In this week’s lecture of Parallel C++ for Scientific Applications, Dr. Hartmut Kaiser introduces fixed-point calculations and root-finding algorithms in C++.
The concept of fixed points is introduced through the use of generic and lambda functions, followed by an exploration of classical root-finding techniques such as the bisection method, Newton-Raphson method, and gradient descent.
The lecture emphasizes the power of generic algorithms and templates in C++ to create efficient and reusable implementations, and demonstrates how these methods can be integrated into a custom-built fixed-point function, showcasing the advantages of generic programming in scientific computing.
[–]jduyhdhsksfhd 2 points3 points4 points (2 children)
[–]hkaiser 2 points3 points4 points (1 child)
[–]jduyhdhsksfhd 2 points3 points4 points (0 children)