Sorry but I don't understand the test suite.
Calculate the Levenshtein distance between two strings
How to find the position of an element in a vector without using the find function
Sequential Unconstrained Minimization (SUMT) using Interior Penalty
Sequential Unconstrained Minimization (SUMT) using Exterior Penalty
Forward Elimination for Gauss Elimination
Free Fall analytical solution (Chapra 2012 textbook Example 1.1)
Bisection 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