Bisection method: Root-finding algorithm, Interval (mathematics), Intermediate value theorem, Binary search algorithm, Continuous function - Brossura

 
9786134100663: Bisection method: Root-finding algorithm, Interval (mathematics), Intermediate value theorem, Binary search algorithm, Continuous function

Sinossi

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The bisection method in mathematics, is a root- finding algorithm which repeatedly bisects an interval then selects a subinterval in which a root must lie for further processing. It is a very simple and robust method, but it is also relatively slow.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.