Computing the matrix square root with the doubling algorithm
From MaRDI portal
Cites work
- A note on computing the matrix square root
- A Schur method for the square root of a matrix
- Approximating the logarithm of a matrix to specified accuracy
- Computations with infinite Toeplitz matrices and polynomials
- Computing real square roots of a real matrix
- Computing the Polar Decomposition—with Applications
- Convergence Analysis of Structure-Preserving Doubling Algorithms for Riccati-Type Matrix Equations
- Convergence analysis of the doubling algorithm for several nonlinear matrix equations in the critical case
- Functions of Matrices
- Improved cyclic reduction for solving queueing problems
- Matrix Analysis and Computations
- Newton's Method for the Matrix Square Root
- Numerical solution of algebraic Riccati equations.
- On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
- Optimization of extrapolated Cayley transform with non-Hermitian positive definite matrix
- Rational Iterative Methods for the Matrix Sign Function
- Stable iterations for the matrix square root
- The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub
- The matrix sign function and computations in systems
- The Matrix Square Root from a New Functional Perspective: Theoretical Results and Computational Issues
This page was built for publication: Computing the matrix square root with the doubling algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930071)
