Displaying similar documents to “Geometrical/Geographical Optimization and Fast Automatic Differentiation”

Loss of Accuracy in Numerical Computations Загуба на точност в числените пресмятания

Konstantinov, Mihail, Petkov, Petko (2011)

Union of Bulgarian Mathematicians

Similarity:

Михаил М. Константинов, Петко Х. Петков - Разгледани са възможните катастрофални ефекти от неправилното използване на крайна машинна аритметика с плаваща точка. За съжаление, тази тема не винаги се разбира достатъчно добре от студентите по приложна и изчислителна математика, като положението в инженерните и икономическите специалности в никакъв случай не е по-добро. За преодоляване на този образователен пропуск тук сме разгледали главните виновници за загубата на точност при числените компютърни...

Computational algorithm for homogenized coefficients of hyperelastic heterogeneous materials undergoing large deformations

Lukeš, Vladimír, Rohan, Eduard, Cimrman, Robert

Similarity:

This article deals with an algorithm for numerical modelling of hyperelastic heterogeneous materials undergoing large deformations. The microstructure of these materials is changing (deforming) during a loading process, the changes in the microstructure depend on macroscopic deformations. To compute macroscopic responses, we must know material stiffness parameters and stresses in the heterogeneous structure. These effective parameters are obtained by solving microscopic problems. The...

Combinatorial optimization in DNA mapping — A computational thread of the simplified partial digest problem

Jacek Blazewicz, Marta Kasprzak (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In the paper, the problem of the genome mapping of DNA molecules, is presented. In particular, the new approach — the Simplified Partial Digest Problem (SPDP), is analyzed. This approach, although easy in laboratory implementation and robust with respect to measurement errors, when formulated in terms of a combinatorial search problem, is proved to be strongly NP-hard for the general error-free case. For a subproblem of the SPDP, a simple O( n log n )-time algorithm is given, where n is a number...

Experiments with variants of ant algorithms.

Thomas Stützle, Sebastian Linke (2002)

Mathware and Soft Computing

Similarity:

A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally...