Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
From MaRDI portal
Publication:3736802
DOI10.1137/0906059zbMATH Open0601.65019OpenAlexW2029830594MaRDI QIDQ3736802FDOQ3736802
Authors: Y. Saad 
Publication date: 1985
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0906059
Recommendations
conjugate gradient algorithmparallel algorithmsvectorizationGershgorin estimatepolynomial preconditionings
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Cited In (74)
- Stability of polynomial preconditioning
- Polynomial preconditioners based on factorized sparse approximate inverses
- Spectral optimization of explicit iterative methods. I
- Preconditioned conjugate gradient method for finding minimal energy surfaces on Powell-Sabin triangulations
- A primal-dual projection algorithm for efficient constraint preconditioning
- Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method
- A block preconditioned steepest descent method for symmetric eigenvalue problems
- Incomplete block factorization methods for complex-structure matrices
- A polynomial preconditioner for the CMRH algorithm
- Approximate polynomial preconditionings applied to biharmonic equations
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- Implementation of an adaptive algorithm for Richardson's method
- Yet another polynomial preconditioner for the conjugate gradient algorithm
- On vectorizing the preconditioned generalized conjugate residual methods
- Minimax Polynomial Preconditioning for Hermitian Linear Systems
- Restarted GMRES preconditioned by deflation
- Accuracy of preconditioned CG-type methods for least squares problems.
- Preconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomials
- Résolution de grands systèmes linéaires creux par méthodes itératives parallèles
- A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP
- Iterative solution of linear systems in the 20th century
- Accelerated simultaneous iterations for large finite element eigenproblems
- Comparison of several iterative techniques in the solution of symmetric banded equations on a two-pipe Cyber 205
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Parallel solution techniques in computational structural mechanics
- A method about polynomial preconditioning technique
- Improved seed methods for symmetric positive definite linear equations with multiple right-hand sides.
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- Title not available (Why is that?)
- On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic
- The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology
- Coarsest-level improvements in multigrid for lattice QCD on large-scale computers
- Finite-element-wise domain decomposition iterative solvers with polynomial preconditioning
- Performance of Jacobi preconditioning in Krylov subspace solution of finite element equations
- Using program package NSPCG to analyze the trunk reservation service protection method
- A massively parallel solver for discrete Poisson-like problems
- A comparison of vectorized methods for solving the two-dimensional diffusion equation: Multigrid versus polynomial preconditioned conjugate gradient
- Generalized least-squares polynomial preconditioners for symmetric indefinite linear equations
- The behavior of conjugate gradient algorithms on a multivector processor with a hierarchical memory
- Domain decomposition preconditioners for the conjugate gradient method
- Data structures to vectorize CG algorithms for general sparsity patterns
- ROBUST PRECONDITIONERS FOR LINEAR ELASTICITY FEM ANALYSES
- Communication lower bounds and optimal algorithms for numerical linear algebra
- CARP-CG: A robust and efficient parallel solver for linear systems, applied to strongly convection dominated PDEs
- An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost
- Polynomial Preconditioned GMRES and GMRES-DR
- Efficient Polynomial Preconditioning for the Conjugate Gradient Method
- Pipelined iterative solvers with kernel fusion for graphics processing units
- Polynomial Preconditioners for Conjugate Gradient Calculations
- Title not available (Why is that?)
- On the cost of iterative computations
- On approximate factorization methods for block matrices suitable for vector and parallel processors
- A block preconditioned conjugate gradient method for solving high-order finite element matrix equations
- Smooth and adaptive gradient method with retards
- Conjugate gradient solution of finite element equations on the IBM 3090 vector computer utilizing polynomial preconditionings
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- An incomplete inverse as a preconditioner for the conjugate gradient method
- Estimation of spectral bounds in gradient algorithms
- Preconditioning complex symmetric linear systems
- On the condition number of some Gram matrices arising from least squares approximation in the complex plane
- Parallel algorithms for the numerical simulation of three-dimensional natural convection
- Preconditioned multishift BiCG for \(\mathcal{H}_2\)-optimal model reduction
- Implementation of a hybrid method for eddy current problems
- Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures
- Polynomial preconditioning for the action of the matrix square root and inverse square root
- Predict-and-Recompute Conjugate Gradient Variants
- Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- Title not available (Why is that?)
- Parallel matrix-free polynomial preconditioners with application to flow simulations in discrete fracture networks
- Application of polynomial preconditioners to conservation laws
- Overlapping multiplicative Schwarz preconditioning for linear and nonlinear systems
- Polynomial preconditioned Arnoldi with stability control
- Detection and correction of silent errors in the conjugate gradient algorithm
This page was built for publication: Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3736802)
