Newton's method for the matrix nonsingular square root (Q2336276): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/jam/LiS14, #quickstatements; #temporary_batch_1731547958265
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Shu-Qian Shen / rank
Normal rank
 
Property / author
 
Property / author: Shu-Qian Shen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2014/267042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2145243032 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59050586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Logarithm of a Matrix to Specified Accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Techniques for Real Logarithms of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square roots of complex matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster method of computing the square root of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of matrix square roots under a numerical range condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Schur method for the square root of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of the Nth root / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matrix sign function and computations in systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to compute the square root of a 3\(\times 3\) positive definite matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's Method for the Matrix Square Root / rank
 
Normal rank
Property / cites work
 
Property / cites work: A power method for computing square roots of complex matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable iterations for the matrix square root / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the square roots of matrices with central symmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of the principal square roots of centrosymmetric H-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Iterative Solution of the Matrix Equation AX 2 - I = 0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matrix Square Root from a New Functional Perspective: Theoretical Results and Computational Issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Sylvester matrix equation AXB <sup> <i>T</i> </sup> + CXD <sup> <i>T</i> </sup> = E / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638711 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jam/LiS14 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:57, 14 November 2024

scientific article
Language Label Description Also known as
English
Newton's method for the matrix nonsingular square root
scientific article

    Statements

    Newton's method for the matrix nonsingular square root (English)
    0 references
    0 references
    0 references
    19 November 2019
    0 references
    Summary: Two new algorithms are proposed to compute the nonsingular square root of a matrix \(A\). Convergence theorems and stability analysis for these new algorithms are given. Numerical results show that these new algorithms are feasible and effective.
    0 references

    Identifiers