Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
From MaRDI portal
Publication:4376247
Recommendations
- MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides
- Galerkin Projection Methods for Solving Multiple Linear Systems
- Oblique projection methods for linear systems with multiple right-hand sides
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- A new family of global methods for linear systems with multiple right-hand sides
Cited in
(54)- A Seed Method for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides
- A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides
- Condition numbers for linear systems and Kronecker product linear systems with multiple right-hand sides
- On applying weighted weed techniques to GMRES algorithm for solving multiple linear systems
- Krylov subspace recycling for sequences of shifted linear systems
- A new projected variant of the deflated block conjugate gradient method
- A block preconditioner for the Gl-LSMR algorithm
- Reduced-basis output bounds for approximately parametrized elliptic coercive partial differential equations
- Efficient iterative algorithms for the stochastic finite element method with application to acoustic scattering
- Projection techniques for iterative solution of \(A\underline x=\underline b\) with successive right-hand sides
- Biorthogonal Rosenbrock-Krylov time discretization methods
- Global SCD algorithm for real positive definite linear systems with multiple right-hand sides
- Block minimum perturbation algorithm based on block Arnoldi process for nonsymmetric linear systems with multiple right-hand sides
- A local character based method for solving linear systems of radiation diffusion problems
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- A new family of global methods for linear systems with multiple right-hand sides
- Multisplitting for regularized least squares with Krylov subspace recycling.
- A fully discrete adjoint method for optimization of flow problems on deforming domains with time-periodicity constraints
- Block projection methods for linear systems
- The block Lanczos method for linear systems with multiple right-hand sides
- Restarted block-GMRES with deflation of eigenvalues
- A breakdown-free block conjugate gradient method
- Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
- A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides -- matrix and polynomial interpretation
- Improved seed methods for symmetric positive definite linear equations with multiple right-hand sides.
- Generalized global conjugate gradient squared algorithm
- On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems
- Accelerated GCRO-DR method for solving sequences of systems of linear equations
- Efficient solution of block Toeplitz systems with multiple right-hand sides arising from a periodic boundary element formulation
- A Mathematical and Computational Framework for Reliable Real-Time Solution of Parametrized Partial Differential Equations
- A survey of subspace recycling iterative methods
- Accelerating data uncertainty quantification by solving linear systems with multiple right-hand sides
- BACKWARD PERTURBATION ANALYSIS AND RELATIVE ALGORITHMS FOR NONSYMMETRIC LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES
- Approximate Solutions of Linear Systems at a Universal Rate
- A PosterioriError Estimation for Reduced-Basis Approximation of Parametrized Elliptic Coercive Partial Differential Equations: “Convex Inverse” Bound Conditioners
- Solution methods for linear discrete ill-posed problems for color image restoration
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- Smoothing iterative block methods for linear systems with multiple right-hand sides
- A novel class of block methods based on the block \(AA^T\)-Lanczos bi-orthogonalization process for matrix equations
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Twofold deflation preconditioning of linear algebraic systems. I: Theory
- Non-overlapping domain decomposition solution schemes for structural mechanics isogeometric analysis
- On Kaczmarz's projection iteration as a direct solver for linear least squares problems
- The deflated conjugate gradient method: convergence, perturbation and accuracy
- Dealing with pressure: FEM solution strategies for the pressure in the time-dependent Navier-Stokes equations
- Deflated GMRES for systems with multiple shifts and multiple right-hand sides
- Matrix Krylov subspace methods for linear systems with multiple right-hand sides
- Revisiting performance of biCGStab methods for solving systems with multiple right-hand sides
- The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- Alternate Broyden’s method for solving linear least squares problem with multiple right-hand sides
- Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides.
- Parallel preconditioners and multigrid solvers for stochastic polynomial chaos discretizations of the diffusion equation at the large scale.
- The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
- MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides
This page was built for publication: Analysis of Projection Methods for Solving 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 Q4376247)
