Optimal segmented polynomial Ls-approximations

Kioustelidis, JB

dc.contributor.author	Kioustelidis, JB	en
dc.date.accessioned	2014-03-01T01:05:58Z
dc.date.available	2014-03-01T01:05:58Z
dc.date.issued	1981	en
dc.identifier.issn	0010-485X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9089
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	MATHEMATICAL TECHNIQUES	en
dc.title	Optimal segmented polynomial Ls-approximations	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/BF02243481	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BF02243481	en
heal.language	English	en
heal.publicationDate	1981	en
heal.abstract	Characteristic properties of such approximations are given. An algorithm providing good, but not necessarily best, approximations is also discussed. © 1981 Springer-Verlag.	en
heal.publisher	Springer-Verlag	en
heal.journalName	Computing	en
dc.identifier.doi	10.1007/BF02243481	en
dc.identifier.isi	ISI:A1981LN01000005	en
dc.identifier.volume	26	en
dc.identifier.issue	3	en
dc.identifier.spage	239	en
dc.identifier.epage	246	en