Fast in-place accumulation
From MaRDI portal
Cites work
- A new truncated Fourier transform algorithm
- A Strassen-like matrix multiplication suited for squaring and higher power computation
- Addition requirements for matrix and transposed matrix products
- An Algorithm for the Machine Calculation of Complex Fourier Series
- An in-place truncated Fourier transform
- An in-place truncated Fourier transform and applications to polynomial multiplication
- Computational Complexity
- Computing with a full memory: catalytic space
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- Fast in-place algorithms for polynomial operations
- Fast multiplication of large numbers
- Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power
- Gaussian elimination is not optimal
- GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
- Generic reductions for in-place polynomial multiplication
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- In-place accumulation of fast multiplication formulae
- In-place fast polynomial modular remainder
- Integer and polynomial multiplication: towards optimal Toom-Cook matrices
- Matrix multiplication, a little faster
- Modern computer algebra
- Modern computer arithmetic
- On fast multiplication of polynomials over arbitrary algebras
- On multiplication of 2 2 matrices
- On the additive complexity of 2 \(\times 2\) matrix multiplication
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- One (more) line on the most ancient algorithm in history
- Polynomial multiplication over finite fields in time O(n n)
- Simultaneous computation of the row and column rank profiles
- Some fast algorithms multiplying a matrix by its adjoint
- Strassen's algorithm is not optimally accurate
- Symmetric indefinite triangular factorization revealing the rank profile matrix
- The middle product algorithm. I: Speeding up the division and square root of power series
- The truncated fourier transform and applications
- Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
This page was built for publication: Fast in-place accumulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892749)
