Sciweavers

358 search results - page 14 / 72
» Sparse squares of polynomials
Sort
View
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
13 years 11 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
ICASSP
2011
IEEE
12 years 11 months ago
Sliding window greedy RLS for sparse filters
We present a sliding window RLS for sparse filters, based on the greedy least squares algorithm. The algorithm adapts a partial QR factorization with pivoting, using a simplifie...
Alexandru Onose, Bogdan Dumitrescu, Ioan Tabus
ICML
2008
IEEE
14 years 8 months ago
A least squares formulation for canonical correlation analysis
Canonical Correlation Analysis (CCA) is a well-known technique for finding the correlations between two sets of multi-dimensional variables. It projects both sets of variables int...
Liang Sun, Shuiwang Ji, Jieping Ye
SIAMMAX
2010
103views more  SIAMMAX 2010»
13 years 2 months ago
On Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
Vance Faber, Jörg Liesen, Petr Tichý
ICASSP
2011
IEEE
12 years 11 months ago
TLS-FOCUSS for sparse recovery with perturbed dictionary
In this paper, we propose a new algorithm, TLS-FOCUSS, for sparse recovery for large underdetermined linear systems, based on total least square (TLS) method and FOCUSS(FOCal Unde...
Xuebing Han, Hao Zhang, Huadong Meng