Use forward elimination to make the coefficient matrix, A, an upper triangular matrix, and then solve using back substitution, for a sample 2-by-2 system.
Back and Forth Rows
Swap the first and last columns
Rotate a Matrix
Rotate input square matrix 90 degrees CCW without rot90
Returning a "greater than" vector
Bisection method of finding a root.
Steepest Descent Method
Fletcher-Reeves Conjugate Gradient Method
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office