This utility class holds the quotient and the remainder of a division
between two polynomials. When you use operator/ on two Algebraic
objects, this class is returned. For example:
Implementation of the "Cholesky decomposition" algorithm for solving a
system of linear equations. It only works with Hermitian, positive-definite
matrices.
The Durandâ€“Kerner method, also known as Weierstrass method, is a root
finding algorithm for solving polynomial equations. With this class, you
can find all the roots of a polynomial of any degree.
Parses mathematical expressions with real numbers and the x variable (if
any). The only allowed variable name is x: any other type of value isn't
recognized. Some expressions examples are:
Solves a system of linear equations using the Gauss-Seidel iterative method.
The given input matrix, representing the system of linear equations, must
be square.
Abstract class representing an interpolation strategy that finds new
data points based on a given discrete set of data points, called nodes.
The algorithms implemented by this package are:
A point in the cartesian coordinate system used by Interpolation types to
represent interpolation nodes. This class simply represents the x and y
coordinates of a point on a cartesian plane.
Solves a system of linear equations using the Jacobi iterative method.
The given input matrix, representing the system of linear equations, must
be square.
Linear interpolation is a curve fitting method that uses linear polynomials
to construct new data points within the range of a discrete set of known
data points.
Solves a system of linear equations using the 'LU decomposition' method.
The given input matrix, representing the system of linear equations, must
be square.
A simple Dart implementation of a matrix whose size is m x n. Thanks to
its generic nature, you can decide to work with int, double, Complex
or any other kind of numerical type.
Dart representation of a 'mixed fraction', which is made up by the whole
part and a proper fraction. A proper fraction is a fraction in which the
relation numerator <= denominator is true.
When it comes to analysis, the term numerical integration indicates a
group of algorithms for calculating the numerical value of a definite
integral on an interval.
Polynomial interpolation is the interpolation of a given data set by the
polynomial of lowest possible degree that passes through the points of the
dataset.
Solves a system of linear equations using the SOR iterative method.
The given input matrix, representing the system of linear equations, must
be square.
Performs spline interpolation given a set of control points. The algorithm
can compute a "monotone cubic spline" or a "linear spline" based on the
properties of the control points.