Efficient and reliable iterative methods for linear systems
From MaRDI portal
Publication:1860479
DOI10.1016/S0377-0427(02)00534-4zbMath1013.65025MaRDI QIDQ1860479
Publication date: 23 February 2003
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
convergencedomain decompositionpreconditioningiterative methodsGMRESKrylov subspace methodsconjugate gradientsSchur complementsreorderingincomplete Cholesky factorizationBi-CGSTAB
Related Items (7)
Study of Momentum and Thermal Wakes Due to Elliptic Cylinders of Various Axes Ratios Using the Immersed Boundary Method ⋮ Direct pore-level modeling of incompressible fluid flow in porous media ⋮ An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost ⋮ Efficient solution for Galerkin-based polynomial chaos expansion systems ⋮ On the capabilities of the polynomial chaos expansion method within SFE analysis -- an overview ⋮ A coupled volume-of-fluid and level set (VOSET) method for computing incompressible two-phase flows ⋮ A MATLAB-based frequency-domain finite-difference package for solving 2D visco-acoustic wave equation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The block preconditioned conjugate gradient method on vector computers
- Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems
- Large tridiagonal and block tridiagonal linear systems on vector and parallel computers
- Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
- Iterative solution methods for certain sparse linear systems with a non- symmetric matrix arising from PDE-problems
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- The effect of ordering on preconditioned conjugate gradients
- Practical use of the conjugate gradient method on parallel supercomputers
- Parallel solvers for nonlinear elliptic problems based on domain decomposition ideas
- Reliable updated residuals in hybrid Bi-CG methods
- Nested grids ILU-decomposition (NGILU)
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- High Performance Preconditioning
- Two-Color Fourier Analysis of Iterative Algorithms for Elliptic Problems with Red/Black Ordering
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Ordering Methods for Preconditioned Conjugate Gradient Methods Applied to Unstructured Grid Problems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A class of first order factorization methods
- Numerical Linear Algebra for High-Performance Computers
- Iterative Solution Methods
- Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
- A generalized domain decomposition paradigm for parallel incomplete LU factorization preconditionings
- DRIC: A dynamic version of the RIC method
- Parallel block preconditioning based on SSOR and MILU
- Spectral analysis of parallel incomplete factorizations with implicit pseudo‐overlap
- The Use of Conjugate Gradients for Systems of Linear Equations Possessing “Property A”
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Methods of conjugate gradients for solving linear systems
- Parallel incomplete factorizations with pseudo-overlapped subdomains
This page was built for publication: Efficient and reliable iterative methods for linear systems
