{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:10:16Z","timestamp":1759839016775,"version":"3.41.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T00:00:00Z","timestamp":1521763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"J.T. Oden Faculty Fellow"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2018,9,30]]},"abstract":"<jats:p>Large-scale linear systems arise in finite-difference and finite-element discretizations of elliptic problems. With increasing computer performance, ever larger systems are solved using direct methods. How large can such systems be without roundoff compromising accuracy?<\/jats:p>\n          <jats:p>\n            Here we model roundoff dynamics in standard\n            <jats:italic>LU<\/jats:italic>\n            and\n            <jats:italic>LDL<\/jats:italic>\n            <jats:sup>T<\/jats:sup>\n            decompositions with respect to problem size\n            <jats:italic>N<\/jats:italic>\n            . For the one-dimensional (1D) Poisson equation with Dirichlet boundary conditions on an equidistant grid, we show that the relative error in the factorized matrix grows like O(\u03b5 \u221a\n            <jats:italic>N<\/jats:italic>\n            ) if roundoffs are modeled as independent, expectation zero random variables. With bias, the growth rate changes to O(\u03b5\n            <jats:italic>N<\/jats:italic>\n            ).\n          <\/jats:p>\n          <jats:p>\n            Subsequent back substitution results in typical error growths of O(\u03b5\n            <jats:italic>N<\/jats:italic>\n            \u221a\n            <jats:italic>N<\/jats:italic>\n            ) and O(\u03b5\n            <jats:italic>N<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            ), respectively. Error growth is governed by the dynamics of the computational process and by the structure of the boundary conditions rather than by the condition number. Computational results are demonstrated in several examples, including a few fourth-order 1D problems and second-order 2D problems, showing that error accumulation depends strongly on the solution method. Thus, the same\n            <jats:italic>LU<\/jats:italic>\n            solver may exhibit different growth rates for the same 2D Poisson problem, depending on whether the five-point or nine-point FDM operator is used.\n          <\/jats:p>","DOI":"10.1145\/3134444","type":"journal-article","created":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T12:29:49Z","timestamp":1521808189000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["On Roundoff Error Growth in Elliptic Problems"],"prefix":"10.1145","volume":"44","author":[{"given":"Ivo","family":"Babu\u0161ka","sequence":"first","affiliation":[{"name":"ICES, The University of Texas at Austin, Austin, Texas"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustaf","family":"S\u00f6derlind","sequence":"additional","affiliation":[{"name":"Center for Mathematical Sciences, Lund University, Lund, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,3,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/504210.504212"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"I. Babu\u0161ka and U. Banerjee. 2012. Stable generalized finite element method (SGFEM). Comput. Methods Appl. Mech. Engg. 201--204 (2012) 91--111.  I. Babu\u0161ka and U. Banerjee. 2012. Stable generalized finite element method (SGFEM). Comput. Methods Appl. Mech. Engg. 201--204 (2012) 91--111.","DOI":"10.1016\/j.cma.2011.09.012"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02251834"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"F. Chaitin-Chatelin and V. Frayss\u00e9. 1996. Lectures on Finite Precision Computations. SIAM Philadelphia PA.  F. Chaitin-Chatelin and V. Frayss\u00e9. 1996. Lectures on Finite Precision Computations. SIAM Philadelphia PA.","DOI":"10.1137\/1.9780898719673"},{"key":"e_1_2_1_5_1","unstructured":"G. Forsythe and C. B. Moler. 1967. Computer Solution of Linear Algebraic Systems. Prentice Hall Englewood Cliffs NJ.  G. Forsythe and C. B. Moler. 1967. Computer Solution of Linear Algebraic Systems. Prentice Hall Englewood Cliffs NJ."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/103162.103163"},{"volume-title":"Matrix Computations (3rd. ed.)","author":"Golub G. H.","key":"e_1_2_1_7_1"},{"volume-title":"Accuracy and Stability of Numerical Algorithms","author":"Higham N. J.","key":"e_1_2_1_8_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718027"},{"volume-title":"Advanced Topics in Sampling and Interpolation Theory","author":"Jerri A. J.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","unstructured":"W. Kahan. 2013. Floating-point Tricks to Solve Boundary-Value Problems Faster. Mathematics and Computer Science Departments UC Berkeley. Retrieved from https:\/\/www.cs.berkeley.edu\/wkahan\/Math128\/FloTrik.pdf.  W. Kahan. 2013. Floating-point Tricks to Solve Boundary-Value Problems Faster. Mathematics and Computer Science Departments UC Berkeley. Retrieved from https:\/\/www.cs.berkeley.edu\/wkahan\/Math128\/FloTrik.pdf."},{"key":"e_1_2_1_11_1","unstructured":"W. Kahan and M. Y. Ivory. 1997. Roundoff Degrades an Idealized Cantilever. Mathematics and Computer Science Departments UC Berkeley. Retrieved from https:\/\/www.cs.berkeley.edu\/wkahan\/Cantilever.ps.  W. Kahan and M. Y. Ivory. 1997. Roundoff Degrades an Idealized Cantilever. Mathematics and Computer Science Departments UC Berkeley. Retrieved from https:\/\/www.cs.berkeley.edu\/wkahan\/Cantilever.ps."},{"volume-title":"Effective Conition Number for Partial Differential Equations. Number 55 in Series in Information and Computational Science","author":"Li Z.-C.","key":"e_1_2_1_12_1"},{"volume-title":"Numerical Computing with IEEE Floating Poimnt Arithmetic","author":"Overton M. L.","key":"e_1_2_1_13_1"},{"volume-title":"Sparse Matrix Technology","author":"Pissanetzky S.","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90423-8"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2014.02.031"},{"key":"e_1_2_1_17_1","unstructured":"Wikipedia. 2016. Preferred number. Retrieved from https:\/\/en.wikipedia.org\/wiki\/Preferred_number.  Wikipedia. 2016. Preferred number. Retrieved from https:\/\/en.wikipedia.org\/wiki\/Preferred_number."},{"volume-title":"Rounding Errors in Algebraic Processes. Her Majesty\u2019s Stationery Office","author":"Wilkinson J. H.","key":"e_1_2_1_18_1"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3134444","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3134444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:10Z","timestamp":1750217410000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3134444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,23]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9,30]]}},"alternative-id":["10.1145\/3134444"],"URL":"https:\/\/doi.org\/10.1145\/3134444","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"type":"print","value":"0098-3500"},{"type":"electronic","value":"1557-7295"}],"subject":[],"published":{"date-parts":[[2018,3,23]]},"assertion":[{"value":"2016-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-03-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}