On approximate factorization methods for block matrices suitable for vector and parallel processors
From MaRDI portal
Publication:1072329
DOI10.1016/0024-3795(86)90159-XzbMath0587.65013MaRDI QIDQ1072329
Publication date: 1986
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
BILUS: A block version of ILUS factorization., Circulant block-factorization preconditioners for elliptic problems, A block preconditioned conjugate gradient method for solving high-order finite element matrix equations, Circulant block-factorization preconditioning of anisotropic elliptic problems, Decay rates of inverses of banded M-matrices that are near to Toeplitz matrices, Block ILU preconditioners for block-tridiagonal systems, Incomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation, On computing of block ILU preconditioner for block tridiagonal systems, Vectorizable preconditioners for elliptic difference equations in three space dimensions, Vectorizable preconditioners for mixed finite element solution of second-order elliptic problems, Incomplete block-factorization preconditioners for solving three-dimensional elliptic difference equations on systolic processors∗∗∗, Localization in Matrix Computations: Theory and Applications, On the conditioning analysis of block approximate factorization methods, Conditioning analysis of modified block incomplete factorizations, On the preconditioning of the block tridiagonal linear system of equations, On incomplete block factorization methods of generalized SSOR type for \(H\)-matrices, Analytical bounds for block approximate factorization methods, Milestones in the development of iterative solution methods, Preconditioned CG-type methods for solving the coupled system of fundamental semiconductor equations, On some ways of approximating inverses of banded matrices in connection with deriving preconditioners based on incomplete block factorizations, A Framework for Block ILU Factorizations Using Block-Size Reduction, Incomplete block factorization methods for complex-structure matrices, Incomplete block-matrix factorization iterative methods for convection- diffusion problems, Block incomplete factorization preconditioners for a symmetric block-tridiagonal \(M\)-matrix, Block ILU factorization preconditioners for a block-tridiagonal \(H\)-matrix, Remark on convergence of algebraic multigrid in the form of matrix decomposition
Cites Work
- The block preconditioned conjugate gradient method on vector computers
- On some versions of incomplete block-matrix factorization iterative methods
- On the eigenvalue distribution of a class of preconditioning methods
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Error estimates over infinite intervals of some discretizations of evolution equations
- Analysis of incomplete matrix factorizations as multigrid smoothers for vector and parallel computers
- A general incomplete block-matrix factorization method
- Block Preconditioning for the Conjugate Gradient Method
- Quasi-tridiagonal matrices and type-insensitive difference equations
- NOTE ON M-MATRICES
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Marching Algorithms for Elliptic Boundary Value Problems. I: The Constant Coefficient Case
- A generalized SSOR method
- An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
