laurpoly

(To be removed) Laurent polynomials constructor

collapse all in page

    laurpoly will be removed in a future release. Use laurentPolynomial instead. For more information, see Version History.

    Syntax

    P = laurpoly(C,d)
    P = laurpoly(C,"dmin",d)
    P = laurpoly(C,"dmax",d)

    Description

    P = laurpoly(C,d) returns a Laurent polynomial object whose coefficients are C and where d is the highest degree of the monomials of P.

    If m is the length of C, P represents the following Laurent polynomial:

    P(z) = C(1)*z^d + C(2)*z^(d-1) + ... + C(m)*z^(d-m+1)

    example

    P = laurpoly(C,"dmin",d) specifies the lowest degree of the monomials of P.

    If m is the length of C, P represents the following Laurent polynomial:

    P(z) = C(1)*z^(d+m-1) + ... + C(m-1)*z^(d+1) + C(m)*z^d

    P = laurpoly(C,"dmax",d) is equivalent to P = laurpoly(C,d).

    Examples

    collapse all

    Create a Laurent polynomial whose highest degree is 2.

    P = laurpoly(1:3,2)
     P(z) = + z^(+2) + 2*z^(+1) + 3

    Create a Laurent polynomial whose smallest degree is 2.

    P = laurpoly(1:3,"dmin",2)
    P(z) = + z^(+4) + 2*z^(+3) + 3*z^(+2)

    Multiply the polynomial with a monomial of degree 1.

    Z = laurpoly(1,1);
Q = Z*P
    Q(z) = + z^(+5) + 2*z^(+4) + 3*z^(+3)

    Input Arguments

    collapse all

    Polynomial coefficients, specified as a vector.

    Degree of monomial in P, specified as an integer.

    References

    [1] Strang, Gilbert, and Truong Nguyen. Wavelets and Filter Banks. Rev. ed. Wellesley, Mass: Wellesley-Cambridge Press, 1997.

    [2] Sweldens, Wim. “The Lifting Scheme: A Construction of Second Generation Wavelets.” SIAM Journal on Mathematical Analysis 29, no. 2 (March 1998): 511–46. https://doi.org/10.1137/S0036141095289051.

    Version History

    Introduced before R2006a

    expand all

    See Also