35 search results - page 2 / 7 » Accurate Error Bounds for the Eigenvalues of the Kernel Matr... |
MA
2011
Springer
13 years 7 days ago
2011
Springer
The ratio of the largest eigenvalue divided by the trace of a p×p random Wishart matrix with n degrees of freedom and identity covariance matrix plays an important role in variou...
SIAMMAX
2011
13 years 6 days ago
2011
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
MOC
2010
13 years 1 days ago
2010
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
— This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The protocols taken into account adopt an updating rule based either on const...
SIAMJO
2008
13 years 5 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...