𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hierarchical tree-based discretization for the method of finite spheres

✍ Scribed by Michael Macri; Suvranu De; Mark S. Shephard

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
570 KB
Volume
81
Category
Article
ISSN
0045-7949

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we report the development of a geometry-based automatic pre-processing environment for the method of finite spheres; a truly meshfree numerical technique developed for the solution of boundary value problems on geometrically complex domains. Techniques of generating open covers for the Galerkin-based as well as the point collocation-based method of finite spheres are presented for two as well as three-dimensional problems by recursive spatial subdivision using quadtrees and octrees, respectively.

πŸ“œ SIMILAR VOLUMES

A hierarchical finite element method bas
A hierarchical finite element method based on the partition of unity
✍ Robert L. Taylor; O.C. Zienkiewicz; E. OΓ±ate πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 789 KB

In this paper we consider the application of hierarchical functions to base approximations which are a partition of unity. The particular hierarchical functions used are added to base finite element interpolations which, for Co approximations, are a particular case of the partition of unity. We also

A gradient computational procedure for t
A gradient computational procedure for the solution of large problems arising from the finite element discretization method
✍ Isaac Fried πŸ“‚ Article πŸ“… 1970 πŸ› John Wiley and Sons 🌐 English βš– 825 KB

## Abstract A computational procedure based on gradient iterative techniques is proposed for the solution of large problems to which the finite element method is applicable. In linear problems the procedure can be used either for solving the set of algebraic equations or for the complete inversion