{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:07:34Z","timestamp":1758823654911},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s11075-005-0411-3","type":"journal-article","created":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T10:57:43Z","timestamp":1131533863000},"page":"401-414","source":"Crossref","is-referenced-by-count":4,"title":["Smolyak's algorithm for weighted L1-approximation of multivariate functions with bounded rth mixed derivatives over \u211dd"],"prefix":"10.1007","volume":"40","author":[{"given":"Piotr","family":"Gajda","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20411_CR1","unstructured":"P. Gajda, Koksma-Hlawka type (in)equalities for multiple weighted integration over \u211dd, submitted."},{"key":"20411_CR2","unstructured":"F.J. Hickernell, I.H. Sloan and G.W. Wasilkowski, A piecewise constant algorithm for weighted L1 approximation over bounded or unbounded regions in \u211ds, submitted."},{"key":"20411_CR3","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1006\/jcom.2001.0632","volume":"18","author":"Y. Li","year":"2002","unstructured":"Y. Li and G.W. Wasilkowski, Worst case complexity of weighted approximation and integration over \u211dd, J. Complexity 18 (2002) 330\u2013345.","journal-title":"J. Complexity"},{"key":"20411_CR4","series-title":"Lectures Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0079792","volume-title":"Deterministic and Stochastic Error Bounds in Numerical Analysis","author":"E. Novak","year":"1988","unstructured":"E. Novak, Deterministic and Stochastic Error Bounds in Numerical Analysis, Lectures Notes in Mathematics, Vol. 1349 (Springer, New York, 1988)."},{"key":"20411_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69894-1","volume-title":"n-Widths in Approximation Theory","author":"A. Pinkus","year":"1985","unstructured":"A. Pinkus, n-Widths in Approximation Theory (Springer, Berlin, 1985)."},{"key":"20411_CR6","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.jco.2003.10.002","volume":"20","author":"L. Plaskota","year":"2004","unstructured":"L. Plaskota, K. Ritter and G.W. Wasilkowski, Optimal designs for weighted approximation and integration of stochastic processes on [0,\u221e), J. Complexity 20 (2004) 108\u2013131.","journal-title":"J. Complexity"},{"key":"20411_CR7","doi-asserted-by":"crossref","unstructured":"L. Plaskota and G.W. Wasilkowski, Smolyak's algorithm for integration and L1-approximation of multivariate functions with bounded mixed derivatives of second order, Numer. Algorithms (2004), to appear.","DOI":"10.1023\/B:NUMA.0000040060.56819.a7"},{"key":"20411_CR8","first-page":"240","volume":"4","author":"S.A. Smolyak","year":"1963","unstructured":"S.A. Smolyak, Quadrature and interpolation formulas for tensor products of certain classes of functions, Dokl. Akad. Nauk. SSSR 4 (1963) 240\u2013243.","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"20411_CR9","volume-title":"Information-Base Complexity","author":"J.F. Traub","year":"1988","unstructured":"J.F. Traub, G.W. Wasilkowski and H. Wo\u017aniakowski, Information-Base Complexity (Academic Press, New York, 1988)."},{"key":"20411_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcom.1995.1001","volume":"11","author":"G.W. Wasilkowski","year":"1995","unstructured":"G.W. Wasilkowski and H. Wo\u017aniakowski, Explicit cost bounds of algorithms for multivariate tensor product problems, J. Complexity 11 (1995) 1\u201356.","journal-title":"J. Complexity"},{"key":"20411_CR11","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1006\/jcom.2001.0601","volume":"17","author":"G.W. Wasilkowski","year":"2001","unstructured":"G.W. Wasilkowski and H. Wo\u017aniakowski, Complexity of weighted approximation over \u211dd, J. Complexity 17 (2001) 722\u2013740.","journal-title":"J. Complexity"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-005-0411-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-005-0411-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-005-0411-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:08:06Z","timestamp":1559365686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-005-0411-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["20411"],"URL":"https:\/\/doi.org\/10.1007\/s11075-005-0411-3","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}