Iterative methods for computing the matrix square root
DOI10.1007/S40324-015-0038-9zbMATH Open1331.65068OpenAlexW2206186927MaRDI QIDQ892990FDOQ892990
Authors: Sergio Amat, J. A. Ezquerro, Miguel A. Hernández Verón 
Publication date: 13 November 2015
Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40324-015-0038-9
Recommendations
algorithmnumerical experimentiterative methodorder of convergencesemilocal convergencematrix square root
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cites Work
- Functions of Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adaptive Approximation of Nonlinear Operators
- Multiresolution Representation of Data: A General Framework
- Computing real square roots of a real matrix
- Modification of the Kantorovich assumptions for semilocal convergence of the Chebyshev method
- Results on the Chebyshev method in banach spaces
- An adaptive version of a fourth-order iterative method for quadratic equations
- The convergence of a Halley-Chebysheff-type method under Newton- Kantorovich hypotheses
- On Newton's method and Halley's method for the principal \(p\)th root of a matrix
- A residual recurrence for Halley's method for the matrix \(p\)th root
- On a new family of high-order iterative methods for the matrix \(p\)th root.
- New Kantorovich-Type Conditions for Halley's Method
- Multiresolution Standard Form of a Matrix
- A note on computing the matrix square root
- Newton's Method for the Matrix Square Root
- A convergence analysis of Newton's method under the gamma-condition in Banach spaces
Cited In (17)
- Matrix methods for finding \(\root n \of {m^u}\)
- Title not available (Why is that?)
- Dual time-stepping using second derivatives
- Application of Matlab in the improved square root method of symmetric real matrix
- Short Notes: Rapidly Converging Iterative Formulae for Finding Square Roots and their Computational Efficiencies
- Approximate iterations for structured matrices
- Methods with prefixed order for approximating square roots with global and general convergence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Revisiting matrix squaring
- On a new family of high-order iterative methods for the matrix \(p\)th root.
- New methods for approximating square roots
- After notes on Chebyshev’s iterative method
- The binomial method for a matrix square root
- A one parameter method for the matrix inverse square root
- A power method for computing square roots of complex matrices
- Square rooting by iterative multiply-additions
Uses Software
This page was built for publication: Iterative methods for computing the matrix square root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892990)
