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.
Return the 3n+1 sequence for n
Project Euler: Problem 6, Natural numbers, squares and sums.
Stuff the Board
Find the biggest empty box
Matrix to column conversion
Composite Trapezoidal Rule for Numeric Integration
Sequential Unconstrained Minimization (SUMT) using Interior Penalty
Rosenbrock's Banana Function and its derivatives
Forward Elimination for Gauss Elimination
Partial pivoting for Gauss Elimination
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