A parallel algorithm for principal \(n\)th roots of matrices

DOI10.1016/S0005-1098(97)00067-8MaRDI QIDQ2275046

M. InceoǦlu, Çetin Kaya Koç

Publication date: 2 October 2019

Published in: Automatica (Search for Journal in Brave)

zbMATH Keywords

matrix methodsiterative methodsparallel algorithms

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Linear and multilinear algebra; matrix theory (15-XX)

Related Items (1)

Extraction of \(n\)th roots of \(2 \times 2\) matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing real square roots of a real matrix
• A Schur method for the square root of a matrix
• Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function
• Roots of real matrices
• A faster, more stable method for comuting the pth roots of positive definite matrices
• Fast and stable algorithms for computing the principal square root of a complex matrix
• A PARALLEL ALGORITHM FOR THE MATRIX SIGN FUNCTION
• Some properties of matrix sign functions derived from continued fractions
• A generalization of the matrix-sign-function solution for algebraic Riccati equations
• The Generalized Matrix Sector Function and the Separation of Matrix Eigenvalues
• Padé error estimates for the logarithm of a matrix
• Newton's Method for the Matrix Square Root
• Rational Iterative Methods for the Matrix Sign Function
• The Equivalence of Definitions of a Matric Function

This page was built for publication: A parallel algorithm for principal \(n\)th roots of matrices