Ivo Babuška
Abstract
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?
Here we model roundoff dynamics in standard LU and LDLT decompositions with respect to problem size 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(ε √ N) if roundoffs are modeled as independent, expectation zero random variables. With bias, the growth rate changes to O(ε N).
Subsequent back substitution results in typical error growths of O(ε N √N) and O(ε N2), 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 LU 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.
- P. R. Amestoy, I. S. Duff, J.-Y. L’Excellent, and X. S. Li. 2001. Analysis and comparison of two general sparse solvers for distributed memory computers. ACM Transactions on Mathematical Software (TOMS’01) 27, 4 (2001), 388--421. Google Scholar
Digital Library
- I. Babuška and U. Banerjee. 2012. Stable generalized finite element method (SGFEM). Comput. Methods Appl. Mech. Engg. 201--204 (2012), 91--111.Google Scholar
- J. L. Barlow and E. H. Bareiss. 1985. Probabilistic error analysis of gaussian elimination in floating point and logarithmic arithmetic. Computing 34, 4 (1985), 349--364. Google ScholarDigital Library
- F. Chaitin-Chatelin and V. Frayssé. 1996. Lectures on Finite Precision Computations. SIAM, Philadelphia, PA.Google Scholar
- G. Forsythe and C. B. Moler. 1967. Computer Solution of Linear Algebraic Systems. Prentice Hall, Englewood Cliffs, NJ.Google Scholar
- D. Goldberg. 1991. What every computer scientist should know about floating-point arithmetic. Computing Surveys. Retrieved from http://www.validlab.com/goldberg/paper.pdf. Google ScholarDigital Library
- G. H. Golub and C. F. van Loan. 1996. Matrix Computations (3rd. ed.). Johns Hopkins University Press, Baltimore, MD. Google ScholarDigital Library
- N. J. Higham. 1996. Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia, PA. Google Scholar
- A. J. Jerri. 1993. Advanced Topics in Sampling and Interpolation Theory. R. J. Marks II, editor. Springer Verlag, New York, NY.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Z.-C. Li, H.-T. Huang, Y. Wei, and A. H.-D. Cheng. 2013. Effective Conition Number for Partial Differential Equations. Number 55 in Series in Information and Computational Science. Science Press, Beijing.Google Scholar
- M. L. Overton. 2001. Numerical Computing with IEEE Floating Poimnt Arithmetic. SIAM, Philadelphia, PA. Google ScholarDigital Library
- S. Pissanetzky. 1984. Sparse Matrix Technology. Academic Press, London.Google Scholar
- J. Sun. 1992. Rounding-error and perturbation bounds for the Cholesky and L D LT Factorizations. Lin. Alg. Appl. 173 (1992), 77--97.Google ScholarCross Ref
- M. Svärd and J. Nordström. 2014. Review of summation-by-parts schemes for initial-boundary value problems. J. Comp. Phys. 268 (2014), 17--38.Google ScholarCross Ref
- Wikipedia. 2016. Preferred number. Retrieved from https://en.wikipedia.org/wiki/Preferred_number.Google Scholar
- J. H. Wilkinson. 1963. Rounding Errors in Algebraic Processes. Her Majesty’s Stationery Office, London.Google Scholar
Index Terms
- On Roundoff Error Growth in Elliptic Problems
Recommendations
Error Estimates for the Numerical Approximation of Boundary Semilinear Elliptic Control Problems
We study the numerical approximation of boundary optimal control problems governed by semilinear elliptic partial differential equations with pointwise constraints on the control. The analysis of the approximate control problems is carried out. The ...
Families of High Order Accurate Discretizations of Some Elliptic Problems
In this paper we construct and analyze high order finite difference discretizations of a class of elliptic partial differential equations. In particular, two one-parameter families of fourth order HODIE discretizations of the Helmholtz equation are ...
Local Error Estimates for SUPG Solutions of Advection-Dominated Elliptic Linear-Quadratic Optimal Control Problems
We derive local error estimates for the discretization of optimal control problems governed by linear advection-diffusion partial differential equations (PDEs) using the streamline upwind/Petrov Galerkin (SUPG) stabilized finite element method. We show ...
Comments