Algorithms for the matrix sector function

zbMath1190.65069MaRDI QIDQ964060

Beata Laszkiewicz, Krystyna Ziętak

Publication date: 14 April 2010

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/228607

zbMATH Keywords

stabilityNewton's methodnumerical examplesHalley's methodconditioningFréchet derivativeSchur algorithmconvergence regionsmatrix sign functionmatrix sector functionmatrix pth rootParlett recurrence

Mathematics Subject Classification ID

Matrix equations and identities (15A24)

Related Items (9)

Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix \(p\)th root ⋮ A globally convergent variant of mid-point method for finding the matrix sign ⋮ Constructing a high-order globally convergent iterative method for calculating the matrix sign function ⋮ Approximating the matrix sign function using a novel iterative method ⋮ On iterative algorithms for the polar decomposition of a matrix and the matrix sign function ⋮ A Padé family of iterations for the matrix sector function and the matrix p th root ⋮ The dual Padé families of iterations for the matrix \(p\)th root and the matrix \(p\)-sector function ⋮ A Padé family of iterations for the matrix sign function and related problems ⋮ A binary powering Schur algorithm for computing primary matrix roots

This page was built for publication: Algorithms for the matrix sector function