The complexity of the matrix eigenproblem
From MaRDI portal
Recommendations
Cited in
(43)- Identifying complexity by means of matrices
- An adaptive local reduced basis method for solving PDEs with uncertain inputs and evaluating risk
- Distributed resource allocation with binary decisions via Newton-like neural network dynamics
- A feasible \(k\)-means kernel trick under non-Euclidean feature space
- An approximation algorithm for the maximum spectral subgraph problem
- Eigenvalue-flipping algorithm for matrix Monte Carlo
- 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
- Hermitian matrix definiteness from quantum phase estimation
- First-order continuous- and discontinuous-Galerkin moment models for a linear kinetic equation: realizability-preserving splitting scheme and numerical analysis
- Computing the asymptotic distribution of second-order \(U\)- and \(V\)-statistics
- An SDP primal-dual algorithm for approximating the Lovász-theta function
- High-performance processing of covariance matrices using GPU computations
- A randomized homotopy for the Hermitian eigenpair problem
- Bounds on skyline probability for databases with uncertain preferences
- AMID: approximation of multi-measured data using SVD
- New spectral bounds on \(\mathcal{H}_2\)-norm of linear dynamical networks
- Algebraic connectivity of network-of-networks having a graph product structure
- The robust minimal controllability problem
- Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension
- A new trust region technique for the maximum weight clique problem
- Typical case complexity of satisfiability algorithms and the threshold phenomenon
- An ellipsoidal bounding scheme for the quasi-clique number of a graph
- Complexity results for some eigenvector problems
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- Distributionally robust inverse covariance estimation: the Wasserstein shrinkage estimator
- Multilevel Artificial Neural Network Training for Spatially Correlated Learning
- The Complexity of Diagonalization
- Learning methods for structural damage detection via entropy‐based sensors selection
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- Constrained polynomial zonotopes
- Dynamic normal forms and dynamic characteristic polynomial
- Generalized Principal Component Analysis: Projection of Saturated Model Parameters
- Complexity of robust orbit problems for torus actions and the abc-conjecture
- Sampling matrices from Harish-Chandra-Itzykson-Zuber densities with applications to quantum inference and differential privacy
- Subsampling based community detection for large networks
- New lower bounds on the cutwidth of graphs
- Deep out-of-distribution uncertainty quantification via weight entropy maximization
- Model-based vs. agnostic methods for the prediction of time-varying covariance matrices
- Linear discriminant analysis with the randomized Kaczmarz method
- Fast eigenvalue finders for data with graph symmetries
- Estimating the extremal eigenvalues of a symmetric matrix
- Stochastic semidiscretization method: second moment stability analysis of linear stochastic periodic dynamical systems with delays
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)
