Pages that link to "Item:Q2819583"

The following pages link to The complexity of the matrix eigenproblem (Q2819583):

Displaying 30 items.

• Dynamic normal forms and dynamic characteristic polynomial (Q633626) (← links)
• Stochastic semidiscretization method: second moment stability analysis of linear stochastic periodic dynamical systems with delays (Q821999) (← links)
• An adaptive local reduced basis method for solving PDEs with uncertain inputs and evaluating risk (Q1986786) (← links)
• Distributed resource allocation with binary decisions via Newton-like neural network dynamics (Q2021311) (← links)
• A feasible \(k\)-means kernel trick under non-Euclidean feature space (Q2023581) (← links)
• An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
• Eigenvalue-flipping algorithm for matrix Monte Carlo (Q2092662) (← links)
• On eventual non-negativity and positivity for the weighted sum of powers of matrices (Q2104554) (← links)
• Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q2105455) (← links)
• Hermitian matrix definiteness from quantum phase estimation (Q2108008) (← links)
• First-order continuous- and discontinuous-Galerkin moment models for a linear kinetic equation: realizability-preserving splitting scheme and numerical analysis (Q2133803) (← links)
• Computing the asymptotic distribution of second-order \(U\)- and \(V\)-statistics (Q2157505) (← links)
• An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
• High-performance processing of covariance matrices using GPU computations (Q2319673) (← links)
• Bounds on skyline probability for databases with uncertain preferences (Q2374521) (← links)
• AMID: approximation of multi-measured data using SVD (Q2390395) (← links)
• New spectral bounds on \(\mathcal{H}_2\)-norm of linear dynamical networks (Q2407204) (← links)
• Algebraic connectivity of network-of-networks having a graph product structure (Q2407241) (← links)
• The robust minimal controllability problem (Q2409157) (← links)
• Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension (Q2424630) (← links)
• A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
• Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
• An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision (Q4995607) (← links)
• Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator (Q5031024) (← links)
• Multilevel Artificial Neural Network Training for Spatially Correlated Learning (Q5241254) (← links)
• Learning methods for structural damage detection via entropy‐based sensors selection (Q6061092) (← links)
• Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time (Q6142334) (← links)
• Constrained polynomial zonotopes (Q6171823) (← links)
• Generalized Principal Component Analysis: Projection of Saturated Model Parameters (Q6636567) (← links)