|
Numerical methods and programming, 2011, Volume 12, Issue 4, Pages 423–434
(Mi vmp211)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Вычислительные методы и приложения
A parallel algorithm for solving strong separability problem
on the basis of Fejer mappings
A. V. Ershova, I. M. Sokolinskaya South Ural State University, Chelyabinsk
Abstract:
An approach to solving the problem of separating two convex nonintersecting
polyhedrons by the layer of maximum thickness is proposed. A parallel algorithm
based on a method of using Fejer mappings is described. This algorithm admits
an efficient implementation on the massively parallel multiprocessor systems.
The results of computing experiments confirming the efficiency of the proposed
approach are discussed. This work was supported by the Russian Foundation
for Basic Research (project N 09-01-00546а).
Keywords:
strong separability; Fejer mappings; parallel programming; pseudoprojection; iterative process; pattern recognition.
Citation:
A. V. Ershova, I. M. Sokolinskaya, “A parallel algorithm for solving strong separability problem
on the basis of Fejer mappings”, Num. Meth. Prog., 12:4 (2011), 423–434
Linking options:
https://www.mathnet.ru/eng/vmp211 https://www.mathnet.ru/eng/vmp/v12/i4/p423
|
Statistics & downloads: |
Abstract page: | 109 | Full-text PDF : | 77 |
|