An Efficient Solver for Multi--Right-Hand-Side Linear Systems Based on the CCCG($\eta$) Method with Applications to Implicit Time-Dependent Partial Differential Equations

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60)

Related Items (8)

A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming ⋮ Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods ⋮ Recycling basic columns of the splitting preconditioner in interior point methods ⋮ Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming ⋮ Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods ⋮ Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method ⋮ Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach ⋮ Krylov-based Uzawa algorithms for the solution of the Stokes equations using discontinuous-pressure tetrahedral finite elements

This page was built for publication: An Efficient Solver for Multi--Right-Hand-Side Linear Systems Based on the CCCG($\eta$) Method with Applications to Implicit Time-Dependent Partial Differential Equations