Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
From MaRDI portal
Publication:3253351
DOI10.1137/0105007zbMath0083.35503OpenAlexW2010431242MaRDI QIDQ3253351
Publication date: 1957
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0105007
Related Items (40)
An iterative rational fraction polynomial technique for modal identification ⋮ Construction of polynomials that are orthogonal with respect to a discrete bilinear form ⋮ Discrete orthogonal polynomials on Gauss-Lobatto Chebyshev nodes ⋮ Cross-directional control on paper machines using Gram polynomials ⋮ Stability of parallel algorithms for polynomial evaluation ⋮ Trigonometric interpolation and curve-fitting ⋮ A model of the nerve action potential ⋮ Limited‐memory polynomial methods for large‐scale matrix functions ⋮ On generating Sobolev orthogonal polynomials ⋮ Multivariate Polynomial Chaos Expansions with Dependent Variables ⋮ A new application of the discrete Laguerre polynomials in the numerical evaluation of the Hankel transform of a strongly decreasing even function ⋮ Nonlinear multiple breathing cracks detection using direct zeros estimation of higher-order frequency response function ⋮ Non-linear regression with discrete explanatory variables, with an application to the earnings function ⋮ Orthogonal basis functions in discrete least-squares rational approximation. ⋮ Parallel evaluation of Chebyshev and trigonometric series ⋮ An Algorithm for Summing Orthogonal Polynomial Series and their Derivatives with Applications to Curve-Fitting and Interpolation ⋮ On function recovery by neural networks based on orthogonal expansions ⋮ Minimal Error Constant Numerical Differentiation (N.D.) Formulas ⋮ Is the recurrence relation for orthogonal polynomials always stable? ⋮ Rational approximation of decay-type functions ⋮ Stable high-order quadrature rules with equidistant points ⋮ On algorithms for the summation of certain special functions ⋮ Stability of parallel algorithms to evaluate Chebyshev series ⋮ Modeling Noisy Time Series: Physiological Tremor ⋮ Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes ⋮ Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series ⋮ Interpolazione, rappresentazione e analisi di funzioni sperimentali ⋮ Polynomial least square interval approximation ⋮ The numerically stable reconstruction of a Jacobi matrix from spectral data ⋮ Adaptive multi-element polynomial chaos with discrete measure: algorithms and application to SPDEs ⋮ Orthogonal polynomials in several variables ⋮ Numerical integration of a nonlinear, singular integro-partial differential equation ⋮ On the statistical properties on the least square interpolating polynomials ⋮ A study of the correlation technique of generalized spectral analysis ⋮ Vandermonde with Arnoldi ⋮ A new algorithm for computing orthogonal polynomials ⋮ Fitting monotone polynomials in mixed effects models ⋮ Gauss-Christoffel quadrature for inverse regression: applications to computer experiments ⋮ Reliable determination of interpolating polynomials ⋮ Orthonormal polynomials in one and two dimensions: application to calibration problems in high energy physics
This page was built for publication: Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
