Optimal segmented approximations

Kioustelidis, JB

dc.contributor.author	Kioustelidis, JB	en
dc.date.accessioned	2014-03-01T01:05:50Z
dc.date.available	2014-03-01T01:05:50Z
dc.date.issued	1980	en
dc.identifier.issn	0010-485X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9030
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	Optimal segmented approximations	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/BF02242787	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BF02242787	en
heal.language	English	en
heal.publicationDate	1980	en
heal.abstract	Segmented approximations with free knots for a given continuous function are discussed in a general form. This form includes any kind of continuous approximating segments, and a great variety of error criteria, such as any Ls-norm, or the maximum norm of the pointwise error. It is shown that a solution to the problem exists under very general conditions, and that one solution at least must have continuous pointwise error modulus. Finally, algorithms for the iterative reduction of the approximation error are proposed, which lead to good, but not necessarily best approximations. © 1980 Springer-Verlag.	en
heal.publisher	Springer-Verlag	en
heal.journalName	Computing	en
dc.identifier.doi	10.1007/BF02242787	en
dc.identifier.isi	ISI:A1980JG75500001	en
dc.identifier.volume	24	en
dc.identifier.issue	1	en
dc.identifier.spage	1	en
dc.identifier.epage	8	en