Conditioning analysis of sparse block approximate factorizations

DOI10.1016/0168-9274(91)90096-IMaRDI QIDQ1181519zbMATH OpenOpenAlexWikidataFDO

Authors Monga-made Magolu

Publication date 27 June 1992

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-9274(91)90096-i

zbMATH Keywords

numerical exampleslarge sparse linear systemsStieltjes matrixpolynomially accelerated iterative methodssparse block approximate factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• Conditioning analysis of modified block incomplete factorizations
• Analytical bounds for block approximate factorization methods
• On the conditioning analysis of block approximate factorization methods
• Existence and Conditioning Properties of Sparse Approximate Block Factorizations

Cites work

• scientific article; zbMATH DE number 4176341 (Why is no real title available?)
• scientific article; zbMATH DE number 3854346 (Why is no real title available?)
• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3720254 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3325215 (Why is no real title available?)
• A class of first order factorization methods
• A generalized SSOR method
• Block Preconditioning for the Conjugate Gradient Method
• Conditioning analysis of positive definite matrices by approximate factorizations
• Existence and Conditioning Properties of Sparse Approximate Block Factorizations
• Incomplete factorizations of singular linear systems
• Iterative Methods for Elliptic Problems and the Discovery of “q”
• Lower eigenvalue bounds for pencils of matrices
• On Axelsson's perturbations
• On Sparse Block Factorization Iterative Methods
• Parallel concepts in graph theory
• Preconditioning and Two-Level Multigrid Methods of Arbitrary Degree of Approximation
• Second-degree iterative methods for the solution of large linear systems
• Upper eigenvalue bounds for pencils of matrices
• Vectorizable preconditioners for elliptic difference equations in three space dimensions

Cited in

(10)

• Existence and Conditioning Properties of Sparse Approximate Block Factorizations
• Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations
• Iterative solution methods
• Modified block-approximate factorization strategies
• Lower eigenvalue bounds for pencils of matrices
• On the conditioning analysis of block approximate factorization methods
• Analytical bounds for block approximate factorization methods
• Lower eigenvalue bounds for singular pencils of matrices
• Conditioning analysis of modified block incomplete factorizations
• Structured condition numbers and statistical condition estimation for the \(LDU\) factorization

Describes a project that uses

Uses Software

• symrcm

This page was built for publication: Conditioning analysis of sparse block approximate factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181519)