Using FFT-based techniques in polynomial and matrix computations: recent advances and applicatons

DOI10.1080/01630560008816939zbMath0953.65101OpenAlexW2168284561MaRDI QIDQ4484796

Dario Andrea Bini

Publication date: 29 January 2001

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630560008816939

zbMATH Keywords

algorithmsstabilitycomputational complexityMarkov chainsfast Fourier transformspolynomial factorizationToeplitz matricescyclic reductionpolynomial arithmetic

Mathematics Subject Classification ID

Related Items (1)

Polynomial factorization through Toeplitz matrix computations

Cites Work

• Theory of function spaces
• Theory of function spaces II
• Fractals and Spectra
• Entropy Numbers in Weighted Function Spaces and Eigenvalue Distributions of Some Degenerate Pseudodifferential Operators I
• Regular Elliptic Boundary Value Problems in Besov‐Triebel‐Lizorkin Spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using FFT-based techniques in polynomial and matrix computations: recent advances and applicatons