Iterative methods for computing the matrix square root

DOI10.1007/s40324-015-0038-9zbMath1331.65068OpenAlexW2206186927MaRDI QIDQ892990

José Antonio Ezquerro, Sergio Amat, Miguel Ángel 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

zbMATH Keywords

algorithmiterative methodsemilocal convergencematrix square rootnumerical experimentorder of convergence

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix exponential and similar matrix functions (65F60)

Related Items (2)

After notes on Chebyshev’s iterative method ⋮ Dual time-stepping using second derivatives

Uses Software

• mftoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Computing real square roots of a real matrix
• 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
• The convergence of a Halley-Chebysheff-type method under Newton- Kantorovich hypotheses
• An adaptive version of a fourth-order iterative method for quadratic equations
• A note on computing the matrix square root
• Results on the Chebyshev method in banach spaces
• On a new family of high‐order iterative methods for the matrix pth root
• A convergence analysis of Newton's method under the gamma-condition in Banach spaces
• Adaptive Approximation of Nonlinear Operators
• New Kantorovich-Type Conditions for Halley's Method
• Newton's Method for the Matrix Square Root
• Multiresolution Standard Form of a Matrix
• Multiresolution Representation of Data: A General Framework
• Functions of Matrices
• Modification of the Kantorovich assumptions for semilocal convergence of the Chebyshev method

This page was built for publication: Iterative methods for computing the matrix square root