Analytical bounds for block approximate factorization methods
The author derives simple analytical upper bounds on the spectral condition number associated with the preconditioning of large sparse linear systems by the so-called modified block incomplete factorizations. By the application of graph notions to block matrices, he succeeds to get the upper bounds for the preconditioning in the case of a Stieltjes matrix. The results prove to handle a large class of discretization of second-order elliptic partial differential equations with mixed boundary conditions, and support that sparse approximate block-matrix factorizations provide powerful preconditioners.
- On the conditioning analysis of block approximate factorization methods
- Modified block-approximate factorization strategies
- Conditioning analysis of block incomplete factorizations and its application to elliptic equations
- scientific article; zbMATH DE number 440681
- Conditioning analysis of modified block incomplete factorizations
- A general incomplete block-matrix factorization method
- Aspects of multigrid methods for problems in three dimensions
- Block Preconditioning for the Conjugate Gradient Method
- Conditioning analysis of modified block incomplete factorizations
- Conditioning analysis of positive definite matrices by approximate factorizations
- Conditioning analysis of sparse block approximate factorizations
- Estimates for Some Computational Techniques in Linear Algebra
- Existence and Conditioning Properties of Sparse Approximate Block Factorizations
- scientific article; zbMATH DE number 440681 (Why is no real title available?)
- scientific article; zbMATH DE number 440684 (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 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3477343 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Modified block-approximate factorization strategies
- On approximate factorization methods for block matrices suitable for vector and parallel processors
- On Sparse Block Factorization Iterative Methods
- On the conditioning analysis of block approximate factorization methods
- On the eigenvalue distribution of a class of preconditioning methods
- Parallel concepts in graph theory
- The rate of convergence of conjugate gradients
- Upper eigenvalue bounds for pencils of matrices
- Vectorizable preconditioners for elliptic difference equations in three space dimensions
- On the conditioning analysis of block approximate factorization methods
- Conditioning analysis of sparse block approximate factorizations
- Numerical methods and algorithms. Part X
- A study of the method of approximate factorization for solving grid elliptic boundary-value problems
- A survey of some estimates of eigenvalues and condition numbers for certain preconditioned matrices
- Bounds for elements of LU factorizations of sparse matrices and their application to incomplete factorization methods
- scientific article; zbMATH DE number 440684 (Why is no real title available?)
- Existence and Conditioning Properties of Sparse Approximate Block Factorizations
- Spectral analysis of parallel incomplete factorizations with implicit pseudo‐overlap
- Modified block-approximate factorization strategies
This page was built for publication: Analytical bounds for block approximate factorization methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208299)
