Two kinds of algorithms are usually resorted to in order to solve the well-known Lyapounov discrete equation

: transformation of the original linear system in a classical one with

unknowns, and iterative scheme [1]. The first requires

storage words and a cost of

multiplications, which is impractical with a large system, and the second applies only if

is a stable matrix. The solution proposed requires no stability assumption and operates in only some n
2words and n
3multiplications.