Write a computer program in a language of your choice to solve a system of n linear equations and n unknowns using the LU decomposition. Input data to the program should be The number of equations n.

Anping Liao, Yuan Lei, OPTIMAL APPROXIMATE SOLUTION OF THE MATRIX EQUATION AX B = C OVER SYMMETRIC MATRICES, Journal of Computational Mathematics, Vol. 25, No. 5 (September 2007), pp. 543-552 ...

Consider a d times n matrix A, with d < n. The problem of solving for x in y = Ax is underdetermined, and has infinitely many solutions (if there are any). Given y, the minimum Kolmogorov complexity ...

In each case, the recurrence relations may be represented by matrix equations of the form X = AX + XB + C, where A and B are tridiagonal Toeplitz matrices. The spectral properties of A and B are ...