A note on computing the matrix square root

DOI10.1007/s10092-003-0079-9zbMath1117.65059OpenAlexW1964404061MaRDI QIDQ2504778

Bruno Iannazzo

Publication date: 28 September 2006

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-003-0079-9

Mathematics Subject Classification ID

Related Items (14)

Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix ⋮ On a new family of high‐order iterative methods for the matrix pth root ⋮ Square roots of \(3\times 3\) matrices ⋮ Approximation of inverse operators by a new family of high-order iterative methods ⋮ Iterative methods for computing the matrix square root ⋮ After notes on Chebyshev’s iterative method ⋮ A new ZNN model for finding discrete time-variant matrix square root: from model design to parameter analysis ⋮ Geometric means of quasi-Toeplitz matrices ⋮ A numerical method for computing the principal square root of a matrix ⋮ Residual methods for the large-scale matrix \(p\)th root and some related problems ⋮ The palindromic cyclic reduction and related algorithms ⋮ A binary powering Schur algorithm for computing primary matrix roots ⋮ The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub ⋮ Zolotarev Iterations for the Matrix Square Root

This page was built for publication: A note on computing the matrix square root