Bruno Iannazzo

On the Doubling Algorithm for a (Shifted) Nonsymmetric Algebraic Riccati Equation

Nonsymmetric algebraic Riccati equations for which the four coefficient matrices form an irreducible

A Fast Newton's Method for a Nonsymmetric Algebraic Riccati Equation

M

A Family of Rational Iterations and Its Application to the Computation of the Matrix

-matrix

p

M

th Root

are considered. The emphasis is on the case where

The geometric mean of two matrices from a computational viewpoint

M

A binary powering Schur algorithm for computing primary matrix roots

is an irreducible singular

A Schur Logarithmic Algorithm for Fractional Powers of Matrices

M

The Pade iterations for the matrix sign function and their reciprocals are optimal

-matrix, which arises in the study of Markov models. The doubling algorithm is considered for finding the minimal nonnegative solution, the one of practical interest. The algorithm has been recently studied by others for the case where

Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms

M