A parallel multigrid method using the full domain partition.
A Parallel Projection Method for Solving Generalized Linear Least-Squares Problems.
A parallel QR-factorization/solver of quasiseparable matrices.
A parallel splitting-up method for partial differential equations and its applications to Navier-Stokes equations
A robust and parallel multigrid method for convection diffusion equations.
A tree-based dataflow model for the unsymmetric multifrontal method.
Adaptive data distribution for concurrent continuation.
Advancing analysis capabilities in ANSYS through solver technology.
An adaptive -step conjugate gradient algorithm with dynamic basis updating
The adaptive -step CG algorithm is a solver for sparse symmetric positive definite linear systems designed to reduce the synchronization cost per iteration while still achieving a user-specified accuracy requirement. In this work, we improve the adaptive -step conjugate gradient algorithm by the use of iteratively updated estimates of the largest and smallest Ritz values, which give approximations of the largest and smallest eigenvalues of , using a technique due to G. Meurant and P. Tichý (2018)....
An additive Schwarz preconditioner for the spectral element ocean model formulation of the shallow water equations.
An efficiency analysis of the parallel multitransputer implementation of two-level optimization algorithms
The paper presents an approach to improve the efficiency of some two-level optimization algorithms by their implementation in parallel MIMD multiprocessor systems. Diagonal decomposition dynamic programming and parametric optimization methods are considered, and some concepts of their parallelization are discussed. Results regarding the implementation of computations in a parallel multitransputer system are presented. For the analysed problems, the obtained values of speedup are close to the theoretical...
An Implementation of Ray Tracing Algorithm for the Multiprocessor Machines
An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
Here is presented a 6-states non minimal-time solution which is intrinsically Minsky-like and solves the three following problems: unrestricted version on a line, with one initiator at each end of a line and the problem on a ring. We also give a complete proof of correctness of our solution, which was never done in a publication for Minsky's solutions.
An unconditionally stable parallel difference scheme for telegraph equation.
Analysis of two-level domain decomposition preconditioners based on aggregation
In this paper we present two-level overlapping domain decomposition preconditioners for the finite-element discretisation of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction is added. We present an algebraic way to define the coarse space, based on the concept of aggregation. This employs a (smoothed) aggregation technique and does not require the introduction of a coarse grid. We consider a set of assumptions...
Analysis of two-level domain decomposition preconditioners based on aggregation
In this paper we present two-level overlapping domain decomposition preconditioners for the finite-element discretisation of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction is added. We present an algebraic way to define the coarse space, based on the concept of aggregation. This employs a (smoothed) aggregation technique and does not require the introduction of a coarse grid. We consider a...
Asynchronous weighted additive Schwarz methods.
Book Reviews
Coarsening invariance and bucket-sorted independent sets for algebraic multigrid.
Communication balancing in parallel sparse matrix-vector multiplication.