Abstract by Aaron Kline
Sparse and Iterative Methods for Constructing Macaulay Matrix
In numerical root finding and when solving other problems of numerical algebra, it is often necessary to construct a special matrix called the Macaulay matrix, but this matrix tends to grow very large in many applications. I will discuss the Macaulay matrix, its importance, fast construction, and an implementation of sparse construction. I will also present several numerical applications.