Parameter Estimation for Bingham Models
|
|
- James Chase
- 8 years ago
- Views:
Transcription
1 Dr. Volker Schulz, Dmitriy Logashenko Parameter Estimation for Bingham Models supported by BMBF
2 Parameter Estimation for Bingham Models Industrial application of ceramic pastes Material laws for Bingham fluids Parameter identification technique Discretization of the model Numerical solution of the variational problem Experiment Precision of the technique Shape Optimization of the device Optimal Shape: numerical results
3 Industrial applications: Object: ceramic pastes used, e. g. in production of bricks or bodies of catalytic converters Industrial partner: Braun GmbH (Friedrichshafen) Products: outlets for the extrusion machines Aim of the project: a fast model based measurement technique which allows the simultaneous determination of all model parameters from one experiment.
4 The continuity and impulse equations: divu = 0, ρ u t = divt + f with the stress tensor: T = pi + T E (D), where D = 1 2 ( u + ( u) T ) is the strain tensor. For Bingham fluids T E (D) = 2µ(D)D = 2 where II D is the second invariant of D, ( ) η B + τ F (2II D ) 1 2 D II D = 1 2 ( TrD 2 (TrD) 2) = 1 2 TrD2. This form of T E holds only under a condition II T E > τf 2 else the material is considered as a rigid body: D = 0 for II T E τf 2. Two parameters: η B τ F Bingham viscosity, yield stress.
5 Regularization: µ(d) = η B + τ F (δ + 2II D ) 1 2 δ a regularization parameter. The regularized PDE system for a stationary flow: ( ( divu = 0, ) ) div 2 η B + τ F (δ + 2Tr D 2 ) 1 2 D + p = 0. The stress tensor: T = pi + 2(η B + τ F (δ + 2Tr D 2 ) 1 2) D The boundary conditions of the 3rd kind for describing the wall sliding: n T Tt ku T t = τ G, u T n = 0. Two additional parameters: k τ G wall sliding factor, sliding limit.
6 Parameter identification devices for measuring the Γ 0 normal stress H Γ in Γ 0 L α Γ out h For the used device H = 30 mm, h = 10 mm, L = 244 mm, α The average inflow velocity of the paste is 80 mm s.
7 Let the equation c(u, p, q) = 0 comprise the PDE system with the boundary conditions, where q = (η B, τ F,k, τ G ) T. Note that the pressure p is defined up to a constant. The parameters are determined from the output least squares problem where 7 i=2 1 σ 2 i ((π Pi (u, p, q) π P1 (u, p, q)) (ˆπ i ˆπ 1 )) 2 min s. t. c(u, p, q) = 0, P i are the measurement points ˆπ i are the measured normal stresses π P (u, p, q) = n T P T P(u, p, q)n P are the normal stresses computed on u and p σ i = 0.08(ˆπ i +ˆπ 1 ) are the standard deviations for the difference evaulations, if all measurements are assumed to be independently normally distributed with expectation ˆπ i and standard deviation 0.08ˆπ i.
8 Discretization A collocated finite-volume scheme based on the idea from Schneider G.E., Raw M.J. Control Volume Finite- Element Method for Heat Transfer and Fluid Flow Using Colocated Variables 1. Computational Procedure. Numerical Heat Transfer 11: (1987) The fixed point method for the solution of the discretized system. The discretized system is represented in the form where A is a sparse matrix. A(x, q)x = f, The inner multi-grid method with ILU smoothers for the solution of the linear systems in the fixed point iteration. The model has been implemented on the base of UG toolbox (s. Bastian P., Birken K., Johannsen K., Lang S., Neuß N., Wieners C. UG a flexible software toolbox for solving partial differential equations. Comput Visual Sci 1: (1997)).
9 The discretized problem: f(x, q) min, s. t. c(x, q) = 0, where f : R n 4 R and c : R n 4 R n. The Jacobian J = c x is assumed to be nonsingular. The dimention n of the constraint is very large application of structure exploiting methods to reduce the computation time. Numerical solution by a Reduced SQP method. Idea: Linearization of the constraint by a Taylor expansion: c(x, q) + J(x, q) x + c (x, q) q = 0, q imposing a quadratic subproblem with the approximate projected Hessian of the Lagrangian L(x, q, λ) = f(x, q) λ T c(x, q).
10 Algorithm 1: The Redused SQP method. (0) Set k := 0; start at some initial guess x 0, q 0. (1) Compute the adjoint variables from the linear system J T (x k, q k ) λ k+1 := x f(x k, q k ); compute the reduced gradient ( ) c T γ k := q f(x k, q k ) q (x k, q k ) λ k+1; determine some approximation B k of the projected Hessian of the Lagrangian. (2) solve B k q k = γ k. (3) compute step on x from the linear system J(x k, q k ) x k := c q (x k, q k ) q k + c(x k, q k ). (4) Set x k+1 := x k + x k, q k+1 := q k + q k. (5) k := k + 1; go to (1) until convergence. The approximate projected Hessian B k by BGFS update formula: B 0 B k+1 = αi, = B k + v kv T k v T k s k with s k := q k q k 1, v k := γ k γ k 1. (Bs k)(bs k ) T s T k Bs k 2-step superlinear local convergence to the minimum Difficulty: necessaty of inverting J and J T.,
11 Algorithm 2: The RSQP method with an approximate Jacobian. (0) Set k := 0; start at some initial guess x 0, q 0. (1) Compute λ k from the linear system A T (x k, q k ) λ k := x f(x k, q k ) J T (x k, q k ) λ k ; compute the reduced gradient ( ) c T γ k := q f(x k, q k ) q (x k, q k ) (λ k + λ k ); determine some approximation B k of the projected Hessian of the Lagrangian. (2) solve B k q k = γ k. (3) compute step on x form the linear system A(x k, q k ) x k := c q (x k, q k ) q k + c(x k, q k ). (4) Set x k+1 := x k + x k, q k+1 := q k + q k and λ k+1 = λ k + λ k. (5) k := k + 1; go to (1) until convergence. Equivalent to: 0 0 A ( T c 0 B k q A c 0 q ) T x q λ = xl q L c.
12 Experiment π i π 1, bar i The differences of the normal stresses. Empty circles the relative measured stresses (ˆπ i ˆπ 1 ), the black circles the computed stresses π h,i (x, q) π h,1 (x, q) Computation time of the parameter identification: 12 min. Computation time of the flow simulation: 5 min. (SGI Indigo 2 with a R4400 Processor, 200 MHz) η B = bar s, k = bar s m, τ F = 3.03 bar, τ G = bar.
13 Precision of the parameters We assume that the measurements at the different measurement points are statistically independent and satisfy the normal distribution. The precision of these measurements is 8%. Let Π(x, q) = (π 2 (x, q) π 1 (x, q),..., π 7 (x, q) π 1 (x, q)) T, ( ) Π Π S(q) = J 1 c q x q I (here x form c(x, q) = 0). D = diag {0.08(ˆπ i 1 ˆπ 1 )}. The covariance matrix of the parameters: [ 1 Cov(q) = (S(q)) T D S(q)] 2. Covariances for the simple device: Value Cov. 95%-conf. int η B ±237.4 τ F ±410.8 k ±428.5 τ G ±17.5
14 Shape optimization of the device h 0 h 1 h 2 h 3 h 4 h 5 h 6 h 7 L (A-optimal design) Numerical solution: Φ(Cov(q)) = 1 Tr Cov(q) min 4 s. t. h 0... h 7, h 0 h min, h 7 h max A gradient-free optimization method Penalty technique for the constraints Assumption that all normal stresses are measured with the equal absolute standard deviations
15 Numerical results for the optimized shape: the pressure field Confidence intervals for the simple and optimized devices: Parameter Simple Optimized η B = bar s ±26.3 ± τ F = 3.03 bar ±38.5 ± k = bar s ±46.2 ± m τ G = bar ±1.48 ± (Standard deviation of the stress measurements: 0.05 bar)
16 Conclusion: Simulation of Flows of the Bingham Fluids Parameter Identification Shape Optimization for the Measurement Device
Applications to Data Smoothing and Image Processing I
Applications to Data Smoothing and Image Processing I MA 348 Kurt Bryan Signals and Images Let t denote time and consider a signal a(t) on some time interval, say t. We ll assume that the signal a(t) is
More informationLecture 3: Linear methods for classification
Lecture 3: Linear methods for classification Rafael A. Irizarry and Hector Corrada Bravo February, 2010 Today we describe four specific algorithms useful for classification problems: linear regression,
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 10
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 10 Boundary Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More informationOpenFOAM Optimization Tools
OpenFOAM Optimization Tools Henrik Rusche and Aleks Jemcov h.rusche@wikki-gmbh.de and a.jemcov@wikki.co.uk Wikki, Germany and United Kingdom OpenFOAM Optimization Tools p. 1 Agenda Objective Review optimisation
More informationDiscrete mechanics, optimal control and formation flying spacecraft
Discrete mechanics, optimal control and formation flying spacecraft Oliver Junge Center for Mathematics Munich University of Technology joint work with Jerrold E. Marsden and Sina Ober-Blöbaum partially
More informationNumerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
More informationOptimization of Supply Chain Networks
Optimization of Supply Chain Networks M. Herty TU Kaiserslautern September 2006 (2006) 1 / 41 Contents 1 Supply Chain Modeling 2 Networks 3 Optimization Continuous optimal control problem Discrete optimal
More informationOPTIMAL DISPATCH OF POWER GENERATION SOFTWARE PACKAGE USING MATLAB
OPTIMAL DISPATCH OF POWER GENERATION SOFTWARE PACKAGE USING MATLAB MUHAMAD FIRDAUS BIN RAMLI UNIVERSITI MALAYSIA PAHANG v ABSTRACT In the reality practical power system, power plants are not at the same
More informationChristfried Webers. Canberra February June 2015
c Statistical Group and College of Engineering and Computer Science Canberra February June (Many figures from C. M. Bishop, "Pattern Recognition and ") 1of 829 c Part VIII Linear Classification 2 Logistic
More informationNonlinear Algebraic Equations Example
Nonlinear Algebraic Equations Example Continuous Stirred Tank Reactor (CSTR). Look for steady state concentrations & temperature. s r (in) p,i (in) i In: N spieces with concentrations c, heat capacities
More informationNonlinear Algebraic Equations. Lectures INF2320 p. 1/88
Nonlinear Algebraic Equations Lectures INF2320 p. 1/88 Lectures INF2320 p. 2/88 Nonlinear algebraic equations When solving the system u (t) = g(u), u(0) = u 0, (1) with an implicit Euler scheme we have
More informationPaper Pulp Dewatering
Paper Pulp Dewatering Dr. Stefan Rief stefan.rief@itwm.fraunhofer.de Flow and Transport in Industrial Porous Media November 12-16, 2007 Utrecht University Overview Introduction and Motivation Derivation
More informationCSCI567 Machine Learning (Fall 2014)
CSCI567 Machine Learning (Fall 2014) Drs. Sha & Liu {feisha,yanliu.cs}@usc.edu September 22, 2014 Drs. Sha & Liu ({feisha,yanliu.cs}@usc.edu) CSCI567 Machine Learning (Fall 2014) September 22, 2014 1 /
More informationPOISSON AND LAPLACE EQUATIONS. Charles R. O Neill. School of Mechanical and Aerospace Engineering. Oklahoma State University. Stillwater, OK 74078
21 ELLIPTICAL PARTIAL DIFFERENTIAL EQUATIONS: POISSON AND LAPLACE EQUATIONS Charles R. O Neill School of Mechanical and Aerospace Engineering Oklahoma State University Stillwater, OK 74078 2nd Computer
More informationMachine Learning and Data Mining. Regression Problem. (adapted from) Prof. Alexander Ihler
Machine Learning and Data Mining Regression Problem (adapted from) Prof. Alexander Ihler Overview Regression Problem Definition and define parameters ϴ. Prediction using ϴ as parameters Measure the error
More informationThe Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method
The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method Robert M. Freund February, 004 004 Massachusetts Institute of Technology. 1 1 The Algorithm The problem
More informationMesh Discretization Error and Criteria for Accuracy of Finite Element Solutions
Mesh Discretization Error and Criteria for Accuracy of Finite Element Solutions Chandresh Shah Cummins, Inc. Abstract Any finite element analysis performed by an engineer is subject to several types of
More information2.2 Creaseness operator
2.2. Creaseness operator 31 2.2 Creaseness operator Antonio López, a member of our group, has studied for his PhD dissertation the differential operators described in this section [72]. He has compared
More informationHPC enabling of OpenFOAM R for CFD applications
HPC enabling of OpenFOAM R for CFD applications Towards the exascale: OpenFOAM perspective Ivan Spisso 25-27 March 2015, Casalecchio di Reno, BOLOGNA. SuperComputing Applications and Innovation Department,
More informationDuality in General Programs. Ryan Tibshirani Convex Optimization 10-725/36-725
Duality in General Programs Ryan Tibshirani Convex Optimization 10-725/36-725 1 Last time: duality in linear programs Given c R n, A R m n, b R m, G R r n, h R r : min x R n c T x max u R m, v R r b T
More informationNumerical Analysis of Independent Wire Strand Core (IWSC) Wire Rope
Numerical Analysis of Independent Wire Strand Core (IWSC) Wire Rope Rakesh Sidharthan 1 Gnanavel B K 2 Assistant professor Mechanical, Department Professor, Mechanical Department, Gojan engineering college,
More informationComputing a Nearest Correlation Matrix with Factor Structure
Computing a Nearest Correlation Matrix with Factor Structure Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with Rüdiger
More informationIntroduction to the Finite Element Method
Introduction to the Finite Element Method 09.06.2009 Outline Motivation Partial Differential Equations (PDEs) Finite Difference Method (FDM) Finite Element Method (FEM) References Motivation Figure: cross
More informationSIXTY STUDY QUESTIONS TO THE COURSE NUMERISK BEHANDLING AV DIFFERENTIALEKVATIONER I
Lennart Edsberg, Nada, KTH Autumn 2008 SIXTY STUDY QUESTIONS TO THE COURSE NUMERISK BEHANDLING AV DIFFERENTIALEKVATIONER I Parameter values and functions occurring in the questions belowwill be exchanged
More information(Quasi-)Newton methods
(Quasi-)Newton methods 1 Introduction 1.1 Newton method Newton method is a method to find the zeros of a differentiable non-linear function g, x such that g(x) = 0, where g : R n R n. Given a starting
More informationMultigrid preconditioning for nonlinear (degenerate) parabolic equations with application to monument degradation
Multigrid preconditioning for nonlinear (degenerate) parabolic equations with application to monument degradation M. Donatelli 1 M. Semplice S. Serra-Capizzano 1 1 Department of Science and High Technology
More informationExact Inference for Gaussian Process Regression in case of Big Data with the Cartesian Product Structure
Exact Inference for Gaussian Process Regression in case of Big Data with the Cartesian Product Structure Belyaev Mikhail 1,2,3, Burnaev Evgeny 1,2,3, Kapushev Yermek 1,2 1 Institute for Information Transmission
More informationHow To Calculate Energy From Water
A bi-projection method for Bingham type flows Laurent Chupin, Thierry Dubois Laboratoire de Mathématiques Université Blaise Pascal, Clermont-Ferrand Ecoulements Gravitaires et RIsques Naturels Juin 2015
More informationGeneral Framework for an Iterative Solution of Ax b. Jacobi s Method
2.6 Iterative Solutions of Linear Systems 143 2.6 Iterative Solutions of Linear Systems Consistent linear systems in real life are solved in one of two ways: by direct calculation (using a matrix factorization,
More informationDual Methods for Total Variation-Based Image Restoration
Dual Methods for Total Variation-Based Image Restoration Jamylle Carter Institute for Mathematics and its Applications University of Minnesota, Twin Cities Ph.D. (Mathematics), UCLA, 2001 Advisor: Tony
More informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More informationOptimization Modeling for Mining Engineers
Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2
More informationSimulation of Fluid-Structure Interactions in Aeronautical Applications
Simulation of Fluid-Structure Interactions in Aeronautical Applications Martin Kuntz Jorge Carregal Ferreira ANSYS Germany D-83624 Otterfing Martin.Kuntz@ansys.com December 2003 3 rd FENET Annual Industry
More informationBIG DATA PROBLEMS AND LARGE-SCALE OPTIMIZATION: A DISTRIBUTED ALGORITHM FOR MATRIX FACTORIZATION
BIG DATA PROBLEMS AND LARGE-SCALE OPTIMIZATION: A DISTRIBUTED ALGORITHM FOR MATRIX FACTORIZATION Ş. İlker Birbil Sabancı University Ali Taylan Cemgil 1, Hazal Koptagel 1, Figen Öztoprak 2, Umut Şimşekli
More informationGenOpt (R) Generic Optimization Program User Manual Version 3.0.0β1
(R) User Manual Environmental Energy Technologies Division Berkeley, CA 94720 http://simulationresearch.lbl.gov Michael Wetter MWetter@lbl.gov February 20, 2009 Notice: This work was supported by the U.S.
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationSTCE. Fast Delta-Estimates for American Options by Adjoint Algorithmic Differentiation
Fast Delta-Estimates for American Options by Adjoint Algorithmic Differentiation Jens Deussen Software and Tools for Computational Engineering RWTH Aachen University 18 th European Workshop on Automatic
More informationIncreasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
More informationElasticity Theory Basics
G22.3033-002: Topics in Computer Graphics: Lecture #7 Geometric Modeling New York University Elasticity Theory Basics Lecture #7: 20 October 2003 Lecturer: Denis Zorin Scribe: Adrian Secord, Yotam Gingold
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationG.A. Pavliotis. Department of Mathematics. Imperial College London
EE1 MATHEMATICS NUMERICAL METHODS G.A. Pavliotis Department of Mathematics Imperial College London 1. Numerical solution of nonlinear equations (iterative processes). 2. Numerical evaluation of integrals.
More informationOutline. Generalize Simple Example
Solving Simultaneous Nonlinear Algebraic Equations Larry Caretto Mechanical Engineering 309 Numerical Analysis of Engineering Systems March 5, 014 Outline Problem Definition of solving simultaneous nonlinear
More informationconstraint. Let us penalize ourselves for making the constraint too big. We end up with a
Chapter 4 Constrained Optimization 4.1 Equality Constraints (Lagrangians) Suppose we have a problem: Maximize 5, (x 1, 2) 2, 2(x 2, 1) 2 subject to x 1 +4x 2 =3 If we ignore the constraint, we get the
More informationApplications of the Discrete Adjoint Method in Computational Fluid Dynamics
Applications of the Discrete Adjoint Method in Computational Fluid Dynamics by René Schneider Submitted in accordance with the requirements for the degree of Doctor of Philosophy. The University of Leeds
More informationOverview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model 1 September 004 A. Introduction and assumptions The classical normal linear regression model can be written
More informationABAQUS Tutorial. 3D Modeling
Spring 2011 01/21/11 ABAQUS Tutorial 3D Modeling This exercise intends to demonstrate the steps you would follow in creating and analyzing a simple solid model using ABAQUS CAE. Introduction A solid undergoes
More information10. Proximal point method
L. Vandenberghe EE236C Spring 2013-14) 10. Proximal point method proximal point method augmented Lagrangian method Moreau-Yosida smoothing 10-1 Proximal point method a conceptual algorithm for minimizing
More informationConstrained curve and surface fitting
Constrained curve and surface fitting Simon Flöry FSP-Meeting Strobl (June 20, 2006), floery@geoemtrie.tuwien.ac.at, Vienna University of Technology Overview Introduction Motivation, Overview, Problem
More informationLecture 8 February 4
ICS273A: Machine Learning Winter 2008 Lecture 8 February 4 Scribe: Carlos Agell (Student) Lecturer: Deva Ramanan 8.1 Neural Nets 8.1.1 Logistic Regression Recall the logistic function: g(x) = 1 1 + e θt
More informationBlind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections
Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections Maximilian Hung, Bohyun B. Kim, Xiling Zhang August 17, 2013 Abstract While current systems already provide
More informationObject-oriented scientific computing
Object-oriented scientific computing Pras Pathmanathan Summer 2012 The finite element method Advantages of the FE method over the FD method Main advantages of FE over FD 1 Deal with Neumann boundary conditions
More informationNonlinear Optimization: Algorithms 3: Interior-point methods
Nonlinear Optimization: Algorithms 3: Interior-point methods INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2006 Jean-Philippe Vert,
More informationValuation of American Options
Valuation of American Options Among the seminal contributions to the mathematics of finance is the paper F. Black and M. Scholes, The pricing of options and corporate liabilities, Journal of Political
More informationFinite Element Methods (in Solid and Structural Mechanics)
CEE570 / CSE 551 Class #1 Finite Element Methods (in Solid and Structural Mechanics) Spring 2014 Prof. Glaucio H. Paulino Donald Biggar Willett Professor of Engineering Department of Civil and Environmental
More informationSolutions Of Some Non-Linear Programming Problems BIJAN KUMAR PATEL. Master of Science in Mathematics. Prof. ANIL KUMAR
Solutions Of Some Non-Linear Programming Problems A PROJECT REPORT submitted by BIJAN KUMAR PATEL for the partial fulfilment for the award of the degree of Master of Science in Mathematics under the supervision
More informationMixed Precision Iterative Refinement Methods Energy Efficiency on Hybrid Hardware Platforms
Mixed Precision Iterative Refinement Methods Energy Efficiency on Hybrid Hardware Platforms Björn Rocker Hamburg, June 17th 2010 Engineering Mathematics and Computing Lab (EMCL) KIT University of the State
More informationDiscrete Optimization
Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.1-4.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 2015-03-31 Todays presentation Chapter 3 Transforms using
More informationSTCE. Outline. Introduction. Applications. Ongoing work. Summary. STCE RWTH-Aachen, Industrial Applications of discrete adjoint OpenFOAM, EuroAD 2014
Industrial Applications of discrete adjoint OpenFOAM Arindam Sen Software and Tools for Computational Engineering Science RWTH Aachen University EuroAD 2014, Nice, 16-17. June 2014 Outline Introduction
More informationInterior-Point Algorithms for Quadratic Programming
Interior-Point Algorithms for Quadratic Programming Thomas Reslow Krüth Kongens Lyngby 2008 IMM-M.Sc-2008-19 Technical University of Denmark Informatics and Mathematical Modelling Building 321, DK-2800
More informationGLM, insurance pricing & big data: paying attention to convergence issues.
GLM, insurance pricing & big data: paying attention to convergence issues. Michaël NOACK - michael.noack@addactis.com Senior consultant & Manager of ADDACTIS Pricing Copyright 2014 ADDACTIS Worldwide.
More informationIntroduction to the Finite Element Method (FEM)
Introduction to the Finite Element Method (FEM) ecture First and Second Order One Dimensional Shape Functions Dr. J. Dean Discretisation Consider the temperature distribution along the one-dimensional
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationLecture 13 Linear quadratic Lyapunov theory
EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time
More informationEnhancing the SNR of the Fiber Optic Rotation Sensor using the LMS Algorithm
1 Enhancing the SNR of the Fiber Optic Rotation Sensor using the LMS Algorithm Hani Mehrpouyan, Student Member, IEEE, Department of Electrical and Computer Engineering Queen s University, Kingston, Ontario,
More informationAPPLIED MATHEMATICS ADVANCED LEVEL
APPLIED MATHEMATICS ADVANCED LEVEL INTRODUCTION This syllabus serves to examine candidates knowledge and skills in introductory mathematical and statistical methods, and their applications. For applications
More informationAN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS
AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEY-INTERSCIENCE A John Wiley & Sons, Inc.,
More informationBig Data - Lecture 1 Optimization reminders
Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Schedule Introduction Major issues Examples Mathematics
More informationOperation Count; Numerical Linear Algebra
10 Operation Count; Numerical Linear Algebra 10.1 Introduction Many computations are limited simply by the sheer number of required additions, multiplications, or function evaluations. If floating-point
More informationNumerical Methods for Solving Systems of Nonlinear Equations
Numerical Methods for Solving Systems of Nonlinear Equations by Courtney Remani A project submitted to the Department of Mathematical Sciences in conformity with the requirements for Math 4301 Honour s
More informationLecture 16 - Free Surface Flows. Applied Computational Fluid Dynamics
Lecture 16 - Free Surface Flows Applied Computational Fluid Dynamics Instructor: André Bakker http://www.bakker.org André Bakker (2002-2006) Fluent Inc. (2002) 1 Example: spinning bowl Example: flow in
More informationIntroduction to Solid Modeling Using SolidWorks 2012 SolidWorks Simulation Tutorial Page 1
Introduction to Solid Modeling Using SolidWorks 2012 SolidWorks Simulation Tutorial Page 1 In this tutorial, we will use the SolidWorks Simulation finite element analysis (FEA) program to analyze the response
More informationContents. Microfluidics - Jens Ducrée Physics: Navier-Stokes Equation 1
Contents 1. Introduction 2. Fluids 3. Physics of Microfluidic Systems 4. Microfabrication Technologies 5. Flow Control 6. Micropumps 7. Sensors 8. Ink-Jet Technology 9. Liquid Handling 10.Microarrays 11.Microreactors
More informationLinear Threshold Units
Linear Threshold Units w x hx (... w n x n w We assume that each feature x j and each weight w j is a real number (we will relax this later) We will study three different algorithms for learning linear
More informationSTA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Statistics! rsalakhu@utstat.toronto.edu! http://www.cs.toronto.edu/~rsalakhu/ Lecture 6 Three Approaches to Classification Construct
More informationNUMERICAL ANALYSIS OF THE EFFECTS OF WIND ON BUILDING STRUCTURES
Vol. XX 2012 No. 4 28 34 J. ŠIMIČEK O. HUBOVÁ NUMERICAL ANALYSIS OF THE EFFECTS OF WIND ON BUILDING STRUCTURES Jozef ŠIMIČEK email: jozef.simicek@stuba.sk Research field: Statics and Dynamics Fluids mechanics
More informationChristof Hinterberger, Mark Olesen
Application of of a Continuous Adjoint Flow Solver for for Geometry Optimisation of of Automotive Exhaust Systems Christof Hinterberger, Mark Olesen FLOWHEAD Workshop, Varna Sept. 2010 Workshop on industrial
More informationModeling of Earth Surface Dynamics and Related Problems Using OpenFOAM
CSDMS 2013 Meeting Modeling of Earth Surface Dynamics and Related Problems Using OpenFOAM Xiaofeng Liu, Ph.D., P.E. Assistant Professor Department of Civil and Environmental Engineering University of Texas
More informationAN EFFECT OF GRID QUALITY ON THE RESULTS OF NUMERICAL SIMULATIONS OF THE FLUID FLOW FIELD IN AN AGITATED VESSEL
14 th European Conference on Mixing Warszawa, 10-13 September 2012 AN EFFECT OF GRID QUALITY ON THE RESULTS OF NUMERICAL SIMULATIONS OF THE FLUID FLOW FIELD IN AN AGITATED VESSEL Joanna Karcz, Lukasz Kacperski
More informationTESLA Report 2003-03
TESLA Report 23-3 A multigrid based 3D space-charge routine in the tracking code GPT Gisela Pöplau, Ursula van Rienen, Marieke de Loos and Bas van der Geer Institute of General Electrical Engineering,
More informationNumerical Methods for Option Pricing
Chapter 9 Numerical Methods for Option Pricing Equation (8.26) provides a way to evaluate option prices. For some simple options, such as the European call and put options, one can integrate (8.26) directly
More informationDoes Black-Scholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem
Does Black-Scholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem Gagan Deep Singh Assistant Vice President Genpact Smart Decision Services Financial
More informationMachine Learning and Pattern Recognition Logistic Regression
Machine Learning and Pattern Recognition Logistic Regression Course Lecturer:Amos J Storkey Institute for Adaptive and Neural Computation School of Informatics University of Edinburgh Crichton Street,
More informationMATLAB and Big Data: Illustrative Example
MATLAB and Big Data: Illustrative Example Rick Mansfield Cornell University August 19, 2014 Goals Use a concrete example from my research to: Demonstrate the value of vectorization Introduce key commands/functions
More informationImproved fluid control by proper non-newtonian flow modeling
Tekna Flow Assurance 2015, Larvik Improved fluid control by proper non-newtonian flow modeling Stein Tore Johansen, SINTEF Sjur Mo, SINTEF A general wall friction model for a non-newtonian fluid has been
More informationFinite Elements for 2 D Problems
Finite Elements for 2 D Problems General Formula for the Stiffness Matrix Displacements (u, v) in a plane element are interpolated from nodal displacements (ui, vi) using shape functions Ni as follows,
More informationExample: Credit card default, we may be more interested in predicting the probabilty of a default than classifying individuals as default or not.
Statistical Learning: Chapter 4 Classification 4.1 Introduction Supervised learning with a categorical (Qualitative) response Notation: - Feature vector X, - qualitative response Y, taking values in C
More informationCurves and Surfaces. Goals. How do we draw surfaces? How do we specify a surface? How do we approximate a surface?
Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.1-10.6] Goals How do we draw surfaces? Approximate with polygons Draw polygons
More informationF Matrix Calculus F 1
F Matrix Calculus F 1 Appendix F: MATRIX CALCULUS TABLE OF CONTENTS Page F1 Introduction F 3 F2 The Derivatives of Vector Functions F 3 F21 Derivative of Vector with Respect to Vector F 3 F22 Derivative
More informationAn Introduction to Applied Mathematics: An Iterative Process
An Introduction to Applied Mathematics: An Iterative Process Applied mathematics seeks to make predictions about some topic such as weather prediction, future value of an investment, the speed of a falling
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationDie Multipol Randelementmethode in industriellen Anwendungen
Fast Boundary Element Methods in Industrial Applications Söllerhaus, 15. 18. Oktober 2003 Die Multipol Randelementmethode in industriellen Anwendungen G. Of, O. Steinbach, W. L. Wendland Institut für Angewandte
More informationQuantile Regression under misspecification, with an application to the U.S. wage structure
Quantile Regression under misspecification, with an application to the U.S. wage structure Angrist, Chernozhukov and Fernandez-Val Reading Group Econometrics November 2, 2010 Intro: initial problem The
More informationLecture 3 Fluid Dynamics and Balance Equa6ons for Reac6ng Flows
Lecture 3 Fluid Dynamics and Balance Equa6ons for Reac6ng Flows 3.- 1 Basics: equations of continuum mechanics - balance equations for mass and momentum - balance equations for the energy and the chemical
More informationSIMPLIFIED PERFORMANCE MODEL FOR HYBRID WIND DIESEL SYSTEMS. J. F. MANWELL, J. G. McGOWAN and U. ABDULWAHID
SIMPLIFIED PERFORMANCE MODEL FOR HYBRID WIND DIESEL SYSTEMS J. F. MANWELL, J. G. McGOWAN and U. ABDULWAHID Renewable Energy Laboratory Department of Mechanical and Industrial Engineering University of
More informationMultiple Optimization Using the JMP Statistical Software Kodak Research Conference May 9, 2005
Multiple Optimization Using the JMP Statistical Software Kodak Research Conference May 9, 2005 Philip J. Ramsey, Ph.D., Mia L. Stephens, MS, Marie Gaudard, Ph.D. North Haven Group, http://www.northhavengroup.com/
More informationRoots of Polynomials
Roots of Polynomials (Com S 477/577 Notes) Yan-Bin Jia Sep 24, 2015 A direct corollary of the fundamental theorem of algebra is that p(x) can be factorized over the complex domain into a product a n (x
More information. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2
4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the
More informationExploratory Data Analysis
Exploratory Data Analysis Johannes Schauer johannes.schauer@tugraz.at Institute of Statistics Graz University of Technology Steyrergasse 17/IV, 8010 Graz www.statistics.tugraz.at February 12, 2008 Introduction
More information