{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T02:36:03Z","timestamp":1649126163318},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,18]],"date-time":"2014-12-18T00:00:00Z","timestamp":1418860800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11075-014-9945-6","type":"journal-article","created":{"date-parts":[[2014,12,17]],"date-time":"2014-12-17T04:12:34Z","timestamp":1418789554000},"page":"249-267","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reusing Chebyshev points for polynomial interpolation"],"prefix":"10.1007","volume":"70","author":[{"given":"Saman","family":"Ghili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Iaccarino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,18]]},"reference":[{"key":"9945_CR1","first-page":"124","volume":"7","author":"J Baglama","year":"1998","unstructured":"Baglama, J., Calvetti, D., Reichel, L.: Fast Leja points. Electron. Trans. Numer. Anal. 7, 124\u2013140 (1998)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"9945_CR2","first-page":"1025","volume":"8","author":"S Bernstein","year":"1931","unstructured":"Bernstein, S.: Sur la limitation des valeurs d\u2019un polyn\u00f4me. Bull. Acad. Sci. de l\u2019URSS 8, 1025\u20131050 (1931)","journal-title":"Bull. Acad. Sci. de l\u2019URSS"},{"key":"9945_CR3","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.amc.2008.12.087","volume":"210","author":"JP Boyd","year":"2009","unstructured":"Boyd, J.P., Xu, F.: Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and Mock-Chebyshev subset interpolation. Appl. Math. Comput. 210, 158\u2013168 (2009)","journal-title":"Appl. Math. Comput."},{"key":"9945_CR4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.apnum.2010.11.009","volume":"61","author":"JP Boyd","year":"2011","unstructured":"Boyd, J.P., Gildersleeve, K.W.: Numerical experiments on the condition number of the interpolation matrices for radial basis functions. Appl. Numer. Math. 61, 443\u2013459 (2011)","journal-title":"Appl. Numer. Math."},{"key":"9945_CR5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF01386223","volume":"2","author":"CW Clenshaw","year":"1960","unstructured":"Clenshaw, C.W., Curtis, A.R.: A method for numerical integration on an automatic computer. Numer. Math. 2, 197\u2013205 (1960)","journal-title":"Numer. Math."},{"key":"9945_CR6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF02066686","volume":"12","author":"P Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s, P.: Problems and results on the theory of interpolation. II. Acta Math. Acad. Sci. Hung. 12, 235\u2013244 (1961)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"9945_CR7","doi-asserted-by":"crossref","unstructured":"Gil, A., Segura, J., Temme, N.M.: Numerical Methods for Special Functions. SIAM. 978-0-898716-34-4 (2007)","DOI":"10.1137\/1.9780898717822"},{"key":"9945_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10915-010-9397-7","volume":"46","author":"J Jung","year":"2010","unstructured":"Jung, J., Stefan, W.: A simple regularization of the polynomial interpolation for the resolution of the Runge phenomenon. J. Sci. Comput. 46, 225\u2013242 (2010)","journal-title":"J. Sci. Comput."},{"key":"9945_CR9","doi-asserted-by":"crossref","first-page":"8","DOI":"10.4064\/ap-4-1-8-13","volume":"3","author":"F Leja","year":"1957","unstructured":"Leja, F.: Sur certaines suites li\u00e9es aux ensembles plans et leur application \u00e0 la repr\u00e9sentation conforme. Ann. Polon. Math. 3, 8\u201313 (1957)","journal-title":"Ann. Polon. Math."},{"key":"9945_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0021-9045(91)90087-Q","volume":"64","author":"FJ Narcowich","year":"1991","unstructured":"Narcowich, F.J., Ward, J.D.: Norms of inverses and condition numbers for matrices associated with scattered data. J. Approx. Theory 64, 69\u201394 (1991)","journal-title":"J. Approx. Theory"},{"key":"9945_CR11","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1137\/060663660","volume":"46","author":"F Nobile","year":"2008","unstructured":"Nobile, F., Tempone, R., Webster, C.G.: A sparse grid stochastic collocation method for partial differential equations with random input data. SIAM J. Numer. Anal. 46, 2309\u20132345 (2008)","journal-title":"SIAM J. Numer. Anal."},{"key":"9945_CR12","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1093\/comjnl\/15.2.156","volume":"15","author":"HE Salzer","year":"1972","unstructured":"Salzer, H.E.: Lagrangian interpolation at the Chebyshev points x n , = cos ( \u03bd\u03c0 \/ n ) , \u03bd = 0 ( 1 ) n $x_{n,\u03bd} = \\cos (\\nu \\pi \/n), \\nu = 0(1)n$ ; some unnoted advantages. Comput. J. 15, 156\u2013159 (1972)","journal-title":"Comput. J."},{"key":"9945_CR13","unstructured":"Taylor, R.: Lagrange interpolation on Leja points, Graduate School Theses and Dissertations. http:\/\/scholarcommons.usf.edu\/etd\/530 (2008)"},{"key":"9945_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1137\/060659831","volume":"50","author":"LN Trefethen","year":"2008","unstructured":"Trefethen, L.N.: Is Gauss quadrature better than Clenshaw-Curtis? SIAM Rev. 50, 67\u201387 (2008)","journal-title":"SIAM Rev."},{"key":"9945_CR15","unstructured":"Trefethen, L.N., et al.: Chebfun Version 4.2. The Chebfun Development Team. http:\/\/www.chebfun.org (2011)"},{"key":"9945_CR16","unstructured":"Trefethen, L.N.: Approximation Theory and Approximation Practice. SIAM, Philadelphia (2012)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9945-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-014-9945-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9945-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T14:28:39Z","timestamp":1566138519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-014-9945-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,18]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9945"],"URL":"https:\/\/doi.org\/10.1007\/s11075-014-9945-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,18]]}}}