block iteration
Recently Published Documents


TOTAL DOCUMENTS

21
(FIVE YEARS 3)

H-INDEX

8
(FIVE YEARS 1)

Author(s):  
Viktor Bazhenov ◽  
Oleksii Shkril’ ◽  
Yurii Maksymiuk ◽  
Ivan Martyniuk ◽  
Oleksandr Maksymiuk

In [4, 5, 6] the algorithm of the method of block iterations of solving linear and nonlinear equations by the semivanalytic finite element method for curvilinear inhomogeneous prismatic bodies is realized. This paper presents the results of the effectiveness of the semi-analytical finite element method for the consideration of curvilinear prismatic objects in elastic and elastic-plastic formulation. The choice of the optimal in terms of machine time and speed of convergence of the iterative process algorithm for solving systems of linear and nonlinear equations by the semivanalytic finite element method [1, 2, 3] is an important factor influencing the efficiency of the method as a whole. Numerous studies have shown that using the block iteration method to solve systems of equations of the semivanalytic finite element method for prismatic bodies with variable parameters has a number of important advantages over solving systems of the traditional variant of the finite element method. The organization of the computational process and its software implementation takes into account the basic requirements for software for calculating strength on modern software packages. The modular structure of the developed system of programs provides its non-closedness concerning new classes of tasks. The use of the block iteration method to solve systems of nonlinear equations of SAFEM is approximately an order of magnitude superior to the traditional finite element method.


2019 ◽  
Vol 9 (6) ◽  
pp. 1141 ◽  
Author(s):  
Ran Zhao ◽  
Chao Li ◽  
Xiaowei Guo ◽  
Sijiang Fan ◽  
Yi Wang ◽  
...  

Greedy algorithm is one of the important point selection methods in the radial basis function based mesh deformation. However, in large-scale mesh, the conventional greedy selection will generate expensive time consumption and result in performance penalties. To accelerate the computational procedure of the point selection, a block iteration with parallelization method is proposed in this paper. By the block iteration method, the computational complexities of three steps in the greedy selection are all reduced from O ( n 3 ) to O ( n 2 ) . In addition, the parallelization of two steps in the greedy selection separates boundary points into sub-cores, efficiently accelerating the procedure. Specifically, three typical models of three-dimensional undulating fish, ONERA M6 wing and three-dimensional Super-cavitating Hydrofoil are taken as the test cases to validate the proposed method and the results show that it improves 17.41 times performance compared to the conventional method.


2012 ◽  
Vol 155-156 ◽  
pp. 789-794
Author(s):  
Jie He ◽  
Hui Guo

Based on nondestructive and block iteration function the characteristics of the system, and put forward a kind of improved the global optimal solution from similar partition adaptive genetic algorithm is proposed. In the algorithm for the father the searching space of the individual pieces by gray coding method; Definition of father and son of minimum error for the match fitness function; Genetic algorithm is put forward the improvement of the linear adaptive crossover and mutation probability; Take excellent protection strategy choice. The experimental results show that this method in the similar image guarantee the quality and the compression ratio decompression also can obviously reduce compressed time, effectively improve the searching efficiency.


Sign in / Sign up

Export Citation Format

Share Document