Nested Krylov methods based on GCR
From MaRDI portal
Publication:1919408
DOI10.1016/0377-0427(94)00123-5zbMath0854.65026OpenAlexW2122830560MaRDI QIDQ1919408
Publication date: 26 January 1997
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(94)00123-5
Related Items
A geometric view of Krylov subspace methods on singular systems ⋮ Hybrid methods based on LCG and GMRES ⋮ Recycling Krylov subspaces for CFD applications and a new hybrid recycling solver ⋮ A Nested Lanczos Method for the Trust-Region Subproblem ⋮ Enabling off-design linearised aerodynamics analysis using Krylov subspace recycling technique ⋮ A note on augmented unprojected Krylov subspace methods ⋮ Robust and efficient adjoint solver for complex flow conditions ⋮ A combination of the fast multipole boundary element method and Krylov subspace recycling solvers ⋮ Dual consistency and functional accuracy: a finite-difference perspective ⋮ A new family of preconditioned iterative solvers for nonsymmetric linear systems ⋮ Subspace recycling accelerates the parametric macro-modeling of MEMS ⋮ A survey of subspace recycling iterative methods ⋮ Preconditioned Chebyshev BiCG method for parameterized linear systems ⋮ Output error estimation for summation-by-parts finite-difference schemes ⋮ GMRES with multiple preconditioners ⋮ Solving shifted linear systems with restarted GMRES augmented with error approximations ⋮ GMRES algorithms over 35 years ⋮ Multi Space Reduced Basis Preconditioners for Large-Scale Parametrized PDEs ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ Krylov subspace recycling for sequences of shifted linear systems ⋮ Accelerated GCRO-DR method for solving sequences of systems of linear equations ⋮ TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems ⋮ Multipreconditioned GMRES for simulating stochastic automata networks ⋮ A new implicit hybridizable discontinuous Galerkin time-domain method for solving the 3-D electromagnetic problems ⋮ A dynamically deflated GMRES adjoint solver for aerodynamic shape optimization ⋮ Block conjugate gradient algorithms for least squares problems ⋮ An efficient iterative penalization method using recycled Krylov subspaces and its application to impulsively started flows ⋮ A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides ⋮ Computing Reduced Order Models via Inner-Outer Krylov Recycling in Diffuse Optical Tomography ⋮ Inexact inverse iteration for symmetric matrices ⋮ On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems ⋮ A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations ⋮ A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides ⋮ Projections, Deflation, and Multigrid for Nonsymmetric Matrices ⋮ Some iterative approaches for Sylvester tensor equations. II: A tensor format of simpler variant of GCRO-based methods ⋮ Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES ⋮ Preconditioning the solution of the time-dependent neutron diffusion equation by recycling Krylov subspaces ⋮ Analysis of acceleration strategies for restarted minimal residual methods ⋮ Subspace Recycling--Based Regularization Methods ⋮ A Block Minimum Residual Norm Subspace Solver with Partial Convergence Management for Sequences of Linear Systems ⋮ Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method ⋮ Preconditioned linear solves for parametric model order reduction
Uses Software
Cites Work
- Unnamed Item
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- GMRESR: a family of nested GMRES methods
- ILUT: A dual threshold incomplete LU factorization
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
This page was built for publication: Nested Krylov methods based on GCR
