Inversion free algorithms for computing the principal square root of a matrix (Q2260324): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2014/613840 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2120139931 / rank
 
Normal rank

Revision as of 21:58, 19 March 2024

scientific article
Language Label Description Also known as
English
Inversion free algorithms for computing the principal square root of a matrix
scientific article

    Statements

    Inversion free algorithms for computing the principal square root of a matrix (English)
    0 references
    0 references
    0 references
    10 March 2015
    0 references
    Summary: New algorithms are presented about the principal square root of an \(n \times n\) matrix \(A\). In particular, all the classical iterative algorithms require matrix inversion at every iteration. The proposed inversion free iterative algorithms are based on the Schulz iteration or the Bernoulli substitution as a special case of the continuous time Riccati equation. It is certified that the proposed algorithms are equivalent to the classical Newton method. An inversion free algebraic method, which is based on applying the Bernoulli substitution to a special case of the continuous time Riccati equation, is also proposed.
    0 references
    inversion free iterative algorithms
    0 references
    Schulz iteration
    0 references
    Bernoulli substitution
    0 references
    continuous time Riccati equation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references