scientific article
From MaRDI portal
Publication:2760356
zbMath0982.65057MaRDI QIDQ2760356
Publication date: 19 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
performancenumerical experimentsKrylov subspace methodsincomplete LU factorizationmulti-elimination ILU factorizationsparse linear systemSchur complement techniquesreordering techniquesmulti-level preconditioner
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20)
Related Items (8)
Recursive two-level ILU preconditioner for nonsymmetric M-matrices ⋮ A new scheme of computing the approximate inverse preconditioner for the reduced linear systems ⋮ Multilevel block ILU preconditioner for sparse nonsymmetric \(M\)-matrices. ⋮ Enhanced multi-level block ILU preconditioning strategies for general sparse linear systems ⋮ The effect of block red-black ordering on block ILU preconditioner for sparse matrices ⋮ Preconditioned Krylov subspace methods for solving nonsymmetric matrices from CFD applications ⋮ Remark on convergence of algebraic multigrid in the form of matrix decomposition ⋮ A grid-based multilevel incomplete LU factorization preconditioning technique for general sparse matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of multilevel preconditioned iterative methods
- Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems
- An incomplete-factorization preconditioning using repeated red-black ordering
- How fast the Laplace equation was solved in 1995
- Experimental study of ILU preconditioners for indefinite matrices
- On the algebraic multigrid method
- Nested grids ILU-decomposition (NGILU)
- Matrix-dependent prolongations and restrictions in a blackbox multigrid solver
- Sparse matrix test problems
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- The Nested Recursive Two-Level Factorization Method for Nine-Point Difference Matrices
- Approximate Inverse Techniques for Block-Partitioned Matrices
- A Parallel Graph Coloring Heuristic
- Matrix Renumbering ILU: An Effective Algebraic Multilevel ILU Preconditioner for Sparse Matrices
- BILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems
- Algebraic multilevel iteration method for Stieltjes matrices
- ILUT: A dual threshold incomplete LU factorization
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
This page was built for publication: