𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for contouring and interpolation of data using bilinear finite elements

✍ Scribed by T.C. Gopalakrishnan; Maha Korttom

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
922 KB
Volume
14
Category
Article
ISSN
0168-874X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A consistent point-searching algorithm f
A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements
✍ Chongbin Zhao; B. E. Hobbs; H. B. MΓΌhlhaus; A. Ord πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 201 KB πŸ‘ 1 views

To translate and transfer solution data between two totally di!erent meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has t

An efficient implementation of the finit
An efficient implementation of the finite-element time-domain algorithm on parallel computers using a finite-element tearing and interconnecting algorithm
✍ Umesh D. Navsariwala; Stephen D. Gedney πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 3 views

An efficient algorithm for implementing the finite-element ( ) time-domain FETD method on parallel computers is presented. An unconditionally stable implicit FETD algorithm is combined with the ( ) finite-element tearing and interconnecting FETI method. This domain decomposition algorithm con¨erges