Displaying similar documents to “Systolic arrays to solve algebraic equations by Bernoulli's method.”

K3M: a universal algorithm for image skeletonization and a review of thinning techniques

Khalid Saeed, Marek Tabędzki, Mariusz Rybnik, Marcin Adamski (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper aims at three aspects closely related to each other: first, it presents the state of the art in the area of thinning methodologies, by giving descriptions of general ideas of the most significant algorithms with a comparison between them. Secondly, it proposes a new thinning algorithm that presents interesting properties in terms of processing quality and algorithm clarity, enriched with examples. Thirdly, the work considers parallelization issues for intrinsically sequential...

Extension of reverse elimination method through a dynamic management of the tabu list

Saïd Hanafi, Arnaud Fréville (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list. It is based on logical interdependencies between the solutions encountered during recent iterations of the search. REM provides both a necessary and sufficient condition to prevent cycling. The purpose of this paper is first to incorporate in REM a chronological order rule when cycling is unavoidable, thereby assuring the finite convergence of Tabu Search. Secondly, we correct a generalization of REM,...

A novel interval arithmetic approach for solving differential-algebraic equations with VALENCIA-IVP

Andreas Rauh, Michael Brill, Clemens Günther (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

The theoretical background and the implementation of a new interval arithmetic approach for solving sets of differentialalgebraic equations (DAEs) are presented. The proposed approach computes guaranteed enclosures of all reachable states of dynamical systems described by sets of DAEs with uncertainties in both initial conditions and system parameters. The algorithm is based on VALENCIA-IVP, which has been developed recently for the computation of verified enclosures of the solution...

Two implementations of the preconditioned conjugate gradient method on heterogeneous computing grids

Tijmen P. Collignon, Martin B. Van Gijzen (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

Efficient iterative solution of large linear systems on grid computers is a complex problem. The induced heterogeneity and volatile nature of the aggregated computational resources present numerous algorithmic challenges. This paper describes a case study regarding iterative solution of large sparse linear systems on grid computers within the software constraints of the grid middleware GridSolve and within the algorithmic constraints of preconditioned Conjugate Gradient (CG) type methods....

Application of a Java-based framework to parallel simulation of large-scale systems

Ewa Niewiadomska-Szynkiewicz, Maciej Żmuda, Maciej Żmuda (2003)

International Journal of Applied Mathematics and Computer Science

Similarity:

Large-scale systems, such as computer and telecommunication networks, complex control systems and many others, operate in inherently parallel environments. It follows that there are many opportunities to admit parallelism into both the algorithm of control implementation and simulation of the system operation considered. The paper addresses issues associated with the application of parallel discrete event simulation (PDES). We discuss the PDES terminology and methodology. Particular...