Monotonicity of the error of optimal segmented approximations

Kioustelidis, JB

dc.contributor.author	Kioustelidis, JB	en
dc.date.accessioned	2014-03-01T01:06:05Z
dc.date.available	2014-03-01T01:06:05Z
dc.date.issued	1982	en
dc.identifier.issn	0010-485X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9147
dc.subject	AMS Subject Classification: 41A15, 41A25, 65G99	en
dc.subject	Segmented approximations	en
dc.subject	spline approximations	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	MATHEMATICAL TECHNIQUES	en
dc.title	Monotonicity of the error of optimal segmented approximations	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/BF02237997	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BF02237997	en
heal.language	English	en
heal.publicationDate	1982	en
heal.abstract	Optimal segmented approximations with free knots for a continuous function have (with the exception of trivial cases) strictly monotonically decreasing error with increasing number of knots, if the error functional is strictly isotonic and the approximation segments belong to the linear space of solutions of a linear homogeneous differential equation. More generally, the error is certain to decrease, if two additional knots are allowed, provided that the segments belong to any set of continuous functions, which includes additive constants. © 1982 Springer-Verlag.	en
heal.publisher	Springer-Verlag	en
heal.journalName	Computing	en
dc.identifier.doi	10.1007/BF02237997	en
dc.identifier.isi	ISI:A1982NA17500007	en
dc.identifier.volume	28	en
dc.identifier.issue	1	en
dc.identifier.spage	69	en
dc.identifier.epage	74	en