A real algorithm for the Hermitian eigenvalue decomposition (Q2366659): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Least Squares Computations by Givens Transformations Without Square Roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of cyclic Jacobi-like processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sharp quadratic convergence bounds for the serial Jacobi methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inversion of Matrices by Biorthogonalization and Related Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Parallel Jacobi Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast givens rotations for orthogonal similarity transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a one-sided Jacobi algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the quadratic convergence of the cyclic Jacobi process / rank
 
Normal rank

Latest revision as of 17:15, 17 May 2024

scientific article
Language Label Description Also known as
English
A real algorithm for the Hermitian eigenvalue decomposition
scientific article

    Statements

    A real algorithm for the Hermitian eigenvalue decomposition (English)
    0 references
    0 references
    0 references
    0 references
    17 February 1994
    0 references
    The replacement of each complex rotation in the Jacobi method by the composition of a real rotation followed by a complex unit scaling in one coordinate is the basis of the algorithms presented in the paper; by means of these algorithms, the eigensystem of a Hermitian matrix is determined avoiding complex arithmetic. This yields a significant reduction in the overall computational cost. Numerical examples that illustrate this point are exhibited.
    0 references
    complex rotation
    0 references
    Jacobi method
    0 references
    scaling
    0 references
    algorithms
    0 references
    eigensystem
    0 references
    Hermitian matrix
    0 references
    Numerical examples
    0 references

    Identifiers