论文信息 - Direct Domain Decomposition using the Hierarchical Matrix Technique

Direct Domain Decomposition using the Hierarchical Matrix Technique

• inside of the subdomains, L∞-coefficients are allowed (i.e., jumping coefficients, oscillatory coefficients, etc.). There is no need to place the skeleton along jump lines. A proof concerning robustness against rough boundaries and non-smooth coefficients is given in [1]. If, however, it happens that the coefficients are piecewise constant or analytic in the subdomains, a further improvement is possible using a new technique of Khoromskij and Melenk [7] (see Subsection 3.2).

Wolfgang Hackbusch | W. Hackbusch

[1] W. Hackbusch,et al. A Sparse ℋ-Matrix Arithmetic. , 2000, Computing.

[2] Wolfgang Hackbusch,et al. A Sparse Matrix Arithmetic Based on H-Matrices. Part I: Introduction to H-Matrices , 1999, Computing.

[3] W. Hackbusch,et al. Introduction to Hierarchical Matrices with Applications , 2003 .

[4] Jens Markus Melenk,et al. Boundary Concentrated Finite Element Methods , 2003, SIAM J. Numer. Anal..

[5] W. Hackbusch,et al. On H2-Matrices , 2000 .

[6] W. Hackbusch. A Sparse Matrix Arithmetic Based on $\Cal H$-Matrices. Part I: Introduction to ${\Cal H}$-Matrices , 1999, Computing.

[7] W. Hackbusch,et al. Numerische Mathematik Existence of H-matrix approximants to the inverse FE-matrix of elliptic operators with L ∞-coefficients , 2002 .

[8] Dietrich Braess,et al. A Multigrid Method for Nonconforming FE-Discretisations with Application to Non-Matching Grids , 1999, Computing.

[9] HackbuschW.. A sparse matrix arithmetic based on H-matrices. Part I , 1999 .

[10] Boris N. Khoromskij,et al. A Sparse H-Matrix Arithmetic. Part II: Application to Multi-Dimensional Problems , 2000, Computing.