Search Results for ""

The Woodbury formula (A+UV^(T))^(-1)=A^(-1)-[A^(-1)U(I+V^(T)A^(-1)U)^(-1)V^(T)A^(-1)] is a formula that allows a perturbed matrix to be computed for a change to a given ...

Let n be an integer such that n>=lambda_1, where lambda=(lambda_1,lambda_2,...) is a partition of n=|lambda| if lambda_1>=lambda_2>=...>=0, where lambda_i are a sequence of ...

The Hermite polynomials H_n(x) are set of orthogonal polynomials over the domain (-infty,infty) with weighting function e^(-x^2), illustrated above for n=1, 2, 3, and 4. ...

Let l(x) be an nth degree polynomial with zeros at x_1, ..., x_n. Then the fundamental Hermite interpolating polynomials of the first and second kinds are defined by ...

A Lucas polynomial sequence is a pair of generalized polynomials which generalize the Lucas sequence to polynomials is given by W_n^k(x) = ...

The Pell polynomials P(x) are the W-polynomials generated by the Lucas polynomial sequence using the generator p(x)=2x, q(x)=1. This gives recursive equations for P(x) from ...

Polynomials S_k(x) which form the Sheffer sequence for g(t) = e^(-t) (1) f^(-1)(t) = ln(1/(1-e^(-t))), (2) where f^(-1)(t) is the inverse function of f(t), and have ...

Subresultants can be viewed as a generalization of resultants, which are the product of the pairwise differences of the roots of polynomials. Subresultants are the most ...

The orthogonal polynomials defined variously by (1) (Koekoek and Swarttouw 1998, p. 24) or p_n(x;a,b,c,d) = W_n(-x^2;a,b,c,d) (2) = (3) (Koepf, p. 116, 1998). The first few ...

The process of taking the complement of a set or truth function. In the latter case, complementation is equivalent to the NOT operation.