A fast algorithm for calculating CBP in large-scale sharing resource networks

Author(s):  
Xing Xu ◽  
Wu Ye ◽  
Suili Feng ◽  
Shengye Huang
Geophysics ◽  
2018 ◽  
Vol 83 (4) ◽  
pp. G25-G34 ◽  
Author(s):  
Saeed Vatankhah ◽  
Rosemary Anne Renaut ◽  
Vahid Ebrahimzadeh Ardestani

We develop a fast algorithm for solving the under-determined 3D linear gravity inverse problem based on randomized singular-value decomposition (RSVD). The algorithm combines an iteratively reweighted approach for [Formula: see text]-norm regularization with the RSVD methodology in which the large-scale linear system at each iteration is replaced with a much smaller linear system. Although the optimal choice for the low-rank approximation of the system matrix with [Formula: see text] rows is [Formula: see text], acceptable results are achievable with [Formula: see text]. In contrast to the use of the iterative LSQR algorithm for the solution of linear systems at each iteration, the singular values generated using RSVD yield a good approximation of the dominant singular values of the large-scale system matrix. Thus, the regularization parameter found for the small system at each iteration is dependent on the dominant singular values of the large-scale system matrix and appropriately regularizes the dominant singular space of the large-scale problem. The results achieved are comparable with those obtained using the LSQR algorithm for solving each linear system, but they are obtained at a reduced computational cost. The method has been tested on synthetic models along with real gravity data from the Morro do Engenho complex in central Brazil.


1993 ◽  
Vol 04 (01) ◽  
pp. 127-136 ◽  
Author(s):  
PETER OSSADNIK

We study numerically the growth of a crack in an elastic medium under the influence of a travelling shockwave. We describe the implementation of a fast algorithm which is perfectly suited for a data parallel computer. Using large scale simulations on the Connection Machine we generate cracks with more than 10000 sites on a 1024 × 1024 lattice. We show that the resulting patterns are fractal with a fractal dimension that depends on the chosen breaking criterion and varies between 1. and 2.


1997 ◽  
Vol 31 (1) ◽  
pp. 41-55
Author(s):  
Brendan J Ring ◽  
John A George ◽  
Chong Juin Kuan

Sign in / Sign up

Export Citation Format

Share Document