Ranges and Iterators for Numerical Problems
summary
Explains how to use C++ ranges and iterators to solve numerical computation problems, showing concrete techniques and libraries for expressing numeric algorithms with range-based abstractions. Covers practical approaches to designing and applying iterator-based pipelines and range utilities to make numerical code clearer and more composable.
AI-written summary · about
chapters (5)
- 0:00Start
- 0:01Ranges and iterators for numerical problems
- 10:25Numerical sequences
- 14:22Dynamical systems
- 27:44Convergence methods
related talks
01h 04mEffective Ranges: A Tutorial for Using C++2x Ranges
01h 00mBack to Basics: (Range) Algorithms in C++
01h 05mBetter C++ ranges
01h 00mMissing (and future?) C++ range concepts
01h 06mConquering C++20 Ranges
01h 04mRange adaptors - 5 years after C++20
56mThrowing Tools at Ranges
01h 01mIteration Revisited: A Safer Iteration Model for Cpp
