No label defined (Q3974777)

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 17457
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 17457

      Statements

      0 references
      0 references
      26 June 1992
      0 references
      conjugate gradient algorithm
      0 references
      extreme eigenproblems
      0 references
      symmetric matrices
      0 references
      QR algorithm
      0 references
      eigenvalues
      0 references
      eigenvectors
      0 references
      fast Fourier transform (FFT)
      0 references
      Hankel system
      0 references
      digital signal processing
      0 references
      numerical example
      0 references
      [For the entire collection see Zbl 0728.00018.] During the last decade, the authors have published several articles dealing with the efficiency of the conjugate gradient (CG) algorithm for solution of extreme eigenproblems of symmetric matrices. An advantage of this algorithm is the fact that it finds the minimum eigenvector directly, while the conventional methods, such as the QR algorithm, solve, needed or not, all the eigenvalues and eigenvectors simultaneously. It turns out that the introduction of the fast Fourier transform (FFT) into the computation further improves the efficiency of the QR algorithm and demonstrates its flexibility. In the present paper these ideas are applied to a minimum eigenproblem of a Hankel system. Such systems arise, as the authors state, in many areas of digital signal processing. The authors solve a numerical example both in terms of the CG algorithm and in terms of the EIGRS routine based on the QR algorithm. The result given by the former method and using 5 ms. CPU time is more accurate than that given by the latter method and using 27 ms. CPU time.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references