spire.math.poly

PolySparse

case class PolySparse[C] extends Polynomial[C] with Product with Serializable

Self Type
PolySparse[C]
Linear Supertypes
Serializable, Serializable, Product, Equals, Polynomial[C], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. PolySparse
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Polynomial
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. class TermIterator extends Iterator[Term[C]]

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def %(rhs: Polynomial[C])(implicit field: Field[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    Polynomial
  5. def *(rhs0: Polynomial[C])(implicit ring: Semiring[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    PolySparsePolynomial
  6. def **(k: Int)(implicit ring: Rig[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    Polynomial
  7. def *:(k: C)(implicit ring: Semiring[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    PolySparsePolynomial
  8. def +(rhs0: Polynomial[C])(implicit ring: Semiring[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    PolySparsePolynomial
  9. def -(rhs: Polynomial[C])(implicit ring: Rng[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    Polynomial
  10. def /%(rhs: Polynomial[C])(implicit field: Field[C], eq: Eq[C]): (Polynomial[C], Polynomial[C])

    Definition Classes
    PolySparsePolynomial
  11. def /~(rhs: Polynomial[C])(implicit field: Field[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    Polynomial
  12. def :*(k: C)(implicit ring: Semiring[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    Polynomial
  13. def :/(k: C)(implicit field: Field[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    Polynomial
  14. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  15. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  16. def apply(x: C)(implicit ring: Semiring[C]): C

    Evaluate the polynomial at x.

    Evaluate the polynomial at x.

    Definition Classes
    PolySparsePolynomial
  17. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  18. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. val coeff: Array[C]

  20. def coeffsArray(implicit ring: Semiring[C]): Array[C]

    Returns the coefficients in little-endian order.

    Returns the coefficients in little-endian order. So, the i-th element is coeffsArray(i) * (x ** i).

    Definition Classes
    PolySparsePolynomial
  21. def compose(y: Polynomial[C])(implicit ring: Rig[C], eq: Eq[C]): Polynomial[C]

    Compose this polynomial with another.

    Compose this polynomial with another.

    Definition Classes
    Polynomial
  22. implicit val ct: ClassTag[C]

    Definition Classes
    PolySparsePolynomial
  23. def data(implicit ring: Semiring[C], eq: Eq[C]): Map[Int, C]

    Returns a map from exponent to coefficient of this polynomial.

    Returns a map from exponent to coefficient of this polynomial.

    Definition Classes
    Polynomial
  24. def degree: Int

    Returns the degree of this polynomial.

    Returns the degree of this polynomial.

    Definition Classes
    PolySparsePolynomial
  25. def derivative(implicit ring: Ring[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    PolySparsePolynomial
  26. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  27. def equals(that: Any): Boolean

    Definition Classes
    Polynomial → AnyRef → Any
  28. def evalWith[A](x: A)(f: (C) ⇒ A)(implicit arg0: Semiring[A], arg1: Eq[A], arg2: ClassTag[A], ring: Semiring[C], eq: Eq[C]): A

    Definition Classes
    Polynomial
  29. val exp: Array[Int]

  30. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  31. def flip(implicit ring: Rng[C], eq: Eq[C]): Polynomial[C]

    Replace x, the variable, in this polynomial with -x.

    Replace x, the variable, in this polynomial with -x. This will flip/mirror the polynomial about the y-axis.

    Definition Classes
    Polynomial
  32. def foreach[U](f: (Int, C) ⇒ U): Unit

    Traverses each term in this polynomial, in order of degree, lowest to highest (eg.

    Traverses each term in this polynomial, in order of degree, lowest to highest (eg. constant term would be first) and calls f with the degree of term and its coefficient. This may skip zero terms, or it may not.

    Definition Classes
    PolySparsePolynomial
  33. def foreachNonZero[U](f: (Int, C) ⇒ U)(implicit ring: Semiring[C], eq: Eq[C]): Unit

    Traverses each non-zero term in this polynomial, in order of degree, lowest to highest (eg.

    Traverses each non-zero term in this polynomial, in order of degree, lowest to highest (eg. constant term would be first) and calls f with the degree of term and its coefficient.

    Definition Classes
    PolySparsePolynomial
  34. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  35. def hashCode(): Int

    Definition Classes
    Polynomial → AnyRef → Any
  36. def integral(implicit field: Field[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    PolySparsePolynomial
  37. def isConstant: Boolean

    Returns true iff this polynomial is constant.

    Returns true iff this polynomial is constant.

    Definition Classes
    Polynomial
  38. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  39. def isZero: Boolean

    Returns true if this polynomial is ring.zero.

    Returns true if this polynomial is ring.zero.

    Definition Classes
    PolySparsePolynomial
  40. def map[D](f: (C) ⇒ D)(implicit arg0: Semiring[D], arg1: Eq[D], arg2: ClassTag[D], ring: Semiring[C], eq: Eq[C]): Polynomial[D]

    Definition Classes
    Polynomial
  41. def mapTerms[D](f: (Term[C]) ⇒ Term[D])(implicit arg0: Semiring[D], arg1: Eq[D], arg2: ClassTag[D], ring: Semiring[C], eq: Eq[C]): Polynomial[D]

    Definition Classes
    Polynomial
  42. def maxOrderTermCoeff(implicit ring: Semiring[C]): C

    Returns the coefficient of max term of this polynomial.

    Returns the coefficient of max term of this polynomial.

    Definition Classes
    PolySparsePolynomial
  43. def maxTerm(implicit ring: Semiring[C]): Term[C]

    Returns the term of the highest degree in this polynomial.

    Returns the term of the highest degree in this polynomial.

    Definition Classes
    Polynomial
  44. def minTerm(implicit ring: Semiring[C], eq: Eq[C]): Term[C]

    Returns the non-zero term of the minimum degree in this polynomial, unless it is zero.

    Returns the non-zero term of the minimum degree in this polynomial, unless it is zero. If this polynomial is zero, then this returns a zero term.

    Definition Classes
    Polynomial
  45. def monic(implicit f: Field[C], eq: Eq[C]): Polynomial[C]

    Returns this polynomial as a monic polynomial, where the leading coefficient (ie.

    Returns this polynomial as a monic polynomial, where the leading coefficient (ie. maxOrderTermCoeff) is 1.

    Definition Classes
    Polynomial
  46. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  47. final def notify(): Unit

    Definition Classes
    AnyRef
  48. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  49. def nth(n: Int)(implicit ring: Semiring[C]): C

    Returns the coefficient of the n-th degree term.

    Returns the coefficient of the n-th degree term.

    Definition Classes
    PolySparsePolynomial
  50. def pow(k: Int)(implicit ring: Rig[C], eq: Eq[C]): Polynomial[C]

    Definition Classes
    Polynomial
  51. def reciprocal(implicit ring: Semiring[C], eq: Eq[C]): Polynomial[C]

    Returns the reciprocal of this polynomial.

    Returns the reciprocal of this polynomial. Essentially, if this polynomial is p with degree n, then returns a polynomial q(x) = x^n*p(1/x).

    Definition Classes
    Polynomial
    See also

    http://en.wikipedia.org/wiki/Reciprocal_polynomial

  52. def reductum(implicit e: Eq[C], ring: Semiring[C], ct: ClassTag[C]): Polynomial[C]

    Returns a polynomial with the max term removed.

    Returns a polynomial with the max term removed.

    Definition Classes
    PolySparsePolynomial
  53. def removeZeroRoots(implicit ring: Semiring[C], eq: Eq[C]): Polynomial[C]

    Removes all zero roots from this polynomial.

    Removes all zero roots from this polynomial.

    Definition Classes
    Polynomial
  54. def roots(implicit finder: RootFinder[C]): Roots[C]

    Returns the real roots of this polynomial.

    Returns the real roots of this polynomial.

    Depending on C, the finder argument may need to be passed "explicitly" via an implicit conversion. This is because some types (eg BigDecimal, Rational, etc) require an error bound, and so provide implicit conversions to RootFinders from the error type. For instance, BigDecimal requires either a scale or MathContext. So, we'd call this method with poly.roots(MathContext.DECIMAL128), which would return a Roots[BigDecimal whose roots are approximated to the precision specified in DECIMAL128 and rounded appropriately.

    On the other hand, a type like Double doesn't require an error bound and so can be called without specifying the RootFinder.

    finder

    a root finder to extract roots with

    returns

    the real roots of this polynomial

    Definition Classes
    Polynomial
  55. def shift(h: C)(implicit ring: Rig[C], eq: Eq[C]): Polynomial[C]

    Returns this polynomial shifted by h.

    Returns this polynomial shifted by h. Equivalent to calling poly.compose(x + h).

    Definition Classes
    Polynomial
  56. def signVariations(implicit ring: Semiring[C], eq: Eq[C], signed: Signed[C]): Int

    Returns the number of sign variations in the coefficients of this polynomial.

    Returns the number of sign variations in the coefficients of this polynomial. Given 2 consecutive terms (ignoring 0 terms), a sign variation is indicated when the terms have differing signs.

    Definition Classes
    Polynomial
  57. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  58. def terms(implicit ring: Semiring[C], eq: Eq[C]): List[Term[C]]

    Returns a list of non-zero terms.

    Returns a list of non-zero terms.

    Definition Classes
    Polynomial
  59. def termsIterator: Iterator[Term[C]]

    Return an iterator of non-zero terms.

    Return an iterator of non-zero terms.

    This method is used to implement equals and hashCode.

    NOTE: This method uses a (_ == 0) test to prune zero values. This makes sense in a context where Semiring[C] and Eq[C] are unavailable, but not other places.

    Definition Classes
    PolySparsePolynomial
  60. def toDense(implicit ring: Semiring[C], eq: Eq[C]): PolyDense[C]

    Returns a polynmial that has a dense representation.

    Returns a polynmial that has a dense representation.

    Definition Classes
    PolySparsePolynomial
  61. def toSparse(implicit ring: Semiring[C], eq: Eq[C]): PolySparse[C]

    Returns a polynomial that has a sparse representation.

    Returns a polynomial that has a sparse representation.

    Definition Classes
    PolySparsePolynomial
  62. def toString(): String

    Definition Classes
    Polynomial → AnyRef → Any
  63. def translate(h: C)(implicit ring: Ring[C], eq: Eq[C]): Polynomial[C]

    Translates this polynomial by h.

    Translates this polynomial by h. Equivalent to calling poly.compose(x - h).

    Definition Classes
    Polynomial
  64. def unary_-()(implicit ring: Rng[C]): Polynomial[C]

    Definition Classes
    PolySparsePolynomial
  65. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  66. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  67. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Polynomial[C]

Inherited from AnyRef

Inherited from Any

Ungrouped