On the numerical rank of the off-diagonal blocks of Schur complements of discretized elliptic PDEs

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 5, 2010, Pages 2261-2290

  Chandrasekaran, S ^a   Dewilde, P ^b   Gu, M ^c   Somasunderam, N ^a  

^a University of California   (United States)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Elliptic PDEs; Fast algorithms; Numerical rank; Schur complements

Indexed keywords

CONSTANT COEFFICIENTS; ELLIPTIC PDES; FAST ALGORITHMS; FINITE-DIFFERENCE DISCRETIZATION; GRID SIZE; NUMERICAL RANK; SCHUR COMPLEMENT; SPATIAL DIMENSION; THREE-DIMENSIONAL PROBLEMS;

ALGORITHMS;

GEOMETRY;

EID: 77956413970     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/090775932     Document Type: Article

References (15)

1. M. Bebendorf, Why finite element discretizations can be factored by triangular hierarchical matrices, SIAM J. Numer. Anal., 45 (2007), pp. 1472-1494.
2. M. Bebendorf and W. Hackbusch, Existence of H-matrix approximants to the inverse F Ematrix of elliptic operators in L∞-coefficients, Numer. Math., 95 (2003), pp. 1-28.
3. S. Chandrasekaran, M. Gu, and T. Pals, A fast ULV decomposition solver for hierarchically semiseparable representations, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 603-622.
4. P. Dewilde, K. Diepold, and W. Bamberger, A semi-separable approach to a tridiagonal hierarchy of matrices with application to image flow analysis, in Proceedings of the 17th International Symposium on Mathematical Theory of Networks and Systems (MTNS), Brussels, Belgium, 2004.
5. G. B. Folland, Introduction to Partial Differential Equations, Princeton University Press, Princeton, NJ, 1995.
6. I. Gohberg, T. Kailath, and I. Koltracht, Linear complexity algorithms for semiseparable matrices, Integral Equations Operator Theory, 8 (1985), pp. 780-804.
7. L. Greengard and V. Rokhlin, A fast algorithm for particle simulations, J. Comput. Phys., 73 (1987), pp. 325-348.
8. W. Hackbusch, A sparse matrix arithmetic based on H-matrices. Part I: Introduction to H-matrices, Computing, 62 (2) (1999), pp. 89-108.
9. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1999.
10. R. J. Lipton, D. J. Rose, and R. E. Tarjan, Generalized nested dissection, SIAM J. Numer. Anal., 16 (1979), pp. 346-358.
11. C. D. Meyer, Matrix Analysis and Applied Linear Algebra, SIAM, Philadelphia, 2000.
12. T. Needham, Visual Complex Analysis, Oxford University Press, New York, 1997.
13. D. Newman, Rational approximation to |x|, Michigan Math. J., 11 (1964), pp. 11-14.
14. P. P. Petrushev and V. A. Popov, Rational Approximation of Real Functions, Cambridge University Press, Cambridge, UK, 1987.
15. V. Strassen, Gaussian elimination is not optimal, Numer. Math., 13 (1969), pp. 354-356.