Cholesky-like factorizations of skew-symmetric matrices (Q1586943)

From MaRDI portal
Revision as of 03:05, 20 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Cholesky-like factorizations of skew-symmetric matrices
scientific article

    Statements

    Cholesky-like factorizations of skew-symmetric matrices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 November 2000
    0 references
    The authors present a stable \(O(n^3)\) algorithm for computing \(R\) in the Cholesky-like factorization \(B= R^TJR\) of some skew-symmetric \(2n\times 2n\) matrix \(B\), where \(R\) is a permuted triangular matrix and \(J\) has the form \[ J= \left[\begin{matrix} O & I_n\\ -I_n & 0\end{matrix}\right]. \] Cholesky-like factorizations of skew-symmetric matrices are needed in the treatment of generalized eigenvalue problems with Hamiltonian structure that arise, e.g., in the analysis of corner singularities in elasticity and in linear quadratic optimal control problems. These applications are also discussed in the paper.
    0 references
    0 references
    matrix factorizations
    0 references
    Hamiltonian eigenproblems
    0 references
    complete pivoting
    0 references
    skew-symmetric matrices
    0 references
    corner singularities
    0 references
    elasticity
    0 references
    linear quadratic optimal control problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references