{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:39:38Z","timestamp":1649007578570},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p> Dimension-adaptive sparse grid interpolation is a powerful tool to obtain surrogate functions of smooth, medium to high-dimensional objective models. In case of expensive models, the efficiency of the sparse grid algorithm is governed by the time required for the function evaluations. In this paper, we first briefly analyze the inherent parallelism of the standard dimension-adaptive algorithm. Then, we present an enhanced version of the standard algorithm that permits, in each step of the algorithm, a specified number (equal to the number of desired processes) of function evaluations to be executed in parallel, thereby increasing the parallel efficiency. <\/jats:p>","DOI":"10.1142\/s0129626406002733","type":"journal-article","created":{"date-parts":[[2006,12,20]],"date-time":"2006-12-20T06:24:00Z","timestamp":1166595840000},"page":"407-418","source":"Crossref","is-referenced-by-count":0,"title":["CONSTRUCTING DIMENSION-ADAPTIVE SPARSE GRID INTERPOLANTS USING PARALLEL FUNCTION EVALUATIONS"],"prefix":"10.1142","volume":"16","author":[{"given":"ANDREAS","family":"KLIMKE","sequence":"first","affiliation":[{"name":"Institute of Applied Analysis and Numerical Simulation, Universit\u00e4t Stuttgart, Pfaffenwaldring 57, 70569 Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BARBARA","family":"WOHLMUTH","sequence":"additional","affiliation":[{"name":"Institute of Applied Analysis and Numerical Simulation, Universit\u00e4t Stuttgart, Pfaffenwaldring 57, 70569 Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492904000182"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-5712-3_14"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626492000180"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(98)00043-X"},{"key":"rf5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1007\/3-540-44863-2_67","volume":"2659","author":"Garcke J.","year":"2003"},{"key":"rf7","volume-title":"Finite Elements of Higher Order on Sparse Grids","author":"Bungartz H.-J.","year":"1998"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018977404843"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-003-0015-5"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/1114268.1114275"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626406002733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T09:29:07Z","timestamp":1565170147000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626406002733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":9,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0129626406002733"],"URL":"https:\/\/doi.org\/10.1142\/s0129626406002733","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}