Suchergebnisse - Parallel Thomas algorithm

swPTS: an efficient parallel Thomas split algorithm for tridiagonal systems on Sunway manycore processors von Tian, Min, Liu, Qi, Pan, Jingshan, Gou, Ying, Zhang, Zanjun

“… Based on the performance analysis of the classic Thomas algorithm and matrix splitting method, we propose a parallel Thomas split (PTS) algorithm …”
Volltext

Parallel implementation of Thomas algorithm for the 2D heat equation von Kenzhebek, Yerzhan, Imankulov, Timur, Matkerim, Bazargul, Akhmed-Zaki, Darkhan

“… In this paper was considered a parallel implementation of the Thomas algorithm for the 2D heat equation …”
Volltext

CONVERSION OF THE SEQUENTIAL INFORMATION GRAPH OF THE THOMAS ALGORITHM INTO A PARALLEL FORM von Mikhailov, D.V.

Volltext

Parallel tridiagonal matrix inversion with a hybrid multigrid-Thomas algorithm method von Parker, J.T., Hill, P.A., Dickinson, D., Dudson, B.D.

“… In this paper, we derive a hybrid multigrid-Thomas algorithm designed to efficiently invert tridiagonal matrix equations in a highly-scalable fashion in the context of time evolving partial …”
Volltext

High-performance modeling acoustic and elastic waves using the parallel Dichotomy Algorithm von Fatyanov, Alexey G., Terekhov, Andrew V.

“… A high-performance parallel algorithm is proposed for modeling the propagation of acoustic and elastic waves in inhomogeneous media …”
Volltext

GPUSCAN: GPU-Based Parallel Structural Clustering Algorithm for Networks von Stovall, Thomas Ryan, Kockara, Sinan, Avci, Recep

“… This paper presents a massively parallel implementation of a prominent network clustering algorithm, the structural clustering algorithm for networks (SCAN …”
Volltext

A scalable, parallel algorithm for maximal clique enumeration von Schmidt, Matthew C., Samatova, Nagiza F., Thomas, Kevin, Park, Byung-Hoon

“… Even the most efficient serial MCE algorithms require large amounts of time to enumerate the maximal cliques in networks arising from these problems that contain hundreds, thousands, or larger numbers of vertices …”
Volltext

GBEES-GPU: An efficient parallel GPU algorithm for high-dimensional nonlinear uncertainty propagation von Hanson, Benjamin L., Rubio, Carlos, García-Gutiérrez, Adrián, Bewley, Thomas

“… A recent approach to this class of algorithm, Grid-based Bayesian Estimation Exploiting Sparsity, addresses the first challenge by dynamically allocating a discretized grid in regions of phase space …”
Volltext

Parallel Thomas approach development for solving tridiagonal systems in GPU programming − steady and unsteady flow simulation von Souri, Milad, Akbarzadeh, Pooria, Darian, Hossein Mahmoodi

“… The solution of tridiagonal system of equations using graphic processing units (GPU) is assessed. The parallel-Thomas-algorithm …”
Volltext

Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries von Erlebach, Thomas, Hoffmann, Michael, de Lima, Murilo Santos

“… ). We introduce a new model where  k queries can be made in parallel in each round, and the goal is to minimize the number of query rounds …”
Volltext

A Higher-Order Compact Method in Space and Time Based on Parallel Implementation of the Thomas Algorithm von Povitsky, Alex, Morris, Philip J.

“… –Kutta temporal update. The most efficient direct method to compute spatial derivatives on a serial computer is a version of Gaussian elimination for narrow linear banded systems known as the Thomas algorithm …”
Volltext

Adaptive Collision Culling for Massive Simulations by a Parallel and Context-Aware Sweep and Prune Algorithm von Capannini, Gabriele, Larsson, Thomas

“… We present an improved parallel Sweep and Prune algorithm that solves the dynamic box intersection problem in three dimensions …”
Volltext

Discriminating flash crowds from DDoS attacks using efficient thresholding algorithm von David, Jisa, Thomas, Ciza

“… Distributed Denial-of-Service attacks have been a challenge to cyberspace, as the attackers send a large number of attack packets similar to the normal …”
Volltext

A parallel algorithm for Bayesian network structure learning from large data sets von Madsen, Anders L., Jensen, Frank, Salmerón, Antonio, Langseth, Helge, Nielsen, Thomas D.

“… This paper considers a parallel algorithm for Bayesian network structure learning from large data sets …”
Volltext

Optimal polynomial smoothers for parallel AMG von D’Ambra, Pasqua, Durastante, Fabio, Filippone, Salvatore, Massei, Stefano, Thomas, Stephen

“… In this paper, we explore polynomial accelerators that are well-suited for parallel computations, specifically as smoothers in Algebraic MultiGrid (AMG …”
Volltext

Parallel Implementation of Curvilinear High-order Formulas von Ladeinde, F., Cai, X., Visbal, M.R., Gaitonde, D.

“… Three procedures were selected: the one-sided method, the parallel diagonal dominant (PDD) method, and the parallel Thomas algorithm …”
Volltext

The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines von Agnetis, Alessandro, Lidbetter, Thomas

“… In this paper we analyze the worst-case performance of a greedy algorithm called Largest-Z-ratio-First for the problem of scheduling unreliable jobs on m parallel machines …”
Volltext

Efficient parallel resolution of the simplified transport equations in mixed-dual formulation von Barrault, M., Lathuilière, B., Ramet, P., Roman, J.

“… ]. In order to obtain a high parallel efficiency, we improve the parallelization scheme by changing the location of the loop over the subdomains in the overall algorithm and by benefiting …”
Volltext

Parallel Direct and Iterative Methods for Solving the Time-Fractional Diffusion Equation on Multicore Processors von Sultanov, Murat A., Akimova, Elena N., Misilov, Vladimir E., Nurlanuly, Yerkebulan

“… The developed parallel algorithms are based on the Thomas algorithm, parallel sweep algorithm, and accelerated over-relaxation method for solving this system …”
Volltext

Detecting global hyperparaboloid correlated clusters: a Hough-transform based multicore algorithm von Kazempour, Daniyal, Mauder, Markus, Kröger, Peer, Seidl, Thomas

“… Correlation clustering detects complex and intricate relationships in high-dimensional data by identifying groups of data points, each characterized by …”
Volltext