Low-Rank Approximation of Elliptic Boundary Value Problems with High-Contrast Coefficients
- 1 January 2016
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 48 (2) , 932-949
- https://doi.org/10.1137/140991030
Abstract
We analyze the convergence of degenerate approximations to the Green's function of elliptic boundary value problems with high-contrast coefficients. It is shown that the convergence is independent of the contrast if the error is measured with respect to suitable norms. This lays the groundwork for fast methods (so-called hierarchical matrix approximations) which do not have to be adapted to the coefficients.Keywords
This publication has 21 references indexed in Scilit:
- Scaling up through domain decompositionApplicable Analysis, 2009
- Parallel Hierarchical Matrix Preconditioners for the Curl-Curl OperatorJournal of Computational Mathematics, 2009
- Efficient inversion of the Galerkin matrix of general second-order elliptic operators with nonsmooth coefficientsMathematics of Computation, 2004
- Homogenization and MultigridComputing, 2001
- FETI‐DP: a dual–primal unified FETI method—part I: A faster alternative to the two‐level FETI methodInternational Journal for Numerical Methods in Engineering, 2001
- Semi On-Line Scheduling on Two Identical MachinesComputing, 1999
- A method of finite element tearing and interconnecting and its parallel solution algorithmInternational Journal for Numerical Methods in Engineering, 1991
- A fast algorithm for particle simulationsJournal of Computational Physics, 1987
- A hierarchical O(N log N) force-calculation algorithmNature, 1986
- The Green function for uniformly elliptic equationsmanuscripta mathematica, 1982