Name | Description | Type | Package | Framework |
ChangeOfVariable | Change of variable can easy the computation of some integrals, such as improper integrals. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann | SuanShu |
|
ChebyshevRule | | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian.rule | SuanShu |
|
DoubleExponential | This transformation speeds up the convergence of the Trapezoidal Rule exponentially. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.substitution | SuanShu |
|
DoubleExponential4HalfRealLine | This transformation is good for the region ((0, +infty)). | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.substitution | SuanShu |
|
DoubleExponential4RealLine | This transformation is good for the region ((-infty, +infty)). | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.substitution | SuanShu |
|
Exponential | This transformation is good for when the lower limit is finite, the upper limit is infinite, and the integrand falls off exponentially. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.substitution | SuanShu |
|
GaussChebyshevQuadrature | Gauss-Chebyshev Quadrature uses the following weighting function: w(x) = frac{1}{sqrt{1 - x^2}} | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian | SuanShu |
|
GaussHermiteQuadrature | Gauss-Hermite quadrature exploits the fact that quadrature approximations are open integration formulas (that is, the values of the endpoints are not required) to evaluate of integrals in the | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian | SuanShu |
|
GaussianQuadrature | A quadrature rule is a method of numerical integration in which we approximate the integral of a function by a weighted sum of sample points. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian | SuanShu |
|
GaussianQuadratureRule | This interface defines a Gaussian quadrature rule used in Gaussian quadrature. | Interface | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian.rule | SuanShu |
|
GaussLaguerreQuadrature | Gauss-Laguerre quadrature exploits the fact that quadrature approximations are open integration formulas (i. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian | SuanShu |
|
GaussLegendreQuadrature | Gauss-Legendre quadrature considers the simplest case of uniform weighting: (w(x) = 1). | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian | SuanShu |
|
HermitePolynomials | A Hermite polynomial is defined by the recurrence relation below. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian.rule | SuanShu |
|
HermiteRule | | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian.rule | SuanShu |
|
Integrator | This defines the interface for the numerical integration of definite integrals of univariate functions. | Interface | com.numericalmethod.suanshu.analysis.integration.univariate.riemann | SuanShu |
|
InvertingVariable | This is the inverting-variable transformation. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.substitution | SuanShu |
|
IterativeIntegrator | An iterative integrator computes an integral by a series of sums, which approximates the value of the integral. | Interface | com.numericalmethod.suanshu.analysis.integration.univariate.riemann | SuanShu |
|
LaguerrePolynomials | Laguerre polynomials are defined by the recurrence relation below. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian.rule | SuanShu |
|
LaguerreRule | | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian.rule | SuanShu |
|
LegendrePolynomials | A Legendre polynomial is defined by the recurrence relation below. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian.rule | SuanShu |
|
LegendreRule | | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian.rule | SuanShu |
|
Midpoint | The midpoint rule computes an approximation to a definite integral, made by finding the area of a collection of rectangles whose heights are determined by the values of the function. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.newtoncotes | SuanShu |
|
MixedRule | The mixed rule is good for functions that fall off rapidly at infinity, e. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.substitution | SuanShu |
|
NewtonCotes | The Newton-Cotes formulae, also called the Newton-Cotes quadrature rules or simply Newton-Cotes rules, are a group of formulae for numerical integration (also called quadrature) based on evaluating the integrand at equally-spaced points. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.newtoncotes | SuanShu |
|
NewtonCotes .Type | There are two types of the Newton-Cotes method: OPEN and CLOSED. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.newtoncotes | SuanShu |
|
NoChangeOfVariable | This is a dummy substitution rule that does not change any variable. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.substitution | SuanShu |
|
OrthogonalPolynomialFamily | This factory class produces a family of orthogonal polynomials. | Interface | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.gaussian.rule | SuanShu |
|
PowerLawSingularity | This transformation is good for an integral which diverges at one of the end points. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.substitution | SuanShu |
|
PowerLawSingularity .PowerLawSingularityType | the type of end point divergenceReturns the enum constant of this type with the specified nam | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.substitution | SuanShu |
|
Riemann | This is a wrapper class that integrates a function by using an appropriate integrator together with Romberg's method. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann | SuanShu |
|
Romberg | Romberg's method computes an integral by generating a sequence of estimations of the integral value and then doing an extrapolation. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.newtoncotes | SuanShu |
|
Simpson | Simpson's rule can be thought of as a special case of Romberg's method. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.newtoncotes | SuanShu |
|
StandardInterval | This transformation is for mapping integral region from [a, b] to [-1, 1]. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.substitution | SuanShu |
|
SubstitutionRule | A substitution rule specifies (x(t)) and (frac{mathrm{d} x}{mathrm{d} t}). | Interface | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.substitution | SuanShu |
|
Trapezoidal | The Trapezoidal rule is a closed type Newton-Cotes formula, where the integral interval is evenly divided into N sub-intervals. | Class | com.numericalmethod.suanshu.analysis.integration.univariate.riemann.newtoncotes | SuanShu |