Keywords
Affiliated Institutions
Related Publications
Spectral partitioning works: planar graphs and finite element meshes
Spectral partitioning methods use the Fiedler vector-the eigenvector of the second-smallest eigenvalue of the Laplacian matrix-to find a small separator of a graph. These method...
Convergence of infinite products of matrices and inner-outer iteration schemes
We develop conditions under which a product Q1=0 Ti of matrices chosen from a possibly innite set of matricesS =fTjjj2 Jg converges. We obtain the following conditions which are...
The Power of Convex Relaxation: Near-Optimal Matrix Completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a ...
For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution
Abstract We consider linear equations y = Φ x where y is a given vector in ℝ n and Φ is a given n × m matrix with n < m ≤ τ n , and we wish to solve for x ∈ ℝ m . We suppose ...
Numerical operator calculus in higher dimensions
When an algorithm in dimension one is extended to dimension d , in nearly every case its computational cost is taken to the power d . This fundamental difficulty is the single g...
Publication Info
- Year
- 1992
- Type
- article
- Volume
- 166
- Pages
- 21-27
- Citations
- 384
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1016/0024-3795(92)90267-e