The Bisection method is a root-finding method that applies to any continuous functions for which one knows two values with opposite signs.
-
Updated
Dec 12, 2020 - C++
The Bisection method is a root-finding method that applies to any continuous functions for which one knows two values with opposite signs.
The Regula–Falsi Method is a numerical method for estimating the roots of a polynomial f(x).
Fixed-point iteration is a method of computing fixed points of a function, which is used with Newton's method to find roots of a differentiable function.
Stirling's Central Difference interpolation gives the average of the values obtained by Gauss forward and backward interpolation formulae.
Newton’s divided difference interpolation formula is a interpolation technique used when the interval difference is not same for all sequence of values.
Newton's (Newton-Gregory) Forward Difference formula is a way of approximating a function with an nth degree polynomial passing through (n+1) equally spaced points.
Newton's (Newton-Gregory) Backward Difference formula is a way of approximating a function with an nth degree polynomial passing through (n+1) equally spaced points.
The Lagrange interpolation formula is a way to find a polynomial which takes on certain values at arbitrary points.
Rectangular integration is a numerical integration technique that approximates the integral of a function with a rectangle.
Trapezoidal Rule is an integration rule that evaluates the area under the curves by dividing the total area into smaller trapezoids.
Add a description, image, and links to the rule topic page so that developers can more easily learn about it.
To associate your repository with the rule topic, visit your repo's landing page and select "manage topics."