Perform forward elimination for a given pivot column in the augmented matrix, Ab=[A,b]
Find the peak 3n+1 sequence value
Back to basics 2 - Function Path
Number of bytes required to store a sparse matrix
Gauss Eliminate 2-by-2 example
Bisection method of finding a root.
Composite Trapezoidal Rule for Numeric Integration
Sequential Unconstrained Minimization (SUMT) using Interior Penalty
False position (linear interpolation) method of finding a root.
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