01101010100101010010111101 011010101001010010100100111 011010101001010100101110 0101010010101001011110001 Real Time Collaboration and Sharing 01111100101101010100101010.

Slides:



Advertisements
Similar presentations
Solving LP Models Improving Search Special Form of Improving Search
Advertisements

CSE 330: Numerical Methods
Computational Modeling for Engineering MECN 6040
Active Contours, Level Sets, and Image Segmentation
Algebraic, transcendental (i.e., involving trigonometric and exponential functions), ordinary differential equations, or partial differential equations...
Point-wise Discretization Errors in Boundary Element Method for Elasticity Problem Bart F. Zalewski Case Western Reserve University Robert L. Mullen Case.
An Introduction of Support Vector Machine
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2014 – 35148: Continuous Solution for Boundary Value Problems.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Lecture 8 – Nonlinear Programming Models Topics General formulations Local vs. global solutions Solution characteristics Convexity and convex programming.
Thursday, April 25 Nonlinear Programming Theory Separable programming Handouts: Lecture Notes.
MIT and James Orlin © Nonlinear Programming Theory.
Surface to Surface Intersection N. M. Patrikalakis, T. Maekawa, K. H. Ko, H. Mukundan May 25, 2004.
Prénom Nom Document Analysis: Linear Discrimination Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Support Vector Classification (Linearly Separable Case, Primal) The hyperplanethat solves the minimization problem: realizes the maximal margin hyperplane.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 20 Solution of Linear System of Equations - Iterative Methods.
Revision.
Classification Problem 2-Category Linearly Separable Case A- A+ Malignant Benign.
Design of Curves and Surfaces by Multi Objective Optimization Rony Goldenthal Michel Bercovier School of Computer Science and Engineering The Hebrew University.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Systems of Non-Linear Equations
D Nagesh Kumar, IIScOptimization Methods: M3L1 1 Linear Programming Preliminaries.
An Integrated Pose and Correspondence Approach to Image Matching Anand Rangarajan Image Processing and Analysis Group Departments of Electrical Engineering.
Interval-based Inverse Problems with Uncertainties Francesco Fedele 1,2 and Rafi L. Muhanna 1 1 School of Civil and Environmental Engineering 2 School.
Numerical Methods Due to the increasing complexities encountered in the development of modern technology, analytical solutions usually are not available.
2009 Mathematics Standards of Learning Training Institutes Algebra II Virginia Department of Education.
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Operations Research Models
Dual Evolution for Geometric Reconstruction Huaiping Yang (FSP Project S09202) Johannes Kepler University of Linz 1 st FSP-Meeting in Graz, Nov ,
IMAM Institute of Mechanics and Advanced Materials
Machine Learning CUNY Graduate Center Lecture 3: Linear Regression.
Chapter 17 Boundary Value Problems. Standard Form of Two-Point Boundary Value Problem In total, there are n 1 +n 2 =N boundary conditions.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Ken YoussefiMechanical Engineering Dept. 1 Design Optimization Optimization is a component of design process The design of systems can be formulated as.
1 Subdivision Termination Criteria in Subdivision Multivariate Solvers Iddo Hanniel, Gershon Elber CGGC, CS, Technion.
Module 4 Multi-Dimensional Steady State Heat Conduction.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
Chapter 3 Roots of Equations. Objectives Understanding what roots problems are and where they occur in engineering and science Knowing how to determine.
Stress constrained optimization using X-FEM and Level Set Description
Nonlinear Interval Finite Elements for Structural Mechanics Problems Rafi Muhanna School of Civil and Environmental Engineering Georgia Institute of Technology,
Numerical Methods.
MECN 3500 Inter - Bayamon Lecture 9 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
linear  2.3 Newton’s Method ( Newton-Raphson Method ) 1/12 Chapter 2 Solutions of Equations in One Variable – Newton’s Method Idea: Linearize a nonlinear.
Numerical Methods Solution of Equation.
CSE4334/5334 DATA MINING CSE4334/5334 Data Mining, Fall 2014 Department of Computer Science and Engineering, University of Texas at Arlington Chengkai.
Application of Generic Constraint Solving Techniques for Insightful Engineering Design Hiroyuki Sawada Digital Manufacturing Research Center (DMRC) National.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 27.
Branch and Bound Algorithms Present by Tina Yang Qianmei Feng.
ROBUSTNESS IN NUMERICAL COMPUTATION II VALIDATED ODE SOLVER KWANG HEE KO SCHOOL OF MECHATRONICS GWANGJU INSTITUTE OF SCIENCE AND TECHNOLOGY.
MA2213 Lecture 2 Interpolation.
Lecture 3: MLE, Bayes Learning, and Maximum Entropy
(i) Preliminaries D Nagesh Kumar, IISc Water Resources Planning and Management: M3L1 Linear Programming and Applications.
MULTIDIMENSIONAL HEAT TRANSFER  This equation governs the Cartesian, temperature distribution for a three-dimensional unsteady, heat transfer problem.
Interval Finite Element as a Basis for Generalized Models of Uncertainty in Engineering Mechanics Rafi L. Muhanna Georgia Institute of Technology NSF workshop.
Linear Programming Chapter 1 Introduction.
1 Unconstrained and Constrained Optimization. 2 Agenda General Ideas of Optimization Interpreting the First Derivative Interpreting the Second Derivative.
Camera calibration from multiple view of a 2D object, using a global non linear minimization method Computer Engineering YOO GWI HYEON.
1 M 277 (60 h) Mathematics for Computer Sciences Bibliography  Discrete Mathematics and its applications, Kenneth H. Rosen  Numerical Analysis, Richard.
Chapter 1: Linear Functions, Equations, and Inequalities
Introduction to the Finite Element Method
Computation of the solutions of nonlinear polynomial systems
Boundary Element Analysis of Systems Using Interval Methods
Lecture 3.
Role and Potential of TAs for Industrial Scheduling Problems
Chapter 1. Introduction Mathematical Programming (Optimization) Problem: min/max
Chapter 27.
1.5 Linear Equations and Inequalities
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Numerical Modeling Ramaz Botchorishvili
Presentation transcript:

Real Time Collaboration and Sharing National Science Foundation Industry/University Cooperative Research Center for e-Design: IT-Enabled Design and Realization of Engineered Products and Systems Solving Interval Constraints in Computer-Aided Design Yan Wang Department of Industrial Engineering NSF Center for e-Design University of Pittsburgh

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Outline Parametric geometric modeling Interval geometric modeling Constraint solving

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Parametric Geometric Modeling Geometric model – Geometry – Topology – Attributes Constraint solver – Numerical – Symbolic – Graph-based / Constructive – Rule-based reasoning Visualization

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Fixed-Value Parameter vs. Interval-Value Parameter Fixed-value parameters may generate inconsistency errors from floating-point arithmetic. Fixed-value constraints bring up conflicts easily at later design stages. Fixed-value parameters make the development of Computer- Aided Conceptual Design difficult. Interval parameters improve robustness of geometry computation. Interval parameters capture the uncertainty and inexactness. Interval parameters directly represent boundary information for optimization. Intervals provide a generic representation for geometric constraints.

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Application of IA in CAD/CAE Computer graphics: rasterizing [Mudur and Koparkar], ray tracing [Toth, Kalra and Barr], collision detection [Moore and Wilhelms, Von Herzen et al., Duff, Snyder et al.]. CAD: curve approximation [Sederberg and Farouki, Patrikalakis et al., Chen and Lou, Lin et al.], shape interrogation [Maekawa and Patrikalakis], robust boundary evaluation [Patrikalakis et al., Wallner et al.] CAE: finite element formulation [Muhanna and Mullen] System design: set-based modeling [Finch and Ward], structural analysis [Rao et al.]

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Given that A = [a L, a N, a U ], B = [b L, b N, b U ], Nominal Intervals in IGM Display Interactivity Tolerance  equivalence:  nominal equivalence:  strictly greater than or equal to:  strictly greater than:  strictly less than or equal to:  strictly less than:  inclusion:

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Sampling Relation between Real Number and Interval Number  strict equivalence:  strictly greater than or equal to:  strictly greater than:  strictly less than or equal to:  strictly less than: Strict relations Global relations  global equivalence:  greater than or equal to:  greater than:  less than or equal to:  less than:

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Set vs. Individuals Global relations are default relations in IA. Global relations ensure the feasibility of interval arithmetic operations and solutions. Global relations make global solution and optimization of interval analysis possible. Strict relations exhibit the rigidity of RA. Strict relations specify constraints between variables directly.

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Preference, Specification, & Interval Constraint Improve specification interoperability for design life-cycle Represent soft constraint Capture the uncertainty of design Model incompleteness and inexactness especially during conceptual design Model a set of design alternatives Represent tolerance and boundary information for global optimization Improve robustness of computation

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Under-, Over-, & Well-Constrained

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Special Considerations of Interval Linear Equations for CAD Matrix-based methods are not for under- or over- constrained problems Iteration-based methods (e.g. Jacobi iteration, Gauss- Seidel iteration) are more general and useful in CAD constraint solving

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design X AY Extended Gauss-Seidel Method

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Solving Interval Nonlinear Equations based on Linear Enclosure 1. Transform to separable form; 2. Find linear enclosure; 3. Solve linear enclosure equations; 4. Update variable values 5. If stop criteria not satisfied, go to step 2; otherwise stop. Start Transform to Separable Form Stop Criteria Satisfied? End Y N Find Linear Enclosure Solve Linear Enclosure Equations Update Variable Values

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design 1. Separable Form  Function f(x 1, x 2, …, x n ) is said to be separable iff f(x 1, x 2, …, x n ) = f 1 (x 1 ) + f 2 (x 2 ) + … + f n (x n ). Yamamura’s algorithm[Yamamura,1996]: +, , , /, sin, exp, log, sqrt, ^, etc. For example: f = f 1  f 2  f = (y 2  f 1 2  f 2 2 )/2 y = f 1 + f 2 f = f 1 / f 2  f = (y 2  f 1 2  1/ f 2 2 )/2 y = f 1 + 1/f 2 f = (f 1 ) f2  f =exp(y 1 ) y 1 = (y 2 2  (log(f 1 )) 2  f 2 2 )/2 y 2 = log(f 1 ) + f 2

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design 2. Linear Enclosure Let X j 0 = [x L j, x N j, x U j ] Linear Enclosure is defined as: such that Extending Kolev’s work:

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design 3. Solve Linear Enclosure Equations If f ij (x) is continuous within interval X j 0, solve using root isolation [Collins et al.] and Secant method. Suppose x jp (p=1, 2, …, P) is the p th solution of the above equation, and x j0 =x L j. Let B ij =[b L ij, b N ij, b U ij ], where

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design 4. Update Variable Values Suppose Y j is the j th variable solution of linear enclosure equations in the k th iteration, update X j for (k+1) th iteration by If an empty interval is derived, the original system has no solution within the given initial intervals. If the stop criterion is not met, iterate.

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Solving Interval Inequalities Adding slack variables to translate inequalities into equalities. Solving linear/nonlinear equations with previous methods.

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Interval Subdivision Subpaving divides a hyper-cube into multiple smaller hyper-cubes recursively Implemented as order elevation of power interval P (m, n) = [X 1, X 2, …, X m ]

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Constraint Re-Specification Need to differentiate active and inactive constraints. For a constraint set p = {f(X) = Y and g(X) = Z}, the subset f(X) = Y with respect to a solution D  X is inactive if f(D)  Y and g(D)  Z. (a) f – inactive, g – active (b) f – active, g – active (c) f – active, g – inactive

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design An Example

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Refinement - subdivision subdivide up to Level 3, and some sub-regions are eliminated.

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design What can interval provide for design? The decisions to fix values of parameters can be postponed to later design stages. Variation and uncertain are inherent in the process of design. Soft constraint-driven geometry modeling Support under- and over-constrained problem Integrated linear, nonlinear equations, and inequality solving

C E N T E R F O R e – D E S I G N National Science Foundation Industry/University Cooperative Research Center for e-Design Thank you!