Calculation of the square root of a positive-definite matrix
Algorithms for finding the square root of a positive definite matrix are examined. The first one involves inversion of matrices. While the second one does not, which, of course, speaks favorably of the accuracy of the result. The third algorithm in a certain sense combines the ideas of the first two. As a possible application of these algorithms, we may particularly mention problems of ellipsoidal approximation, which involve numerical integration of nonlinear matrix differential equations containing the square root of the matrix sought.
- scientific article; zbMATH DE number 220010
- Numerical approximation of the product of the square root of a matrix with a vector
- An algorithm to compute the square root of a 3\(\times 3\) positive definite matrix
- Enclosing the square root of a positive definite symmetric matrix
- Newton's method for the matrix nonsingular square root
- An algorithm to compute the square root of a 3\(\times 3\) positive definite matrix
- Numerical approximation of the product of the square root of a matrix with a vector
- An Improved Arc Algorithm for Detecting Definite Hermitian Pairs
- scientific article; zbMATH DE number 1264500 (Why is no real title available?)
- Enclosing the square root of a positive definite symmetric matrix
- scientific article; zbMATH DE number 220010 (Why is no real title available?)
- Calculus of the sqaure root of a positive definite symmetrical linear mappings by solely determinig a rotation
This page was built for publication: Calculation of the square root of a positive-definite matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1335706)
