formulation Model Real world data interpretation results Explanations

Similar documents
Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute. Week 02 Module 06 Lecture - 14 Merge Sort: Analysis

4 Visualization and. Approximation

Lecture 3: Linear Classification

Generating Functions

Lecture #3: PageRank Algorithm The Mathematics of Google Search

Applied Algorithm Design Lecture 3

process variable x,y,a,b,c: integer begin x := b; -- d2 -- while (x < c) loop end loop; end process; d: a := b + c

Exercises: Instructions and Advice

The notion of functions

Lecture 2 Finite Automata

The Bizarre Truth! Automating the Automation. Complicated & Confusing taxonomy of Model Based Testing approach A CONFORMIQ WHITEPAPER

II. Linear Programming

Chapter 3. Set Theory. 3.1 What is a Set?

Introduction to Parallel Programming in OpenMp Dr. Yogish Sabharwal Department of Computer Science & Engineering Indian Institute of Technology, Delhi

Houghton Mifflin MATHEMATICS Level 1 correlated to NCTM Standard

Lesson 10. Student Outcomes. Lesson Notes

MergeSort, Recurrences, Asymptotic Analysis Scribe: Michael P. Kim Date: April 1, 2015

(Refer Slide Time 5:19)

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18

Sample tasks from: Algebra Assessments Through the Common Core (Grades 6-12)

Comp 411 Principles of Programming Languages Lecture 7 Meta-interpreters. Corky Cartwright January 26, 2018

computational Fluid Dynamics - Prof. V. Esfahanian

Cypress Adopts Questa Formal Apps to Create Pristine IP

WHAT TYPE OF NEURAL NETWORK IS IDEAL FOR PREDICTIONS OF SOLAR FLARES?

14.1 Encoding for different models of computation

Solutions to In Class Problems Week 5, Wed.

MergeSort, Recurrences, Asymptotic Analysis Scribe: Michael P. Kim Date: September 28, 2016 Edited by Ofir Geri

DD2429 Computational Photography :00-19:00

19.2 View Serializability. Recall our discussion in Section?? of how our true goal in the design of a

LP-Modelling. dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven. January 30, 2008

Week - 04 Lecture - 01 Merge Sort. (Refer Slide Time: 00:02)

introduction to Programming in C Department of Computer Science and Engineering Lecture No. #40 Recursion Linear Recursion

Lecture 5: Duality Theory

An Introduction to Fractals

How to print a Hypercube

Lecture Notes on Contracts

Lecture 19: Generative Adversarial Networks

Concepts of programming languages

6.001 Notes: Section 8.1

Outline. Introduction. 2 Proof of Correctness. 3 Final Notes. Precondition P 1 : Inputs include

GAP CLOSING. Grade 9. Facilitator s Guide

Lutz Prechelt Fakultíat fíur Informatik. Universitíat Karlsruhe, Postfach Dí7500 Karlsruhe, Germany.

MATHEMATICS 191, FALL 2004 MATHEMATICAL PROBABILITY Outline #1 (Countability and Uncountability)

AS COMPUTERS AND THEIR USER INTERFACES have become easier to use,

This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane?

These are notes for the third lecture; if statements and loops.

CPS122 Lecture: From Python to Java last revised January 4, Objectives:

Polynomial-Time Approximation Algorithms

Topic 1: What is HoTT and why?

III. CONCEPTS OF MODELLING II.

Cache-Oblivious Traversals of an Array s Pairs

Unit 1 Algebraic Functions and Graphs

How Developers Use the Dynamic Features of Programming Languages: The Case of Smalltalk

Topic C. Communicating the Precision of Measured Numbers

An Interesting Way to Combine Numbers

Algebraic Specifications

Notes on Turing s Theorem and Computability

CE4031 and CZ4031 Database System Principles

Note that ALL of these points are Intercepts(along an axis), something you should see often in later work.

Approximating a Policy Can be Easier Than Approximating a Value Function

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14

GAP CLOSING. Integers. Intermediate / Senior Facilitator s Guide

DISSERTATION. Presented to the Faculty of the Graduate School of. The University of Texas at Austin. in Partial Fulællment. of the Requirements

2 Ambiguity in Analyses of Idiomatic Phrases

Type Checking and Type Equality

Amy Shih-Chun Hsu. Master's Project. under the direction of Carlo H. Sçequin. Computer Science Division. University of California, Berkeley

In our first lecture on sets and set theory, we introduced a bunch of new symbols and terminology.

AXIOMS OF AN IMPERATIVE LANGUAGE PARTIAL CORRECTNESS WEAK AND STRONG CONDITIONS. THE AXIOM FOR nop

Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #23 Loops: Precedence of Operators

1. Lecture notes on bipartite matching February 4th,

Introducing Computational Science in the Curriculum Part 3

Yup, left blank on purpose. You can use it to draw whatever you want :-)

Topic: 1-One to Five

Object-Oriented Programming and Laboratory of Simulation Development

(Refer Slide Time: 4:00)

Eight units must be completed and passed to be awarded the Diploma.

Performance-Polymorphic Declarative Queries

Using loops and debugging code

The Design and Implementation of a Modern Lisp. Dialect

CONTENTS: What Is Programming? How a Computer Works Programming Languages Java Basics. COMP-202 Unit 1: Introduction

Ramsey s Theorem on Graphs

[1] CURVE FITTING WITH EXCEL

1.2 Numerical Solutions of Flow Problems

UNINFORMED SEARCH. Announcements Reading Section 3.4, especially 3.4.1, 3.4.2, 3.4.3, 3.4.5

Many of the slides in this lecture are either from or adapted from slides provided by the authors of the textbook Computer Systems: A Programmer s

Introduction to Programming in C Department of Computer Science and Engineering\ Lecture No. #02 Introduction: GCD

Lecture 1: Introduction

MITOCW watch?v=kz7jjltq9r4

Notebook Assignments

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology, Madras. Lecture No.

Animations involving numbers

Technical Arts 101 Prof. Anupam Saxena Department of Mechanical engineering Indian Institute of Technology, Kanpur. Lecture - 7 Think and Analyze

PART I - Fundamentals of Parallel Computing

Mathematics Mathematics Applied mathematics Mathematics

Software Testing Prof. Meenakshi D Souza Department of Computer Science and Engineering International Institute of Information Technology, Bangalore

Machine Structure Oriented Control Code Logic

Introduction. Advanced Econometrics - HEC Lausanne. Christophe Hurlin. University of Orléans. October 2013

Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #29 Arrays in C

Lecture 4: Petersen Graph 2/2; also, Friendship is Magic!

JINI RMI JAVA JAVA UNIX TCP TCP Architectural structure: Runtime structure:

Transcription:

Mathematical Modeling Lecture Notes David C. Dobson January 7, 2003 1

Mathematical Modeling 2 1 Introduction to modeling Roughly deæned, mathematical modeling is the process of constructing mathematical objects whose behaviors or properties correspond in some way to a particular real-world system. In this description, a mathematical object could be a system of equations, a stochastic process, a geometric or algebraic structure, an algorithm, or even just a set of numbers. The term real-world system could refer to a physical system, a ænancial system, a social sytem, an ecological system, or essentially any other system whose behaviors can be observed. 1.1 Why model? What is the motivation behind mathematical modeling? There are of course many speciæc reasons, but most are related in some way to the following two: æ To gain understanding. Generally speaking, if we have a mathematical model which accurately reæects some behavior of a real-world system of interest, we can often gain improved understanding of that system through analysis of the model. Furthermore, in the process of building the model we ænd out which factors are most important in the system, and how diæerent parts of the system are related. Very often we wish to know what a realworld system will do in the future, but it is expensive, impractical, or impossible to experiment directly with the system. Examples include nuclear reactor design, space æight, extinction of species, weather prediction, drug eæcacy in humans, and so on. æ To predict or simulate. It should be apparentthatmuch of modern science involves mathematical modeling. The old adage ëmathematics is the language of science" is really true. Scientists use mathematics to describe real phenomena, and in fact much of this activity constitutes mathematical modeling. As computers become cheaper and powerful and their use becomes more widespread, mathematical models play an increasingly important role in science. From a business perspective, it is clear that an improved ability to simulate, predict, or understand certain real-world systems through mathematical modeling provides a distinct competitive advantage. Examples: the stock market, aircraft design, oil production, semiconductor manufacturing. Furthermore, just as in pure science, as computing power becomes

Mathematical Modeling 3 cheaper, modeling becomes an increasingly cost-eæective alternative to direct experimentation. 1.2 The modeling process So modeling is important. How does one do it? Unfortunately, there is no deænite ëalgorithm" to construct a mathematical model that will work in all situations. Modeling is sometimes viewed as an art. It involves taking whatever knowledge you may have of mathematics and of the system of interest and using that knowledge to create something. Since everyone has a diæerent knowledge base, a preferred bag of tricks, and a unique way of looking at problems, diæerent people may come up with diæerent models for the same system. There is usually plenty of room for argument about which model is ëbest". It is very important to understand at the outset that for any real system, there is no ëperfect" model 1. One is always faced with tradeoæs between æ accuracy, æ æexibility, æ cost. Increasing the accuracy of a model generally increases cost and decreases æexibility. The goal in creating a model is usually to obtain a ësuæciently accurate" and æexible model at a low cost. Note that this situation is much diæerent than what we normally encounter when we solve purely mathematical problems, at least in the context of the traditional mathematical curriculum. Usually in a mathematics text weændvery precise and explicit problems, whichwe are asked to solve completely. We may have to struggle to ænd a solution, but when we æ- nally ænish a problem, it is done. In modeling on the other hand, we are faced with unclearly stated and ambiguous problems which we can never hope to solve completely! It may sound awful but actually it can be a lot of fun. And it is much more representative of how things are done in the ëreal world" èeven in mathematical researchè. 1 This statement can be challenged, but ëperfect" is meant here in a strict sense. One may object with possible counterexamples from physics, but since there is not yet a ëtheory of Everything", it can be asserted that no existing mathematical model provides a perfectly accurate and complete picture of reality.

Mathematical Modeling 4 Real world data formulation Model test analysis Predictions or Explanations interpretation Mathematical results Figure 1: Schematic æow of modeling process. One of the most useful ways to view modeling is as a process, as illustrated in Figure 1.1. Notice that the ægure represents a loop, or an iterative process. The starting point is the bubble in the upper left-hand corner, real world data. This could represent quantitative measurements of the system of interest, general knowledge about how it works, or both. In any case we need some information pertaining to the system; usually the more information, the better. From that information we proceed to formulate, or construct, a model. Constructing a model requires: æ A clear picture of the goal of the modeling exercise. Exactly which aspects of the system do you wish to understand or predict, and how accurately do you need to do it? æ An picture of the key factors involved in the system and how they relate to each other. This often requires taking a greatly simpliæed view of the system, neglecting factors known to inæuence the system, and making assumptions which may or may not be correct. A model may consist of algebraic, diæerential, or integral equations, stochastic processes, geometrical structures, etc. The following situations are very common in modeling: æ Good models already exist for parts of the system. The goal is then to assemble these ësubmodels" to represent the whole system of interest.

Mathematical Modeling 5 æ Good models already exist for a diæerent system, which can be translated or modiæed to apply to the system of interest. One of the greatest virtues of mathematics is its generality. æ A general model exists which includes the system of interest as a special case, but it is very diæcult to compute with or analyze the general model. The goal is then to simplify or make approximations to the general model which will still reæect the behavior of the particular system of interest. Situations like this occur often in æuid dynamics, where the NavieríStokes equations are capable of modeling an extremely wide range of æuid æow problems, but it is usually not feasible to solve the equations in full generality. The three situations above illustrate the importance of proper background research in modeling. It is often astounding how much information and previous modeling work one can uncover by searching the scientiæc literature, the internet, government reports, and so on. In very lucky cases you may even ænd software which can be used for your problem. Once a model is constructed, one generally needs to do some analysis or computation to make it produce results. The results are often approximate solutions to the equations of interest, but for example in the case of stochastic models, results could be in the form of statisical information. Since the model is supposed to somehow represent the real system, it should be possible to interpret results from the model in terms of observable properties of the system. This is not always a trivial step, but it must be done if the results are to be of any use. Interpretation of the results should lead to predictions or explanations about the real system, which can then be tested against real observations to determine the effectiveness of the model. If the observations do not agree suæciently well with predictions from the model, the loop is iterated again with a revised formulation, new results, predictions, and so on. The description above of the modeling process should remind you of scientiæc method, which has been the foundation of scientiæc research for hundreds of years. The scientiæc method goes something like this: 1. Make general observations of phenomena, 2. Formulate a hypothesis, 3. Develop a method to test hypothesis, 4. Obtain data,

Mathematical Modeling 6 5. Test hypothesis against data, 6. Attempt to conærm or deny hypothesis. Mathematical models are often used in this context, where the hypothesis is a mathematical model. However as we discussed above, mathematical modeling can also be used in situations outside of scientiæc research. In nonscientiæc applications, the goal may be simply to obtain something which can produce answers ëclose enough" for a particular purpose, with the clear understanding that important features of the system may have been neglected. In this course, our goal will be to learn by way of direct experience, something about the process of mathematical modeling.