26,161 research outputs found
Substructured formulations of nonlinear structure problems - influence of the interface condition
We investigate the use of non-overlapping domain decomposition (DD) methods
for nonlinear structure problems. The classic techniques would combine a global
Newton solver with a linear DD solver for the tangent systems. We propose a
framework where we can swap Newton and DD, so that we solve independent
nonlinear problems for each substructure and linear condensed interface
problems. The objective is to decrease the number of communications between
subdomains and to improve parallelism. Depending on the interface condition, we
derive several formulations which are not equivalent, contrarily to the linear
case. Primal, dual and mixed variants are described and assessed on a simple
plasticity problem.Comment: in International Journal for Numerical Methods in Engineering, Wiley,
201
Virtual Delamination Testing through Non-Linear Multi-Scale Computational Methods: Some Recent Progress
This paper deals with the parallel simulation of delamination problems at the
meso-scale by means of multi-scale methods, the aim being the Virtual
Delamination Testing of Composite parts. In the non-linear context, Domain
Decomposition Methods are mainly used as a solver for the tangent problem to be
solved at each iteration of a Newton-Raphson algorithm. In case of strongly
nonlinear and heterogeneous problems, this procedure may lead to severe
difficulties. The paper focuses on methods to circumvent these problems, which
can now be expressed using a relatively general framework, even though the
different ingredients of the strategy have emerged separately. We rely here on
the micro-macro framework proposed in (Ladev\`eze, Loiseau, and Dureisseix,
2001). The method proposed in this paper introduces three additional features:
(i) the adaptation of the macro-basis to situations where classical
homogenization does not provide a good preconditioner, (ii) the use of
non-linear relocalization to decrease the number of global problems to be
solved in the case of unevenly distributed non-linearities, (iii) the
adaptation of the approximation of the local Schur complement which governs the
convergence of the proposed iterative technique. Computations of delamination
and delamination-buckling interaction with contact on potentially large
delaminated areas are used to illustrate those aspects
Lock-in Problem for Parallel Rotor-router Walks
The rotor-router model, also called the Propp machine, was introduced as a
deterministic alternative to the random walk. In this model, a group of
identical tokens are initially placed at nodes of the graph. Each node
maintains a cyclic ordering of the outgoing arcs, and during consecutive turns
the tokens are propagated along arcs chosen according to this ordering in
round-robin fashion. The behavior of the model is fully deterministic. Yanovski
et al.(2003) proved that a single rotor-router walk on any graph with m edges
and diameter stabilizes to a traversal of an Eulerian circuit on the set of
all 2m directed arcs on the edge set of the graph, and that such periodic
behaviour of the system is achieved after an initial transient phase of at most
2mD steps. The case of multiple parallel rotor-routers was studied
experimentally, leading Yanovski et al. to the conjecture that a system of k
\textgreater{} 1 parallel walks also stabilizes with a period of length at
most steps. In this work we disprove this conjecture, showing that the
period of parallel rotor-router walks can in fact, be superpolynomial in the
size of graph. On the positive side, we provide a characterization of the
periodic behavior of parallel router walks, in terms of a structural property
of stable states called a subcycle decomposition. This property provides us the
tools to efficiently detect whether a given system configuration corresponds to
the transient or to the limit behavior of the system. Moreover, we provide
polynomial upper bounds of and on the
number of steps it takes for the system to stabilize. Thus, we are able to
predict any future behavior of the system using an algorithm that takes
polynomial time and space. In addition, we show that there exists a separation
between the stabilization time of the single-walk and multiple-walk
rotor-router systems, and that for some graphs the latter can be asymptotically
larger even for the case of walks
Strict bounding of quantities of interest in computations based on domain decomposition
This paper deals with bounding the error on the estimation of quantities of
interest obtained by finite element and domain decomposition methods. The
proposed bounds are written in order to separate the two errors involved in the
resolution of reference and adjoint problems : on the one hand the
discretization error due to the finite element method and on the other hand the
algebraic error due to the use of the iterative solver. Beside practical
considerations on the parallel computation of the bounds, it is shown that the
interface conformity can be slightly relaxed so that local enrichment or
refinement are possible in the subdomains bearing singularities or quantities
of interest which simplifies the improvement of the estimation. Academic
assessments are given on 2D static linear mechanic problems.Comment: Computer Methods in Applied Mechanics and Engineering, Elsevier,
2015, online previe
Total and selective reuse of Krylov subspaces for the resolution of sequences of nonlinear structural problems
This paper deals with the definition and optimization of augmentation spaces
for faster convergence of the conjugate gradient method in the resolution of
sequences of linear systems. Using advanced convergence results from the
literature, we present a procedure based on a selection of relevant
approximations of the eigenspaces for extracting, selecting and reusing
information from the Krylov subspaces generated by previous solutions in order
to accelerate the current iteration. Assessments of the method are proposed in
the cases of both linear and nonlinear structural problems.Comment: International Journal for Numerical Methods in Engineering (2013) 24
page
Variational Theory and Domain Decomposition for Nonlocal Problems
In this article we present the first results on domain decomposition methods
for nonlocal operators. We present a nonlocal variational formulation for these
operators and establish the well-posedness of associated boundary value
problems, proving a nonlocal Poincar\'{e} inequality. To determine the
conditioning of the discretized operator, we prove a spectral equivalence which
leads to a mesh size independent upper bound for the condition number of the
stiffness matrix. We then introduce a nonlocal two-domain variational
formulation utilizing nonlocal transmission conditions, and prove equivalence
with the single-domain formulation. A nonlocal Schur complement is introduced.
We establish condition number bounds for the nonlocal stiffness and Schur
complement matrices. Supporting numerical experiments demonstrating the
conditioning of the nonlocal one- and two-domain problems are presented.Comment: Updated the technical part. In press in Applied Mathematics and
Computatio
- …