Javascript must be enabled to continue!
Orthogonality of quasi-orthogonal polynomials
View through CrossRef
A result of P?lya states that every sequence of quadrature formulas Qn(f)
with n nodes and positive Cotes numbers converges to the integral I(f) of
a continuous function f provided Qn(f) = I(f) for a space of algebraic
polynomials of certain degree that depends on n. The classical case when the
algebraic degree of precision is the highest possible is well-known and the
quadrature formulas are the Gaussian ones whose nodes coincide with the
zeros of the corresponding orthogonal polynomials and the Cotes (Christoffel)
numbers are expressed in terms of the so-called kernel polynomials. In many
cases it is reasonable to relax the requirement for the highest possible
degree of precision in order to gain the possibility to either approximate
integrals of more specific continuous functions that contain a polynomial
factor or to include additional fixed nodes. The construction of such
quadrature processes is related to quasi-orthogonal polynomials. Given a
sequence {Pn}n?0 of monic orthogonal polynomials and a fixed integer k, we
establish necessary and sufficient conditions so that the quasi-orthogonal
polynomials {Qn}n?0 defined by Qn(x) = Pn(x) + ?k-1,i=1 bi,nPn-i(x), n ?
0, with bi,n ? R, and bk-1,n ? 0 for n ? k-1, also constitute a sequence
of orthogonal polynomials. Therefore we solve the inverse problem for
linearly related orthogonal polynomials. The characterization turns out to
be equivalent to some nice recurrence formulas for the coefficients bi,n. We
employ these results to establish explicit relations between various types
of quadrature rules from the above relations. A number of illustrative
examples are provided.
Title: Orthogonality of quasi-orthogonal polynomials
Description:
A result of P?lya states that every sequence of quadrature formulas Qn(f)
with n nodes and positive Cotes numbers converges to the integral I(f) of
a continuous function f provided Qn(f) = I(f) for a space of algebraic
polynomials of certain degree that depends on n.
The classical case when the
algebraic degree of precision is the highest possible is well-known and the
quadrature formulas are the Gaussian ones whose nodes coincide with the
zeros of the corresponding orthogonal polynomials and the Cotes (Christoffel)
numbers are expressed in terms of the so-called kernel polynomials.
In many
cases it is reasonable to relax the requirement for the highest possible
degree of precision in order to gain the possibility to either approximate
integrals of more specific continuous functions that contain a polynomial
factor or to include additional fixed nodes.
The construction of such
quadrature processes is related to quasi-orthogonal polynomials.
Given a
sequence {Pn}n?0 of monic orthogonal polynomials and a fixed integer k, we
establish necessary and sufficient conditions so that the quasi-orthogonal
polynomials {Qn}n?0 defined by Qn(x) = Pn(x) + ?k-1,i=1 bi,nPn-i(x), n ?
0, with bi,n ? R, and bk-1,n ? 0 for n ? k-1, also constitute a sequence
of orthogonal polynomials.
Therefore we solve the inverse problem for
linearly related orthogonal polynomials.
The characterization turns out to
be equivalent to some nice recurrence formulas for the coefficients bi,n.
We
employ these results to establish explicit relations between various types
of quadrature rules from the above relations.
A number of illustrative
examples are provided.
Related Results
On Semi-Classical Orthogonal Polynomials Associated with a Modified Sextic Freud-Type Weight
On Semi-Classical Orthogonal Polynomials Associated with a Modified Sextic Freud-Type Weight
Polynomials that are orthogonal with respect to a perturbation of the Freud weight function by some parameter, known to be modified Freudian orthogonal polynomials, are considered....
Pencils of Semi-Infinite Matrices and Orthogonal Polynomials
Pencils of Semi-Infinite Matrices and Orthogonal Polynomials
Semi-infinite matrices, generalized eigenvalue problems, and orthogonal polynomials are closely related subjects. They connect different domains in mathematics—matrix theory, opera...
A Note on Bi-Orthogonal Polynomials and Functions
A Note on Bi-Orthogonal Polynomials and Functions
The theory of orthogonal polynomials is well established and detailed, covering a wide field of interesting results, as, in particular, for solving certain differential equations. ...
On Perfectness of Systems of Weights Satisfying Pearson’s Equation with Nonstandard Parameters
On Perfectness of Systems of Weights Satisfying Pearson’s Equation with Nonstandard Parameters
Measures generating classical orthogonal polynomials are determined by Pearson’s equation, whose parameters usually provide the positivity of the measures. The case of general comp...
Krein–Sobolev Orthogonal Polynomials II
Krein–Sobolev Orthogonal Polynomials II
In a recent paper, Littlejohn and Quintero studied the orthogonal polynomials {Kn}n=0∞—which they named Krein–Sobolev polynomials—that are orthogonal in the classical Sobolev space...
Truncated-Exponential-Based Appell-Type Changhee Polynomials
Truncated-Exponential-Based Appell-Type Changhee Polynomials
The truncated exponential polynomials em(x) (1), their extensions, and certain newly-introduced polynomials which combine the truncated exponential polynomials with other known pol...
Gradual transitivity in orthogonality spaces of finite rank
Gradual transitivity in orthogonality spaces of finite rank
AbstractAn orthogonality space is a set together with a symmetric and irreflexive binary relation. Any linear space equipped with a reflexive and anisotropic inner product provides...
On Certain Properties and Applications of the Perturbed Meixner–Pollaczek Weight
On Certain Properties and Applications of the Perturbed Meixner–Pollaczek Weight
This paper deals with monic orthogonal polynomials orthogonal with a perturbation of classical Meixner–Pollaczek measure. These polynomials, called Perturbed Meixner–Pollaczek poly...

