15 citations · 27 across the 6 of their papers we have counts for
6 papers
Cucheb: A GPU implementation of the filtered Lanczos procedure
Jared L. Aurentz, Vassilis Kalantzis, Yousef Saad
This paper describes the software package Cucheb, a GPU implementation of the filtered Lanczos procedure for the solution of large sparse symmetric eigenvalue problems. The filtere…
The Laurent-Horner method for validated evaluation of Chebyshev expansions
Jared L. Aurentz, Behnam Hashemi
We develop a simple two-step algorithm for enclosing Chebyshev expansions whose cost is linear in terms of the polynomial degree. The algorithm first transforms the expansion from…
On symmetrizing the ultraspherical spectral method for self-adjoint problems
Jared Lee Aurentz, Richard Mikael Slevinsky
A mechanism is described to symmetrize the ultraspherical spectral method for self-adjoint problems. The resulting discretizations are symmetric and banded. An algorithm is present…
Fast and backward stable computation of the eigenvalues and eigenvectors of matrix polynomials
Jared Aurentz, Thomas Mach, Leonardo Robol +2
In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigen…
Fast and backward stable computation of roots of polynomials, Part II: backward error analysis; companion matrix and companion pencil
Jared L. Aurentz, Thomas Mach, Leonardo Robol +2
This work is a continuation of "Fast and backward stable computation of roots of polynomials" by J.L. Aurentz, T. Mach, R. Vandebril, and D.S. Watkins, SIAM Journal on Matrix Analy…
Chopping a Chebyshev Series
Jared L. Aurentz, Lloyd N. Trefethen
Chebfun and related software projects for numerical computing with functions are based on the idea that at each step of a computation, a function defined on an interval $[a,…