Nearly optimal computations with structured matrices
DOI10.1016/j.tcs.2017.03.031zbMath1375.65047OpenAlexW2041922262MaRDI QIDQ5919809
Pan, Victor Y., Elias P. Tsigaridas
Publication date: 13 June 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.03.031
interpolationalgorithmfast Fourier transformpolynomialsrational functionsToeplitz matrixHankel matrixVandermonde matrixstructured matricesCauchy matrixBoolean complexityprecision of computingapproximate computationsTrummer's problemmultipoint evaluationCauchy linear systemsolution of nonsingular linear systemstransposed vandermonde matrices
Numerical interpolation (65D05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Toeplitz, Cauchy, and related matrices (15B05)
Related Items
Cites Work
- Transformations of matrix structures work again
- Nearly optimal refinement of real roots of a univariate polynomial
- A fast numerical algorithm for the composition of power series with complex coefficients
- Fast modular transforms
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
- Solving secular and polynomial equations: a multiprecision algorithm
- Stability of Methods for Solving Toeplitz Systems of Equations
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- Evaluating Polynomials at Fixed Sets of Points
- A Fast Algorithm for Trummer’s Problem
- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions
- Univariate real root isolation in an extension field
- Complex interval arithmetic
- A fast algorithm for particle simulations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
