arXiv · 1110.3233
Metaprogramming Applied to Numerical Problems
Abstract
From the discovery that the template system of C++ forms a Turing complete language in 1994, a programming technique called Template Metaprogramming has emerged that allows for the creation of faster, more generic and better code. Here, we apply Template Metaprogramming to implement a generic Runge-Kutta scheme that can be used to numerically solve ordinary differential equations. We show that using Template Metaprogramming results in a significantly improved performance compared to a classical implementation.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mario Mulansky, Karsten Ahnert. 2011-10-14. Metaprogramming Applied to Numerical Problems. https://doi.org/10.1063/1.3637933
Cite the original work for its findings. Save a collection to share your selection of sources.