Sciweavers

1717 search results - page 1 / 344
» A Computable Spectral Theorem
Sort
View
CCA
2000
Springer
13 years 9 months ago
A Computable Spectral Theorem
Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them su...
Martin Ziegler, Vasco Brattka
LION
2009
Springer
125views Optimization» more  LION 2009»
13 years 12 months ago
New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
Samuel Rota Bulò, Marcello Pelillo
LSSC
2007
Springer
13 years 11 months ago
Comments on the GMRES Convergence for Preconditioned Systems
Abstract. The purpose of this paper is to comment a frequent observation by the engineers studying acoustic scattering. It is related to the convergence of the GMRES method when so...
Nabil Gmati, Bernard Philippe
JMLR
2010
82views more  JMLR 2010»
13 years 7 days ago
On Spectral Learning
In this paper, we study the problem of learning a matrix W from a set of linear measurements. Our formulation consists in solving an optimization problem which involves regulariza...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 5 months ago
Computing spectral sequences
John McCleary insisted in his interesting textbook entitled "User's guide to spectral sequences" on the fact that the tool "spectral sequence" is not in t...
Ana Romero, Julio Rubio, Francis Sergeraert