Concepts inTemplate-driven interfaces for numerical subroutines
Root-finding algorithm
A root-finding algorithm is a numerical method, or algorithm, for finding a value x such that f(x) = 0, for a given function f. Such an x is called a root of the function f. This article is concerned with finding scalar, real or complex roots, approximated as floating point numbers. Finding integer roots or exact algebraic roots are separate problems, whose algorithms have little in common with those discussed here.
more from Wikipedia
Differential equation
A differential equation is a mathematical equation for an unknown function of one or several variables that relates the values of the function itself and its derivatives of various orders. Differential equations play a prominent role in engineering, physics, economics, and other disciplines.
more from Wikipedia
Curve fitting
Curve fitting is the process of constructing a curve, or mathematical function, that has the best fit to a series of data points, possibly subject to constraints. Curve fitting can involve either interpolation, where an exact fit to the data is required, or smoothing, in which a "smooth" function is constructed that approximately fits the data.
more from Wikipedia
Subroutine
In computer science, a subroutine, also termed procedure, function, routine, method, or subprogram, is a part of source code within a larger computer program that performs a specific task and is relatively independent of the remaining code. As the name subprogram suggests, a subroutine behaves in much the same way as a computer program that is used as one step in a larger program or another subprogram.
more from Wikipedia
Least squares
The method of least squares is a standard approach to the approximate solution of overdetermined systems, i.e. , sets of equations in which there are more equations than unknowns. "Least squares" means that the overall solution minimizes the sum of the squares of the errors made in the results of every single equation. The most important application is in data fitting.
more from Wikipedia
Complex number
A complex number is a number which can be put in the form a + bi, where a and b are real numbers and i is called the imaginary unit, where . In this expression, a is called the real part and b the imaginary part of the complex number. Complex numbers extend the idea of the one-dimensional number line to the two-dimensional complex plane by using the horizontal axis for the real part and the vertical axis for the imaginary part. The complex number can be identified with the point (a, b).
more from Wikipedia
Domain (mathematical analysis)
In mathematical analysis, a domain is any connected open subset of a finite-dimensional vector space. This is a different concept than the domain of a function, though it is often used for that purpose, for example in partial differential equations and Sobolev spaces.
more from Wikipedia
Computer program
A computer program (also software, or just a program) is a sequence of instructions written to perform a specified task with a computer. A computer requires programs to function, typically executing the program's instructions in a central processor. The program has an executable form that the computer can use directly to execute the instructions.
more from Wikipedia