• Aucun résultat trouvé

Solving extremely ill-posed structures

N/A
N/A
Protected

Academic year: 2021

Partager "Solving extremely ill-posed structures"

Copied!
29
0
0

Texte intégral

(1)

Solving extremely ill-posed structures

Lars Beex Marc Duflotb Laurent Adamb

(2)
(3)

Introduction

(4)

Problem: no out-of-plane stiffness

x y

(5)
(6)
(7)

Energy minimisation without Hessian

x y

(8)

Energy minimisation: steepest descent

View 1 Top view

START: u0 E(u0)

(9)

Energy minimisation: steepest descent

View 1 Top view

START: u0 E(u0) -f(u0)

(10)

Energy minimisation: steepest descent

View 1 Top view

UPDATE: ui+1 = ui – α f(ui)

(11)

Energy minimisation: steepest descent

View 1 Top view

(12)

Energy minimisation: steepest descent

View 1 Top view

CONDITION: small stepsize α

(13)

Steepest descent with backtracking linesearch (BTLS)

View 1 Top view

IDEA: once you know the search direction,

(14)

Steepest descent with backtracking linesearch (BTLS)

Cross-section along search direction

(15)

Steepest descent with backtracking linesearch (BTLS)

BACKTRACKING: αi = α0

while E(αi+1) < E(αi) αi+1 = 0.5 αi

(16)

Steepest descent vs Steepest descent with BTLS

(17)

Steepest descent with backtracking linesearch (BTLS)

Problem BACKTRACKING: New point is higher than starting point

(18)

Steepest descent with BTLS and Armijo Rule (AR)

Solution: apply Armijo Rule, before backtracking E(ui – αi+1 f(ui)) ≤ E(ui) – c1 α0 f(ui)T f(u

i)

(19)

Steepest descent with BTLS vs Steepest descent with BTLS & AR

(20)

Steepest descent with BTLS and Armijo Rule

Consider the following case:

Cross-section along search direction

(21)

Steepest descent with BTLS and Armijo rule

Include Curvature Rule to ensure that the slope changes enough

Cross-section along search direction

(22)

Steepest descent with BTLS incl. AR and CR

Curvature Rule:

f(ui)T f(u

i+1) ≤ c2 f(ui)T f(ui)

Terminology:

(23)

Steepest descent with BTLS & AR vs Steepest descent with BTLS & WC

(24)

Conjugate gradient instead of Steepest descent

trond.hjorteland.com

(25)

Conjugate gradient vs Steepest descent

Steepest descent update:

ui+1 = ui – α f(ui)

Conjugate gradient update for 2nd step:

u2 = u1 – α ( f(u1) - β f(u0) ) where β: β(f(u1), f(u0))

(26)

Steepest descent with BTLS & AR vs Steepest descent with BTLS & WC

(27)

Truss network: Conjugate gradient with BTLS & WC

x y

(28)

Truss network: Conjugate gradient with BTLS & WC

(29)

Final remarks

Contact cannot be included via standard penalty methods or Lagrange multipliers

Energy landscape must be smooth

à no discontinuous potential

à no dissipation, BUT varational dissipation!! à no friction in contact

Références

Documents relatifs

Avec VI planches. Mémoire publié à l'occasion du Jubilé de l'Université. Mémoire publié à l'occasion du Jubilé de l'Université.. On constate l'emploi régulier

D’une mani`ere quantitative, on observe des d´eviations qui proviennent du fait que les r´egressions ont ´et´e effectu´ees sur seulement trois valeurs diff´erentes de c et

La fonction de transfert est aussi employ´ee en optique de champ proche [Pieralli 94] pour ´etudier le couplage sonde-objet dans le PSTM en mode collection et en SNOM en

We present some extensions to the limited memory steepest descent method based on spectral properties and cyclic iterations.. Our aim is to show that it is possible to combine sweep

We introduce an algorithm generating uniformly distributed random permutations with a prescribed descent set.. 1 Statement of

In particular, second order stochastic gradient and averaged stochastic gradient are asymptotically efficient after a single pass on the training set.. Keywords: Stochastic

Keywords: Riemannian manifold, gradient flow, steepest descent, convex- ity, minimization.. AMS Subject Classification:

The rate of grade A POPF after PD was significantly increased in patients with CSD, but that modality of drainage did not impact clinically relevant grade B/C POPF,