Overview
Numeric algorithms are algorithms that are implemented to implement some mathematical procedure or calculation. Due to machine precision issues, most numeric algorithms can only give an approximation to the true mathematical value.
Listing
- Number Theory
- Combinatorics : is the branch of discrete mathematics which considers ways of counting the number of permutations (and combinations) of a set of objects. Is used extensively in probability and statistics in order to determine the size of a sample space.
- Algebraic
- Root Finding : Root finding is the process of finding the inputs at which an algebraic function is zero.
- Attribution
- Attribution : Attributes the change in a function to its underlying parameters
-
Calculus
- Differentiation : Differentiation is a process developed in calculus for calculating the instantaneous slope of a function at a point on a function.
- Integration : Measure theory is an abstract mathematical theory concerned with measuring the "size" of sets, typically thought of as areas or volumes. Its most basic form is the traditional integration analysis that is taught in standard calculus classes.
- Optimization : Optimization is the process of finding the inputs at which a function hits its maximum or minimum values.
- Differential Equations
- Functional Analysis
- Function Approximation : is the process of creating a computable approximation to some function, typically not fully known or not computable.
- Fourier Analysis : the process of decomposing a signal into sinusoids (waves)
- Transforms :