On Wednesday, 6 May 2015 07:27:36 UTC+1, Paul Royik wrote: > > How can this be applied to systems? >
nobody really knows how to solve systems of (non-polynomial) equations in general. There are heuristics implemented in various systems... > > On Wednesday, May 6, 2015 at 1:28:55 AM UTC+3, Dima Pasechnik wrote: >> >> >> >> On Tuesday, 5 May 2015 20:25:46 UTC+1, Paul Royik wrote: >>> >>> I meant without discontinuous functions. >>> What is the general approach even in numerical solving of "school" >>> functions on the interval? >>> >> >> on the interval it is the bisection method and its versions >> http://en.wikipedia.org/wiki/Root-finding_algorithm >> >> bisection is what Sage's find_root() does, as you can see by inspecting >> its code, by typing >> find_root?? >> >> >> >> >>> Can sage do that? >>> >>> On Tuesday, May 5, 2015 at 9:53:22 PM UTC+3, Dima Pasechnik wrote: >>>> >>>> This is an overtly optimistic point of view that find_root can solve >>>> any equation on an interval. You'll need your function to be continuous, >>>> at least. For systems of equations things are considerably more >>>> complicated. Look up "Newton method" for one particularly popular approach. >>>> >>>> >>>> >>>> -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
