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
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...
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...
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Here in this paper, we provide characterizations of fuzzy quasi-ideal in terms of level and strong level subsets. Along with it, we provide expression for the generated fuzzy quasi...
Generating Functions for New Families of Combinatorial Numbers and Polynomials: Approach to Poisson–Charlier Polynomials and Probability Distribution Function
Generating Functions for New Families of Combinatorial Numbers and Polynomials: Approach to Poisson–Charlier Polynomials and Probability Distribution Function
The aim of this paper is to construct generating functions for new families of combinatorial numbers and polynomials. By using these generating functions with their functional and ...
Explicit representations of the norms of the Laguerre-Sobolev and Jacobi-Sobolev polynomials
Explicit representations of the norms of the Laguerre-Sobolev and Jacobi-Sobolev polynomials
Abstract
This paper deals with discrete Sobolev orthogonal polynomials with respect to inner products built upon the classical Laguerre and Jacobi measures on the interva...
Study on Orthogonal Sets for Birkhoff Orthogonality
Study on Orthogonal Sets for Birkhoff Orthogonality
We introduce the notion of orthogonal sets for Birkhoff orthogonality, which we will call Birkhoff orthogonal sets in this paper. As a generalization of orthogonal sets in Hilbert ...
Core and strongly core orthogonal elements in rings with involution
Core and strongly core orthogonal elements in rings with involution
In this paper, we present a new concept of the core orthogonality for two core invertible elements
a and b in rings with involution. a is said to be core orthogonal to b, if a#b = ...

