Computing the square root and logarithm of a real \(P\)-orthogonal matrix (Q1398682)

From MaRDI portal
Revision as of 08:56, 21 July 2025 by CorrectionBot (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 1961608
Language Label Description Also known as
English
Computing the square root and logarithm of a real \(P\)-orthogonal matrix
scientific article; zbMATH DE number 1961608

    Statements

    Computing the square root and logarithm of a real \(P\)-orthogonal matrix (English)
    0 references
    0 references
    0 references
    0 references
    7 August 2003
    0 references
    The authors consider \(P\)-orthogonal square matrices A such that \(A^TPA=P\) for a fixed real nonsingular matrix \(P\). But most of the results require that \(P\) be symmetric or \(P^T=P^{-1}\) and \(P^2=\pm I\). They present an efficient iterative method for computing the \(P\)-orthogonal factor in the generalized polar decomposition which generalizes Newton's method for polar decomposition. A new iterative method is given for computing the principal square root of a \(P\)-orthogonal matrix. When \(P\) is symmetric positive definite, this method restores the \(P\)-orthogonal properties of the exact square root by computing the nearest \(P\)-orthogonal matrix. New bounds and new estimates for the Padé error of the matrix logarithm improve the existing Briggs-Padé algorithms and adapt them to \(P\)-orthogonal matrices.
    0 references
    \(P\)-orthoggonal matrices
    0 references
    generalized polar decomposition
    0 references
    Padé approximation
    0 references
    matrix square roots
    0 references
    matrix logarithm
    0 references
    error bounds
    0 references
    iterative method
    0 references
    Newton's method
    0 references
    Briggs-Padé algorithms
    0 references

    Identifiers