Displaying similar documents to “On a new computational algorithm for impacts of elastic bodies”

A frictionless contact algorithm for deformable bodies

Olivier Pantz (2011)

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

Similarity:

This article is devoted to the presentation of a new contact algorithm for bodies undergoing finite deformations. We only address the kinematic aspect of the contact problem, that is the numerical treatment of the non-intersection constraint. In consequence, mechanical aspects like friction, adhesion or wear are not investigated and we restrict our analysis to the simplest frictionless case. On the other hand, our method allows us to treat contacts and self-contacts, thin or non-thin...

A modified algorithm for the strict feasibility problem

D. Benterki, B. Merikhi (2010)

RAIRO - Operations Research

Similarity:

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.

Numerical Modelling of Contact Elastic-Plastic Flows

N. M. Bessonov, S. F. Golovashchenko, V. A. Volpert (2009)

Mathematical Modelling of Natural Phenomena

Similarity:

Wilkins' method has been successfully used since early 60s for numerical simulation of high velocity contact elastic-plastic flows. The present work proposes some effective modifications of this method including more sophisticated material model including the Baushinger effect; modification of the algorithm based on correction of the initial configuration of a solid; a contact algorithm based on the idea of a mild contact.

An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem

Peng Wuliang, Huang Min, Hao Yongping (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an...

A Bermúdez–Moreno algorithm adapted to solve a viscoplastic problem in alloy solidification processes

P. Barral, P. Quintela, M. T. Sánchez (2014)

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

Similarity:

The aim of this work is to present a computationally efficient algorithm to simulate the deformations suffered by a viscoplastic body in a solidification process. This type of problems involves a nonlinearity due to the considered thermo-elastic-viscoplastic law. In our previous papers, this difficulty has been solved by means of a duality method, known as Bermúdez–Moreno algorithm, involving a multiplier which was computed with a fixed point algorithm or a Newton method. In this paper,...

A modified K3M thinning algorithm

Marek Tabedzki, Khalid Saeed, Adam Szczepański (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

The K3M thinning algorithm is a general method for image data reduction by skeletonization. It had proved its feasibility in most cases as a reliable and robust solution in typical applications of thinning, particularly in preprocessing for optical character recognition. However, the algorithm had still some weak points. Since then K3M has been revised, addressing the best known drawbacks. This paper presents a modified version of the algorithm. A comparison is made with the original...