1 / 41

Engineering Optimization

Concepts and Applications. Engineering Optimization. Fred van Keulen Matthijs Langelaar CLA H21.1 A.vanKeulen@tudelft.nl. Contents. Sensitivity analysis. Sensitivity of system response (state variables). u constant. s i constant. Sensitivity analysis.

derex
Télécharger la présentation

Engineering Optimization

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Concepts and Applications Engineering Optimization • Fred van Keulen • Matthijs Langelaar • CLA H21.1 • A.vanKeulen@tudelft.nl

  2. Contents • Sensitivity analysis

  3. Sensitivity of system response (state variables) u constant si constant Sensitivity analysis • Sensitivity: derivative of response w.r.t. design variable: Total derivative Partial derivatives • Note: components of s should be independent!

  4. Sensitivity analysis (2) • What for? • Avoid curse of dimensionality by using higher-order optimization algorithms (gradient-based, Newton, …) • Examine sensitivity / robustness of optimized design solutions (parameter sensitivity) • When? • Attractive when sensitivity information can be obtained relatively cheaply

  5. Logarithmic sensitivity • Definition: • Advantages: • Dimensionless, allows comparisons between parameters • Clearly indicate the relative “strength” of the influence of parameters:>1: influential, important parameter<<1: not very influential parameter

  6. Example logarithmic sensitivity • Logarithmic sensitivity gives information on relative importance • Always use logarithmic sensitivities when comparing sensitivity values of different variables!

  7. Response Design variable Aspects of sensitivity analysis • Implementation effort • Efficiency • Accuracy and consistency Exact Numericalmodel

  8. Sensitivity analysis approaches Implementation Efficiency Very easy Terrible* Moderate As good as it gets Lots of work As good as it gets • Global finite differencesInvolves repetitive design evaluations • Discrete derivativesBased on differentiation of numerical model • Continuum derivativesBased on differentiation of governing equations

  9. x Governingequations Discrete Discretization Differentiation x Governingequations Continuum Differentiation Discretization Sensitivity analysis approaches (2) Schematically: f x Model x GFD - + f+Df x+Dx Model

  10. Automated differentiation • Automatic generation of code that computes sensitivities: Derivativecode Automaticdifferentiation Analysiscode • Many different tools exist: ADIFOR, ADOL-F (Fortran), ADIC, ADOL-C (C/C++), … • Convenient, but generally code is several times slower than hand-coded derivatives

  11. Based on Taylor series: Finite difference derivatives • Finite differences for sensitivity analysis (GFD): • Simple • Computationally inefficient (however …) • Accuracy depends on design perturbation

  12. Central FD: - Finite difference derivatives (2) • First order forward / backward FD:

  13. (forward) (central) • Forward FD error analysis: Condition error Truncation error Finite difference derivatives (3) • Similarly:

  14. FD accuracy • Perturbation h determines error: Error h

  15. Practical aspect: noise • Numerical noise can spoil FD accuracy! • Example of noise source: effect of remeshing Normalized stress constraint Hole radius

  16. Nonlinear elastic case • Relatively cheap FD sensitivities (exception): • Solution technique: incremental-iterative approachInvolves solution of many linear systems, e.g. Load • FD: start the solution process for the perturbed case from the unperturbed solution Displacement • Much less expensive than full analysis!

  17. Solution obtained by Newton iterations: • For FD, solve perturbed case by iterating from nominal solution: Nonlinear path-independent case (e.g. ) • Consider:

  18. For small design perturbation, this approaches: Originalresidual Nonlinear path-independent case • Pitfall: make sure to include the finite residuals in the FD calculation! • Consider first iteration for perturbed case: • Interpretation: just an additional Newton iterationOriginal residual dominates over effect of design perturbation

  19. Finite residual problem: solution • To improve FD accuracy with finite residuals:instead of solvingsolve i.e. subtract original residual from new residual. • Ok for Ds = 0. Original residual no longer dominates

  20. Finite difference summary • Easy to implement, black box approach • Inefficient, except for nonlinear path-independent and explicitly solved transient case • Choice of proper relative design perturbation critical • No adjoint formulation possible: unattractive in cases with many design variables and few responses

  21. Then: State variable vector sensitivity Discrete derivatives • Consider linear discretized equations (e.g. linear elastic FE model):and response (e.g. equivalent stress):

  22. Decomposed Kalready available (direct solver)! State variable sensitivity • State variable derivatives follow from differentiation of original equation: Pseudo-load vector

  23. Already decomposed tangent matrix (direct solver) State variable sensitivity (2) • Nonlinear case similar:

  24. Semi-analytical approach • Semi-analytical: use FD to compute pseudo-load: • Advantages: • Easy implementation (can be done at top level) • Efficient computation

  25. Alreadydecomposed • SA approach: computed using FD: SA: nonlinear case • Geometrically nonlinear (history-independent) setting:

  26. Options for calculation of pseudo-load vector: a) Analytical differentiation (lots of work) b) Automated differentiation (code generator programs) c) Finite difference approach Discrete derivatives CHEAP!! • Note, computation of discrete derivatives • Only involves a linear equation, also in nonlinear case • Allows re-use of the decomposed system matrix  Sensitivity analysis much cheaper than analysis itself!

  27. SA accuracy problem • Accuracy of semi-analytical (SA) sensitivities w.r.t. shape variables reduces for cases with substantial rotations (slender structures) • Problem increases with mesh refinement!?! SEE APPENDIX

  28. Eigenvalue sensitivities • Important class of responses: eigenvalues • Discrete sensitivity analysis:

  29. Eigenvalue sensitivities (2) • Result: • Note, no need to compute eigenvector sensitivities v’! If needed, one can use Nelson’s method(but rather expensive) • Difficulties: eigenvalue multiplicity, mode switching ...

  30. Contents • Sensitivity analysis: • Brief recap discrete / SA approach • Adjoint method • Continuum sensitivities • Topology optimization • Closure

  31. and Adjoint discrete sensitivities • Discussed direct approach: • One backsubstitution needed for every design variable: not attractive for many design variables • Alternative: adjoint formulation

  32. = 0 • To avoid computation of state vector derivatives, choose li such that vanishes! Adjoint sensitivities • Starting point: augmented response:

  33. Adjoint sensitivities (2) • Result: • One backsubstitution per response: attractive in case of many design variables and few responses

  34. Difference consists of order of computations: Adjoint vs. direct • Direct method attractive when #variables < #responses,adjoint method attractive when #variables > #responses • Note, adjoint method requires load vector composed of response derivatives (specific implementation)

  35. Sensitivities in transient case • Transient analysis: • Sensitivities at time ti depend on sensitivities at previous instants • Direct method: forward time integration of sensitivities • Adjoint method: backward time integration of sensitivities (unattractive, storage problem) • FD often preferred for explicitly solved transient problems

  36. x Governingequations Discretization Differentiation Discrete derivative summary • Generally efficient and easy to implement, particularly semi-analytical case (combination with FD) • Reuse of decomposed stiffness matrix (with direct solver – with iterative solver, reuse of preconditioner) • Direct and adjoint versions • SA: accuracy problems for structures under large rotations (beams, shells)

  37. Contents • Sensitivity analysis: • Brief recap discrete / SA approach • Adjoint method • Continuum sensitivities • Topology optimization • Closure

  38. x Governingequations Differentiation Discretization q(x) I(x,s) x Governing equation: + boundary conditions Continuum derivatives • Example: beam bending(Euler-Bernoulli beam)

  39. Compare: Governing equation Sensitivity equation Continuum derivatives (2) • Now differentiate w.r.t. s: • For nonlinear / complex problems, the continuum sensitivity equations are often simpler

  40. Sensitivity analysis summary • Sensitivities important in optimization: • Efficient higher-order optimization algorithms • Evaluation of robustness of results • Choice of sensitivity analysis method depends on: • Number of design variables vs. number of responses (adjoint vs. direct) • Type of model (cheap / expensive, linear / nonlinear / transient) • Implementation effort, access to source code

  41. Perturbation size critical • Efficient for nonlinear elastic & explicit transient case • Inaccurate for large rotations • Remedies: exact / refined version Sensitivity analysis summary (2) Points of attention Implementation Adjoint mode Efficiency Accuracy Finite difference Discrete derivativesSemi-analytical Continuum derivatives

More Related