research
∙
05/18/2023
Blendstrings: an environment for computing with smooth functions
A "blendstring" is a piecewise polynomial interpolant with high-degree t...
share
research
∙
02/15/2022
Bohemian Matrix Geometry
A Bohemian matrix family is a set of matrices all of whose entries are d...
research
∙
03/25/2021
Approximate GCD in Lagrange bases
For a pair of polynomials with real or complex coefficients, given in an...
research
∙
02/19/2021
Equivalences for Linearizations of Matrix Polynomials
One useful standard method to compute eigenvalues of matrix polynomials ...
research
∙
07/13/2020
Inverse Cubic Iteration
There are thousands of papers on rootfinding for nonlinear scalar equati...
research
∙
07/09/2020
Blends in Maple
A blend of two Taylor series for the same smooth real- or complex-valued...
research
∙
10/04/2019
Approximate GCD in a Bernstein basis
We adapt Victor Y. Pan's root-based algorithm for finding approximate GC...
research
∙
07/23/2019
Upper Hessenberg and Toeplitz Bohemians
We look at Bohemians, specifically those with population {-1, 0, +1} and...
research
∙
09/27/2018
Bohemian Upper Hessenberg Toeplitz Matrices
We look at Bohemian matrices, specifically those with entries from {-1, ...
research
∙
09/27/2018
Bohemian Upper Hessenberg Matrices
We look at Bohemian matrices, specifically those with entries from {-1, ...
research
∙
01/16/2018
A random walk through experimental mathematics
We describe our adventures in creating a new first-year course in Experi...
research
∙
12/05/2017