Stable iterations for the matrix square root
From MaRDI portal
The paper first gives an overview on the theory of iteration method for computig matrix square roots. Then computer studies are used to compare different methods. Finally, the numerical stability of the Padé iteration is analysed.
Recommendations
Cited in
(53)- Error analysis of Padé iterations for computing matrix invariant subspaces
- Hamiltonian square roots of skew-Hamiltonian matrices
- Computing the square root and logarithm of a real P-orthogonal matrix
- Fast random field generation with \(H\)-matrices
- A Taylor expansion of the square root matrix function
- Mixed matrix sign function/DFT inversion method for solving parameter-dependent Riccati equation
- Accelerating a recurrent neural network to finite-time convergence using a new design formula and its application to time-varying matrix square root
- Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration
- Conditioning of the matrix-matrix exponentiation
- Numerical approximation of the product of the square root of a matrix with a vector
- Square roots of H-nonnegative matrices
- Analysis of numerical methods for spectral fractional elliptic equations based on the best uniform rational approximation
- Matrix hypergeometric function and its application to computation of characteristic function of spherically symmetric distributions with phase-type amplitude
- Newton's method for the matrix nonsingular square root
- The computation of the principal square roots of centrosymmetric H-matrices
- On stability of functional differential equations with rapidly oscillating coefficients
- The nontriviality of trivial general covariance: how electrons restrict `time' coordinates, spinors (almost) fit into tensor calculus, and \(\frac{7}{16}\) of a tetrad is surplus structure
- Some properties of generalized \(K\)-centrosymmetric \(H\)-matrices
- A note on computing the matrix square root
- A robust algorithm for finding the eigenvalues and eigenvectors of \(3 \times 3\) symmetric matrices
- Matrix arithmetic-geometric mean and the computation of the logarithm
- Classical and nonclassical randomness in quantum measurements
- Fast wave computation via Fourier integral operators
- Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
- A faster method of computing matrix pythagorean sums
- Numerical solution of some algebraic problems arising in the theory of stability
- On the Matrix Square Root
- A manual approach for calculating the root of square matrix of dimension
- A Padé Approximation Method for Square Roots of Symmetric Positive Definite Matrices
- On computing complex square roots of real matrices
- An iterative method for solving the stable subspace of a matrix pencil and its application
- Newton's Method for the Matrix Square Root
- Symplectic analogs of polar decomposition and their applications to bosonic Gaussian channels
- Zolotarev iterations for the Matrix square Root
- An Algorithm for the Matrix Lambert W Function
- Functions Preserving Matrix Groups and Iterations for the Matrix Square Root
- The binomial method for a matrix square root
- Uniqueness of matrix square roots and an application
- Numerical linear algebra in data assimilation
- Scaled fixed point algorithm for computing the matrix square root
- Revisiting Convolutional Neural Networks from the Viewpoint of Kernel-Based Methods
- Measuring linear correlation between random vectors
- The Padé iterations for the matrix sign function and their reciprocals are optimal
- Computation of matrix \(p\)th roots using moments
- Computing the matrix square root with the doubling algorithm
- A complete pair of solvents of a quadratic matrix pencil
- An iterative method to compute the sign function of a non-Hermitian matrix and its application to the overlap Dirac operator at nonzero chemical potential
- Residual methods for the large-scale matrix \(p\)th root and some related problems
- The computation of the square roots of circulant matrices
- A new stable and inversion-free iteration for computing the matrix square root of large and sparse matrices
- Iterative methods for computing the matrix square root
- Approximate iterations for structured matrices
- Least-squares collocation with covariance-matching constraints
This page was built for publication: Stable iterations for the matrix square root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373134)
