I've implemented the Welzl's algorithm, but, please, be warned as I've learned later that sometimes the algorithm fails. Years later, Matoušek, Sharir, and Welzl seems to have fixed the problem, creating a new version of the algorithm (adding one additional test).
I think the tolerance in Test 3 is a bit too tight. My solution fails in about 28% of the cases because the numerical error max(D)-r is up to 8*eps.
Return the 3n+1 sequence for n
Remove any row in which a NaN appears
What is the next step in Conway's Life?
Is X a Fibonacci Matrix?
Pandigital Multiples of 11 (based on Project Euler 491)
Function minimization - beat fminbnd!
Algorithmic Trading - 3 (short selling and leverage)
What is the current time in Darwin, Australia?
Algorithmic Trading - 4 (two thresholds)
Function minimization - beat fminsearch!
Find the treasures in MATLAB Central and discover how the community can help you!
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