Existence and Conditioning Properties of Sparse Approximate Block Factorizations

DOI10.1137/0725053zbMath0653.65022OpenAlexW2066399015WikidataQ114074379 ScholiaQ114074379MaRDI QIDQ3799556

Mustapha Ben Bouzid, Robert Beauwens

Publication date: 1988

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0725053

zbMATH Keywords

conditioninglarge sparse linear systemsspectral condition numberapproximate factorizationssparse block LU factorizations

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items

A survey of some estimates of eigenvalues and condition numbers for certain preconditioned matrices, On the conditioning analysis of block approximate factorization methods, Conditioning analysis of modified block incomplete factorizations, Conditioning analysis of sparse block approximate factorizations, Analytical bounds for block approximate factorization methods, Iterative solution methods, Approximate factorizations with S/P consistently ordered M-factors, Modified block-approximate factorization strategies, Implementation strategies for block recursive factorizations, Numerical methods and algorithms. Part X