Matrix multiplication is one of the most basic algebraic operations. Since Strassen's surprising breakthrough algorithm from 1969, which showed that matrices can be multiplied faster than the most ...

We present two fast algorithms for finding the solution of the nonsingular lower Hessenberg quasi-Toeplitz linear system stem from Markov chain. And we confirm the complexity of these two algorithms ...