A unidirectional approach for d-dimensional finite element methods for higher order on sparse grids
- Technische Universitaet Muenchen (Germany)
In the last years, sparse grids have turned out to be a very interesting approach for the efficient iterative numerical solution of elliptic boundary value problems. In comparison to standard (full grid) discretization schemes, the number of grid points can be reduced significantly from O(N{sup d}) to O(N(log{sub 2}(N)){sup d-1}) in the d-dimensional case, whereas the accuracy of the approximation to the finite element solution is only slightly deteriorated: For piecewise d-linear basis functions, e. g., an accuracy of the order O(N{sup - 2}(log{sub 2}(N)){sup d-1}) with respect to the L{sub 2}-norm and of the order O(N{sup -1}) with respect to the energy norm has been shown. Furthermore, regular sparse grids can be extended in a very simple and natural manner to adaptive ones, which makes the hierarchical sparse grid concept applicable to problems that require adaptive grid refinement, too. An approach is presented for the Laplacian on a uinit domain in this paper.
- Research Organization:
- Front Range Scientific Computations, Inc., Lakewood, CO (United States)
- OSTI ID:
- 440731
- Report Number(s):
- CONF-9604167-Vol.2; ON: DE96015307; TRN: 97:000721-0053
- Resource Relation:
- Conference: Copper Mountain conference on iterative methods, Copper Mountain, CO (United States), 9-13 Apr 1996; Other Information: PBD: [1996]; Related Information: Is Part Of Copper Mountain conference on iterative methods: Proceedings: Volume 2; PB: 242 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
Sparse adaptive finite elements for radiative transfer