Newton's method for the matrix nonsingular square root
From MaRDI portal
Publication:2336276
DOI10.1155/2014/267042zbMath1437.65035OpenAlexW2145243032WikidataQ59050586 ScholiaQ59050586MaRDI QIDQ2336276
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/267042
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the square roots of matrices with central symmetry
- A Schur method for the square root of a matrix
- The matrix sign function and computations in systems
- An algorithm to compute the square root of a 3\(\times 3\) positive definite matrix
- Fast computation of the Nth root
- Stable iterations for the matrix square root
- A power method for computing square roots of complex matrices
- The computation of the principal square roots of centrosymmetric H-matrices
- Approximating the Logarithm of a Matrix to Specified Accuracy
- On the Iterative Solution of the Matrix Equation AX 2 - I = 0
- A faster method of computing the square root of a matrix
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- The Matrix Square Root from a New Functional Perspective: Theoretical Results and Computational Issues
- Newton's Method for the Matrix Square Root
- Square roots of complex matrices
- Computational Techniques for Real Logarithms of Matrices
- Uniqueness of matrix square roots under a numerical range condition
This page was built for publication: Newton's method for the matrix nonsingular square root
