Search Java Classes and Packages
#Com.numericalmethod.suanshu.analysis.function.polynomial Classes and Interfaces - 16 results found.
| Name | Description | Type | Package | Framework |
| CauchyPolynomial | The Cauchy's polynomial of a polynomial takes this form: C(x) = | Class | com.numericalmethod.suanshu.analysis.function.polynomial | SuanShu |
| CubicRoot | This is a cubic equation solver. | Class | com.numericalmethod.suanshu.analysis.function.polynomial.root | SuanShu |
| HornerScheme | Horner scheme is an algorithm for the efficient evaluation of polynomials in monomial form. | Class | com.numericalmethod.suanshu.analysis.function.polynomial | SuanShu |
| JenkinsTraubReal | The Jenkins-Traub algorithm is a fast globally convergent iterative method for solving for polynomial roots. | Class | com.numericalmethod.suanshu.analysis.function.polynomial.root.jenkinstraub | SuanShu |
| LinearRoot | This is a solver for finding the roots of a linear equation. | Class | com.numericalmethod.suanshu.analysis.function.polynomial.root | SuanShu |
| Polynomial | A polynomial is a UnivariateRealFunction that represents a finite length expression constructed from variables and constants, using the operations of addition, subtraction, multiplication, and constant non-negative whole number exponents. | Class | com.numericalmethod.suanshu.analysis.function.polynomial | SuanShu |
| PolyRoot | This is a solver for finding the roots of a polynomial equation. | Class | com.numericalmethod.suanshu.analysis.function.polynomial.root | SuanShu |
| PolyRootSolver | A root (or a zero) of a polynomial p is a member x in the domain of p such that p(x) vanishes. | Interface | com.numericalmethod.suanshu.analysis.function.polynomial.root | SuanShu |
| QuadraticMonomial | A quadratic monomial has this form: x2 + ux + v. | Class | com.numericalmethod.suanshu.analysis.function.polynomial | SuanShu |
| QuadraticRoot | This is a solver for finding the roots of a quadratic equation, (ax^2 + bx + c = 0). | Class | com.numericalmethod.suanshu.analysis.function.polynomial.root | SuanShu |
| QuadraticSyntheticDivision | Divide a polynomial P(x) by a quadratic monomial (x2 + ux + v) to give the quotient Q(x) and the remainder (b * (x + u) + a). | Class | com.numericalmethod.suanshu.analysis.function.polynomial | SuanShu |
| QuarticRoot | This is a quartic equation solver that solves (ax^4 + bx^3 + cx^2 + dx + e = 0). | Class | com.numericalmethod.suanshu.analysis.function.polynomial.root | SuanShu |
| QuarticRoot .QuarticSolver | This defines a quartic equation solver. | Interface | com.numericalmethod.suanshu.analysis.function.polynomial.root | SuanShu |
| QuarticRootFerrari | This is a quartic equation solver that solves (ax^4 + bx^3 + cx^2 + dx + e = 0) using the Ferrari method. | Class | com.numericalmethod.suanshu.analysis.function.polynomial.root | SuanShu |
| QuarticRootFormula | This is a quartic equation solver that solves (ax^4 + bx^3 + cx^2 + dx + e = 0) using a root-finding formula. | Class | com.numericalmethod.suanshu.analysis.function.polynomial.root | SuanShu |
| ScaledPolynomial | This constructs a scaled polynomial that has neither too big or too small coefficients, hence avoiding overflow or underflow. | Class | com.numericalmethod.suanshu.analysis.function.polynomial | SuanShu |