Oblique projection methods for linear systems with multiple right-hand sides

MaRDI QIDQ871135zbMATH OpenFDO

Authors A. Tinzefte, Khalide Jbilou, Hassane Sadok

Publication date 16 March 2007

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/128021, http://etna.mcs.kent.edu/vol.20.2005/pp119-138.dir/pp119-138.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

numerical examplesiterative methodsconjugate gradient methodnonsymmetric linear systemsmultiple right-hand sidesmatrix Krylov subspaceblock methodsBiCGSTAB algorithmsglobal Lanczos

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)

Recommendations

• Direct global Lanczos method for large linear systems with multiple right-hand sides
• Global FOM and GMRES algorithms for matrix equations
• A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides -- matrix and polynomial interpretation
• Matrix Krylov subspace methods for linear systems with multiple right-hand sides
• A new family of global methods for linear systems with multiple right-hand sides

Cited in

(46)

• A block preconditioner for the Gl-LSMR algorithm
• Matrix Krylov subspace methods for large scale model reduction problems
• Generalized global conjugate gradient squared algorithm
• A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides
• Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides
• Solution methods for linear discrete ill-posed problems for color image restoration
• Extended nonsymmetric global Lanczos method for matrix function approximation
• Shifted extended global Lanczos processes for trace estimation with application to network analysis
• Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides
• Global Golub-Kahan bidiagonalization applied to large discrete ill-posed problems
• A shifted complex global Lanczos method and the quasi-minimal residual variant for the Stein-conjugate matrix equation \(X + A \overline{X} B = C\)
• Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
• The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides
• scientific article; zbMATH DE number 7404606 (Why is no real title available?)
• Development of the block BiCGGR2 method for linear systems with multiple right-hand sides
• Direct global Lanczos method for large linear systems with multiple right-hand sides
• A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\)
• Preconditioned global GPBiCG method for solving saddle point problems with multiple right-hand sides and its convergence analysis
• An enhancement of the convergence of the IDR method
• Range restricted iterative methods for linear discrete ill-posed problems
• A matrix rational Lanczos method for model reduction in large-scale first- and second-order dynamical systems.
• Cross-interactive residual smoothing for global and block Lanczos-type solvers for linear systems with multiple right-hand sides
• Orthogonal expansion of network functions
• A parallel generalized global conjugate gradient squared algorithm for linear systems with multiple right-hand sides
• A global Lanczos method for image restoration
• The extended global Lanczos method, Gauss-Radau quadrature, and matrix function approximation
• Global symplectic Lanczos method with application to matrix exponential approximation
• Alternate Broyden’s method for solving linear least squares problem with multiple right-hand sides
• On applying weighted weed techniques to GMRES algorithm for solving multiple linear systems
• A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides
• MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides
• The global Golub-Kahan method and Gauss quadrature for tensor function approximation
• Numerical considerations of block GMRES methods when applied to linear discrete ill-posed problems
• Global GPBiCGstab\((L)\) method for solving linear matrix equations
• A breakdown-free block conjugate gradient method
• Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
• A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides
• Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides
• The regularized global GMERR method for solving large-scale linear discrete ill-posed problems
• On the choice of subspace for large-scale Tikhonov regularization problems in general form
• Convergence properties of some block Krylov subspace methods for multiple linear systems
• On short recurrence Krylov type methods for linear systems with many right-hand sides
• The block Lanczos algorithm for linear ill-posed problems
• A new family of global methods for linear systems with multiple right-hand sides
• Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
• Deflated and augmented global Krylov subspace methods for the matrix equations

This page was built for publication: Oblique projection methods for linear systems with multiple right-hand sides

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