Showing math.NAShow all
3 papers · 1 filter
math.NA2024
Fast measure modification of orthogonal polynomials via matrices with displacement structure
Karim Gumerov, Samantha Rigg, Richard Mikael Slevinsky
It is well known that matrices with low Hessenberg-structured displacement rank enjoy fast algorithms for certain matrix factorizations. We show how principal finite se…
math.NA2022
A recursive algorithm for an efficient and accurate computation of incomplete Bessel functions
Richard M. Slevinsky, Hassan Safouhi
In a previous work, we developed an algorithm for the computation of incomplete Bessel functions, which pose as a numerical challenge, based on the transformation and…
math.NA2021
Fast associated classical orthogonal polynomial transforms
Brock Klippenstein, Richard Mikael Slevinsky
We discuss a fast approximate solution to the associated classical -- classical orthogonal polynomial connection problem. We first show that associated classical orthogonal polynom…