Successive Matrix Squaring Algorithm for Computing the Generalized InverseAT,S(2)

Successive matrix squaring algorithm for computing outer inverses

In this paper we derive a successive matrix squaring (SMS) algorithm to approximate an outer generalized inverse with prescribed range and null space of a given matrix A ∈ Cm×n r . We generalize the results from the papers [3], [16], [18], and obtain an algorithm for computing various classes of outer generalized inverses of A. Instead of particular matrices used in these articles, we use an ap...

Successive Matrix Squaring Algorithm for Computing the Generalized Inverse AT,S(2)

We investigate successive matrix squaring SMS algorithms for computing the generalized inverse A 2 T,S of a given matrix A ∈ C m×n .

Successive Matrix Squaring Algorithm for Computing the Generalized Inverse A 2 T , S

Efficient Scaling-squaring Taylor Method for Computing the Matrix Exponential∗

The matrix exponential plays a fundamental role in linear systems arising in engineering, mechanics and control theory. In this paper, an efficient Taylor method for computing matrix exponentials is presented. Taylor series truncation together with a modification of the PatersonStockmeyer method avoiding factorial evaluations, and the scaling-squaring technique, allow efficient computation of t...

Full-rank representations of {2, 4}, {2, 3}-inverses and successive matrix squaring algorithm

We present the full-rank representations of {2, 4} and {2, 3}-inverses (with given rank as well as with prescribed range and null space) as particular cases of the full-rank representation of outer inverses. As a consequence, two applications of the successive matrix squaring (SMS) algorithm from [P.S. Stanimirović, D.S. Cvetković-Ilić, Successive matrix squaring algorithm for computing outer i...