A Fast Algorithm for Trummer’s Problem
From MaRDI portal
Publication:4728104
DOI10.1137/0908017zbMath0618.65030OpenAlexW1966591299MaRDI QIDQ4728104
Li-Ping Sun, Apostolos Gerasoulis, Michael D. Grigoriadis
Publication date: 1987
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0908017
computational complexityfast Fourier transformspolynomial evaluationpolynomial interpolationmatrix vector multiplication
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
An inversion formula and fast algorithms for Cauchy-Vandermonde matrices ⋮ Matrix structure and loss-resilient encoding/decoding ⋮ Factorizations of Cauchy matrices ⋮ Orthogonal Cauchy-like matrices ⋮ Rational interpolation and recursive solution of Löwner-Vandermonde systems of equations ⋮ Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function ⋮ Nearly optimal computations with structured matrices ⋮ A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors ⋮ Fast approximate computations with Cauchy matrices and polynomials ⋮ Coefficient-free adaptations of polynomial root-finders
This page was built for publication: A Fast Algorithm for Trummer’s Problem
