Sciweavers

82 search results - page 1 / 17
» Solving Systems of Linear Algebraic Equations Using Quasiran...
Sort
View
LSSC
2001
Springer
13 years 9 months ago
Solving Systems of Linear Algebraic Equations Using Quasirandom Numbers
In this paper we analyze a quasi-Monte Carlo method for solving systems of linear algebraic equations. It is well known that the convergence of Monte Carlo methods for numerical in...
Aneta Karaivanova, Rayna Georgieva
NAA
2000
Springer
125views Mathematics» more  NAA 2000»
13 years 8 months ago
Matrix Computations Using Quasirandom Sequences
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
Michael Mascagni, Aneta Karaivanova
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
13 years 10 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
JSC
2006
147views more  JSC 2006»
13 years 4 months ago
An algorithm to solve integer linear systems exactly using numerical methods
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...
Zhendong Wan