Premium
On Fast Computations with the Inverse to Harmonic Potential Operators via Domain Decomposition
Author(s) -
Khoromskij Boris N.
Publication year - 1996
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/(sici)1099-1506(199603/04)3:2<91::aid-nla64>3.0.co;2-x
Subject(s) - mathematics , polyhedron , computation , lipschitz continuity , domain decomposition methods , boundary (topology) , inverse , domain (mathematical analysis) , degrees of freedom (physics and chemistry) , algorithm , mathematical analysis , combinatorics , geometry , physics , quantum mechanics , finite element method , thermodynamics
In this paper a method for fast computations with the inverse to weakly singular, hypersingular and double layer potential boundary integral operators associated with the Laplacian on Lipschitz domains is proposed and analyzed. It is based on the representation formulae suggested for above‐mentioned boundary operations in terms of the Poincare‐Steklov interface mappings generated by the special decompositions of the interior and exterior domains. Computations with the discrete counterparts of these formulae can be efficiently performed by iterative substructuring algorithms provided some asymptotically optimal techniques for treatment of interface operators on subdomain boundaries. For both two‐ and three‐dimensional cases the computation cost and memory needs are of the order O(N log p N ) and O ( N log 2 N ), respectively, with 1 ≤ p ≤ 3, where N is the number of degrees of freedom on the boundary under consideration (some kinds of polygons and polyhedra). The proposed algorithms are well suited for serial and parallel computations.