Optimal preconditioners of a given sparsity pattern
From MaRDI portal
Publication:581999
DOI10.1007/BF01932737zbMath0689.65014OpenAlexW2082727440MaRDI QIDQ581999
Garry H. Rodrigue, Anne Greenbaum
Publication date: 1989
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01932737
preconditioningcondition numberChebyshev methodconjugate gradients methodoptimal preconditionerssparsity patterns
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Related Items
A numerical study of optimized sparse preconditioners, Approximate inverse preconditionings for sparse linear systems, Towards a cost-effective ILU preconditioner with high level fill, An interior-point method for fractional programs with convex constraints, Scalable preconditioned conjugate gradient inversion of vector finite element mass matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparisons of regular splittings of matrices
- Fast approximate solution of large scale sparse linear systems
- A note on optimal block-scaling of matrices
- Algebraic multilevel preconditioning methods. I
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- Optimal block diagonal scaling of block 2-cyclic matrices
- Condition numbers and equilibration of matrices
- Analysis of Preconditioners for Domain Decomposition
- Parallel algorithms for the solution of certain large sparse linear systems
- Polynomial Preconditioners for Conjugate Gradient Calculations
- Decay Rates for Inverses of Band Matrices
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Diagonal Scalings of the Laplacian as Preconditioners for Other Elliptic Differential Operators
- Approximate inverse preconditionings for sparse linear systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- A class of first order factorization methods
- Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into Substructures
- The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
- The Fast Solution of Poisson’s and the Biharmonic Equations on Irregular Regions
- On Best Conditioned Matrices
