Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations (Q2570769): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4348513 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparse matrix test problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global FOM and GMRES algorithms for matrix equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Restarted GMRES Method Augmented with Eigenvectors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: GMRES with Deflated Restarting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Harmonic projection methods for large non-symmetric eigenvalue problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implicit Application of Polynomial Filters in a <i>k</i>-Step Arnoldi Method / rank | |||
Normal rank |
Revision as of 17:09, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations |
scientific article |
Statements
Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations (English)
0 references
28 October 2005
0 references
Many applications require the solution of several sparse systems of linear equations \(Ax^i=b^i\), for \(i=1,\ldots, s,\) with the same coefficient matrix and different right-hand sides. When all the \(b^i\) are available simultaneously, we have a matrix equation \(AX=B\), where \(A\) is an \(n\times n\) real nonsingular matrix, \(B\) and \(X\) are \(n\times s\) rectangular matrices whose columns are \(b^i\) and \(x^i\), respectively. Recently, global full orthogonal method (FOM) and generalized minimal residual (GMRES) algorithms for nonsymmetric matrix equations presented by \textit{K. Jbilou, A. Messauudi} and \textit{H. Sadok} [Appl. Numer. Math. 31, No.~1, 49--63 (1999; Zbl 0935.65024)]. In general, they must be restarted which slows the convergence. However, some information can be retained at the time of restart and used it in the next cycle. In this paper, the author presents algorithms that use the implicitly restarted technique and deflation in order to retain this information. In addition, it is proved that the global FOM and GMRES methods for matrix equations are equivalent with the corresponding methods for linear equations. In this case, the author proposes implicitly restarted global FOM and GMRES.
0 references
global Arnoldi method
0 references
matrix Krylov subspace method
0 references
harmonic Ritz values and Ritz vectors
0 references
GMRES
0 references
implicit restarting
0 references
multiple right-hand sides
0 references
Sylvester equation
0 references
eigenmatrix
0 references
matrix equation
0 references
full orthogonal method
0 references
generalized minimal residual algorithms
0 references