{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T12:10:55Z","timestamp":1785327055252,"version":"3.55.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"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":[[2000,8]]},"DOI":"10.1023\/a:1019105612985","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T23:30:27Z","timestamp":1045697427000},"page":"239-254","source":"Crossref","is-referenced-by-count":111,"title":["Adaptive greedy techniques for approximate solution of large RBF systems"],"prefix":"10.1007","volume":"24","author":[{"given":"Robert","family":"Schaback","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Holger","family":"Wendland","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"329399_CR1","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s003659900033","volume":"13","author":"G. Davis","year":"1997","unstructured":"G. Davis, S. Mallat and M. Avallaneda, Adaptive greedy approximations, Constr. Approx. 13 (1997) 737-785.","journal-title":"Constr. Approx."},{"key":"329399_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF02124742","volume":"5","author":"R.A. DeVore","year":"1996","unstructured":"R.A. DeVore and V.N. Temlyakov, Some remarks on greedy algorithms, Adv. Comput. Math. 5 (1996) 173-187.","journal-title":"Adv. Comput. Math."},{"key":"329399_CR3","unstructured":"G. Fasshauer, C. Gartland and J. Jerome, Nash iteration as a computational tool for differential equations, Preprint (1999)."},{"key":"329399_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1018923925800","volume":"11","author":"A. Faul","year":"1999","unstructured":"A. Faul and M.J.D. Powell, Proof of convergence of an iterative technique for thin-plate spline interpolation in two dimensions, Adv. Comput. Math. 11 (1999) 183-192.","journal-title":"Adv. Comput. Math."},{"key":"329399_CR5","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1214\/aos\/1176348546","volume":"20","author":"L. Jones","year":"1992","unstructured":"L. Jones, A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training, Ann. Statist. 20 (1992) 608-613.","journal-title":"Ann. Statist."},{"key":"329399_CR6","series-title":"International Series of Numerical Mathematics","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-3-0348-8696-3_16","volume-title":"New Developments in Approximation Theory","author":"R. Schaback","year":"1999","unstructured":"R. Schaback, Native spaces of radial basis functions I, in: New Developments in Approximation Theory, eds. M.W. M\u00fcller, M.D. Buhmann, D.H. Mache and M. Felten, International Series of Numerical Mathematics, Vol. 132 (Birkh\u00e4user, Basel, 1999) pp. 255-282."},{"key":"329399_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1023\/A:1018900431309","volume":"8","author":"V.N. Temlyakov","year":"1998","unstructured":"V.N. Temlyakov, The best m-term approximation and greedy algoriths, Adv. Comput. Math. 8 (1998) 249-265.","journal-title":"Adv. Comput. Math."},{"key":"329399_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1006\/jath.1998.3265","volume":"98","author":"V.N. Temlyakov","year":"1999","unstructured":"V.N. Temlyakov, Greedy algorithms and M-term approximation with regard to redundant dictionaries, J. Approx. Theory 98 (1999) 117-145.","journal-title":"J. Approx. Theory"},{"key":"329399_CR9","unstructured":"www.math.nps.navy.mil\/_rfranke."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019105612985.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019105612985\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019105612985.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:12:49Z","timestamp":1751872369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019105612985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["329399"],"URL":"https:\/\/doi.org\/10.1023\/a:1019105612985","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}