{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T16:22:28Z","timestamp":1792513348949,"version":"4.5.0"},"reference-count":32,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/100000993","name":"Battelle","doi-asserted-by":"publisher","award":["DE-AC05-00OR22725"],"award-info":[{"award-number":["DE-AC05-00OR22725"]}],"id":[{"id":"10.13039\/100000993","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["17-SC-20-SC"],"award-info":[{"award-number":["17-SC-20-SC"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["LAB 15-1338"],"award-info":[{"award-number":["LAB 15-1338"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>We develop a technique for multigrid adaptive reduction of data (MGARD). Special attention is given to the case of tensor product grids, where our approach permits the use of nonuniformly spaced grids in each direction, which can prove problematic for many types of data reduction methods. An important feature of our approach is the provision of guaranteed, computable bounds on the loss incurred by the reduction of the data. Many users are leery of lossy algorithms and will only consider using them provided that numerical bounds on the pointwise difference between the original and the reduced datasets are given. Accordingly, we develop techniques for bounding the loss measured in the $L^{\\infty}(\\Omega)$ norm, and we show that these bounds are realistic in the sense that they do not significantly overestimate the actual loss. The resulting loss indicators are used to guide the adaptive reduction of the data so that the reduced dataset meets a user-prescribed tolerance or memory constraint. Illustrative numerical examples, including the reduction of data arising from the simulation of a nonlinear reaction-diffusion problem, a turbulent channel flow, and a climate simulation, are provided.<\/jats:p>","DOI":"10.1137\/18m1166651","type":"journal-article","created":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T11:53:45Z","timestamp":1556193225000},"page":"A1278-A1303","source":"Crossref","is-referenced-by-count":88,"title":["Multilevel Techniques for Compression and Reduction of Scientific Data---The Multivariate Case"],"prefix":"10.1137","volume":"41","author":[{"given":"Mark","family":"Ainsworth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ozan","family":"Tugluk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben","family":"Whitney","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Scott","family":"Klasky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2019,4,25]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1086248"},{"key":"atypb2","volume-title":"Pure Appl. Math. (Hoboken) 37","author":"Ainsworth M.","year":"2011"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1007\/s00791-018-00303-9"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.67"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600217"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01462238"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691591"},{"key":"atypb8","volume-title":"Athena Scientific & Dynamic Ideas","author":"Bertsimas D.","year":"1997"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01388699"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.22"},{"key":"atypb11","first-page":"521","volume":"48","author":"Crouzeix M.","year":"1987","journal-title":"Math. Comp."},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1109\/18.57199"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.11"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64203-1_1"},{"key":"atypb15","volume-title":"Matrix Computations","author":"Golub G. H.","year":"1996"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIE.1999.801765"},{"key":"atypb17","first-page":"191","volume":"5","author":"Gumel A.","year":"1997","journal-title":"Pertanika J. Sci. Tech."},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22470-1"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00681"},{"key":"atypb20","unstructured":"Johns Hopkins Turbulence Database, Group,\n                      Channel flow dataset\n                      , Oct. 2017,https:\/\/doi.org\/10.7281\/T10K26QW, accessed Jan. 2, 2018."},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1017\/jfm.2015.268"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1080\/14685240802376389"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346458"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.143"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2000.838192"},{"key":"atypb26","volume-title":"Nov.","author":"McCalpin J. D.","year":"2016"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-91215-2"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362654"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15431-2"},{"key":"atypb30","unstructured":"M. Strengert, M. Magall\u00f3n, D. Weiskopf, S. Guthe, and T. Ertl,\n                      Hierarchical visualization and compression of large volume datasets using GPU clusters\n                      , in the Proceedings of the Eurographics Workshop on Parallel Graphs and Visualization, 2004, pp. 41-48."},{"key":"atypb31","first-page":"297","volume":"26","author":"Twizell E. H.","year":"1999","journal-title":"reaction--diffusion system, J. Math. Chem."},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1109\/30.125072"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/18M1166651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:23:19Z","timestamp":1787325799000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/18M1166651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1137\/18M1166651"],"URL":"https:\/\/doi.org\/10.1137\/18m1166651","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}