This documentation is compiled for the latest release of Mathos Core Library
SystemObject
Mathos.CalculusFiniteCalculus
Assembly: Mathos (in Mathos.dll) Version: 1.0.5.1 (1.0.5.1)
Top
This class contains methods for calculus with finite differences. Most of the methods assume that the sequence of numbers is some sort of polynomial.
Inheritance Hierarchy
Mathos.CalculusFiniteCalculus
Namespace: Mathos.Calculus
Assembly: Mathos (in Mathos.dll) Version: 1.0.5.1 (1.0.5.1)
Syntax
The FiniteCalculus type exposes the following members.
Methods
Name | Description | |
---|---|---|
![]() ![]() | GetCoefficientsForNthSum |
Finds the coefficients of the closed form of the sum and returns them in a double array. The first item in the array is of the highest power. The last term in the array is the constant term.
|
![]() ![]() | GetCoefficientsForNthTerm |
Finds the coefficients of the nth term and returns them in a double array. The first item in the array is of the highest power. The last term in the array is the constant term.
|
![]() ![]() ![]() | GetDifference |
Finds the difference between terms in a sequence. By chaging the degree, we can take difference of the differences.
|
![]() ![]() | GetExpressionForNthSum |
Finds an expression, given coefficients of the nth sum, in terms of any variable.
|
![]() ![]() | GetExpressionForNthTerm |
Finds an expression, given coefficients of the nth term, in terms of any variable.
|
![]() ![]() | GetNextTerm |
Finds the next term in the sequence, given that a pattern exist.
|
![]() ![]() | HasPattern |
Checks whether the given sequence contains a pattern. For a pattern to exist, given the terms in the sequence, we should be able to reach a difference of zero for all possible values of degree. Degree is dependent on the number of terms we have.
|
![]() ![]() | SumWithRule |
This method will evaluate a sum that contains a true-false statement - the Iverson notation.
|
See Also