Galerkin Projection Methods for Solving Multiple Linear Systems

DOI10.1137/S1064827598310227zbMath0954.65027OpenAlexW2069496135WikidataQ57397378 ScholiaQ57397378MaRDI QIDQ4702413

Tony F. Chan, Michael Kwok-Po 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 examplesconjugate gradient methoderror boundeffectivenessimage restorationKrylov subspaceGalerkin projectionmultiple linear systemsrecursive least squares approximation

Mathematics Subject Classification ID

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

Related Items (12)

A local character based method for solving linear systems of radiation diffusion problems ⋮ Fast Algorithms for Hyperspectral Diffuse Optical Tomography ⋮ Restarted Hessenberg method for solving shifted nonsymmetric linear systems ⋮ An accelerated subspaces recycling strategy for the deflation of parametric linear systems based on model order reduction ⋮ A survey of subspace recycling iterative methods ⋮ Solving shifted linear systems with restarted GMRES augmented with error approximations ⋮ Accelerated GCRO-DR method for solving sequences of systems of linear equations ⋮ 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 ⋮ Numerical investigation of ensemble methods with block iterative solvers for evolution problems ⋮ Optimal fourth-order staggered-grid finite-difference scheme for 3D frequency-domain viscoelastic wave modeling

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