The complexity of the matrix eigenproblem
DOI10.1145/301250.301389zbMATH Open1346.68103OpenAlexW2091075671MaRDI QIDQ2819583FDOQ2819583
Authors: Victor Y. Pan, Zhao Q. Chen 
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301389
Recommendations
Eigenvalues, singular values, and eigenvectors (15A18) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (35)
- Stochastic semidiscretization method: second moment stability analysis of linear stochastic periodic dynamical systems with delays
- An adaptive local reduced basis method for solving PDEs with uncertain inputs and evaluating risk
- On eventual non-negativity and positivity for the weighted sum of powers of matrices
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- Constrained polynomial zonotopes
- Hermitian matrix definiteness from quantum phase estimation
- Typical case complexity of satisfiability algorithms and the threshold phenomenon
- Identifying complexity by means of matrices
- Multilevel Artificial Neural Network Training for Spatially Correlated Learning
- An SDP primal-dual algorithm for approximating the Lovász-theta function
- Distributionally robust inverse covariance estimation: the Wasserstein shrinkage estimator
- Bounds on skyline probability for databases with uncertain preferences
- Complexity results for some eigenvector problems
- First-order continuous- and discontinuous-Galerkin moment models for a linear kinetic equation: realizability-preserving splitting scheme and numerical analysis
- Distributed resource allocation with binary decisions via Newton-like neural network dynamics
- A feasible \(k\)-means kernel trick under non-Euclidean feature space
- An ellipsoidal bounding scheme for the quasi-clique number of a graph
- Learning methods for structural damage detection via entropy‐based sensors selection
- An approximation algorithm for the maximum spectral subgraph problem
- The Complexity of Diagonalization
- Computing the asymptotic distribution of second-order \(U\)- and \(V\)-statistics
- Estimating the extremal eigenvalues of a symmetric matrix
- Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension
- AMID: approximation of multi-measured data using SVD
- The robust minimal controllability problem
- Generalized Principal Component Analysis: Projection of Saturated Model Parameters
- Dynamic normal forms and dynamic characteristic polynomial
- Algebraic connectivity of network-of-networks having a graph product structure
- New spectral bounds on \(\mathcal{H}_2\)-norm of linear dynamical networks
- A new trust region technique for the maximum weight clique problem
- A randomized homotopy for the Hermitian eigenpair problem
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- Eigenvalue-flipping algorithm for matrix Monte Carlo
- High-performance processing of covariance matrices using GPU computations
This page was built for publication: The complexity of the matrix eigenproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819583)
