Uniform piecewise polynomial approximation with variable joints
Journal of Approximation TheoryPublished 1 September 1974
T. Pavlidis, A.P Maika
Citations27
SJR quartileQ2
SJR score0.55
SNIP0.86
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A procedure based on functional iteration is proposed for solving the problem of uniform piecewise polynomial approximation of a function, and a proof for its convergence is given.
Abstract
A procedure based on functional iteration is proposed for solving the problem of uniform piecewise polynomial approximation of a function, and a proof for its convergence is given. This method compares favorably with Lawson's algorithm, especially in cases in which the given function is not of smooth form.
Keywords
Computer ScienceMathematics
Physics Today<i>Analysis of Numerical Methods</i>
2,290 Citations1967Eugene Isaacson, Herbert B. Keller +1 more
Communications of the ACMOn the approximation of curves by line segments using dynamic programming
439 Citations1961Richard Bellman
The technique of dynamic programming is applied to approximate a given continuous function g(x) by a finite number of line segments over the interval a,b to determine the constants aSub k, b sub k, k equals 0,..., N - 1 and the points of division u sub 1,..., u sub N-1 in the intervala,b that minimize the function J = N -1k=0 uk+1.
IEEE Transactions on ComputersWaveform Segmentation Through Functional Approximation
138 Citations1973Theodosios Pavlidis
Waveform segmentation is treated as a problem of piecewise linear uniform (minmax) approximation and can be used for pattern recognition, data compression, and nonlinear filtering not only for waveforms but also for pictures and maps.
SIAM ReviewApplications of Linear Programming to Numerical Analysis
73 Citations1968Philip Rabinowitz
SIAM Journal on Numerical AnalysisUniform Approximation by Chebyshev Spline Functions. II: Free Knots
59 Citations1968Larry L. Schumaker
Numerische MathematikChebyshev approximation by spline functions with free knots
55 Citations1971Dietrich Braess
Communications of the ACMFurther remarks on line segment curve-fitting using dynamic programming
46 Citations1962Brian Gluss
The computational procedure is considered more fully, and the similarities to some of Stone's equations are indicated, and it is further shown that an equation for u2 involving no minimization may be found.