Ranges and iterators for numerical problems

Ranges and iterators are the fundamental abstractions when one needs to generalize traversion of arbitrary collections of data. In this talk I will show how these concepts can be applied for numerical problems. Examples will range from representing arbitrary functions, to differential equations and cellular automatons. One advantage is that the algorithms from the C++ standard library or boost can be applied directly to numerical problems. We will show how this will lead to cleaner and less error-prone code.

Speaker: Karsten Ahnert

Slides: Ranges and iterators for numerical problems


Go back