Computational Discovery with Newton Fractals, Bohemian Matrices, & Mandelbrot Polynomials
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917736842526720 |
|---|---|
| author | Calkin, Neil J. Chan, Eunice Y. S. Corless, Robert M. |
| author_facet | Calkin, Neil J. Chan, Eunice Y. S. Corless, Robert M. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_03765 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Computational Discovery with Newton Fractals, Bohemian Matrices, & Mandelbrot Polynomials Calkin, Neil J. Chan, Eunice Y. S. Corless, Robert M. History and Overview 97-02 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. |
| title | Computational Discovery with Newton Fractals, Bohemian Matrices, & Mandelbrot Polynomials |
| topic | History and Overview 97-02 |
| url | https://arxiv.org/abs/2109.03765 |