m (XXV. Fun Problems)
m (XXV. Fun Problems)
 
Line 11: Line 11:
  
 
* [[Super root-finding algorithms]] - like [https://en.wikipedia.org/wiki/Brent%27s_method Brent's method] which is robust and hybrid so a great topic of study for students.
 
* [[Super root-finding algorithms]] - like [https://en.wikipedia.org/wiki/Brent%27s_method Brent's method] which is robust and hybrid so a great topic of study for students.
 +
 +
* [[CORDIC algorithms]] to efficiently compute trigonometric functions, square roots and similar things with only basic bitwise arithmetic (see [https://en.wikipedia.org/wiki/CORDIC on Wikipedia]).
  
 
=== Interactivity ===
 
=== Interactivity ===

Latest revision as of 19:13, 22 March 2021

Crash Course in Scientific Computing

XXV. Fun Problems

Fun problems make great topics for graded projects. These are the ones we ran in our course:

Possible topics:

  • CORDIC algorithms to efficiently compute trigonometric functions, square roots and similar things with only basic bitwise arithmetic (see on Wikipedia).

Interactivity

https://stackoverflow.com/questions/58014289/inline-interactive-plots-with-julia-in-jupyter-notebook