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

Verfasser / Beitragende:
Korneev, V.; Langer, U.; Xanthis, L. S.
Ort, Verlag, Jahr:
2003
Enthalten in:
Computational Methods in Applied Mathematics, 3/4(2003), 536-559
Format:
Artikel (online)
ID: 37887506X
LEADER caa a22 4500
001 37887506X
003 CHVBK
005 20180305123418.0
007 cr unu---uuuuu
008 161128s2003 xx s 000 0 eng
024 7 0 |a 10.2478/cmam-2003-0034  |2 doi 
035 |a (NATIONALLICENCE)gruyter-10.2478/cmam-2003-0034 
245 0 0 |a On Fast Domain Decomposition Solving Procedures for hp-Discretizations of 3-D Elliptic Problems  |h [Elektronische Daten] 
520 3 |a 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. 
540 |a This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited. 
690 7 |a fast solvers  |2 nationallicence 
690 7 |a hp finite element discretizations  |2 nationallicence 
690 7 |a domain decomposition  |2 nationallicence 
690 7 |a preconditioning  |2 nationallicence 
700 1 |a Korneev  |D V.  |u St.-Petersburg State Technical University, 29 Polytekhnicheskaya Str.,195251 St.-Petersburg, Russia. 
700 1 |a Langer  |D U.  |u Johannes Kepler University, Altenbrger Str. 69, A-4040, Linz, Austria. 
700 1 |a Xanthis  |D L. S.  |u Centre for Techno-Maths and Sci. Comput. Lab., University of Westminster, London, HA1 3TP, UK. 
773 0 |t Computational Methods in Applied Mathematics  |d De Gruyter  |g 3/4(2003), 536-559  |x 1609-4840  |q 3:4<536  |1 2003  |2 3  |o cmam 
856 4 0 |u https://doi.org/10.2478/cmam-2003-0034  |q text/html  |z Onlinezugriff via DOI 
908 |D 1  |a research article  |2 jats 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.2478/cmam-2003-0034  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Korneev  |D V.  |u St.-Petersburg State Technical University, 29 Polytekhnicheskaya Str.,195251 St.-Petersburg, Russia 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Langer  |D U.  |u Johannes Kepler University, Altenbrger Str. 69, A-4040, Linz, Austria 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Xanthis  |D L. S.  |u Centre for Techno-Maths and Sci. Comput. Lab., University of Westminster, London, HA1 3TP, UK 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t Computational Methods in Applied Mathematics  |d De Gruyter  |g 3/4(2003), 536-559  |x 1609-4840  |q 3:4<536  |1 2003  |2 3  |o cmam 
900 7 |b CC0  |u http://creativecommons.org/publicdomain/zero/1.0  |2 nationallicence 
898 |a BK010053  |b XK010053  |c XK010000 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-gruyter