Modified block-approximate factorization strategies
Incomplete block-matrix factorizations have been recognized as useful preconditioning techniques for the iterative solution of large sparse linear systems of algebraic equations, particularly efficient when combined with a conjugate gradient like method or when used for the construction of smoothers in multigrid methods or of domain decomposition preconditioners. Among these factorizations, ``modified versions for which the original matrix and its approximate factorization have equal row sum, are known to be powerful for reducing the spectral condition number. Unfortunately, performances of modified methods are sometimes spoiled by round off errors in the presence of strongly isolated largest eigenvalues. Two new variants are proposed which not only reduce the largest eigenvalues but also (implicitly) cluster the interior eigenvalues and ensure a \({\mathcal O}(h^{-1})\) behaviour for the associated spectral condition number, when applied to discrete multidimensional self-adjoint (elliptic) partial differential equations with (average) mesh size parameter h. Both rigorous theoretical support and numerical evidence are given, displaying the superiority of the new versions over the standard (``unmodified and ``modified) versions, even in the case of quasi- singular problems.
- On the conditioning analysis of block approximate factorization methods
- Conditioning analysis of modified block incomplete factorizations
- scientific article; zbMATH DE number 176173
- Analytical bounds for block approximate factorization methods
- Stability and spectral properties of some incomplete block factorizations
- A generalized SSOR method
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Analytical bounds for block approximate factorization methods
- Block Preconditioning for the Conjugate Gradient Method
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Conditioning analysis of modified block incomplete factorizations
- Conditioning analysis of positive definite matrices by approximate factorizations
- Conditioning analysis of sparse block approximate factorizations
- Existence and Conditioning Properties of Sparse Approximate Block Factorizations
- scientific article; zbMATH DE number 4174228 (Why is no real title available?)
- 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 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Incomplete factorizations of singular linear systems
- Linear iterations as smoothers in multigrid methods: Theory with applications to incomplete decompositions
- Lower eigenvalue bounds for pencils of matrices
- On Axelsson's perturbations
- 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
- On the Robustness of ILU Smoothing
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- The rate of convergence of conjugate gradients
- Vectorizable preconditioners for elliptic difference equations in three space dimensions
- On the conditioning analysis of block approximate factorization methods
- Conditioning analysis of modified block incomplete factorizations
- Stability and spectral properties of some incomplete block factorizations
- Analytical bounds for block approximate factorization methods
- Graph perturbations
- A survey of some estimates of eigenvalues and condition numbers for certain preconditioned matrices
- Iterative solution of linear systems in the 20th century
- Iterative solution methods
- Incomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation
- Adaptive techniques for improving the performance of incomplete factorization preconditioning
- scientific article; zbMATH DE number 440681 (Why is no real title available?)
- scientific article; zbMATH DE number 4174228 (Why is no real title available?)
- scientific article; zbMATH DE number 5575550 (Why is no real title available?)
- scientific article; zbMATH DE number 176173 (Why is no real title available?)
- Taking Advantage of the Potentialities of Dynamically Modified Block Incomplete Factorizations
- scientific article; zbMATH DE number 766211 (Why is no real title available?)
- Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
- Spectral analysis of parallel incomplete factorizations with implicit pseudo‐overlap
This page was built for publication: Modified block-approximate factorization strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758105)
