Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
From MaRDI portal
Publication:3736802
DOI10.1137/0906059zbMath0601.65019OpenAlexW2029830594MaRDI QIDQ3736802
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
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)
Related Items (59)
On the condition number of some Gram matrices arising from least squares approximation in the complex plane ⋮ Spectral optimization of explicit iterative methods. I ⋮ Polynomial Preconditioned GMRES and GMRES-DR ⋮ A block preconditioned conjugate gradient method for solving high-order finite element matrix equations ⋮ ROBUST PRECONDITIONERS FOR LINEAR ELASTICITY FEM ANALYSES ⋮ Résolution de grands systèmes linéaires creux par méthodes itératives parallèles ⋮ Parallel algorithms for the numerical simulation of three-dimensional natural convection ⋮ The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology ⋮ Accelerated simultaneous iterations for large finite element eigenproblems ⋮ An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost ⋮ Preconditioning complex symmetric linear systems ⋮ On vectorizing the preconditioned generalized conjugate residual methods ⋮ Restarted GMRES preconditioned by deflation ⋮ Domain decomposition preconditioners for the conjugate gradient method ⋮ Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer: ⋮ Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures ⋮ Estimation of spectral bounds in gradient algorithms ⋮ Parallel solution techniques in computational structural mechanics ⋮ Preconditioned conjugate gradient method for finding minimal energy surfaces on Powell-Sabin triangulations ⋮ Coarsest-level improvements in multigrid for lattice QCD on large-scale computers ⋮ Parallel matrix-free polynomial preconditioners with application to flow simulations in discrete fracture networks ⋮ Detection and correction of silent errors in the conjugate gradient algorithm ⋮ Overlapping multiplicative Schwarz preconditioning for linear and nonlinear systems ⋮ Smooth and adaptive gradient method with retards ⋮ Accuracy of preconditioned CG-type methods for least squares problems. ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ Predict-and-Recompute Conjugate Gradient Variants ⋮ Finite-element-wise domain decomposition iterative solvers with polynomial preconditioning ⋮ A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP ⋮ On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic ⋮ An incomplete inverse as a preconditioner for the conjugate gradient method ⋮ Approximate polynomial preconditionings applied to biharmonic equations ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Comparison of several iterative techniques in the solution of symmetric banded equations on a two-pipe Cyber 205 ⋮ CARP-CG: A robust and efficient parallel solver for linear systems, applied to strongly convection dominated PDEs ⋮ A massively parallel solver for discrete Poisson-like problems ⋮ A block preconditioned steepest descent method for symmetric eigenvalue problems ⋮ Implementation of a hybrid method for eddy current problems ⋮ Incomplete block factorization methods for complex-structure matrices ⋮ Data structures to vectorize CG algorithms for general sparsity patterns ⋮ Adaptive polynomial preconditioning for Hermitian indefinite linear systems ⋮ A comparison of vectorized methods for solving the two-dimensional diffusion equation: Multigrid versus polynomial preconditioned conjugate gradient ⋮ A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems ⋮ Preconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomials ⋮ The behavior of conjugate gradient algorithms on a multivector processor with a hierarchical memory ⋮ On the cost of iterative computations ⋮ Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides ⋮ Proxy-GMRES: Preconditioning via GMRES in Polynomial Space ⋮ Iterative solution of linear systems in the 20th century ⋮ A survey of preconditioned iterative methods for linear systems of algebraic equations ⋮ A Primal-Dual Projection Algorithm for Efficient Constraint Preconditioning ⋮ Conjugate gradient solution of finite element equations on the IBM 3090 vector computer utilizing polynomial preconditionings ⋮ Using program package NSPCG to analyze the trunk reservation service protection method ⋮ Yet another polynomial preconditioner for the conjugate gradient algorithm ⋮ Implementation of an adaptive algorithm for Richardson's method ⋮ Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction ⋮ Pipelined Iterative Solvers with Kernel Fusion for Graphics Processing Units ⋮ On approximate factorization methods for block matrices suitable for vector and parallel processors ⋮ Performance of Jacobi preconditioning in Krylov subspace solution of finite element equations
This page was built for publication: Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
