All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 12 of 12

Showing per page

EasyMSG : tools and techniques for an adaptive overlapping in SPMD programming

Pascal Havé (2002)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

During the development of a parallel solver for Maxwell equations by integral formulations and Fast Multipole Method (FMM), we needed to optimize a critical part including a lot of communications and computations. Generally, many parallel programs need to communicate, but choosing explicitly the way and the instant may decrease the efficiency of the overall program. So, the overlapping of computations and communications may be a way to reduce this drawback. We will see a implementation of this techniques...

EasyMSG: Tools and techniques for an adaptive overlapping in SPMD programming

Pascal Havé (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

During the development of a parallel solver for Maxwell equations by integral formulations and Fast Multipole Method (FMM), we needed to optimize a critical part including a lot of communications and computations. Generally, many parallel programs need to communicate, but choosing explicitly the way and the instant may decrease the efficiency of the overall program. So, the overlapping of computations and communications may be a way to reduce this drawback. We will see a implementation of this...

Effective computation of restoring force vector in finite element method

Martin Balazovjech, Ladislav Halada (2007)

Kybernetika

We introduce a new way of computation of time dependent partial differential equations using hybrid method FEM in space and FDM in time domain and explicit computational scheme. The key idea is quick transformation of standard basis functions into new simple basis functions. This new way is used for better computational efficiency. We explain this way of computation on an example of elastodynamic equation using quadrilateral elements. However, the method can be used for more types of elements and...

Efficient numerical algorithms for balanced stochastic truncation

Peter Benner, Enrique Quintana-Ortí, Gregorio Quintana-Ortí (2001)

International Journal of Applied Mathematics and Computer Science

We propose an efficient numerical algorithm for relative error model reduction based on balanced stochastic truncation. The method uses full-rank factors of the Gramians to be balanced versus each other and exploits the fact that for large-scale systems these Gramians are often of low numerical rank. We use the easy-to-parallelize sign function method as the major computational tool in determining these full-rank factors and demonstrate the numerical performance of the suggested implementation of...

Error Control and Andaptivity for a Phase Relaxation Model

Zhiming Chen, Ricardo H. Nochetto, Alfred Schmidt (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

The phase relaxation model is a diffuse interface model with small parameter ε which consists of a parabolic PDE for temperature θ and an ODE with double obstacles for phase variable χ. To decouple the system a semi-explicit Euler method with variable step-size τ is used for time discretization, which requires the stability constraint τ ≤ ε. Conforming piecewise linear finite elements over highly graded simplicial meshes with parameter h are further employed for space discretization. A posteriori...

Event monitoring of parallel computations

Alexander M. Gruzlikov, Nikolai V. Kolesov, Marina V. Tolmacheva (2015)

International Journal of Applied Mathematics and Computer Science

The paper considers the monitoring of parallel computations for detection of abnormal events. It is assumed that computations are organized according to an event model, and monitoring is based on specific test sequences.

Experiments with Krylov subspace methods on a massively parallel computer

Martin Hanke, Marlis Hochbruck, Wilhelm Niethammer (1993)

Applications of Mathematics

In this note, we compare some Krylov subspace iterative methods on the MASPAR, a massively parallel computer with 16K processors. In particular, we apply these methods to solve large sparse nonsymmetric linear systems arising from elliptic partial differential equations. The methods under consideration include conjugate gradient type methods, semiiterative methods, and a hybrid variant. Our numerical results show that, on the MASPAR, one should compare iterative methods rather on the basis of total...

Currently displaying 1 – 12 of 12

Page 1