Hello all,
Would anyone take a stab at breaking this algebraic approach to finding max/min down for me? I’m wondering if it is for global max/min or only relative max/min. If it’s for relative max/min, could there even be one that exists for global max/min? Thanks so much!
https://www.quora.com/How-can-I-find-the-maximum-and-minimum-Turing-points-of-cubic-polynomials-without-using-derivatives/answer/Mike-Hirschhorn?ch=17&oid=335856561&share=f6f9dc41&srid=ucRhy&target_type=answer
In: 0
Cubic polynomials head off to positive and negative infinity as x goes to positive and negative infinity. So this algorithm can’t be finding the global min and max, and must instead be finding the local min and max points.
If what you wanted was the biggest or smallest of the turning points, you could use the algorithm to find all the turning points, then order the results by size and take the one you wanted.
Latest Answers