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.
Encode Roman Numerals
Back to basics 4 - Search Path
Sophie Germain prime
Divisors of an integer
Sum of odd numbers in a matrix
Bisection method of finding a root.
Quasi-Newton Method for Unconstrained Minimization using BFGS Update
Sequential Unconstrained Minimization (SUMT) using Exterior Penalty
Sequential Unconstrained Minimization (SUMT) using Interior Penalty
Steepest Descent 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