Parallelization of Robust Multigrid Technique Using OpenMP Technology

Date

2021-01-01

Author

Martynenko, Sergey
Zhou, Weixing
Gökalp, İskender
Bakhtin, Vladimir
Toktaliev, Pavel

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

119
views

0
downloads

© 2021, Springer Nature Switzerland AG.This article represents the parallel multigrid component analysis of Robust Multigrid Technique (RMT). The RMT has been developed for black-box solution of a large class of (non)linear boundary value problems in computational continuum mechanics. Parallel RMT can be constructed by combination of the algebraic and geometric approaches to parallelization. The geometric smoother-independent approach based on a decomposition of the given problem into 3κ (κ= 1, 2, … ) subproblems without an overlap should be used to overcome the problems of large communication overhead and idling processors on coarser levels. The algebraic grid-independent approach based on a decomposition of the given problem into C3κ (κ= 1, 2, … ) subproblems with an overlap (multicoloured Vanka-type smoother) should be used for parallel smoothing on finer levels. Standard programming model for shared memory parallel programming OpenMP has been used for parallel implementation of RMT on personal computer and computer cluster. This paper represents parallel multigrid cycle, algebraic and geometric approaches to parallelization, estimation of the parallel RMT efficiency and parallel multigrid component analysis.

Subject Keywords

Boundary value problems, OpenMP, Parallel solvers, Robust multigrid technique

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85115320264&origin=inward
https://hdl.handle.net/11511/98811

DOI

https://doi.org/10.1007/978-3-030-86359-3_15

Conference Name

16th International Conference on Parallel Computing Technologies, PaCT 2021

Collections

Department of Mechanical Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Application of a Robust Multigrid Technique for the Parallel Solution of Initial-Boundary Value Problems Martynenko, S.I.; Gökalp, İskender; Bakhtin, V.A.; Karaca, Mehmet; Toktaliev, P.D.; Semenev, P.A. (2022-12-01) This article is devoted to the construction of a parallel multigrid algorithm for the numerical solution of (non)linear initial-boundary value problems (implicit schemes) based on a robust multigrid technique (RMT). A distinctive feature of the proposed algorithm is the possibility of the parallel solution of initial-boundary value problems and initial-boundary value problems in a unified manner involving 3m independent computers (threads, if the OpenMP parallelization technology is used), m = 1, 2, 3, …. C...
Fuzzy multiple objective fractional optimization in rough approximation and its aptness to the fixed-charge transportation problem Midya, Sudipta; Roy, Sankar Kumar; Weber, Gerhard Wilhelm (2021-05-01) This article presents a multiple objective fractional fixed-charge transportation problem (MFFTP) in a rough decision-making framework. A transformation procedure is modified to convert non-linear multi-objective transportation problem to its linear version. The parameters of the designed model are considered to be fuzzy. We employ separate kinds of fuzzy scale, i.e., possibility, credibility and necessity measures, to deal with the fuzzy parameters. Using the fuzzy chance-constrained rough approximation (F...
Recent results on Bayesian Cramér-Rao bounds for jump Markov systems Fritsche, Carsten; Orguner, Umut; Svensson, Lennart; Gustafsson, Fredrik (2016-07-08) In this paper, recent results on the evaluation of the Bayesian Cramer-Rao bound for jump Markov systems are presented. In particular, previous work is extended to jump Markov systems where the discrete mode variable enters into both the process and measurement equation, as well as where it enters exclusively into the measurement equation. Recursive approximations are derived with finite memory requirements as well as algorithms for checking the validity of these approximations are established. The tightnes...
On Solving the Forward Kinematics of the 6-6 General Parallel Manipulator with an Efficient Evolutionary Algorithm Rolland, Luc; Chandra, Rohitash (2010-07-08) The G3-PCX genetic algorithm is compared with hybrid meta-heuristic approaches for solving the forward kinematics problem of the 6-6 general parallel manipulator. The G3-PCX shows improvements in terms of accuracy, response time and reliability. Several experiments confirm solving the given problem in less than 1 second. It also reports all the 16 unique real solutions which are verified by an exact algebraic method. This opens the way to simulation and certification applications.
Multinucleon transfer in Ni-58+Ni-60 and Ni-60+Ni-60 in a stochastic mean-field approach Yilmaz, B.; Ayik, S.; Yılmaz, Osman; Umar, A. S. (2018-09-07) The multinucleon exchange mechanism in Ni-58 + Ni-60 and Ni-60 + Ni-60 collisions is analyzed in the framework of the stochastic mean-field approach. The results of calculations are compared with the time-dependent random-phase approximation (TDRPA) calculations and the recent data of Ni-58 + Ni-60. A good description of the data and a relatively good agreement with the TDRPA calculations are found.

Citation Formats

S. Martynenko, W. Zhou, İ. Gökalp, V. Bakhtin, and P. Toktaliev, “Parallelization of Robust Multigrid Technique Using OpenMP Technology,” Kaliningrad, Rusya, 2021, vol. 12942 LNCS, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85115320264&origin=inward.