Imagen de Portada

Permutation-Avoiding FFT-Based Convolution

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Venkovic, Nicolas, Anzt, Hartwig
Formato:	Preprint
Publicado:	2025
Materias:	Numerical Analysis Data Structures and Algorithms Mathematical Software
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A New Initial Approximation Bound in the Durand Kerner Algorithm for Finding Polynomial Zeros
por: Sanjoyo, B. A., et al.
Publicado: (2025)

A square root algorithm faster than Newton's method for multiprecision numbers, using floating-point arithmetic
por: Romano, Fabio
Publicado: (2024)

Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
por: Shao, Xuancheng, et al.
Publicado: (2007)

Global iterative methods for sparse approximate inverses of symmetric positive-definite matrices
por: Venkovic, Nicolas, et al.
Publicado: (2025)

Block Encoding of Sparse Matrices via Coherent Permutation
por: Setty, Abhishek
Publicado: (2025)

Quasi-Monte Carlo Beyond Hardy-Krause
por: Bansal, Nikhil, et al.
Publicado: (2024)

Efficient generation of expected-degree graphs via edge-arrivals
por: D'Angelo, Gianlorenzo, et al.
Publicado: (2026)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
por: Bentert, Matthias, et al.
Publicado: (2025)

Sublinear Time Low-Rank Approximation of Hankel Matrices
por: Kapralov, Michael, et al.
Publicado: (2025)

Preserving Extreme Singular Values with One Oblivious Sketch
por: Mango, John M., et al.
Publicado: (2025)

Complex Mean and Variance of Linear Regression Model for High-Noised Systems by Kriging
por: Suslo, Tomasz
Publicado: (2005)

Stochastic Rounding 2.0, with a View towards Complexity Analysis
por: Drineas, Petros, et al.
Publicado: (2024)

The Lanczos algorithm for matrix functions: a handbook for scientists
por: Chen, Tyler
Publicado: (2024)

Algorithms and data structures for numerical computations with automatic precision estimation
por: Netay, Igor V.
Publicado: (2024)

Near-optimal hierarchical matrix approximation from matrix-vector products
por: Chen, Tyler, et al.
Publicado: (2024)

Stability of the Lanczos Method for Matrix Function Approximation
por: Musco, Cameron, et al.
Publicado: (2017)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
por: Amsel, Noah, et al.
Publicado: (2026)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
por: Chen, Tyler, et al.
Publicado: (2022)

Fixed-sparsity matrix approximation from matrix-vector products
por: Amsel, Noah, et al.
Publicado: (2024)

Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
por: Balabanov, Oleg, et al.
Publicado: (2022)

Analysis of Different Algorithmic Design Techniques for Seam Carving
por: Aijaz, Owais, et al.
Publicado: (2024)

Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
por: Larsen, Brett W., et al.
Publicado: (2022)

Fast algorithms for least square problems with Kronecker lower subsets
por: Malik, Osman Asif, et al.
Publicado: (2022)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
por: Musco, Cameron, et al.
Publicado: (2024)

Finer-Grained Hardness of Kernel Density Estimation
por: Alman, Josh, et al.
Publicado: (2024)

On the Robustness of the Successive Projection Algorithm
por: Barbarino, Giovanni, et al.
Publicado: (2024)

Diagonally-Addressed Matrix Nicknack: How to improve SpMV performance
por: Saak, Jens, et al.
Publicado: (2023)

Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
por: Cai, Xufeng, et al.
Publicado: (2025)

Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, $MAM^*$!
por: Boahen, Edem, et al.
Publicado: (2025)

Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators
por: Linares, Deijany Rodriguez, et al.
Publicado: (2025)

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
por: Doney, Kyle, et al.
Publicado: (2025)

Query Efficient Structured Matrix Learning
por: Amsel, Noah, et al.
Publicado: (2025)

Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
por: Jennings, David, et al.
Publicado: (2025)

Spectral Gaps with Quantum Counting Queries and Oblivious State Preparation
por: Vazquez, Almudena Carrera, et al.
Publicado: (2025)

The matrix-vector complexity of $Ax=b$
por: Dereziński, Michał, et al.
Publicado: (2026)

Internal versus external balancing in the evaluation of graph-based number types
por: Geppert, Hanna, et al.
Publicado: (2019)

Sinkhorn Algorithm for Sequentially Composed Optimal Transports
por: Watanabe, Kazuki, et al.
Publicado: (2024)

Optimal Embedding Dimension for Sparse Subspace Embeddings
por: Chenakkod, Shabarish, et al.
Publicado: (2023)

Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
por: Chenakkod, Shabarish, et al.
Publicado: (2026)

Distributed Least Squares in Small Space via Sketching and Bias Reduction
por: Garg, Sachin, et al.
Publicado: (2024)