I downloaded a background pattern from here.

- Computes an LU factorization with partial pivoting. [blocklupiv.m]

- Computes an LU factorization with partial pivoting. [lupiv.m]

These two routines are based on Dr. Gallivan's Mfile which you can download at nla1 website.

- Compute an immediate update version of Classic Gram-Schmidt orthogonalization of the columns of X. [cgrams.m]

- Compute an immediate update version of Classic Gram-Schmidt orthogonalization of the columns of X. [cgramsdv.m]

- Compute a delayed updated version of Modified Gram-Schmidt orthogonalization of the columns of X. [mgramsdv.m]

- Least Square Problem. [leastSquare.m]

- Compute all of nxn symmetric tridiagonal matrix eigenvalues via
the implicit QR algorithm using the Wilkinson shift. [isQRww.m]

- Compute all of nxn symmetric tridiagonal matrix eigenvalues via
the implicit QR algorithm using the Wilkinson shift. [isQRwwm.m]

- Compute cos(theta) and sin(theta). [givens.m]

- Compute eigenvalues of a symmetric matrix using Jacobi method. [cjacobi.m]

- Compute the tolerance of the Frobenius norm of a matrix. [tol.m]

- Compute the norm of the off-diagonal elements. [off.m]

- Compute a cos-sin pair. [symschur2.m]

- Compute y=Ax. [sparAx.m]

- Symbolic factorization of a symmetric positive definite matrix A. [symbolicD.m]

[**Sparse : CSC**]

- Cholesky factorization of a symmetric positive definite matrix A. [cholesky2.m]

- Symbolic factorization of a symmetric positive definite matrix A. [symbolic2.m]

- Cuthill-McKee algorithm : Queue Implementation. [CMK2.m]

- Reverse Cuthill-McKee algorithm : Queue Implementation. [RCM2.m]

[**Dense**]

- Cholesky factorization of a symmetric positive definite matrix A. [cholesky.m]

- Symbolic factorization of a symmetric positive definite matrix A. [symbolic.m]

- Cuthill-McKee algorithm : Queue Implementation. [CMK.m]

- Reverse Cuthill-McKee algorithm : Queue Implementation. [RCM.m]

[**Sparse : CSC**]

- Classical Iterative Methods. [cim2.m]

- Check the convergence. [check2.m]

- Compute norm. [norm2.m]

- Compute norm. [normi.m]

[**Dense**]

- Classical Iterative Methods. [cim.m]

- Check the convergence. [check.m]

- Jacobi Method. [jacobi.m]

- Gauss-Seidel Method. [gs.m]

- Successive Overrelaxation (SOR) Method. [sor.m]

- Successive Overrelaxation (SOR) Method. [sorb.m]

- Symmetric Successive Overrelaxation (SSOR) Method. [ssor.m]

[**Sparse : CSC**]

- Preconditioning Conjugate Gradient (PCG) Method. [cg2.m]

- Compute y=Ax. [cscAx.m]

- Solve Mz=r. [solveM2.m]

[**Dense**]

- Preconditioning Conjugate Gradient (PCG) Method. [cg.m]

- Generate sample matrix and vectors. (Ax=b) [generate.m]

- Convert CSC format to Dense format. [convertA.m]

- Convert Dense format to CSC format. [convertCSC.m]

- Convert Dense format to MCC format. [mcc.m]

I do NOT guarantee that above routines are
correct.

Yoshihito Yagi