https://dvillers.umons.ac.be/wiki/ 2026-04-05T19:18:49+00:00 https://dvillers.umons.ac.be/wiki/ https://dvillers.umons.ac.be/wiki/_media/favicon.ico text/html 2018-10-09T07:59:58+00:00 Anonymous (anonymous@undisclosed.example.com) https://dvillers.umons.ac.be/wiki/teaching:methcalchim:numerical_integration?rev=1539064798&do=diff Numerical integration Error estimation * Equally spaced methods : * Numerical_integration * Trapezoidal_rule * Newton–Cotes_formulas * Simpson's rule and composite Simpson's rule * If intervals between interpolation points vary : * Gaussian_quadrature * Chapter 4 in the book “Numerical Recipes” : Integration of Functions * 4.0 Introduction * 4.1 Classical Formulas for Equally Spaced Abscissas text/html 2018-10-19T09:58:36+00:00 Anonymous (anonymous@undisclosed.example.com) https://dvillers.umons.ac.be/wiki/teaching:methcalchim:root-finding_algorithm?rev=1539935916&do=diff Root findings : equations f(x) = 0 * Polynomial equations : Bairstow's method is an efficient algorithm for finding the roots of a real polynomial of arbitrary degree * Polynomials in NumPy * polynomial module, including polyroots(c) to compute the roots of a polynomial. * Bisection method (dichotomy) : very simple and robust method, but relatively slow. It assumes continuity of the function, and obtain one roots. The algorithm is based on a