On the public citation graph
Orthogonal Polynomials and Least Square Sense Approximation of Data and Complex Functions
0 signed · 38 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4471-6464-7openalex-snapshot
Hypergeometric Summation : An Algorithmic Approach to Summation and Special Function Identities
inferredcites →https://doi.org/10.1007/978-1-4757-1595-8openalex-snapshot
Special Functions of Mathematical Physics
inferredcites →https://doi.org/10.1007/978-3-0348-5452-8_6openalex-snapshot
A Survey of Gauss-Christoffel Quadrature Formulae
inferredcites →https://doi.org/10.1007/978-3-642-05014-5openalex-snapshot
Hypergeometric Orthogonal Polynomials and Their q-Analogues
inferredcites →https://doi.org/10.1007/s10915-013-9751-7openalex-snapshot
The Relationships Between Chebyshev, Legendre and Jacobi Polynomials: The Generic Superiority of Chebyshev Polynomials and Three Important Exceptions
inferredcites →https://doi.org/10.1007/s11075-020-01012-6openalex-snapshot
Fast and reliable high-accuracy computation of Gauss–Jacobi quadrature
inferredcites →https://doi.org/10.1007/s12045-011-0040-1openalex-snapshot
Weierstrass’s theorem — Leaving no ‘Stone’ unturned
inferredcites →https://doi.org/10.1007/s40314-021-01688-zopenalex-snapshot
Stable discontinuous mapped bases: the Gibbs–Runge-Avoiding Stable Polynomial Approximation (GRASPA) method
inferredcites →https://doi.org/10.1016/b978-0-444-50617-7.50014-8openalex-snapshot
Computation of Gauss-type quadrature formulas
inferredcites →https://doi.org/10.1016/b978-012382256-7/50021-xopenalex-snapshot
Orthogonal Polynomials
inferredcites →https://doi.org/10.1016/j.aim.2006.09.012openalex-snapshot
Discrete orthogonal polynomials and difference equations of several variables
inferredcites →https://doi.org/10.1016/j.amc.2007.03.080openalex-snapshot
Image reconstruction using various discrete orthogonal polynomials in comparison with DCT
inferredcites →https://doi.org/10.1016/j.cam.2004.09.036openalex-snapshot
Generalizations of orthogonal polynomials
inferredcites →https://doi.org/10.1016/j.cam.2009.05.018openalex-snapshot
Stable high-order quadrature rules with equidistant points
inferredcites →https://doi.org/10.1016/j.jat.2023.105875openalex-snapshot
Extremal polynomials on the n -grid
inferredcites →https://doi.org/10.1016/j.jat.2024.106141openalex-snapshot
Twenty-five years of greedy bases
inferredcites →https://doi.org/10.1016/j.joems.2016.11.001openalex-snapshot
A review of multivariate orthogonal polynomials
inferredcites →https://doi.org/10.1016/s0377-0427(00)00506-9openalex-snapshot
Computation of Gauss-type quadrature formulas
inferredcites →https://doi.org/10.1016/s0377-0427(01)00382-xopenalex-snapshot
Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
inferredcites →https://doi.org/10.1016/s0377-0427(97)00137-4openalex-snapshot
Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case
inferredcites →https://doi.org/10.1016/s0377-0427(97)00196-9openalex-snapshot
Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
inferredcites →https://doi.org/10.1016/s0377-0427(98)00002-8openalex-snapshot
Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
inferredcites →https://doi.org/10.1016/s0377-0427(98)00023-5openalex-snapshot
Representations of orthogonal polynomials
inferredcites →https://doi.org/10.1017/cbo9780511565717openalex-snapshot
Orthogonal Polynomials of Several Variables
inferredcites →https://doi.org/10.1088/1361-6633/aca6f8openalex-snapshot
Information geometry for multiparameter models: new perspectives on the origin of simplicity
inferredcites →https://doi.org/10.1090/s0025-5718-69-99647-1openalex-snapshot
Calculation of Gauss Quadrature Rules
inferredcites →https://doi.org/10.1109/icphys.2019.8780356openalex-snapshot
Simultaneous Approximation of Measurement Values and Derivative Data using Discrete Orthogonal Polynomials
inferredcites →https://doi.org/10.1119/1.1969595openalex-snapshot
Mathematics for the Physical Sciences
inferredcites →https://doi.org/10.1137/090774707openalex-snapshot
Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
inferredcites →https://doi.org/10.1137/19m1259936openalex-snapshot
An Efficient Algorithm for the Classical Least Squares Approximation
inferredcites →https://doi.org/10.12988/imf.2007.07087openalex-snapshot
Discrete orthogonal polynomials on equidistant nodes
inferredcites →https://doi.org/10.13016/m2ygad-ss9sopenalex-snapshot
AI Descartes: Combining Data and Theory for Derivable Scientific Discovery
inferredcites →https://doi.org/10.2478/cm-2020-0002openalex-snapshot
Spectral Theory of Singular Hahn Difference Equation of the Sturm-Liouville Type
inferredcites →https://doi.org/10.33205/cma.1070020openalex-snapshot
Padua points and fake nodes for polynomial approximation: old, new and open problems
inferredcites →https://doi.org/10.3390/a13110286openalex-snapshot
On the Solutions of Second-Order Differential Equations with Polynomial Coefficients: Theory, Algorithm, Application
inferredcites →https://doi.org/10.3390/math11183957openalex-snapshot
Fitting an Equation to Data Impartially
inferredcites →https://doi.org/10.48550/arxiv.1810.04282openalex-snapshot
Chebyshev Interpolation for Function in 1D
inferredcites →https://doi.org/10.48550/arxiv.math/9602214openalex-snapshot
The Askey-scheme of hypergeometric orthogonal polynomials and its q-analogue
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.