A rapidly convergent algorithm is given which will solve

for

when

is a stable matrix. The algorithm proposed requires only

words of memory (for large

) and converges in approximately

s where μ is the multiplication time of the computer and

is the order of the matrix

.