An efficient algorithm for computing powers of triangular matrices

C. P. Huang · 1978

An efficient algorithm for the computation of powers of a square arbitrary lower triangular matrix is presented. A comparison of the algorithm with the standard matrix multiplication method in terms of maximum number of multiplications is included. A numerical example is used to show some of the computational details.

Read the paper · More papers on PaperTik