Cover Image

Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shao, Xuancheng, Johnson, Steven G.
Format:	Preprint
Published:	2007
Subjects:	Numerical Analysis Data Structures and Algorithms Mathematical Software F.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Matrix-by-matrix multiplication algorithm with $O(N^2log_2N)$ computational complexity for variable precision arithmetic
by: Paszyński, Maciej
Published: (2024)

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

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

Stable Iterative Solvers for Ill-conditioned Linear Systems
by: Kalantzis, Vasileios, et al.
Published: (2025)

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

Invariant subspaces and PCA in nearly matrix multiplication time
by: Sobczyk, Aleksandros, et al.
Published: (2023)

Smoothed Analysis of Interior-Point Algorithms: Condition Number
by: Dunagan, John, et al.
Published: (2003)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
by: Spielman, Daniel A., et al.
Published: (2003)

Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
by: Spielman, Daniel A., et al.
Published: (2006)

Entrywise Approximate Solutions for SDDM Systems in Almost-Linear Time
by: Farfan, Angelo, et al.
Published: (2025)

Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time
by: Hofman, Radoslaw
Published: (2006)

An O(nlogn) approximate knapsack algorithm
by: Dawes, Nick
Published: (2025)

Selective algorithm processing of subset sum distributions
by: Dawes, Nick
Published: (2024)

Does block size matter in randomized block Krylov low-rank approximation?
by: Chen, Tyler, et al.
Published: (2025)

Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
by: Kao, Ming-Yang, et al.
Published: (1999)

Model-Based Learning of Whittle indices
by: Charles-Rebuffé, Joël, et al.
Published: (2025)

Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform
by: Andersson, Joel, et al.
Published: (2026)

An 8- and 12-bit block AES cipher
by: Breuer, Peter T.
Published: (2025)

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

A 60-Addition, Rank-23 Scheme for Exact 3x3 Matrix Multiplication
by: Stapleton, Joshua
Published: (2025)

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

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

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
by: Bhattacharjee, Rajarshi, et al.
Published: (2023)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
by: Bhattacharjee, Rajarshi, et al.
Published: (2024)

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

Efficient Uniform Sampling of Surjections via their Profiles
by: Carayol, Arnaud, et al.
Published: (2026)

Beating Meet-in-the-Middle for Subset Balancing Problems
by: Randolph, Tim, et al.
Published: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
by: Randolph, Tim, et al.
Published: (2024)

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

Pop Stacks with a Bypass
by: Cioni, Lapo, et al.
Published: (2024)

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

Entrywise Approximation for Matrix Inversion and Linear Systems
by: Ghadiri, Mehrdad, et al.
Published: (2025)

Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
by: Li, Yifei
Published: (2024)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
by: Koiran, Pascal, et al.
Published: (2022)

Quantum matrix arithmetics with Hamiltonian evolution
by: Kang, Christopher, et al.
Published: (2025)

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

Quantum linear system algorithm with optimal queries to initial state preparation
by: Low, Guang Hao, et al.
Published: (2024)

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

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