Modifier and Type | Method and Description |
---|---|
Polynomial |
CharacteristicPolynomial.getCharacteristicPolynomial()
Get the characteristic polynomial.
|
Modifier and Type | Class and Description |
---|---|
class |
DPolynomial
This is the first order derivative function of a
Polynomial , which, again, is a polynomial. |
Constructor and Description |
---|
DPolynomial(Polynomial polynomial)
Construct the derivative function of a
Polynomial , which, again, is a polynomial. |
Modifier and Type | Class and Description |
---|---|
class |
CauchyPolynomial
The Cauchy's polynomial of a polynomial takes this form:
|
class |
QuadraticMonomial
A quadratic monomial has this form: x2 + ux + v.
|
class |
ScaledPolynomial
This constructs a scaled polynomial that has neither too big or too small coefficients,
hence avoiding overflow or underflow.
|
Modifier and Type | Field and Description |
---|---|
static Polynomial |
Polynomial.ONE
a polynomial representing 1
|
static Polynomial |
Polynomial.ZERO
a polynomial representing 0
|
Modifier and Type | Method and Description |
---|---|
Polynomial |
Polynomial.add(Polynomial that) |
Polynomial |
Polynomial.getNormalization()
Get the normalized version of this polynomial so the leading coefficient is 1.
|
Polynomial |
Polynomial.minus(Polynomial that) |
Polynomial |
Polynomial.multiply(Polynomial that) |
Polynomial |
Polynomial.ONE() |
Polynomial |
Polynomial.opposite() |
Polynomial |
Polynomial.pow(int n) |
Polynomial |
QuadraticSyntheticDivision.quotient()
Get the quotient Q(x).
|
Polynomial |
HornerScheme.quotient()
Get the quotient, Q(x).
|
Polynomial |
Polynomial.scaled(double c) |
Polynomial |
Polynomial.scaled(Real c) |
Polynomial |
Polynomial.ZERO() |
Modifier and Type | Method and Description |
---|---|
Polynomial |
Polynomial.add(Polynomial that) |
Polynomial |
Polynomial.minus(Polynomial that) |
Polynomial |
Polynomial.multiply(Polynomial that) |
Constructor and Description |
---|
CauchyPolynomial(Polynomial p) |
HornerScheme(Polynomial polynomial,
double x)
Evaluate a polynomial at x.
|
Polynomial(Polynomial that)
Copy constructor.
|
QuadraticSyntheticDivision(Polynomial polynomial,
QuadraticMonomial quadratic)
Divide a polynomial by a quadratic monomial.
|
ScaledPolynomial(Polynomial p)
Construct a scaled polynomial, with 2 as the base of the scaling factor.
|
ScaledPolynomial(Polynomial p,
double base)
Construct a scaled polynomial, with a base of the scaling factor.
|
Modifier and Type | Method and Description |
---|---|
List<Number> |
CubicRoot.solve(Polynomial polynomial)
Solve \(ax^3 + bx^2 + cx + d = 0\).
|
List<? extends Number> |
PolyRoot.solve(Polynomial polynomial)
Get the roots/zeros of a polynomial.
|
List<Double> |
LinearRoot.solve(Polynomial polynomial)
Solve ax + b = 0.
|
List<Number> |
QuarticRootFerrari.solve(Polynomial polynomial)
Solve \(ax^4 + bx^3 + cx^2 + dx + e = 0\).
|
List<Number> |
QuadraticRoot.solve(Polynomial polynomial) |
List<Number> |
QuarticRootFormula.solve(Polynomial polynomial)
Solve \(ax^4 + bx^3 + cx^2 + dx + e = 0\).
|
List<Number> |
QuarticRoot.solve(Polynomial polynomial)
Solve \(ax^4 + bx^3 + cx^2 + dx + e = 0\).
|
List<? extends Number> |
PolyRootSolver.solve(Polynomial polynomial) |
List<Number> |
QuadraticRoot.solve(Polynomial polynomial,
double epsilon)
Solve \(ax^2 + bx + c = 0\).
|
Modifier and Type | Method and Description |
---|---|
List<Number> |
JenkinsTraubReal.solve(Polynomial polynomial)
Solve a polynomial equation.
|
Modifier and Type | Method and Description |
---|---|
Polynomial |
LegendrePolynomials.getPolynomial(int order) |
Polynomial |
OrthogonalPolynomialFamily.getPolynomial(int order)
Return an instance of the polynomial class of a given order.
|
Polynomial |
HermitePolynomials.getPolynomial(int order) |
Polynomial |
LaguerrePolynomials.getPolynomial(int order) |
Modifier and Type | Method and Description |
---|---|
Polynomial |
ARIMAXModel.phiPolynomial()
Get the polynomial (1 - φ).
|
Polynomial |
ARIMAXModel.thetaPolynomial()
Get the polynomial (1 + θ).
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.