math - Find minimum of function on C# -


suppose have polynomial determined array of coefficients. coefficients integers -100 100. task find max point of function in range 0 1 programmatically.

how can this?

extrema occur @ roots of first derivative. compute latter , rewrite in bernstein basis (this takes resolution of triangular linear system). convex hull property tells roots possible/impossible looking changes of signs in coefficients.

using de casteljau algorithm of subdivision, can implement dichotomic process root refinement. then, computing sign of second derivative @ roots allow tell maxima minima.


Comments

Popular posts from this blog

sql - invalid in the select list because it is not contained in either an aggregate function -

Angularjs unit testing - ng-disabled not working when adding text to textarea -

How to start daemon on android by adb -