Cover Image

Extended Fourier analysis of signals

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Liepins, Vilnis
Format:	Preprint
Published:	2013
Subjects:	Data Structures and Algorithms Information Theory Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

The Empirical Spectral Distribution of i.i.d. Random Matrices with Random Perturbations
by: Chen, Kun, et al.
Published: (2024)

Probability Tools for Sequential Random Projection
by: Li, Yingru
Published: (2024)

Analysis of Langevin midpoint methods using an anticipative Girsanov theorem
by: Zhang, Matthew S.
Published: (2025)

Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions
by: Lai, Peiyao, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Shifted Composition IV: Toward Ballistic Acceleration for Log-Concave Sampling
by: Altschuler, Jason M., et al.
Published: (2025)

A Survey of Quantum Alternatives to Randomized Algorithms: Monte Carlo Integration and Beyond
by: Intallura, Philip, et al.
Published: (2023)

Algorithmic warm starts for Hamiltonian Monte Carlo
by: Zhang, Matthew S., et al.
Published: (2026)

Lower bounds for trace estimation via Block Krylov and other methods
by: Yu, Shi Jie
Published: (2025)

Shifted Composition III: Local Error Framework for KL Divergence
by: Altschuler, Jason M., et al.
Published: (2024)

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

Perturbation Bounds for Low-Rank Inverse Approximations under Noise
by: Tran, Phuc, et al.
Published: (2025)

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

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

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

Permutation-Avoiding FFT-Based Convolution
by: Venkovic, Nicolas, et al.
Published: (2025)

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

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

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

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

Block Encoding of Sparse Matrices via Coherent Permutation
by: Setty, Abhishek
Published: (2025)

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