Implementation of the GMRES Method Using Householder Transformations
From MaRDI portal
Publication:3476197
DOI10.1137/0909010zbMath0698.65021OpenAlexW2041519450WikidataQ123178917 ScholiaQ123178917MaRDI QIDQ3476197
Publication date: 1988
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0909010
numerical experimentsiterative methodsmatrix-free methodsGMRES methodimplementationHouseholder transformationsnonsymmetric linear systemsGram-Schmidt processresidual reduction
Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Related Items (69)
Domain decomposition methods for the parallel computation of reacting flows ⋮ Implementations of the GMRES method ⋮ Resolution and implementation of the nonstationary vorticity velocity pressure formulation of the Navier-Stokes equations ⋮ Enhanced algorithms for solving the spectral discretization of the vorticity-velocity-pressure formulation of the Navier-Stokes problem ⋮ Unnamed Item ⋮ A Petrov-Galerkin spectral element technique for heterogeneous porous media flow ⋮ Deflation-accelerated preconditioning of the Poisson-Neumann Schur problem on long domains with a high-order discontinuous element-based collocation method ⋮ ITERATIVE SOLUTION OF LARGE THREE-DIMENSIONAL BEM ELASTOSTATIC ANALYSES USING THE GMRES TECHNIQUE ⋮ Numerical stability of GMRES ⋮ A note on stability investigations for Rosenbrock-type methods for quasilinear-implicit differential equations ⋮ A Boundary-Layer Preconditioner for Singularly Perturbed Convection Diffusion ⋮ Numerical behaviour of the modified Gram-Schmidt GMRES implementation ⋮ Roundoff error analysis of algorithms based on Krylov subspace methods ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ On GMRES for Singular EP and GP Systems ⋮ Some investigations on convergence of GMRES in solving BEM equations for slender beam structures ⋮ Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems ⋮ Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory ⋮ A direct solver for the least‐squares problem arising from GMRES(k) ⋮ Multidimensional mixed-hybrid finite element method for compositional two-phase flow in heterogeneous porous media and its parallel implementation on GPU ⋮ An improved model order reduction method for dynamic analysis of large-scale structures with local nonlinearities ⋮ Orthogonal polynomials on a class of planar algebraic curves ⋮ An algorithm for solving the Navier-Stokes problem with mixed boundary conditions ⋮ A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems ⋮ GMRES implementations and residual smoothing techniques for solving ill-posed linear systems ⋮ Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems ⋮ Domain decomposition techniques for the parallel solution of nonsymmetric systems of elliptic boundary value problems ⋮ A fast implementation for GMRES method ⋮ GMRES algorithms over 35 years ⋮ A method for solving three-dimensional viscous incompressible flows over slender bodies ⋮ Parallel Jacobian-free Newton Krylov solution of the discrete ordinates method with flux limiters for 3D radiative transfer ⋮ Avoiding Communication in Primal and Dual Block Coordinate Descent Methods ⋮ Petrov-Galerkin computation of nonlinear waves in pipe flow of shear-thinning fluids: first theoretical evidences for a delayed transition ⋮ Spatially dispersionless, unconditionally stable FC-AD solvers for variable-coefficient PDEs ⋮ Physics-based simulation of nonlinear distortion in semiconductor devices using the harmonic balance method ⋮ Conjugate gradient methods for continuation problems ⋮ Adaptive local overlapping grid methods for parabolic systems in two space dimensions ⋮ Parallel implementations of Broyden's method ⋮ Dynamic block GMRES: An iterative method for block linear systems ⋮ Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG ⋮ An optimal Q-OR Krylov subspace method for solving linear systems ⋮ Varying the \(s\) in your \(s\)-step GMRES ⋮ A Newton-Krylov method with an approximate analytical Jacobian for implicit solution of Navier-Stokes equations on staggered overset-curvilinear grids with immersed boundaries ⋮ Augmented block Householder Arnoldi method ⋮ Krylov Approximations for Matrix Square Roots in Stiff Boundary Value Problems ⋮ On the evaluation of layer potentials close to their sources ⋮ On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems ⋮ Theoretical and numerical comparisons of GMRES and WZ-GMRES ⋮ A periodic Krylov-Schur algorithm for large matrix products ⋮ Motivations and realizations of Krylov subspace methods for large sparse linear systems ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Wavelet preconditioned Newton-Krylov method for elastohydrodynamic lubrication of line contact problems ⋮ s-Step Enlarged Krylov Subspace Conjugate Gradient Methods ⋮ A two-directional Arnoldi process and its application to parametric model order reduction ⋮ The DEFLATED-GMRES(m,k) method with switching the restart frequency dynamically ⋮ Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication ⋮ Data structures to vectorize CG algorithms for general sparsity patterns ⋮ Large sparse continuation problems ⋮ Block Gram-Schmidt algorithms and their stability properties ⋮ Comparison of different Krylov subspace methods embedded in an implicit finite volume scheme for the computation of viscous and inviscid flow fields on unstructured grids ⋮ Block Modified Gram--Schmidt Algorithms and Their Analysis ⋮ On the stable implementation of the generalized minimal error method ⋮ Pitfalls in fast numerical solvers for fractional differential equations ⋮ Communication Avoiding ILU0 Preconditioner ⋮ Automatic partitioning in linearly-implicit Runge-Kutta methods ⋮ Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision ⋮ Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment ⋮ Representations of quasi-Newton matrices and their use in limited memory methods ⋮ Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
This page was built for publication: Implementation of the GMRES Method Using Householder Transformations