Sciweavers

155 search results - page 3 / 31
» Fast matrix rank algorithms and applications
Sort
View
DAGSTUHL
2006
14 years 11 months ago
Using fast matrix multiplication to solve structured linear systems
Structured linear algebra techniques enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness. Following...
Éric Schost, Alin Bostan, Claude-Pierre Jea...
ICML
2010
IEEE
14 years 10 months ago
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama, His...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
15 years 10 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
TSP
2008
178views more  TSP 2008»
14 years 9 months ago
Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
Pei Chen
AUTOMATICA
2006
137views more  AUTOMATICA 2006»
14 years 9 months ago
A Newton-like method for solving rank constrained linear matrix inequalities
This paper presents a Newton-like algorithm for solving systems of rank constrained linear matrix inequalities. Though local quadratic convergence of the algorithm is not a priori...
Robert Orsi, Uwe Helmke, John B. Moore