Results 11 to 20 of about 3,479 (214)
GMRES and Integral Operators [PDF]
SIAM Journal on Scientific Computing, 1996 The purpose of this paper is to show how the generalized minimal residual (GMRES) method can be modified to incorporate Nyström interpolation at a small cost in both computational effort and algorithmic complexity. The result is an algorithm that has the convergence property of Broyden's method.
Carl T. Kelley, Z. Q. Xue
openaire +2 more sources
Properties of Worst-Case GMRES [PDF]
SIAM Journal on Matrix Analysis and Applications, 2013 In the convergence analysis of the GMRES method for a given matrix $A$, one quantity of interest is the largest possible residual norm that can be attained, at a given iteration step $k$, over all unit norm initial vectors. This quantity is called the worst-case GMRES residual norm for $A$ and $k$.
Vance Faber, Jörg Liesen, Petr Tichý
openaire +5 more sources
GMRES with Randomized Sketching and Deflated Restarting [PDF]
SIAM Journal on Matrix Analysis and Applications24 Pages; 6 Figures; 4 ...
Liam Burke 0002 +2 more
core +5 more sources
CoRRThe convergence of the GMRES linear solver is notoriously hard to predict. A particularly enlightening result by [Greenbaum, Pták, Strakoš, 1996] is that, given any convergence curve, one can build a linear system for which GMRES realizes that convergence curve. What is even more extraordinary is that the eigenvalues of the problem matrix can be chosen
Pierre Matalon, Nicole Spillane
openaire +3 more sources
Five-precision GMRES-based Iterative Refinement [PDF]
, 2021 GMRES-based iterative refinement in three precisions (GMRES-IR3) uses a low precision LU factorization to accelerate the solution of a linear system without compromising numerical stability or robustness.
Amestoy, Patrick +7 more
core +1 more source
Multipreconditioned Gmres for Shifted Systems [PDF]
SIAM Journal on Scientific Computing, 2017 An implementation of GMRES with multiple preconditioners (MPGMRES) is proposed for solving shifted linear systems with shift-and-invert preconditioners. With this type of preconditioner, the Krylov subspace can be built without requiring the matrix-vector product with the shifted matrix.
Tania Bakhos +4 more
openaire +4 more sources
Adaptive version of Simpler GMRES [PDF]
Numerical Algorithms, 2009 The authors propose and theoretically analyze a stable version of simpler generalized minimal residual (GMRES) algorithm, based on an adaptive choice of the Krylov subspace basis at a given iteration step. They show that this adaptive choice of direction vectors keeps the basis well-conditioned and that the condition number grows at most linearly with ...
Pavel Jiránek, Miroslav Rozlozník
openaire +2 more sources
SIAM Journal on Scientific Computing, 2023 The GMRES algorithm of Saad and Schultz (1986) is an iterative method for approximately solving linear systems $A{\bf x}={\bf b}$, with initial guess ${\bf x}_0$ and residual ${\bf r}_0 = {\bf b} - A{\bf x}_0$. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of $V_k$).
Stephen J. Thomas +4 more
openaire +4 more sources
Cogent Engineering, 2020 This article considered the numerical simulation of multicomponent multiphase flow in porous media. The resulting system of nonlinear equations linearized by the Newton-Raphson method and solved with the iterative Generalized minimal residual method ...
Saltanbek T. Mukhambetzhanov +5 more
doaj +1 more source
DAPHNE-3D: A NEW TRANSPORT SOLVER FOR UNSTRUCTURED TETRAHEDRAL MESHES [PDF]
EPJ Web of Conferences, 2021 A new Discrete Ordinates transport solver for unstructured tetrahedral meshes is presented. The solver uses the Discontinuous Galërkin Finite Element Method with linear or quadratic expansion of the flux within each cell.
Diamantopoulou Evangelia +1 more
doaj +1 more source