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
Some Orthogonal Combinations of Legendre Polynomials
Some Orthogonal Combinations of Legendre Polynomials
The principle objective of this article is to introduce and investigate a type of orthogonal polynomials that are written as combinations of Legendre polynomials. This kind of poly...
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....
On Carlsson type orthogonality and characterization of inner product spaces
On Carlsson type orthogonality and characterization of inner product spaces
In an inner product space, two vectors are orthogonal if their inner product
is zero. In a normed space, numerous notions of orthogonality have been
introduced via equivalent...
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...
On Convolved Fibonacci Polynomials
On Convolved Fibonacci Polynomials
This work delves deeply into convolved Fibonacci polynomials (CFPs) that are considered generalizations of the standard Fibonacci polynomials. We present new formulas for these pol...
Novel Formulas of Schröder Polynomials and Their Related Numbers
Novel Formulas of Schröder Polynomials and Their Related Numbers
This paper explores the Schröder polynomials, a class of polynomials that produce the famous Schröder numbers when x=1. The three-term recurrence relation and the inversion formula...
New Formulas and Connections Involving Euler Polynomials
New Formulas and Connections Involving Euler Polynomials
The major goal of the current article is to create new formulas and connections between several well-known polynomials and the Euler polynomials. These formulas are developed using...
Ortogonalni polinomi
Ortogonalni polinomi
Introduction: Classical orthogonal polynomials such as the Legendre, Laguerre, Hermite, and Chebyshev polynomials have a wide range of applications across various domains of scienc...

