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
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
conjugate gradient iterationsincomplete factorizationpreconditionerssparse symmetric positive definite matricestime-dependent equations
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60)
- Approximate inverse preconditioning for shifted linear systems
- A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix
- Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method
- A robust incomplete factorization preconditioner for positive definite matrices
- Adaptive techniques for improving the performance of incomplete factorization preconditioning
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- scientific article; zbMATH DE number 4172249
- Using approximate inverses in algebraic multilevel methods
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- Optimal preconditioners of a given sparsity pattern
- Krylov-based Uzawa algorithms for the solution of the Stokes equations using discontinuous-pressure tetrahedral finite elements
- Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method
- 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
- Subspace-by-subspace preconditioners for structured linear systems
- Computing the splitting preconditioner for interior point method using an incomplete factorization approach
- Accelerated preconditioner updates for solving shifted linear systems
- Recycling basic columns of the splitting preconditioner in interior point methods
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389232)
