On the uniqueness of best 𝐿₂[0,1] approximation by piecewise polynomials with variable breakpoints
Mathematics of ComputationPublished 1 January 1982Open access
Jeff Chow
Citations10
SJR quartileQ1
SJR score1.84
SNIP1.96
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.
Abstract
In this paper a sufficient condition for the uniqueness of best L 2 [ 0 , 1 ] {L_2}[0,1] approximation by piecewise polynomials of order k with variable breakpoints is generalized from that of order 2. Other extensions included here are nonuniqueness and eventual uniqueness results.
Keywords
Computer ScienceMathematics
Journal of the London Mathematical SocietyINTERPOLATION AND APPROXIMATION
898 Citations1964J. L. B. Cooper
Mathematics of ComputationUnicity of best mean approximation by second order splines with variable knots
35 Citations1978David L. Barrow, Charles K. Chui +2 more
Mathematics of ComputationUnicity of Best Mean Approximation by Second Order Splines with Variable Knots
6 Citations1978David L. Barrow, C. K. Chui +2 more
