Zolotarev iterations for the Matrix square Root

From MaRDI portal
Publication:5232113

DOI10.1137/18M1178529zbMATH Open1420.65057arXiv1804.11000OpenAlexW2963228395WikidataQ127781427 ScholiaQ127781427MaRDI QIDQ5232113FDOQ5232113


Authors: Evan S. Gawlik Edit this on Wikidata


Publication date: 29 August 2019

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: We construct a family of iterations for computing the principal square root of a square matrix A using Zolotarev's rational minimax approximants of the square root function. We show that these rational functions obey a recursion, allowing one to iteratively generate optimal rational approximants of sqrtz of high degree using compositions and products of low-degree rational functions. The corresponding iterations for the matrix square root converge to A1/2 for any input matrix A having no nonpositive real eigenvalues. In special limiting cases, these iterations reduce to known iterations for the matrix square root: the lowest-order version is an optimally scaled Newton iteration, and for certain parameter choices, the principal family of Pad'e iterations is recovered. Theoretical results and numerical experiments indicate that the iterations perform especially well on matrices having eigenvalues with widely varying magnitudes.


Full work available at URL: https://arxiv.org/abs/1804.11000




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: Zolotarev 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 Q5232113)