Sciweavers

21 search results - page 1 / 5
» Rigorous Perturbation Bounds of Some Matrix Factorizations
Sort
View
SIAMMAX
2010
104views more  SIAMMAX 2010»
12 years 11 months ago
Rigorous Perturbation Bounds of Some Matrix Factorizations
This article presents rigorous normwise perturbation bounds for the Cholesky, LU and QR factorizations with normwise or componentwise perturbations in the given matrix. The conside...
Xiao-Wen Chang, Damien Stehlé
AMC
2010
126views more  AMC 2010»
13 years 5 months ago
On condition numbers of polynomial eigenvalue problems
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
Nikolaos Papathanasiou, Panayiotis Psarrakos
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
MOC
2000
104views more  MOC 2000»
13 years 4 months ago
Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often observed robustness. By using a tridiagonal structure...
Charles H. Tong, Qiang Ye
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 4 months ago
Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurements
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
Blake Hunter, Thomas Strohmer