{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T01:42:24Z","timestamp":1767922944502,"version":"3.49.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Algorithms"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1023\/a:1014022210828","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:56:49Z","timestamp":1048208209000},"page":"45-61","source":"Crossref","is-referenced-by-count":12,"title":["Cubic Spline Data Reduction Choosing the Knots from a Third Derivative Criterion"],"prefix":"10.1007","volume":"28","author":[{"given":"C.","family":"Conti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Morandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Rabut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Sestini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"391460_CR1","volume-title":"Bull. Novosibirsk Comp. Center Ser. Numer. Anal.","author":"A. Bezhaev","year":"1993","unstructured":"A.Yu. Bezhaev and V.A. Vasilenko, Variational Splines Theory, Bull. Novosibirsk Comp. Center Ser. Numer. Anal. (Spec. Issue) 3 (NCC Publisher, Novosibirsk, 1993)."},{"key":"391460_CR2","first-page":"501","volume":"320","author":"M. Buhmann","year":"1995","unstructured":"M. Buhmann and A. Le M\u00e9haut\u00e9, Knot removal with radial function interpolation, C. R. Sci. Paris Ser. I 320 (1995) 501\u2013506.","journal-title":"C. R. Sci. Paris Ser. I"},{"key":"391460_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6333-3","volume-title":"A Practical Guide to Splines","author":"C. de Boor","year":"1978","unstructured":"C. de Boor, A Practical Guide to Splines (Springer, Berlin, 1978)."},{"key":"391460_CR4","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1991","unstructured":"R. Fletcher, Practical Methods of Optimization, Vol. 2 (Wiley, Chichester, 1991)."},{"key":"391460_CR5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1093\/imanum\/13.3.365","volume":"13","author":"Y. Hu","year":"1993","unstructured":"Y. Hu, An algorithm for data reduction using splines with free knotes, IMA J. Numer. Anal. 13 (1993) 365\u2013381.","journal-title":"IMA J. Numer. Anal."},{"key":"391460_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0167-8396(87)90013-6","volume":"4","author":"T. Lyche","year":"1987","unstructured":"T. Lyche and K. M\u00f8rken, Knot removal for parametric B-spline curves and surfaces, Comput. Aided Geom. Design 4 (1987) 217\u2013230.","journal-title":"Comput. Aided Geom. Design"},{"key":"391460_CR7","first-page":"185","volume":"8","author":"T. Lyche","year":"1988","unstructured":"T. Lyche and K. M\u00f8rken, A data reduction strategy for splines with applications to the approximations of functions and data, J. Inst. Math. Appl. 8 (1988) 185\u2013208.","journal-title":"J. Inst. Math. Appl."},{"issue":"1","key":"391460_CR8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01732610","volume":"35","author":"H. Schwetlick","year":"1995","unstructured":"H. Schwetlick and T. Schutze, Least squares approximation by splines with free knots, BIT 35(1) (1995) 361\u2013384.","journal-title":"BIT"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014022210828.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014022210828\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014022210828.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:20:13Z","timestamp":1751872813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014022210828"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":8,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["391460"],"URL":"https:\/\/doi.org\/10.1023\/a:1014022210828","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}