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
Back to basics 25 - Valid variable names
Create a Multiplication table matrix...
07 - Common functions and indexing 3
Beginner's Problem - Squaring
Composite Trapezoidal Rule for Numeric Integration
Sequential Unconstrained Minimization (SUMT) using Interior Penalty
Partial pivoting for Gauss Elimination
Steepest Descent Method
Sequential Unconstrained Minimization (SUMT) using Exterior 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