Results 141 to 150 of about 713 (182)
Implementation of a high-order spatial discretization into a finite volume solver: Applications to turbomachinery test cases using an eddy-viscosity turbulence closure. [PDF]
HeliyonRosafio N, Salvadori S, Misul DA.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
GMRES with Deflated Restarting
SIAM Journal of Scientific Computing, 2002A new version of the generalized minimal residuum (GMRES) algorithm for solving large systems of linear equations is described. It uses a ``deflated restarting'' and at each cycle a recurrence similar to the Arnoldi's one is generated. The new algorithm has about the same storage and expense requirements as GMRES with implicitly restarted Arnoldi ...
Ronald B Morgan
exaly +3 more sources
Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
SIAM Journal on Matrix Analysis and Applications, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xin Ye, Yuanzhe Xi, Yousef Saad
openaire +2 more sources
GMRES On (Nearly) Singular Systems [PDF]
SIAM Journal on Matrix Analysis and Applications, 1997 The authors' purpose is to examine the behavior of the GMRES method when the matrix \(A\) is singular or nearly so, i.e., ill-conditioned, and to formulate practically effective ways of recognizing the singularity or the ill-conditioning when it might significantly affect the performance of the method.
Peter N Brown, Homer F Walker
exaly +3 more sources
SIAM Journal on Matrix Analysis and Applications, 1997
The GMRES algorithm for solving non-Hermitian linear systems \(Ax=b\) \((A\in\mathbb{C}^{N\times N}\), \(b\in \mathbb{C}^{N}\) is studied. The ideal GMRES problem is obtained if one consideres minimization of \(|p(A) |\) instead of \(|p(A)b|\) as in the GMRES algorithm.
Kim-Chuan Toh
exaly +2 more sources
The GMRES algorithm for solving non-Hermitian linear systems \(Ax=b\) \((A\in\mathbb{C}^{N\times N}\), \(b\in \mathbb{C}^{N}\) is studied. The ideal GMRES problem is obtained if one consideres minimization of \(|p(A) |\) instead of \(|p(A)b|\) as in the GMRES algorithm.
Kim-Chuan Toh
exaly +2 more sources
Numerical Linear Algebra With Applications, 1994
AbstractThe generalized minimal residual (GMRES) method is widely used for solving very large, nonsymmetric linear systems, particularly those that arise through discretization of continuous mathematical models in science and engineering. By shifting the Arnoldi process to begin with Ar0 instead of r0, we obtain simpler Gram–Schmidt and Householder ...
Homer F Walker
exaly +3 more sources
AbstractThe generalized minimal residual (GMRES) method is widely used for solving very large, nonsymmetric linear systems, particularly those that arise through discretization of continuous mathematical models in science and engineering. By shifting the Arnoldi process to begin with Ar0 instead of r0, we obtain simpler Gram–Schmidt and Householder ...
Homer F Walker
exaly +3 more sources
Polynomial Preconditioned GMRES and GMRES-DR
SIAM Journal on Scientific Computing, 2015Summary: We look at solving large nonsymmetric systems of linear equations using polynomial preconditioned Krylov methods. We give a simple way to find the polynomial. It is shown that polynomial preconditioning can significantly improve restarted GMRES for difficult problems, and the reasons for this are examined.
Liu, Quan +2 more
openaire +1 more source
Adaptively Preconditioned GMRES Algorithms
SIAM Journal on Scientific Computing, 1998Summary: The restarted GMRES algorithm proposed by \textit{Y. Saad} and \textit{M. H. Schultz} [SIAM J. Sci. Statist. Comput. 7, 856-869 (1986; Zbl 0599.65018)] is one of the most popular iterative methods for the solution of large linear systems of equations \(Ax=b\) with a nonsymmetric and sparse matrix. This algorithm is particularly attractive when
Baglama, J. +3 more
openaire +2 more sources
Restarted GMRES preconditioned by deflation
Journal of Computational and Applied Mathematics, 1996 The authors present a prospective preconditioning technique for the restarted GMRES algorithm. For that purpose a new restarted GMRES scheme for solving the linear system \(AM^{-1}_i \widehat{x} = b\), \(\widehat{x} = M_i x_i\), is given, where \(M_i\) is the preconditioner in the \(i\)th GMRES cycle, \(M_1 = I\).
Kevin Burrage
exaly +4 more sources
Flexible GMRES with Deflated Restarting
SIAM Journal on Scientific Computing, 2010In many situations, it has been observed that significant convergence improvements can be achieved in preconditioned Krylov subspace methods by enriching them with some spectral information. On the other hand, effective preconditioning strategies are often designed where the preconditioner varies from one step to the next so that a flexible Krylov ...
Giraud, Luc +3 more
openaire +2 more sources