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
From MaRDI portal
Publication:4389232
DOI10.1137/S106482759630382XzbMath0917.65030MaRDI QIDQ4389232
F. F. Campos, Nick R. C. Birkett
Publication date: 12 May 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
preconditioners; incomplete factorization; conjugate gradient iterations; sparse symmetric positive definite matrices; time-dependent equations
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
65M60: Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs
Related Items
Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach, 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, 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
