Matrix interpretation of formal orthogonal polynomials for non-definite functionals
نویسندگان
چکیده
منابع مشابه
On orthogonal polynomials for certain non-definite linear functionals
We consider the non-definite linear functionals Ln[f ] = ∫ IR w(x)f (n)(x) dx and prove the nonexistence of orthogonal polynomials, with all zeros real, in several cases. The proofs are based on the connection with moment preserving spline approximation.
متن کاملOrthogonal polynomials for refinable linear functionals
A refinable linear functional is one that can be expressed as a convex combination and defined by a finite number of mask coefficients of certain stretched and shifted replicas of itself. The notion generalizes an integral weighted by a refinable function. The key to calculating a Gaussian quadrature formula for such a functional is to find the three-term recursion coefficients for the polynomi...
متن کاملMultivariate Orthogonal Polynomials and Modified Moment Functionals
Multivariate orthogonal polynomials can be introduced by using a moment functional defined on the linear space of polynomials in several variables with real coefficients. We study the so-called Uvarov and Christoffel modifications obtained by adding to the moment functional a finite set of mass points, or by multiplying it times a polynomial of total degree 2, respectively. Orthogonal polynomia...
متن کاملOn Orthogonal Matrix Polynomials
In this paper we deal with orthogonal matrix polynomials. First of all, we establish some basic notations and results we need later. A matrix polynomial P is a matrix whose entries are polynomials, or, equivalently, a combination P(t) = A 0 +A 1 t+ +A n t n , where A 0 ; ; A n are numerical matrices (the size of all the matrices which appear in this paper is N N). A positive deenite matrix of m...
متن کاملFast algorithms for positive definite matrices structured by orthogonal polynomials
Positive definite matrices structured by orthogonal polynomial systems allow a Cholesky type decomposition of their inverse matrices in O(n2) steps. The algorithm presented in this paper uses the three-term recursion coefficients and the mixed moments of the involved polynomials.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1987
ISSN: 0377-0427
DOI: 10.1016/0377-0427(87)90001-x