Cover Image

Fast algorithms for complex-valued discrete Fourier transform with separate real and imaginary inputs/outputs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Cariow, Aleksandr
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms 65T50
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An inexact augmented Lagrangian algorithm for unsymmetric saddle-point systems
by: Huang, N., et al.
Published: (2024)

Precision Arithmetic: A New Floating-Point Arithmetic
by: Wang, Chengpu
Published: (2006)

A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
by: Guidotti, Nicolas L., et al.
Published: (2023)

Nonlinear transformation of complex amplitudes via quantum singular value transformation
by: Guo, Naixu, et al.
Published: (2021)

Debiasing Polynomial and Fourier Regression
by: Camaño, Chris, et al.
Published: (2025)

Safety-Certified CRT Sparse FFT: $Ω(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case
by: Flouro, Aaron R., et al.
Published: (2026)

Fast Leaf-to-Ancestor Minimum Query in the Oracle Model
by: Upirvitskiy, Aleksey, et al.
Published: (2026)

Deterministic complexity analysis of Hermitian eigenproblems
by: Sobczyk, Aleksandros
Published: (2024)

Fast exact algorithms via the Matrix Tree Theorem
by: Arvind, V., et al.
Published: (2025)

Did Fourier Really Meet Möbius? Fast Subset Convolution via FFT
by: Stoian, Mihail
Published: (2024)

Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
by: Chakraborty, Shantanav, et al.
Published: (2025)

Fast approximation algorithms for the 1-median problem on real-world large graphs
by: Ueta, Keisuke, et al.
Published: (2025)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
by: Alman, Josh, et al.
Published: (2025)

Quasi-optimal hierarchically semi-separable matrix approximation
by: Amsel, Noah, et al.
Published: (2025)

Accelerating ERM for data-driven algorithm design using output-sensitive techniques
by: Balcan, Maria-Florina, et al.
Published: (2022)

Superfast direct inversion of the nonuniform discrete Fourier transform via hierarchically semi-separable least squares
by: Wilber, Heather, et al.
Published: (2024)

Optimization with pattern-avoiding input
by: Berendsohn, Benjamin Aram, et al.
Published: (2023)

Communication efficient application of sequences of planar rotations to a matrix
by: Steel, Thijs, et al.
Published: (2024)

Oblivious Subspace Injection Is Not Enough for Relative Error
by: Townsend, Alex, et al.
Published: (2026)

Make the most of what you have: Resource-efficient randomized algorithms for matrix computations
by: Epperly, Ethan N.
Published: (2025)

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

Fast algorithms for classical specifications of stabiliser states and Clifford gates
by: de Silva, Nadish, et al.
Published: (2023)

The clustered Sparrow algorithm
by: Dumitrescu, Cristian
Published: (2018)

Quantum algorithm for approximating the expected value of a random-exist quantified oracle
by: Rotello, Caleb
Published: (2024)

A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
by: Yang, Yang
Published: (2024)

Streaming algorithms for products of probabilities
by: Lohrey, Markus, et al.
Published: (2025)

Parameterized algorithms for $k$-Inversion
by: Antony, Dhanyamol, et al.
Published: (2026)

Fast quantum algorithm for differential equations
by: Bagherimehrab, Mohsen, et al.
Published: (2023)

A practical algorithm for 3-admissibility
by: Awofeso, Christine, et al.
Published: (2025)

New algorithms for girth and cycle detection
by: Roditty, Liam, et al.
Published: (2025)

Engineering Semi-streaming DFS algorithms
by: Bhagavan, Kancharla Nikhilesh, et al.
Published: (2024)

Insights into $(k,ρ)$-shortcutting algorithms
by: Leonhardt, Alexander, et al.
Published: (2024)

Practical algorithms for Hierarchical overlap graphs
by: Talera, Saumya, et al.
Published: (2024)

Fast Similarity Sketching
by: Dahlgaard, Søren, et al.
Published: (2017)

Fast Computation of the Discrete Fourier Transform Rectangular Index Coefficients
by: Queiroz, Saulo, et al.
Published: (2025)

Fast Computation of the Discrete Fourier Transform Square Index Coefficients
by: Queiroz, Saulo, et al.
Published: (2024)

Rate-optimal community detection near the KS threshold via node-robust algorithms
by: Ding, Jingqiu, et al.
Published: (2025)

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
by: Jennings, David, et al.
Published: (2023)

Strassen's algorithm via orbit flip graphs
by: Ikenmeyer, Christian, et al.
Published: (2025)

Faster parameterized algorithm for 3-Hitting Set
by: Tsur, Dekel
Published: (2025)