A binary powering Schur algorithm for computing primary matrix roots
type: Item
instance of: scholarly article
title: A binary powering Schur algorithm for computing primary matrix roots
zbMATH Open document ID: 1202.65053
author: Federico Greco
author: Bruno Iannazzo
published in: Numerical Algorithms
publication date: 2010-09-21T00:00:00Z
review text: The authors propose a new algorithm based on the Schur normal form, for computing a primary \(p\)th root of an \(n \times n\) complex matrix. They prove that the cost of the proposed algorithm is lowered to \({\mathcal{O}}(n^2 p + n^3 \log_2 p)\) ops and the storage is lowered to \({\mathcal{O}}(n p + n^2 \log_2 p)\) real numbers.
reviewed by: Constantin Popa
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A24
Mathematics Subject Classification ID: 15A16
zbMATH DE Number: 5789596
zbMATH Keywords: matrix \(p\)th root
zbMATH Keywords: matrix functions
zbMATH Keywords: Schur method
zbMATH Keywords: binary powering technique
zbMATH Keywords: algorithm
describes a project that uses: mctoolbox
describes a project that uses: mftoolbox
MaRDI profile type: MaRDI publication profile
full work available at URL: s11075-009-9357-1
OpenAlex ID: W2029063450
cites work: A Schur method for the square root of a matrix
cites work: The matrix sign function and computations in systems
cites work: A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
cites work: Newton's Method for the Matrix Square Root
cites work: Computing real square roots of a real matrix
cites work: Functions of Matrices
cites work: Q4303969
cites work: A note on computing the matrix square root
cites work: On the Newton Method for the Matrix Pth Root
cites work: A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
cites work: On the Iterative Solution of the Matrix Equation AX 2 - I = 0
cites work: Algorithms for the matrix sector function
cites work: A Padé family of iterations for the matrix sector function and the matrix p th root
cites work: The Matrix Square Root from a New Functional Perspective: Theoretical Results and Computational Issues
cites work: A Schur Algorithm for Computing Matrix pth Roots
DOI: 10.1007/S11075-009-9357-1
Recommended article: A Schur Algorithm for Computing Matrix pth Roots
Recommended article: A Schur–Padé Algorithm for Fractional Powers of a Matrix
Recommended article: Algorithms for the matrix \(p\)th root
Recommended article: A parallel algorithm for principal \(n\)th roots of matrices
Recommended article: A Schur logarithmic algorithm for fractional powers of matrices
Recommended article: A power method for computing square roots of complex matrices
Recommended article: A method for computing the Perron root for primitive matrices
Recommended article: Beating binary powering for polynomial matrices
Recommended article: A study of Schröder's method for the matrix \(p\)th root using power series expansions
description: scientific article; zbMATH DE number 5789596