EGGN 598 – Probabilistic Biomechanics Ch

Slides:



Advertisements
Similar presentations
Copyright © Cengage Learning. All rights reserved. 14 Partial Derivatives.
Advertisements

The gradient as a normal vector. Consider z=f(x,y) and let F(x,y,z) = f(x,y)-z Let P=(x 0,y 0,z 0 ) be a point on the surface of F(x,y,z) Let C be any.
Derivation of Engineering-relevant Deformation Parameters
Open Methods Chapter 6 The Islamic University of Gaza
MEGN 537 – Probabilistic Biomechanics Ch.7 – First Order Reliability Methods Anthony J Petrella, PhD.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Newton’s Method Application to LMS Recursive Least Squares Exponentially-Weighted.
Reliability Based Design Optimization. Outline RBDO problem definition Reliability Calculation Transformation from X-space to u-space RBDO Formulations.
PARTIAL DERIVATIVES 14. PARTIAL DERIVATIVES 14.6 Directional Derivatives and the Gradient Vector In this section, we will learn how to find: The rate.
Copyright 2001, J.E. Akin. All rights reserved. CAD and Finite Element Analysis Most ME CAD applications require a FEA in one or more areas: –Stress Analysis.
Open Methods Chapter 6 The Islamic University of Gaza
Radial Basis Functions
Linear Separators. Bankruptcy example R is the ratio of earnings to expenses L is the number of late payments on credit cards over the past year. We will.
Ch 2.1: Linear Equations; Method of Integrating Factors
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
Chapter 14 Section 14.3 Curves. x y z To get the equation of the line we need to know two things, a direction vector d and a point on the line P. To find.
 By River, Gage, Travis, and Jack. Sections Chapter 6  6.1- Introduction to Differentiation (Gage)  The Gradient Function (Gage)  Calculating.
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
EGGN 598 – Probabilistic Biomechanics Ch.7 – First Order Reliability Methods Anthony J Petrella, PhD.
MEGN 537 – Probabilistic Biomechanics Ch.7 – First Order Reliability Methods Anthony J Petrella, PhD.
MEGN 537 – Probabilistic Biomechanics Ch.5 – Determining Distributions and Parameters from Observed Data Anthony J Petrella, PhD.
CS 782 – Machine Learning Lecture 4 Linear Models for Classification  Probabilistic generative models  Probabilistic discriminative models.
Sec 15.6 Directional Derivatives and the Gradient Vector
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Derivation Computational Simplifications Stability Lattice Structures.
Data Modeling Patrice Koehl Department of Biological Sciences National University of Singapore
Tangent Planes and Normal Lines
METU Informatics Institute Min720 Pattern Classification with Bio-Medical Applications Part 7: Linear and Generalized Discriminant Functions.
Ch 2.1: Linear Equations; Method of Integrating Factors A linear first order ODE has the general form where f is linear in y. Examples include equations.
Steepest Descent Method Contours are shown below.
EEE502 Pattern Recognition
Classification Course web page: vision.cis.udel.edu/~cv May 14, 2003  Lecture 34.
STROUD Worked examples and exercises are in the text Programme 9: Tangents, normals and curvature TANGENTS, NORMALS AND CURVATURE PROGRAMME 9.
Vectors and the Geometry of Space Section 10.4 Lines and Planes in Space 2015.
MEGN 537 – Probabilistic Biomechanics Ch.5 – Determining Distributions and Parameters from Observed Data Anthony J Petrella, PhD.
Operators in scalar and vector fields
Advanced Algebra H Notes Section 9.3 – Graph and Write Equations of Circles Objective: Be able to graph and write equations of circles. A _________ is.
CHAPTER 9.10~9.17 Vector Calculus.
Unit 2 Lesson #3 Tangent Line Problems
Tom.h.wilson Department of Geology and Geography West Virginia University Morgantown, WV.
MEGN 537 – Probabilistic Biomechanics Ch
Boyce/DiPrima 10th ed, Ch 10.8: Laplace’s Equation Elementary Differential Equations and Boundary Value Problems, 10th edition, by William E. Boyce and.
Equations of Tangents.
CAD and Finite Element Analysis
Magnetic Methods- continued
Ch 2.1: Linear Equations; Method of Integrating Factors
DIFFERENTIATION APPLICATIONS 1
Notes Over 10.3 r is the radius radius is 4 units
EGGN 598 – Probabilistic Biomechanics Ch
COORDINATE PLANE FORMULAS:
Chapter 3 Component Reliability Analysis of Structures.
Machine Learning Basics
MEGN 537 – Probabilistic Biomechanics Ch
Fitting Curve Models to Edges
Arc Length and Curvature
Lesson: 10 – 8 Equations of Circles
Conic Sections:Circles
Graphical optimization
Chap 3. The simplex method
MEGN 537 – Probabilistic Biomechanics Ch.3 – Quantifying Uncertainty
Response Surface Method
MEGN 537 – Probabilistic Biomechanics Ch
MEGN 537 – Probabilistic Biomechanics Ch
Circles in the Coordinate Plane
4.8: Linear Approximations, Differentials and Newton’s Method
EE 458 Introduction to Optimization
Tutorial 2 The Derivative
Lesson: Derivative Basics - 2
IMPLICIT Differentiation.
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Presentation transcript:

EGGN 598 – Probabilistic Biomechanics Ch EGGN 598 – Probabilistic Biomechanics Ch.7 – First Order Reliability Methods Anthony J Petrella, PhD

Review: Reliability Index To address limitations of risk-based reliability with greater efficiency than MC, we introduce the safety index or reliability index, b Consider the familiar limit state, Z = R – S, where R and S are independent normal variables Then we can write, and POF = P(Z ≤ 0), which can be found as follows…

Review: MPP Failure Safe

Geometry of MPP Recognize that the point on any curve or n-dimensional surface that is closest to the origin is the point at which the function gradient passes through the origin Distance from the origin is the radius of a circle tangent to the curve/surface at that point (tangent and gradient are perpendicular) MPP → closest to the origin → highest likelihood on joint PDF in the reduced coord. space * gradient → perpendicular to tangent direction gradient direction

Review: AMV Example For example, consider the non-linear limit state, where,

Review: AMV Geometry Recall the plot depicts (1) joint PDF of l_fem and h_hip, and (2) limit state curves in the reduced variate space (l_fem’,h_hip’), To find g(X) at a certain prob level, we wish to find the g(X) curve that is tangent to a certain prob contour of the joint PDF – in other words, the curve that is tangent to a circle of certain radius b We start with the linearization of g(X) and compute its gradient We look outward along the gradient until we reach the desired prob level This is the MPP because the linear g(X) is guaranteed to be tangent to the prob contour at that point

Review: AMV Geometry The red dot is (l_fem’*,h_hip’*), the tangency point for glinear_90% When we recalculate g90% at (l_fem’*,h_hip’*) we obtain an updated value of g(X) and the curve naturally passes through (l_fem’*,h_hip’*) Note however that the updated curve may not be exactly tangent to the 90% prob circle, so there may still be a small bit of error (see figure below)

AMV+ Method The purpose of AMV+ is to reduce the error exhibited by AMV AMV+ simply translates to…“AMV plus iterations” Recall Step 3 of AMV: assume an initial value for the MPP, usually at the means of the inputs Recall Step 5 of AMV: compute the new value of MPP AMV+ simply involves reapplying the AMV method again at the new MPP from Step 5 AMV+ iterations may be continued until the change in g(X) falls below some convergence threshold

AMV+ Method (NESSUS) Assuming one is seeking values of the performance function (limit state) at various P-levels, the steps in the AMV+ method are: Define the limit state equation Complete the MV method to estimate g(X) at each P-level of interest, if the limit state is non-linear these estimates will be poor Assume an initial value of the MPP, usually the means Compute the partial derivatives and find alpha (unit vector in direction of the function gradient) Now, if you are seeking to find the performance (value of limit state) at various P-levels, then there will be a different value of the reliability index bHL at each P-level. It will be some known value and you can estimate the MPP for each P-level as…

AMV+ Method (NESSUS) The steps in the AMV+ method (continued): Convert the MPP from reduced coordinates back to original coordinates Obtain an updated estimate of g(X) for each P-level using the relevant MPP’s computed in step 6 Check for convergence by comparing g(X) from Step 7 to g(X) from Step 2. If difference is greater than convergence criterion, return to Step 3 and use the new MPP found in Step 5.

AMV+ Example We will continue with the AMV example already started and extend it with the AMV+ method Mean Value Method AMV Method – Iteration 1 g(X) X = MPP-1

AMV+ Example We will continue with the AMV example already started and extend it with the AMV+ method AMV Method – Iteration 1 AMV Method – Iteration 2 g(X) X = MPP-2

AMV+ Example AMV Method – Iteration 1 AMV Method – Iteration 2

AMV+ Example AMV Method – Iteration 2 AMV Method – Iteration 2

AMV+ Example