Computational Discovery with Newton Fractals, Bohemian Matrices, & Mandelbrot Polynomials
History and Overview
2024-07-31 v1
Abstract
The authors have been using a largely algebraic form of ``computational discovery'' in various undergraduate classes at their respective institutions for some decades now to teach pure mathematics, applied mathematics, and computational mathematics. This paper describes what we mean by ``computational discovery,'' what good it does for the students, and some specific techniques that we used.
Keywords
Cite
@article{arxiv.2109.03765,
title = {Computational Discovery with Newton Fractals, Bohemian Matrices, & Mandelbrot Polynomials},
author = {Neil J. Calkin and Eunice Y. S. Chan and Robert M. Corless},
journal= {arXiv preprint arXiv:2109.03765},
year = {2024}
}
Comments
15 pages, 3 figures, accepted to ATCM 2021 atcmmathandtech.org