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.
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.
Solves a system of linear equations using the Jacobi iterative method.
The given input matrix, representing the system of linear equations, must
be square.
Laguerre's method can be used to numerically solve polynomials in the form
P(x) = 0 where P(x) is a given polynomial. This method requires an initial
guess x0 to start finding the roots.
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.
Solves a system of linear equations using the SOR iterative method.
The given input matrix, representing the system of linear equations, must
be square.