No label defined (Q3983548)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 26912
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 26912

      Statements

      27 June 1992
      0 references
      polynomial approximation
      0 references
      generalized minimal residual algorithm
      0 references
      eigenpair
      0 references
      large symmetric matrix
      0 references
      Krylov space
      0 references
      numerical experiments
      0 references
      gmr algorithm
      0 references
      Lanczos algorithm
      0 references
      The author [J. Complexity 2, 131-162 (1986; Zbl 0599.65021)] introduced the generalized minimal algorithm (gmr) for finding an approximation \((x,\rho)\) of a normalized eigenpair of a large symmetric matrix \(A\) in a Krylov space \({\mathcal K}_ 0\) which minimizes the Euclidean norm of the residual \(| Ax-\rho x|\) for \(| x|=1\), \(x\in{\mathcal K}_ 0\). In this paper, he describes an efficient implementation of his algorithm which is based on Golub's theorem on eigenvalues of a matrix which is perturbed by a rank one matrix. Extensive numerical experiments are reported where the residuals obtained by gmr algorithm are compared with those of the Lanczos algorithm. The method may be modified in order to find approximation to the extreme eigenpairs which minimize the residuals in \({\mathcal K}_ 0\).
      0 references
      0 references

      Identifiers