To solve a sparse linear system of equations resulting from the finite element approximation of elliptic self-adjoint second-order boundary-value problems an algebraic multilevel iteration method is presented. The new method can be considered as an extension of methods, which have been defined by Ax
The adjoint for an algebraic finite element
β Scribed by G. Dasgupta; E. Wachspress
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 494 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
A deterrent to application of rational basis functions over algebraic elements has been the need to compute denominator polynomials (element adjoints) from multiple points of the element boundary. Dasgupta devised a simple algorithm for eliminating this problem for convex polygons. This algorithm is described here and generalized to elements with curved sides.
π SIMILAR VOLUMES
## Abstract This paper presents an algebraic multigrid method for the efficient solution of the linear system arising from a finite element discretization of variational problems in __H__~0~(curl,Ξ©). The finite element spaces are generated by NΓ©dΓ©lec's edge elements. A coarsening technique is pres