## Communications in Applied Mathematics and Computational Science

### Theoretically optimal inexact spectral deferred correction methods

#### Abstract

In several initial value problems with particularly expensive right-hand side evaluation or implicit step computation, there is a tradeoff between accuracy and computational effort. We consider inexact spectral deferred correction (SDC) methods for solving such initial value problems. SDC methods are interpreted as fixed-point iterations and, due to their corrective iterative nature, allow one to exploit the accuracy-work tradeoff for a reduction of the total computational effort. First we derive error models bounding the total error in terms of the evaluation errors. Then we define work models describing the computational effort in terms of the evaluation accuracy. Combining both, a theoretically optimal local tolerance selection is worked out by minimizing the total work subject to achieving the requested tolerance. The properties of optimal local tolerances and the predicted efficiency gain compared to simpler heuristics, and reasonable practical performance, are illustrated with simple numerical examples.

#### Article information

Source
Commun. Appl. Math. Comput. Sci., Volume 13, Number 1 (2018), 53-86.

Dates
Revised: 30 October 2017
Accepted: 30 October 2017
First available in Project Euclid: 28 March 2018

https://projecteuclid.org/euclid.camcos/1522202439

Digital Object Identifier
doi:10.2140/camcos.2018.13.53

Mathematical Reviews number (MathSciNet)
MR3778320

Zentralblatt MATH identifier
06864866

#### Citation

Weiser, Martin; Ghosh, Sunayana. Theoretically optimal inexact spectral deferred correction methods. Commun. Appl. Math. Comput. Sci. 13 (2018), no. 1, 53--86. doi:10.2140/camcos.2018.13.53. https://projecteuclid.org/euclid.camcos/1522202439

#### References

• P. Alfeld, Fixed point iteration with inexact function values, Math. Comp. 38 (1982), no. 157, 87–98.
• M. P. Allen and D. J. Tildesley, Computer simulation of liquids, Oxford University, 1987.
• P. Amodio and L. Brugnano, A note on the efficient implementation of implicit methods for ODEs, J. Comput. Appl. Math. 87 (1997), no. 1, 1–9.
• J. Barnes and P. Hut, A hierarchical $O(N \log N)$ force-calculation algorithm, Nature 324 (1986), 446–449.
• P. Birken, Termination criteria for inexact fixed-point schemes, Numer. Linear Algebra Appl. 22 (2015), no. 4, 702–716.
• J. Carrier, L. Greengard, and V. Rokhlin, A fast adaptive multipole algorithm for particle simulations, SIAM J. Sci. Statist. Comput. 9 (1988), no. 4, 669–686.
• G. J. Cooper and J. C. Butcher, An iteration scheme for implicit Runge–Kutta methods, IMA J. Numer. Anal. 3 (1983), no. 2, 127–140.
• G. J. Cooper and R. Vignesvaran, A scheme for the implementation of implicit Runge–Kutta methods, Computing 45 (1990), no. 4, 321–332.
• P. Deuflhard and F. Bornemann, Scientific computing with ordinary differential equations, Texts Appl. Math., no. 42, Springer, 2002.
• F. P. E. Dunne and D. R. Hayhurst, Efficient cycle jumping techniques for the modelling of materials and structures under cyclic mechanical and thermal loading, Eur. J. Mech. A Solid. 13 (1994), no. 5, 639–660.
• A. Dutt, L. Greengard, and V. Rokhlin, Spectral deferred correction methods for ordinary differential equations, BIT 40 (2000), no. 2, 241–266.
• B. V. Faleichik, Analytic iterative processes and numerical algorithms for stiff problems, Comput. Methods Appl. Math. 8 (2008), no. 2, 116–129.
• K. Frischmuth and D. Langemann, Numerical calculation of wear in mechanical systems, Math. Comput. Simulation 81 (2011), no. 12, 2688–2701.
• E. Gallicchio, S. A. Egorov, and B. J. Berne, On the application of numerical analytic continuation methods to the study of quantum mechanical vibrational relaxation processes, J. Chem. Phys. 109 (1998), no. 18, 7745–7755.
• R. W. S. Grout, Mixed-precision spectral deferred correction, preprint CP-2C00-64959, National Renewable Energy Laboratory, 2015.
• S. Güttel and J. W. Pearson, A rational deferred correction approach to PDE-constrained optimization, preprint, University of Kent, 2016.
• E. Hairer, S. P. Nørsett, and G. Wanner, Solving ordinary differential equations, I: Nonstiff problems, 2nd ed., Springer Series Comput. Math., no. 8, Springer, 1993.
• J. Huang, J. Jia, and M. Minion, Accelerating the convergence of spectral deferred correction methods, J. Comput. Phys. 214 (2006), no. 2, 633–656.
• L. O. Jay and T. Braconnier, A parallelizable preconditioner for the iterative solution of implicit Runge–Kutta-type methods, J. Comput. Appl. Math. 111 (1999), no. 1–2, 63–76.
• M. L. Minion, R. Speck, M. Bolten, M. Emmett, and D. Ruprecht, Interweaving PFASST and parallel multigrid, SIAM J. Sci. Comput. 37 (2015), no. 5, S244–S263.
• J. Nocedal and S. J. Wright, Numerical optimization, Springer, 1999.
• J. M. Ortega and W. C. Rheinboldt, Iterative solution of nonlinear equations in several variables, Academic, 1970.
• C. Schütte, A. Nielsen, and M. Weber, Markov state models and molecular alchemy, Mol. Phys. 113 (2015), no. 1, 69–78.
• R. Speck, D. Ruprecht, M. Minion, M. Emmett, and R. Krause, Inexact spectral deferred corrections, Domain decomposition methods in science and engineering XXII (T. Dickopf, M. J. Gander, L. Halpern, R. Krause, and L. F. Pavarino, eds.), Lect. Notes Comput. Sci. Eng., no. 104, Springer, 2016, pp. 389–396.
• W. Tutschke, Solution of initial value problems in classes of generalized analytic functions, Springer, 1989.
• P. J. van der Houwen and J. J. B. de Swart, Triangularly implicit iteration methods for ODE-IVP solvers, SIAM J. Sci. Comput. 18 (1997), no. 1, 41–55.
• M. Weiser, Faster SDC convergence on non-equidistant grids by DIRK sweeps, BIT 55 (2015), no. 4, 1219–1241.
• M. Wilhelms, G. Seemann, M. Weiser, and O. Dössel, Benchmarking solvers of the monodomain equation in cardiac electrophysiological modeling, Biomed. Eng. 55 (2010), 99–102.