ACCELERATING WILSON FERMION MATRIX INVERSIONS BY MEANS OF THE STABILIZED BICONJUGATE GRADIENT ALGORITHM
نویسندگان
چکیده
منابع مشابه
extremal region detection guided by maxima of gradient magnitude
a problem of computer vision applications is to detect regions of interest under dif- ferent imaging conditions. the state-of-the-art maximally stable extremal regions (mser) detects affine covariant regions by applying all possible thresholds on the input image, and through three main steps including: 1) making a component tree of extremal regions’ evolution (enumeration), 2) obtaining region ...
An Analysis of the Composite Step Biconjugate Gradient Method
The composite step biconjugate gradient method (CSBCG) is a simple modification of the standard biconjugate gradient algorithm (BCG) which smooths the sometimes erratic convergence of BCG by computing only a subset of the iterates. We show that 2 × 2 composite steps can cure breakdowns in the biconjugate gradient method caused by (near) singularity of principal submatrices of the tridiagonal ma...
متن کاملAnalysis of the finite precision s-step biconjugate gradient method
We analyze the s-step biconjugate gradient algorithm in finite precision arithmetic and derive a bound for the residual norm in terms of a minimum polynomial of a perturbed matrix multiplied by an amplification factor. Our bound enables comparison of s-step and classical biconjugate gradient in terms of amplification factors. Our results show that for s-step biconjugate gradient, the amplificat...
متن کاملA Parallel Implementation of the Communication-Avoiding Biconjugate Gradient Method
The speed of an algorithm is determined by two factors: the number of oating-point operations performed (computation) and the amount of data movement (communication). In the sequential case, communication refers to movement of data between levels of the memory hierarchy. In the parallel case, communication means movement of data between processors. Communication cost can be modeled by two param...
متن کاملAccelerating Lloyd’s Algorithm for k-Means Clustering
The k-means clustering algorithm, a staple of data mining and unsupervised learning, is popular because it is simple to implement, fast, easily parallelized, and offers intuitive results. Lloyd’s algorithm is the standard batch, hill-climbing approach for minimizing the k-means optimization criterion. It spends a vast majority of its time computing distances between each of the k cluster center...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 1994
ISSN: 0129-1831,1793-6586
DOI: 10.1142/s012918319400115x