#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1995

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- D. Dureisseix, C. Farhat
- 2000

We present a domain decomposition method with Lagrange multipliers for solving iteratively frictionless contact problems. This method, which is based on the FETI method and therefore is named here the FETI-C method, incorporates a coarse contact system that guides the iterative prediction of the active zone of contact. We demonstrate numerically that this… (More)

- P. Ladevèze, D. Dureisseix
- 2000

SUMMARY A new micro-macro computational strategy is proposed for the analysis of structures which are described up to the micro level, such as composite structures. The description of micro and macro quantities is performed on the interface arising from the decomposition of the structure into an assembly of substructures and interfaces. A traction-based… (More)

- B. Vereecke, H. Bavestrello, D. Dureisseix
- 2003

Incompressible and nearly incompressible problems are treated herein with a mixed finite element formulation in order to avoid ill-conditioning that prevents accuracy in pressure estimation and lack of convergence for iterative solution algorithms. A multilevel dual domain decomposition method is then chosen as an iterative algorithm: the original FETI and… (More)

- Tobias Oetiker, Hubert Partl, +27 authors Rasmus Borup
- 2001

- David Dureisseix
- 1997

SUMMARY Multiphysics phenomena and coupled-field problems usually lead to analyses which are computationally intensive. Strategies to keep the cost of these problems affordable are of special interest. For coupled fluid-structure problems, for instance, partitioned procedures and staggered algorithms are often preferred to direct analysis. In this paper, we… (More)

- Tobias Oetiker, Hubert Partl, +33 authors Aleksandar S Milosevic
- 2001

This document is free; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This document is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of… (More)

- David Dureisseix
- ArXiv
- 2015

This article is concerned with an example of complex planar geometry arising from flat origami challenges. The complexity of solution algorithms is illustrated, depending on the depth of the initial analysis of the problem, starting from brute force enumeration, up to the equivalence to a dedicated problem in graph theory. This leads to algorithms starting… (More)

- Tobias Oetiker, Hubert Partl, +33 authors Aleksandar S Milosevic
- 2001

This document is free; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This document is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of… (More)