Fast random field generation with H-matrices
نویسندگان
چکیده
منابع مشابه
Fast Random Rotation Matrices
In a previous gem Arvo 91] I described a method for generating random rotation matrices based on random unit quaternions. As Ken Shoemake points out in his gem Shoemake 92], that algorithm was awed in that it did not generate uniformly distributed rotation matrices. For a method based on quaternions that corrects this defect, with only slightly more computation, see his algorithm. In this gem I...
متن کاملEfficient Generation of Random Nonsingular Matrices
We present an eecient algorithm for generating an n n nonsingular matrix uniformly over a nite eld. This algorithm is useful for several cryptographic and checking applications. Over GFF2] our algorithm runs in expected time M(n) + O(n 2), where M(n) is the time needed to multiply two n n matrices, and the expected number of random bits it uses is n 2 + 3. (Over other nite elds we use n 2 + O(1...
متن کاملFast Verified Solutions of Sparse Linear Systems with H-matrices
This paper is concerned with the problem of verifying the accuracy of an approximate solution of a sparse linear system whose coefficient matrix is an H-matrix. Fast and efficient methods of calculating componentwise error bounds of the computed solution are proposed. The methods are based on the verified criterion for an M-matrix. The main point of this article is that the proposed methods can...
متن کاملRandom hermitian matrices in an external field
In this article, a model of random hermitian matrices is considered, in which the measure exp(−S) contains a general U(N)-invariant potential and an external source term: S = N tr(V (M) + MA). The generalization of known determinant formulae leads to compact expressions for the correlation functions of the energy levels. These expressions, exact at finite N , are potentially useful for asymptot...
متن کاملOn Random Field Captcha Generation
Herein, we propose generating CAPTCHAs through random field simulation and give a novel, effective and efficient algorithm to do so. Indeed, we demonstrate that sufficient information about word tests for easy human recognition is contained in the site marginal probabilities and the site-to-nearby-site covariances and these quantities can be embedded into KNW conditional probabilities, designed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 2018
ISSN: 0029-599X,0945-3245
DOI: 10.1007/s00211-018-0974-2