Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 47 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 28 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 104 tok/s Pro
Kimi K2 156 tok/s Pro
GPT OSS 120B 474 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Orthogonality of quasi-orthogonal polynomials (1901.01128v1)

Published 14 Dec 2018 in math.CA

Abstract: A result of P\'olya states that every sequence of quadrature formulas $Q_n(f)$ with $n$ nodes and positive numbers converges to the integral $I(f)$ of a continuous function $f$ provided $Q_n(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 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 $\left { P_{n}\right }{n\geq0}$ of monic orthogonal polynomials and a fixed integer $k$, we establish necessary and sufficient conditions so that the quasi-orthogonal polynomials $\left { Q{n}\right }{n\geq0}$ defined by [ Q{n}(x) =P_{n}(x) + \sum \limits_{i=1}{k-1} b_{i,n}P_{n-i}(x), \ \ n\geq 0, ] with $b_{i,n} \in \mathbb{R}$, and $b_{k-1,n}\neq 0$ for $n\geq 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 $b_{i,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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.