Cover Image

Deterministic complexity analysis of Hermitian eigenproblems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Sobczyk, Aleksandros
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Numerical Analysis 65F15 F.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

I/O complexity and pebble games with partial computations
by: Sobczyk, Aleksandros
Published: (2024)

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

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)

Algorithm-agnostic low-rank approximation of operator monotone matrix functions
by: Persson, David, et al.
Published: (2023)

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

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

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

Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number
by: Koiran, Pascal, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

Hutchinson's Estimator is Bad at Kronecker-Trace-Estimation
by: Meyer, Raphael A., et al.
Published: (2023)

Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra
by: Meyer, Raphael A., et al.
Published: (2025)

Linear-Scaling Tensor Train Sketching
by: Cazeaux, Paul, et al.
Published: (2026)

Faster Linear Algebra Algorithms with Structured Random Matrices
by: Camaño, Chris, et al.
Published: (2025)

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

Min-CSPs on Complete Instances
by: Anand, Aditya, et al.
Published: (2024)

The Structural Complexity of Matrix-Vector Multiplication
by: Anand, Emile, et al.
Published: (2025)

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

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

Certified Model Order Reduction for parametric Hermitian eigenproblems
by: Manucci, Mattia, et al.
Published: (2025)

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

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

Even Faster Kernel Matrix Linear Algebra via Density Estimation
by: Shah, Rikhav, et al.
Published: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
by: Bläsius, Thomas, et al.
Published: (2024)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
by: Gillman, David, et al.
Published: (2025)