{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T07:49:45Z","timestamp":1751356185633,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031125966"},{"type":"electronic","value":"9783031125973"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-12597-3_25","type":"book-chapter","created":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T10:02:21Z","timestamp":1659261741000},"page":"403-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["High-Performance Spatial Data Compression for\u00a0Scientific Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7715-8920","authenticated-orcid":false,"given":"Ronald","family":"Kriemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6897-1095","authenticated-orcid":false,"given":"Hatem","family":"Ltaief","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7245-2968","authenticated-orcid":false,"given":"Minh Bau","family":"Luong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7906-8646","authenticated-orcid":false,"given":"Francisco E. Hern\u00e1ndez","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7080-1266","authenticated-orcid":false,"given":"Hong G.","family":"Im","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4052-7224","authenticated-orcid":false,"given":"David","family":"Keyes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00791-018-00303-9","volume":"19","author":"M Ainsworth","year":"2018","unstructured":"Ainsworth, M., Tugluk, O., Whitney, B., Klasky, S.: Multilevel techniques for compression and reduction of scientific data - the univariate case. Comput. Vis. Sci. 19, 65\u201376 (2018)","journal-title":"Comput. Vis. Sci."},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1109\/TPAMI.2015.2448083","volume":"38","author":"S Ambikasaran","year":"2015","unstructured":"Ambikasaran, S., Foreman-Mackey, D., Greengard, L., Hogg, D.W., O\u2019Neil, M.: Fast direct methods for Gaussian processes. IEEE Trans. Pattern Anal. Mach. Intell. 38(2), 252\u2013265 (2015)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Ballard, G., Klinvex, A., Kolda, T.G.: TuckerMPI: a parallel C++\/MPI software package for large-scale data compression via the tucker tensor decomposition. ACM Trans. Math. Softw. 46(2) (2020)","DOI":"10.1145\/3378445"},{"issue":"9","key":"25_CR4","doi-asserted-by":"publisher","first-page":"2891","DOI":"10.1109\/TVCG.2019.2904063","volume":"26","author":"R Ballester-Ripoll","year":"2020","unstructured":"Ballester-Ripoll, R., Lindstrom, P., Pajarola, R.: TTHRESH: tensor compression for multidimensional visual data. IEEE Trans. Vis. Comput. Graph. 26(9), 2891\u20132903 (2020). https:\/\/doi.org\/10.1109\/TVCG.2019.2904063","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Bangerth, W., Hartmann, R., Kanschat, G.: deal.II - A general-purpose object-oriented finite element library. ACM Trans. Math. Softw. 33, 24 (2007)","DOI":"10.1145\/1268776.1268779"},{"issue":"4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/PL00005410","volume":"86","author":"M Bebendorf","year":"2000","unstructured":"Bebendorf, M.: Approximation of boundary element matrices. Numer. Math. 86(4), 565\u2013589 (2000)","journal-title":"Numer. Math."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"B\u00f6rm, S.: Efficient Numerical Methods for Non-local Operators: $$\\cal{H}^2$$-Matrix Compression, Algorithms and Analysis, vol. 14. European Mathematical Society (2010)","DOI":"10.4171\/091"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"B\u00f6rm, S.: Directional $$\\cal{H}^2$$-matrix compression for high-frequency problems. Numer. Linear Algebra Appl. 24 (2017)","DOI":"10.1002\/nla.2112"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00211-005-0618-1","volume":"101","author":"S B\u00f6rm","year":"2005","unstructured":"B\u00f6rm, S., Grasedyck, L.: Hybrid cross approximation of integral operators. Numer. Math. 101, 221\u2013249 (2005)","journal-title":"Numer. Math."},{"key":"25_CR10","unstructured":"B\u00f6rm, S., Grasedyck, L., Hackbusch, W.: Hierarchical matrices. Preprint, Max Planck Institute for Mathematics in the Sciences (2003)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"B\u00f6rm, S., Hackbusch, W.: $$\\cal{H}^2$$-matrix approximation of integral operators by interpolation. Appl. Numer. Math. 43, 129\u2013143 (2002)","DOI":"10.1016\/S0168-9274(02)00121-6"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.acha.2014.04.002","volume":"38","author":"E Corona","year":"2015","unstructured":"Corona, E., Martinsson, P.G., Zorin, D.: An $$O(N)$$ direct solver for integral equations on the plane. Appl. Comput. Harmon. Anal. 38(2), 284\u2013317 (2015)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Desai, S., Yu, J.K., Song, W., Luong, M.B., et al.: Direct numerical simulations of reacting flows with shock waves and stiff chemistry using many-core\/GPU acceleration. Comput. Fluids 215, 104787 (2021)","DOI":"10.1016\/j.compfluid.2020.104787"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Di, S., Cappello, F.: Fast Error-bounded lossy HPC data compression with SZ. In: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 730\u2013739 (2016)","DOI":"10.1109\/IPDPS.2016.11"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1137\/19M128689X","volume":"43","author":"V Ehrlacher","year":"2021","unstructured":"Ehrlacher, V., Grigori, G., Lombardi, D., Song, H.: Adaptive hierarchical subtensor partitioning for tensor compression. SIAM J. Sci. Comput. 43, 139\u2013163 (2021)","journal-title":"SIAM J. Sci. Comput."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00607-004-0103-1","volume":"74","author":"L Grasedyck","year":"2004","unstructured":"Grasedyck, L.: Adaptive recompression of $$\\cal{H}$$-matrices for BEM. Computing 74, 205\u2013223 (2004)","journal-title":"Computing"},{"issue":"4\u20136","key":"25_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00791-008-0098-9","volume":"11","author":"L Grasedyck","year":"2008","unstructured":"Grasedyck, L., Kriemann, R., LeBorne, S.: Parallel black box $$\\cal{H}$$-LU preconditioning for elliptic boundary value problems. Comput. Vis. Sci. 11(4\u20136), 273\u2013291 (2008)","journal-title":"Comput. Vis. Sci."},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-642-59709-1_2","volume-title":"Lectures on Applied Mathematics","author":"W Hackbusch","year":"2000","unstructured":"Hackbusch, W., Khoromskij, B., Sauter, S.A.: On $$\\cal{H}^2$$-Matrices. In: Bungartz, H.J., Hoppe, R.H.W., Zenger, C. (eds.) Lectures on Applied Mathematics, pp. 9\u201329. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-642-59709-1_2"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Hackbusch, W., Khoromskij, B.: A sparse $$\\cal{H}$$-matrix arithmetic. Part II: application to multi-dimensional problems. Computing 64, 21\u201347 (2000)","DOI":"10.1007\/PL00021408"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00607-004-0080-4","volume":"73","author":"W Hackbusch","year":"2004","unstructured":"Hackbusch, W., Khoromskij, B., Kriemann, R.: Hierarchical matrices based on a weak admissibility criterion. Computing 73, 207\u2013243 (2004)","journal-title":"Computing"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Hackbusch, W.: A sparse matrix arithmetic based on $$\\cal{H}$$-matrices. Part I: introduction to $$\\cal{H}$$-matrices. Computing 62, 89\u2013108 (1999)","DOI":"10.1007\/s006070050015"},{"key":"25_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47324-5","volume-title":"$$\\cal{H} ^2$$-Matrices: Algorithms and Analysis","author":"W Hackbusch","year":"2015","unstructured":"Hackbusch, W.: $$\\cal{H} ^2$$-Matrices: Algorithms and Analysis, vol. 49. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47324-5"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Hackbusch, W., Khoromskij, B.N.: $$\\cal{H}$$-matrix approximation on graded meshes. In: Whiteman, J.R. (ed.) Proceedings of the 10th conference on Mathematics of Finite Elements and Applications X, MAFELAP 1999, pp. 307\u2013316 (2000)","DOI":"10.1016\/B978-008043568-8\/50019-5"},{"issue":"2","key":"25_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P.G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53(2), 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.compfluid.2018.03.074","volume":"173","author":"FE Hern\u00e1ndez P\u00e9rez","year":"2018","unstructured":"Hern\u00e1ndez P\u00e9rez, F.E., et al.: Direct numerical simulations of reacting flows with detailed chemistry using many-core\/GPU acceleration. Comput. Fluids 173, 73\u201379 (2018)","journal-title":"Comput. Fluids"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Keyes, D.E., Ltaief, H., Turkiyyah, G.: Hierarchical algorithms on hierarchical architectures. In: Proceedings of PASC, pp. 1\u201311 (2020)","DOI":"10.1098\/rsta.2019.0055"},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.acha.2017.04.002","volume":"44","author":"Y Li","year":"2018","unstructured":"Li, Y., Yang, H., Ying, L.: Multidimensional butterfly factorization. Appl. Comput. Harmon. Anal. 44, 737\u2013758 (2018)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"12","key":"25_CR28","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1109\/TVCG.2014.2346458","volume":"20","author":"P Lindstrom","year":"2014","unstructured":"Lindstrom, P.: Fixed-rate compressed floating-point arrays. IEEE Trans. Vis. Comput. Graph. 20(12), 2674\u20132683 (2014)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Ltaief, H., Cranney, J., Gratadour, D., Hong, Y., Gatineau, L., Keyes, D.: Meeting the real-time challenges of ground-based telescopes using low-rank matrix computations. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2021 (2021)","DOI":"10.1145\/3458817.3476225"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Luo, H., et al.: Identifying latent reduced models to precondition lossy compression. In: 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 293\u2013302 (2019)","DOI":"10.1109\/IPDPS.2019.00039"},{"key":"25_CR31","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10494-020-00171-9","volume":"106","author":"MB Luong","year":"2021","unstructured":"Luong, M.B., Desai, S., Hern\u00e1ndez P\u00e9rez, F.E., et al.: Effects of turbulence and temperature fluctuations on knock development in an ethanol\/air mixture. Flow Turbul. Combust. 106, 575\u2013595 (2021)","journal-title":"Flow Turbul. Combust."},{"key":"25_CR32","doi-asserted-by":"publisher","first-page":"5781","DOI":"10.1016\/j.proci.2020.05.044","volume":"38","author":"MB Luong","year":"2021","unstructured":"Luong, M.B., Desai, S., Hern\u00e1ndez P\u00e9rez, F.E., et al.: A statistical analysis of developing knock intensity in a mixture with temperature inhomogeneities. Proc. Combust. Inst. 38, 5781\u20135789 (2021)","journal-title":"Proc. Combust. Inst."},{"key":"25_CR33","series-title":"Green Energy and Technology","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-981-16-2648-7_14","volume-title":"Advances in Energy and Combustion","author":"MB Luong","year":"2022","unstructured":"Luong, M.B., Im, H.G.: Direct numerical simulation of\u00a0preignition and knock in engine conditions. In: Gupta, A.K., De, A., Aggarwal, S.K., Kushari, A., Runchal, A.K. (eds.) Advances in Energy and Combustion. GET, pp. 311\u2013336. Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-16-2648-7_14"},{"issue":"3","key":"25_CR34","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1073\/pnas.0803205106","volume":"106","author":"MW Mahoney","year":"2009","unstructured":"Mahoney, M.W., Drineas, P.: CUR matrix decompositions for improved data analysis. Proc. Natl. Acad. Sci. 106(3), 697\u2013702 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"25_CR35","unstructured":"Mary, T.: Block low-rank multifrontal solvers: complexity, performance, and scalability. Ph.D. thesis, Paul Sabatier University, Toulouse, France (2017)"},{"key":"25_CR36","doi-asserted-by":"crossref","unstructured":"Massei, S., Robol, L., Kressner, D.: Hierarchical adaptive low-rank format with applications to discretized PDEs (2021). https:\/\/arxiv.org\/abs\/2104.11456","DOI":"10.1002\/nla.2448"},{"issue":"4","key":"25_CR37","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/2930660","volume":"42","author":"FH Rouet","year":"2016","unstructured":"Rouet, F.H., Li, X.S., Ghysels, P., Napov, A.: A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization. ACM Trans. Math. Softw. (TOMS) 42(4), 27 (2016)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"25_CR38","doi-asserted-by":"crossref","unstructured":"Yu, C.D., Levitt, J., Reiz, S., Biros, G.: Geometry-oblivious FMM for compressing dense SPD matrices. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2017 (2017)","DOI":"10.1145\/3126908.3126921"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2022: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-12597-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T23:14:14Z","timestamp":1660259654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-12597-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031125966","9783031125973"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-12597-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"102","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.97","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}