✦ LIBER ✦

A refinement process for collocation approximations

✍ Scribed by M. van Veldhuizen

Publisher: Springer-Verlag
Year: 1976
Tongue: English
Weight: 449 KB
Volume: 26
Category: Article
ISSN: 0029-599X
DOI: 10.1007/bf01409961

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Adaptive local grid refinement algorithm

Adaptive local grid refinement algorithms for finite-element collocation

✍ Myron B. Allen; Mark C. Curran 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 512 KB

A refined Born approximation

✍ Jerzy Rayski 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 256 KB

The proposed method of computing scattering amplitudes and cross-sections is by far more efficient but not much more cumbersome than the Born approximation. It applies to the cases of medium strong couplings in high as weU as low energy region.

Refining diffusion approximations for qu

Refining diffusion approximations for queues

✍ Ward Whitt 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 400 KB

A refinement-based process algebra for t

A refinement-based process algebra for timed automata

✍ Stefano Cattani; Marta Kwiatkowska 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 283 KB

A point collocation method based on repr

A point collocation method based on reproducing kernel approximations

✍ N. R. Aluru 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 958 KB

A reproducing kernel particle method with built-in multiresolution features in a very attractive meshfree method for numerical solution of partial di!erential equations. The design and implementation of a Galerkin-based reproducing kernel particle method, however, faces several challenges such as th

Approximate collocation method for an in

Approximate collocation method for an integral equation with a logarithmic kernel

✍ A. S. Il'inskii 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 198 KB