On Fast Domain Decomposition Solving Procedures for hp-Discretizations of 3-D Elliptic Problems

Abstract: A DD (domain decomposition) preconditioner of almost optimal in p arithmetical complexity is presented for the hierarchical hp discretizations of 3-d second order elliptic equations. We adapt the wire basket substructuring technique to the hierarchical hp discretization, obtain a fast preconditioner-solver for faces by Kinterpolation technique and show that a secondary iterative process may be efficiently used for prolongations from faces. The fast solver for local Dirichlet problems on subdomains of decomposition is based on our earlier derived finite-difference like preconditioner for the internal stiffness matrices of p-finite elements and fast solution procedures for systems with this preconditioner, which appeared recently.

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch

Bibliographic citation
On Fast Domain Decomposition Solving Procedures for hp-Discretizations of 3-D Elliptic Problems ; volume:3 ; number:4 ; year:2003 ; pages:536-559
Computational methods in applied mathematics ; 3, Heft 4 (2003), 536-559

Creator
Korneev, V.
Langer, U.
Xanthis, L. S.

DOI
10.2478/cmam-2003-0034
URN
urn:nbn:de:101:1-2410261612312.380859538632
Rights
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
15.08.2025, 7:35 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

  • Korneev, V.
  • Langer, U.
  • Xanthis, L. S.

Other Objects (12)