BYU

Abstract by Natalie Larsen

Personal Infomation


Presenter's Name

Natalie Larsen

Degree Level

Undergraduate

Co-Authors

Suzanna Stephenson
Lukas Erekson
Daniel Christensen
Hayden Ringer

Abstract Infomation


Department

Mathematics

Faculty Advisor

Tyler Jarvis

Title

Checking Existence of Roots in Numerical Root-finding

Abstract

We have developed a multivariate numerical rootfinding algorithm that finds all real zeros in a given compact region of a system of functions, using a mix of subdivision and eigenvalue methods. As part of the root-finding algorithm, we look to throw out intervals that surely have no roots in them. Using the properties of Chebyshev polynomials we have developed some quick checks for that purpose. We discuss potential additional checks and how this affects the overall algorithm.