Recent CASA consultancy activities By Jürgen Tas 09 - 05 - 2006.

Slides:



Advertisements
Similar presentations
Is the shape below a function? Explain. Find the domain and range.
Advertisements

Optimal Shape Design of Membrane Structures Chin Wei Lim, PhD student 1 Professor Vassili Toropov 1,2 1 School of Civil Engineering 2 School of Mechanical.
Parameterizing a Geometry using the COMSOL Moving Mesh Feature
Reinforcement for Plates Course CT4150 Lecture12 5 Jan
Line Balancing Problem A B C 4.1mins D 1.7mins E 2.7 mins F 3.3 mins G 2.6 mins 2.2 mins 3.4 mins.
Least Square Method Curve Fitting. Linear Least Square Method.
Lecture 23 Exemplary Inverse Problems including Earthquake Location.
Inversion Transforming the apparent to « real » resistivity. Find a numerical model that explains the field measurment.
Hazırlayan NEURAL NETWORKS Least Squares Estimation PROF. DR. YUSUF OYSAL.
Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
Linear Programming Unit 2, Lesson 4 10/13.
N.E. Leonard – ASAP Progress Meeting – February 17-18, 2005 Slide 1/22 ASAP Progress Report Adaptive Sampling and Cooperative Control Naomi Ehrich Leonard.
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
Methods For Nonlinear Least-Square Problems
Fitting. We’ve learned how to detect edges, corners, blobs. Now what? We would like to form a higher-level, more compact representation of the features.
Examples of Various Formulations of Optimization Problems.
1 Deformation and damage of lead free materials and joints J. Cugnoni*, A. Mellal*, Th. J. J. Botsis* * LMAF / EPFL EMPA Switzerland.
PETE 603 Lecture Session #29 Thursday, 7/29/ Iterative Solution Methods Older methods, such as PSOR, and LSOR require user supplied iteration.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
1 Assessment of Imprecise Reliability Using Efficient Probabilistic Reanalysis Farizal Efstratios Nikolaidis SAE 2007 World Congress.
Yuan Chen Advisor: Professor Paul Cuff. Introduction Goal: Remove reverberation of far-end input from near –end input by forming an estimation of the.
ITERATIVE TECHNIQUES FOR SOLVING NON-LINEAR SYSTEMS (AND LINEAR SYSTEMS)
Lecture Objectives Review SIMPLE CFD Algorithm SIMPLE Semi-Implicit Method for Pressure-Linked Equations Define Residual and Relaxation.
Computer Graphics Group Tobias Weyand Mesh-Based Inverse Kinematics Sumner et al 2005 presented by Tobias Weyand.
1 Hybrid methods for solving large-scale parameter estimation problems Carlos A. Quintero 1 Miguel Argáez 1 Hector Klie 2 Leticia Velázquez 1 Mary Wheeler.
1 Numerical Shape Optimisation in Blow Moulding Hans Groot.
Mechatronic group at UiA 15 full time employed in teaching and labs. Mechatronic profile at UiA characterized by: High power / Power Mechatronics Dynamic.
© J. Christopher Beck Lecture 5: Project Planning 2.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
G(m)=d mathematical model d data m model G operator d=G(m true )+  = d true +  Forward problem: find d given m Inverse problem (discrete parameter estimation):
Curve-Fitting Regression
C entre for A nalysis, S cientific computing and A pplications
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
1 Part IV: Blade Geometry Optimization Philippe Giguère Graduate Research Assistant Steady-State Aerodynamics Codes for HAWTs Selig, Tangler, and Giguère.
Efficient computation of Robust Low-Rank Matrix Approximations in the Presence of Missing Data using the L 1 Norm Anders Eriksson and Anton van den Hengel.
© 2011 Autodesk Freely licensed for use by educational institutions. Reuse and changes require a note indicating that content has been modified from the.
Ch. 3: Geometric Camera Calibration
Lecture Objectives Review Define Residual and Relaxation SIMPLE CFD Algorithm SIMPLE Semi-Implicit Method for Pressure-Linked Equations.
EECS 274 Computer Vision Geometric Camera Calibration.
C entre for A nalysis, S cientific computing and A pplications
Data Modeling Patrice Koehl Department of Biological Sciences National University of Singapore
Parallel and Distributed Simulation Time Parallel Simulation.
© 2012 Autodesk A Fast Modal (Eigenvalue) Solver Based on Subspace and AMG Sam MurgieJames Herzing Research ManagerSimulation Evangelist.
Bayesian Brain: Probabilistic Approaches to Neural Coding Chapter 12: Optimal Control Theory Kenju Doya, Shin Ishii, Alexandre Pouget, and Rajesh P.N.Rao.
Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.
Constraints Feasible region Bounded/ unbound Vertices
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
The KOSMOSHOWS What is it ? The statistic inside What it can do ? Future development Demonstration A. Tilquin (CPPM)
INTRO TO OPTIMIZATION MATH-415 Numerical Analysis 1.
Advanced Light Transport in the VFX/Archiviz industry Juan Cañada – Head of Maxwell Render Next Limit Technologies.
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
Review for E&CE Find the minimal cost spanning tree for the graph below (where Values on edges represent the costs). 3 Ans. 18.
Fitting.
Instructional Design Document Simplex Method - Optimization STAM Interactive Solutions.
Flexural stiffness design by integer linear programming.
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
Lucas-Kanade Image Alignment Iain Matthews. Paper Reading Simon Baker and Iain Matthews, Lucas-Kanade 20 years on: A Unifying Framework, Part 1
1. What does a need to be if there were infinitely many solutions to the system of equations. y + 2x = 12 2y + 4x = 2a.
Section 3.5 Linear Programing In Two Variables. Optimization Example Soup Cans (Packaging) Maximize: Volume Minimize: Material Sales Profit Cost When.
STT-RAM Feasibility Study Amr Amin UCLA Jan 2010.
Geometric Camera Calibration
L14 Curve Fitting Homework Curve Fitting – least squares
Estimating 2-view relationships
3-3 Optimization with Linear Programming
Linear Programming.
Optimization of Gamma Knife Radiosurgery
CALCULATING EQUATION OF LEAST SQUARES REGRESSION LINE
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Presentation transcript:

Recent CASA consultancy activities By Jürgen Tas

Consultancy Added-value for the industry: optimize process parameters improve products provide insight in production processModelling NumericalSimulations Product and Process optimization

Goal Presentation Three relevant practical cases Explain - problem - approach - solution / result - future work / idea's Feedback!

Case 1: Problem(1) For measured spectrum: Find shape parameters: Such that: -   0 (best fit) measured computed Optical diffraction Micro structure

Case 1: Problem(2) Forward problem (simulation) Minimize cost function Define initial shape Compute spectrumUpdate shape Goal: Software Tool (30mins → 1 sec.) Inverse problem Computed ≈ Measured No Yes START END

Case 1: Approach Mathematics Least Squares (Gauss-Newton) Maxwell equations Sub-sampling Multivariate data analysis Software development C++ implementation with LAPACK Caching / Library Parallel Computing

Case 1: Solution(1) Nonlinear Least Squares Problem: “Computed ≈ Measured” (best fit) min p ║C(p) – M║ 2 = min p ║F(p)║ 2 Gauss-Newton SymbolMath. descriptionDescription pp = [p 1,...,p n ] T n shape parameters MM = [M 1,...,M m ] T m measured points CC(p) = [C 1 (p),...,C m (p)] T m computed points, (C: R n → R m )

Case 1: Solution(2) Features: linearization QR (normal eqn) relaxation } while(!converged ) i = 0 do { A = (  F/  p)(p i ), b = Ap i – F(p i ) linear LS: Ap i+1 = QRp i+1 = b p i+1 = (1-λ)p i + λp i+1, 0 ≤ λ ≤ 1 i++ Disadvantages: initial guess Jacobian expensive

Case 1: Future Ideas Robustness: damped Gauss-Newton (LM) adaptive relaxation Speed-Up: less iterations (← good initial guess) estimate Jacobian (Quasi-Newton) Trade-off? 30mins → 15 sec. (speed-up x 120!!)

Case 2: Problem Feasibility Study: Bellows - hearing aid devices Maximum Stress for - given form - given material - given load Yield point x

Case 2: Approach COMSOL Multiphysics Benchmark!

Case 2: Results (1) 25μm 650μm 975 μ m 5MPa (force/area)

Case 2: Results (2)

Case 2: Results (3) spring stiffness

Case 2: Future Work minimize spring stiffness minimize maximum Von Mises stress? Shape optimization by: Under constraints: minimum wall thickness minimum flow rate? Formulation: inverse problem?

Case 3: Problem(1) Fastest path (A → B) |x´(t)| ≤ v max, |x´´(t)| ≤ a max Avoid obstacles

Case 3: Problem (2) Time-Optimal Control Theory x y Obstacle ● ● B A x(0), x´(0) x(T), x´(T) minimal T? |x´(t)| ≤ v max, |x´´(t)| ≤ a max

Case 3: Approach (2)?? Time Optimization Problem: Given x 0 єR 2, determine T>0 and a function u:[0,T]→[-a max,a max ] such that the solution of x´ = Ax + bu with initial values x(0) = x 0, x´(0) = 0, we have x(T) = 0, x´(T) = 0, | x´ (t) | ≤ v max for a minimal T. + Avoid obstacles!!

Case 2: Future Work Minimize cost function Parameterized Bellow Forward ProblemUpdate shape Design: optimal shape + max. stress ≤ τ max Inverse problem Optimal Shape? No Yes START END Comsol Multiphysics (White Box) Constraint: max. stress ≤ τ max