Galerkin Projection Methods for Solving Multiple Linear Systems

DOI10.1137/S1064827598310227MaRDI QIDQ4702413zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Tony F. Chan, Michael Ng

Publication date 24 November 1999

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1064827598310227

zbMATH Keywords

numerical exampleserror boundimage restorationconjugate gradient methodGalerkin projectionKrylov subspaceeffectivenessmultiple linear systemsrecursive least squares approximation

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10)

Recommendations

• Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
• MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides
• Block projection methods for linear systems
• A block seed method for solving linear systems with multiple right-hand sides
• Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides

Cited in

(17)

• A projection method for solving nonsymmetric linear systems on multiprocessors
• A local character based method for solving linear systems of radiation diffusion problems
• Multisplitting for regularized least squares with Krylov subspace recycling.
• A FEM for an optimal control problem subject to the fractional Laplace equation
• An automatic Krylov subspaces recycling technique for the construction of a global solution basis of non-affine parametric linear systems
• Optimal fourth-order staggered-grid finite-difference scheme for 3D frequency-domain viscoelastic wave modeling
• Solving shifted linear systems with restarted GMRES augmented with error approximations
• Numerical investigation of ensemble methods with block iterative solvers for evolution problems
• Accelerated GCRO-DR method for solving sequences of systems of linear equations
• A survey of subspace recycling iterative methods
• Block cross-interactive residual smoothing for Lanczos-type solvers for linear systems with multiple right-hand sides
• Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
• Fast Algorithms for Hyperspectral Diffuse Optical Tomography
• A rational filtering algorithm for sequences of shifted symmetric linear systems with applications to frequency response analysis
• An accelerated subspaces recycling strategy for the deflation of parametric linear systems based on model order reduction
• Restarted Hessenberg method for solving shifted nonsymmetric linear systems
• MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides

This page was built for publication: Galerkin Projection Methods for Solving Multiple Linear Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702413)