This is a list of mathematics-based methods. * Adams' method (

differential equations In mathematics, a differential equation is an equation that relates one or more unknown functions and their derivatives. In applications, the functions generally represent physical quantities, the derivatives represent their rates of change, an ...

) * Akra–Bazzi method (

asymptotic analysis In mathematical analysis, asymptotic analysis, also known as asymptotics, is a method of describing limiting behavior. As an illustration, suppose that we are interested in the properties of a function as becomes very large. If , then as beco ...

) * Bisection method ( root finding) *

Brent's method In numerical analysis, Brent's method is a hybrid root-finding algorithm combining the bisection method, the secant method and inverse quadratic interpolation. It has the reliability of bisection but it can be as quick as some of the less-reliable ...

( root finding) * Condorcet method ( voting systems) * Coombs' method ( voting systems) * Copeland's method ( voting systems) *

Crank–Nicolson method In numerical analysis, the Crank–Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations. It is a second-order method in time. It is implicit in time, can be wri ...

( numerical analysis) * D'Hondt method ( voting systems) *

D21 – Janeček method D21 – Janeček method, also known as Democracy 2.1, is an approval voting electoral system for single-member district, single-winner voting, which giving each voter multiple 'positive' and 'negative' votes. It is similar to cumulative voting and c ...

( voting system) * Discrete element method ( numerical analysis) * Domain decomposition method ( numerical analysis) *

Epidemiological methods The science of epidemiology has matured significantly from the times of Hippocrates, Semmelweis and John Snow. The techniques for gathering and analyzing epidemiological data vary depending on the type of disease being monitored but each study wi ...

* Euler's forward method * Explicit and implicit methods ( numerical analysis) * Finite difference method ( numerical analysis) * Finite element method ( numerical analysis) * Finite volume method ( numerical analysis) * Highest averages method ( voting systems) * Method of exhaustion * Method of infinite descent ( number theory) *

Information bottleneck method The information bottleneck method is a technique in information theory introduced by Naftali Tishby, Fernando C. Pereira, and William Bialek. It is designed for finding the best tradeoff between accuracy and complexity (compression) when summarizin ...

* Inverse chain rule method ( calculus) *

Inverse transform sampling method Inverse transform sampling (also known as inversion sampling, the inverse probability integral transform, the inverse transformation method, Smirnov transform, or the golden ruleAalto University, N. Hyvönen, Computational methods in inverse probl ...

( probability) * Iterative method ( numerical analysis) * Jacobi method ( linear algebra) * Largest remainder method ( voting systems) * Level-set method *

Linear combination of atomic orbitals molecular orbital method A linear combination of atomic orbitals or LCAO is a quantum superposition of atomic orbitals and a technique for calculating molecular orbitals in quantum chemistry. In quantum mechanics, electron configurations of atoms are described as wavefu ...

( molecular orbitals) * Method of characteristics *

Least squares method The method of least squares is a standard approach in regression analysis to approximate the solution of overdetermined systems (sets of equations in which there are more equations than unknowns) by minimizing the sum of the squares of the res ...

( optimization,

statistics Statistics (from German language, German: ''wikt:Statistik#German, Statistik'', "description of a State (polity), state, a country") is the discipline that concerns the collection, organization, analysis, interpretation, and presentation of ...

) * Maximum likelihood method (

) * Method of complements (

arithmetic Arithmetic () is an elementary part of mathematics that consists of the study of the properties of the traditional operations on numbers— addition, subtraction, multiplication, division, exponentiation, and extraction of roots. In the 19th ...

) * Method of moving frames (

differential geometry Differential geometry is a mathematical discipline that studies the geometry of smooth shapes and smooth spaces, otherwise known as smooth manifolds. It uses the techniques of differential calculus, integral calculus, linear algebra and multili ...

) * Method of successive substitution ( number theory) * Monte Carlo method ( computational physics, simulation) *

Newton's method In numerical analysis, Newton's method, also known as the Newton–Raphson method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or zeroes) of a real-valu ...

( numerical analysis) * Pemdas method (

order of operation In mathematics and computer programming, the order of operations (or operator precedence) is a collection of rules that reflect conventions about which procedures to perform first in order to evaluate a given mathematical expression. For exampl ...

) * Perturbation methods ( functional analysis, quantum theory) * Probabilistic method (

combinatorics Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many appl ...

) * Romberg's method ( numerical analysis) * Runge–Kutta method ( numerical analysis) * Sainte-Laguë method ( voting systems) * Schulze method ( voting systems) * Sequential Monte Carlo method * Simplex method * Spectral method ( numerical analysis) * Variational methods ( mathematical analysis, differential equations) * Welch's method

See also