Sciweavers

Share
IACR
2011
141views more  IACR 2011»
7 years 4 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
SIAMMAX
2011
157views more  SIAMMAX 2011»
7 years 7 months ago
Deflated Restarting for Matrix Functions
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...
COMPUTING
2006
140views more  COMPUTING 2006»
8 years 4 months ago
A Numerical Study of the Xu Polynomial Interpolation Formula in Two Variables
In his paper "Lagrange interpolation on Chebyshev points of two variables" (J. Approx. Theor. 87, 220
Len Bos, Marco Caliari, Stefano De Marchi, Marco V...
ARITH
2009
IEEE
8 years 11 months ago
Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation
A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation a...
Murat Cenk, Çetin Kaya Koç, Ferruh &...

Lecture Notes
4505views
10 years 2 months ago
Numerical Methods Course Notes
"These notes were originally prepared during Fall quarter 2003 for UCSD Math 174, Numerical Methods."
Steven E. Pav
books