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 to basics 26 - Keywords
Find nearest prime number less than input number
sum of first 'n' terms
02 - Vector Variables 1
Sequential Unconstrained Minimization (SUMT) using Exterior Penalty
Bisection method of finding a root.
Partial pivoting for Gauss Elimination
Sequential Unconstrained Minimization (SUMT) using Interior Penalty
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