The Chebyshev iteration revisited
From MaRDI portal
Publication:5958215
DOI10.1016/S0167-8191(01)00139-9zbMath0984.68209WikidataQ63599186 ScholiaQ63599186MaRDI QIDQ5958215
Martin H. Gutknecht, Stefan Röllin
Publication date: 3 March 2002
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(01)00139-9
68W30: Symbolic computation and algebraic computation
68W10: Parallel algorithms in computer science
Related Items
Proxy-GMRES: Preconditioning via GMRES in Polynomial Space, A Primal-Dual Projection Algorithm for Efficient Constraint Preconditioning, Solving the Three-Dimensional High-frequency Helmholtz Equation Using Contour Integration and Polynomial Preconditioning, CLAIRE: A Distributed-Memory Solver for Constrained Large Deformation Diffeomorphic Image Registration, M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions, Local Fourier Analysis of p-Multigrid for High-Order Finite Element Operators, Chebyshev acceleration of iterative refinement, On the generation of Krylov subspace bases, Restrictively preconditioned Chebyshev method for solving systems of linear equations, On the equivalence between the scheduled relaxation Jacobi method and Richardson's non-stationary method, A comparative study on low-memory iterative solvers for FFT-based homogenization of periodic media, A review of nonlinear FFT-based computational homogenization methods