Using Gaussian Elimination for Determination of Structure Index in Euler Deconvolution
|
|
- Angela Preston
- 5 years ago
- Views:
Transcription
1 Austrli Jourl of Bsic d Applied Scieces, 4(1): , 010 ISSN Usig Gussi Elimitio for Determitio of Structure Idex i Euler Decovolutio 1 Rez.toushmli d M.ghbri 1 Islmic zd uiversity,hmed brch Islmic zd uiversity, khormbd brch Abstrct: Euler s homogeeity reltio hs ttrcted spordic iterest from geophysicists over the yers. The choice of structurl idex i Euler homogeeity equtio remis vexig problem, becuse structures re poorly imged d depths re bised if the wrog idex is used for y give feture. I this pper we ssume tht structurl idex is oe of my ukows d with solvig system of equtio with Gussi elimitio fid vlue of structure idex. Key words: structure idex, Euler Decovolutio, Gussi Elimitio 1)Euler decovolutio: Euler s homogeeity reltio hs ttrcted spordic iterest from geophysicists over the yers. It my be std succictly i the form T T T ( x xo) ( y yo) ( zzo) NT x y z Where x0,y0,z0 is the positio of source whose totl field T is detected t (x,y,z).the totl field hs regiol or bckgroud vlue B. where T, T d T represet first-order derivtive of x y z the mgetic (grvity) field log the x-, y- d z- directios, respectively, N is kow s structurl idex d relted to the geometry of the mgetic(grvity) source(si:thompso,198). Tkig ito ccout bse level for the regiol mgetic field (B) equtio (1) c be rerrged d writte s T T T T T T x y z NB x y z NT., x y z x y z Assigig the structurl idex (N) system of lier equtios c be obtied d solved for estimtig the loctio d depth of the mgetic d grvity body. The choice of structurl idex i euler homogeeity equtio remis vexig problem, becuse structures re poorly imged d depths re bised if the wrog idex is used for y give feture (Reid et l., 1990). I this pper we ssumed N=v, B=0 d obti the vlu of N with solvig system of lier equtio by Usig Gussi Elimitio. ) Gussi Elimitio: -1) How is Set of Equtios Solved Numericlly?: Oe of the most populr techiques for solvig simulteous lier equtios is the Gussi elimitio method. The pproch is desiged to solve geerl set of equtios d ukows Correspodig Author: Rez.toushmli, Islmic zd uiversity,hmed brch E-mil:Atomicboy_rez@yhoo.com 6390
2 x x x... x b x x x x b Gussi elimitio cosists of two steps 1. Forwrd Elimitio of Ukows: I this step, the ukow is elimited i ech equtio strtig with the first equtio. This wy, the equtios re reduced to oe equtio d oe ukow i ech equtio.. Bck Substitutio: I this step, strtig from the lst equtio, ech of the ukows is foud. -)Forwrd Elimitio of Ukows: I the first step of forwrd elimitio, the first ukow, x 1 is elimited from ll rows below the first row. The first equtio is selected s the pivot equtio to elimite x 1. So, to elimite x 1 i the secod equtio, oe divides the first equtio by 11 (hece clled the pivot elemet) d the multiplies it by 1. This is the sme s multiplyig the first equtio by 1 / 11 to give x1 1x... 1x b Now, this equtio c be subtrcted from the secod equtio to give x x b b or x... x b where This procedure of elimitig x 1, is ow repeted for the third equtio to the th equtio to reduce the set of equtios s x 3x3... x b 3x 33x3... 3x b 3... x x x b
3 This is the ed of the first step of forwrd elimitio. Now for the secod step of forwrd elimitio, we strt with the secod equtio s the pivot equtio d s the pivot elemet. So, to elimite x i the third equtio, oe divides the secod equtio by (the pivot elemet) d the multiply it by. This is the sme s multiplyig the secod equtio by 3 / 3 d subtrctig it from the third equtio. This mkes the coefficiet of x zero i the third equtio. The sme procedure is ow repeted for the fourth equtio till the th equtio to give x 3x3... x b 33x3... 3x b 3 3x3... x b The ext steps of forwrd elimitio re coducted by usig the third equtio s pivot equtio d so o. Tht is, there will be totl of - 1 steps of forwrd elimitio. At the ed of - 1 steps of forwrd elimitio, we get set of equtios tht look like x 3x3... x b 33x3... 3x b x b -3)Bck Substitutio: Now the equtios re solved strtig from the lst equtio s it hs oly oe ukow. x b ( 1) ( 1) The the secod lst equtio, tht is the ( - 1) th equtio, hs two ukows: x d x -1, but x is lredy kow. This reduces the ( - 1) th equtio lso to oe ukow. Bck substitutio hece c be represeted for ll equtios by the formul i1 i1 bi ij xj j i 1 xi for i 1,,,1 i1 d ii 639
4 x b ( 1) ( 1) 3)Usig Gussi Elimitio i Euler Decovolutio T=[ ]; x=[1 3 4]; y=[ 4 6 8]; T x T y T z =[ ] =[ ] =[ ] Iput the coefficiets for 4 equtios 1) Doig forwrd-elimitio phse: colum 1 of 4 Foud the first row tht hs ozero i colum V X Y Z = V X Y Z = V X Y Z = V X Y Z = ) Doig forwrd-elimitio phse: colum 1 of 4 Divided etire row 1 by Now subtrct times row 1 from row V X Y Z = V X Y Z = V X Y Z = V X Y Z = ) Doig forwrd-elimitio phse: colum 1 of 4 Now subtrct times row 1 from row 3 V X Y Z = X Y Z = V X Y Z = V X Y Z = ) Doig forwrd-elimitio phse: colum 1 of 4 Now subtrct times row 1 from row 4 V X Y Z = X Y Z = X Y Z = V X Y Z =
5 5) Doig forwrd-elimitio phse: colum 1 of 4 Doe with colum 1. Move o to ext colum V X Y Z = X Y Z = X Y Z = X Y Z = ) Doig forwrd-elimitio phse: colum of 4 Foud first row o or fter row tht hs ozero i colum V X Y Z = X Y Z = X Y Z = X Y Z = ) Doig forwrd-elimitio phse: colum of 4 Divided etire row by Now subtrct times row from row 3 V X Y Z = X Y Z = X Y Z = ) Doig forwrd-elimitio phse: colum of 4 Now subtrct times row from row 4 V X Y Z = Y Z = X Y Z = ) Doig forwrd-elimitio phse: colum of 4 Doe with colum. Move o to ext colum V X Y Z = Y Z = Y Z = ) Doig forwrd-elimitio phse: colum 3 of 4 Foud first row o or fter row 3 tht hs ozero i colum 3 V X Y Z = Y Z = Y Z = ) Doig forwrd-elimitio phse: colum 3 of 4 Divided etire row 3 by Now subtrct times row 3 from row 4 V X Y Z = Y Z = Y Z = ) Doig forwrd-elimitio phse: colum 3 of 4 Doe with colum 3. Move o to ext colum V X Y Z = Y Z = Z =
6 13) Doig forwrd-elimitio phse: colum 4 of 4 Foud first row o or fter row 4 tht hs ozero i colum 4 V X Y Z = Y Z = Z = ) Doig forwrd-elimitio phse: colum 4 of 4 Divided etire row 4 by Doe with colum 4. Tht ws the lst colum, move o to bck-elimitio V X Y Z = Y Z = Z = ) Doig bck-elimitio phse: colum 4 Subtrct times row 4 from row 3 V X Y Z = Y Z = Z = ) Doig bck-elimitio phse: colum 4 Subtrct times row 4 from row V X Y Z = Y = Z = ) Doig bck-elimitio phse: colum 4 Subtrct times row 4 from row 1 V X Y Z = X Y = Y = Z = ) Doig bck-elimitio phse: colum 3 Subtrct times row 3 from row V X Y = X Y = Y = Z = ) Doig bck-elimitio phse: colum 3 Subtrct times row 3 from row 1 V X Y = X = Y = Z = ) Doig bck-elimitio phse: colum Subtrct times row from row 1 V X = X = Y = Z =
7 Doig bck-elimitio phse: colum 1 All doe! V = X = Y = Z = With the clculted vlue of the structurl idex (V=N) we hve chieved our gol d we do t eed specific geologicl ssumptio to determie the structurl idex. If we lso hve more poits this method will Exteded d we c use this method. Coclusio: The choice of structurl idex i euler Decovolutio remis vexig problem, becuse structures re poorly imged d depths re bised if the wrog idex is used for y give feture. I this pper we ssume tht structurl idex is oe of my ukows d with solvig system of equtio with Gussi elimitio fid Vlue of structure idex. With the clculted vlue of the structurl idex we hve chieved our gol d we do t eed specific geologicl ssumptio to determie the structurl idex. If we lso hve more poits this method will Exteded d we c use this method. REFRENCES Golub, H. Gee, V Lo, F. Chrles, Mtrix Computtios (3rd ed.), Johs Hopkis, ISBN Reid, A.B., J.M. Allsop, H. Grser, A.J. Millett, I.W. Somerto, Mgetic iterprettio i three dimesios usig Euler Decovolutio. Geophysics, 55(1): Reid, A.B., [1] GETECH, Euler Decovolutio, Pst, Preset d Future: A Review,c/o Deprtmet of Erth Scieces, Leeds Uiversity, Leeds, Uited Kigdom Thompso, D.T., 198. EULDPH: A ew techique for mkig computer-ssisted depth estimtes from mgetic dt. Geophysics, 47(1): Preuss, W.H., et l., 199. Numericl Recipes i Fortr, d editio Cmbridge Uiversity Press. 6396
Gauss-Seidel Method. An iterative method. Basic Procedure:
Guss-Siedel Method Guss-Seidel Method A itertive method. Bsic Procedure: -Algebriclly solve ech lier equtio for i -Assume iitil guess solutio rry -Solve for ech i d repet -Use bsolute reltive pproimte
More informationON THE STABILITY OF LU-FACTORIZATIONS
Idi Jourl of Fudetl d pplied Life Scieces ISSN: 3 6345 (Olie) Ope ccess Olie Itertiol Jourl vilble t wwwcibtechorg/sped/jls/4/4/jlsht 4 Vol 4 (S4) pp 4-49/Sfdr Reserch rticle BSTRCT ON THE STBILITY OF
More informationA Variant of Pascal s Triangle Dennis Van Hise Stetson University
A Vrit of Pscl s Trigle eis V Hise tetso Uiversity I. Itroductio d Nottio It is the purpose of this pper to explore vrit of Pscl s trigle. This vrit hs the rule tht every etry, deoted s,, where,, is clculted
More informationPrimitive Pythagorean triples and generalized Fibonacci sequences
Notes o Number Theory d Discrete Mthemtics Prit ISSN 30 53, Olie ISSN 37 875 Vol 3, 07, No, 5 Primitive Pythgore triples d geerlized ibocci sequeces J V Leyedekkers d A G Sho, 3 culty of Sciece, The Uiversity
More informationGauss-Siedel Method. Major: All Engineering Majors. Authors: Autar Kaw
Guss-Siedel Method Mjor: All Egieerig Mjors Authors: Autr Kw http://umericlmethods.eg.usf.edu Trsformig Numericl Methods Eductio for STEM Udergrdutes 4//06 http://umericlmethods.eg.usf.edu Guss-Seidel
More informationSection 3.2: Arithmetic Sequences and Series
Sectio 3.: Arithmetic Sequeces Series Arithmetic Sequeces Let s strt out with efiitio: rithmetic sequece: sequece i which the ext term is fou by ig costt (the commo ifferece ) to the previous term Here
More informationSection 3.1: Sequences and Series
Sectio 3.: Sequeces d Series Sequeces Let s strt out with the defiitio of sequece: sequece: ordered list of umbers, ofte with defiite ptter Recll tht i set, order does t mtter so this is oe wy tht sequece
More informationOn Some Iterative Methods for Solving Systems of Linear Equations
Computtiol d Applied Mthemtics Jourl 205; (2: 2-28 Published olie Februry 20, 205 (http://www.scit.org/jourl/cmj O Some Itertive Methods for Solvig Systems of Lier Equtios Fdugb Sudy Emmuel Deprtmet of
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More information. (b) Evaluate the sum given by. Exercise #1: A sequence is defined by the equation a n 2n
Nme: 453 Dte: SEQUENCES ALGEBRA WITH TRIGONOMETRY Sequeces, or ordered list of umbers, re extremely importt i mthemtics, both theoreticl d pplied A sequece is formlly defied s fuctio tht hs s its domi
More informationCS280 HW1 Solution Set Spring2002. now, we need to get rid of the n term. We know that:
CS80 HW Solutio Set Sprig00 Solutios by: Shddi Doghmi -) -) 4 * 4 4 4 ) 4 b-) ) ) ) * ) ) ) 0 ) c-) ) ) ) ) ) ow we eed to get rid of the term. We ow tht: ) ) ) ) substitute ito the recursive epressio:
More informationDakshayani Indices. Annals of
Als of Pure d Applied Mthetics Vol x, No x, 0x, xxx-xxx ISSN: 79-087X (P), 79-0888(olie) Published o 3 October 08 wwwreserchthsciorg DOI: http://dxdoiorg/0457/pv83 Als of Dkshyi Idices VRKulli Deprtet
More informationEE 477 Digital Signal Processing. 8a IIR Systems
EE 477 Digitl Sigl Processig 8 IIR Systems Geerl Differece Equtio FIR: output depeds o curret d pst iputs oly IIR: output depeds o curret d pst iputs d pst outputs y M [] b x[ ] + y[ l] l N l EE 477 DSP
More informationDef : A radical is an expression consisting of a radical sign (radical symbol), a radicand, and an index.
Mth 0 Uit : Roots & Powers Red Buildig O, Big Ides, d New Vocbulry, p. 0 tet.. Estitig Roots ( clss) Red Lesso Focus p. tet. Outcoes Ch. Notes. Defie d give eple of rdicl. pp. 0, 9. Idetify the ide d the
More informationSection 3.1: Sequences and Series
Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More information3n
Prctice Set 6 Sequeces d Series Clcultor Required Objectives Alyze ptters i sequeces to determie subsequet terms. Fid the first four terms of sequece give equtio for. Fid expressio for give sequece. Expd
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationRaytracing: Quality. Ray Genealogy. Ray Genealogy. Describe what you see! Describe what you see! Describe what you see!
Rytrcig: Qulity COSC 4328/5327 Scott A. Kig Ry Geelogy Primry rys spw off 3 rys. Two of those c spw of 3 more, etc. Whe do you stop? Whe ry leves the scee. Whe the cotriutio is smll eough. After ech ouce
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationComputer Graphics. Computer Graphics. Rendering 4/1/2009 CS551
4//009 Computer Grphics CS55 Computer Grphics Wht do it refer to? Rederig odelig Aimtio Imge Processig Also Virtul relity Visuliztio Artistic rederig Ad my my more Rederig Wht it is rederig Oe type of
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationTwo-Dimensional Motion Estimation (Part III: Advanced Techniques) Yao Wang Polytechnic University, Brooklyn, NY11201
Two-Dimesiol Motio Estimtio (Prt III: Advced Techiques) Yo Wg Polytechic Uiversity, Brookly, NY11201 yo@visio.poly.edu Yo Wg, 2002 2-D Motio Estimtio Outlie Deformble block mtchig lgorithm (DBMA) Node-bsed
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationSIMPLIFYING ALGEBRA PASSPORT.
SIMPLIFYING ALGEBRA PASSPORT www.mthletics.com.u This booklet is ll bout turning complex problems into something simple. You will be ble to do something like this! ( 9- # + 4 ' ) ' ( 9- + 7-) ' ' Give
More information1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)
Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationTwo-Dimensional Motion Estimation (Part II: Advanced Techniques) Yao Wang Polytechnic University, Brooklyn, NY
Two-Dimesiol Motio Estimtio (Prt II: Advced Techiques) Yo Wg Polytechic Uiversity, Brookly, NY11201 http://eeweb.poly.edu/~yo Outlie Problems with EBMA Multiresolutio motio estimtio Hierrchicl block mtchig
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationCounting unlabeled full binary rooted plane trees
Coutig uleled full iry rooted ple trees How my wys re there to plce - pirs of pretheses i the product i such wy tht the order of multiplictio is completely specified? = = Coutig uleled full iry rooted
More informationChapter 24. Sorting. Objectives. 1. To study and analyze time efficiency of various sorting algorithms
Chapter 4 Sortig 1 Objectives 1. o study ad aalyze time efficiecy of various sortig algorithms 4. 4.7.. o desig, implemet, ad aalyze bubble sort 4.. 3. o desig, implemet, ad aalyze merge sort 4.3. 4. o
More informationEE213A - EE298-2 Lecture 11
EE23A EE292 Lecture Time multiplexig eferece: F. Ctthoor (prt III) Igrid Verbuwhede Deprtmet of Electricl Egieerig Uiversity of Clifori Los Ageles igrid@ee.ucl.edu Motivtio DSP represettio & modelig to
More informationRandomized Algorithms
// Copyright he McGrw-Hill Compies, Ic. Permissio required for reproductio or disply. Rdomized Algorithms Copyright he McGrw-Hill Compies, Ic. Permissio required for reproductio or disply. Copyright he
More informationA Very Simple Approach for 3-D to 2-D Mapping
A Very Simple Approach for -D to -D appig Sadipa Dey (1 Ajith Abraham ( Sugata Sayal ( Sadipa Dey (1 Ashi Software Private Limited INFINITY Tower II 10 th Floor Plot No. - 4. Block GP Salt Lake Electroics
More informationIntroduction to Integration
Introduction to Integrtion Definite integrls of piecewise constnt functions A constnt function is function of the form Integrtion is two things t the sme time: A form of summtion. The opposite of differentition.
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
More informationHamiltonian-T*- Laceability in Jump Graphs Of Diameter Two
IOSR Jourl of Mthemtics IOSR-JM e-issn 78-78 p-issn9-76x. Volume Issue Ver. III My-Ju. PP -6 www.iosrjourls.org Hmiltoi-T*- Lcebility i Jump Grphs Of Dimeter Two Mjuth.G Murli.R Deprtmet of MthemticsGopl
More informationHigh-Performance Floating Point Divide
High-Performce Flotig Poit Divide Albert A. Liddicot d Michel J. Fly Computer Systems Lbortory Stford Uiversity, Stford, CA 945 liddicot@stford.edu d fly@umuhum.stford.edu Abstrct I moder processors flotig
More informationThe number n of subintervals times the length h of subintervals gives length of interval (b-a).
Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's
More informationThe Chromatic Covering of a Graph: Ratios, Domination, Areas and Farey Sequences.
The Chromtic Coverig of Grph: Rtios Domitio res d Frey eueces. Pul ugust Witer mthemtics UKZN Durb outh fric emil: witerp@ukz.c.z bstrct The study of the chromtic umber d vertex coverigs of grphs hs opeed
More informationEX 1 Find the length of each side EX 2 Find the value of a, b, c, d. if the perimeter is 20.
HOW DOES THIS APPLY? EX Fid the legth of eh side EX 2 Fid the vlue of, b,, d. if the perieter is 20. To solve or ot to solve? C you solve usig properties of isoseles trigles disovered? If so, write the
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More informationDynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012
Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.
More informationII. THE ALGORITHM. A. Depth Map Processing
Lerning Plnr Geometric Scene Context Using Stereo Vision Pul G. Bumstrck, Bryn D. Brudevold, nd Pul D. Reynolds {pbumstrck,brynb,pulr2}@stnford.edu CS229 Finl Project Report December 15, 2006 Abstrct A
More informationControl-Flow Analysis and Loop Detection
! Control-Flow Anlysis nd Loop Detection!Lst time! PRE!Tody! Control-flow nlysis! Loops! Identifying loops using domintors! Reducibility! Using loop identifiction to identify induction vribles CS553 Lecture
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationOur Learning Problem, Again
Noparametric Desity Estimatio Matthew Stoe CS 520, Sprig 2000 Lecture 6 Our Learig Problem, Agai Use traiig data to estimate ukow probabilities ad probability desity fuctios So far, we have depeded o describig
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationd i e j example:
Expoet Rules Mth II Foruls to study for NC Fil Ex Fll 017 exple: 0 1 exple: 0 = 1 c h exple: c h 6 1 1 1 exple: 9 bbg b exple: bbg 1 b d 9 F F exple: exple: 7 7 4 16 HG I K J F H G I K J HG I K J F H G
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationA graphical view of big-o notation. c*g(n) f(n) f(n) = O(g(n))
ca see that time required to search/sort grows with size of We How do space/time eeds of program grow with iput size? iput. time: cout umber of operatios as fuctio of iput Executio size operatio Assigmet:
More informationZZ - Advanced Math Review 2017
ZZ - Advnced Mth Review Mtrix Multipliction Given! nd! find the sum of the elements of the product BA First, rewrite the mtrices in the correct order to multiply The product is BA hs order x since B is
More informationChapter 2 Sensitivity Analysis: Differential Calculus of Models
Chpter 2 Sensitivity Anlysis: Differentil Clculus of Models Abstrct Models in remote sensing nd in science nd engineering, in generl re, essentilly, functions of discrete model input prmeters, nd/or functionls
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationSection 10.4 Hyperbolas
66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol
More information3.5.1 Single slit diffraction
3.5.1 Single slit diffrction Wves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. We will consider this lter.
More informationComputer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.
Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must
More informationCSE 111 Bio: Program Design I Lecture 17: software development, list methods
CSE 111 Bio: Program Desig I Lecture 17: software developmet, list methods Robert H. Sloa(CS) & Rachel Poretsky(Bio) Uiversity of Illiois, Chicago October 19, 2017 NESTED LOOPS: REVIEW Geerate times table
More informationA Fuzzy Linear Programming in Optimizing Meat Production
Lzim Abdullh et l. / Itertiol Jourl of Egieerig d Techology (IJET) A Fuzzy Lier Progrmmig i Optimizig Met Productio Lzim Abdullh # d Nor Hfizh Abidi # #, # School of Iformtics d Applied Mthemtics Uiversity
More informationLogic Spring Final Review
Idirect Argumet: Cotrdictios d Cotrpositio. Prove the followig by cotrdictio d by cotrpositio. Give two seprte proofs. The egtive of y irrtiol umber is irrtiol. b. For ll iteger, if ² is odd the is odd.
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More information3.5.1 Single slit diffraction
3..1 Single slit diffrction ves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. e will consider this lter. Tke
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationc-dominating Sets for Families of Graphs
c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the
More informationSimplifying Algebra. Simplifying Algebra. Curriculum Ready.
Simplifying Alger Curriculum Redy www.mthletics.com This ooklet is ll out turning complex prolems into something simple. You will e le to do something like this! ( 9- # + 4 ' ) ' ( 9- + 7-) ' ' Give this
More informationProduct of polynomials. Introduction to Programming (in C++) Numerical algorithms. Product of polynomials. Product of polynomials
Product of polynomils Introduction to Progrmming (in C++) Numericl lgorithms Jordi Cortdell, Ricrd Gvldà, Fernndo Orejs Dept. of Computer Science, UPC Given two polynomils on one vrile nd rel coefficients,
More informationSOLVING FUZZY TRANSPORTATION PROBLEM USING SYMMETRIC TRIANGULAR FUZZY NUMBER
Itertiol Jourl of Advced Reserch i Mthetics d Applictios Volue: 1 Issue: 1 17-Jul-2014,ISSN_NO: xxxx-xxx SOLVING FUZZY TRANSPORTATION PROBLEM USING SYMMETRIC TRIANGULAR FUZZY NUMBER 1 S Nreshkur, 2 S Kur
More informationImproper Integrals. October 4, 2017
Improper Integrls October 4, 7 Introduction We hve seen how to clculte definite integrl when the it is rel number. However, there re times when we re interested to compute the integrl sy for emple 3. Here
More informationFall 2018 Midterm 1 October 11, ˆ You may not ask questions about the exam except for language clarifications.
15-112 Fll 2018 Midterm 1 October 11, 2018 Nme: Andrew ID: Recittion Section: ˆ You my not use ny books, notes, extr pper, or electronic devices during this exm. There should be nothing on your desk or
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationAgilent Mass Hunter Software
Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss
More informationRational Numbers---Adding Fractions With Like Denominators.
Rtionl Numbers---Adding Frctions With Like Denomintors. A. In Words: To dd frctions with like denomintors, dd the numertors nd write the sum over the sme denomintor. B. In Symbols: For frctions c nd b
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationYoplait with Areas and Volumes
Yoplit with Ares nd Volumes Yoplit yogurt comes in two differently shped continers. One is truncted cone nd the other is n ellipticl cylinder (see photos below). In this exercise, you will determine the
More informationGraphs ORD SFO LAX DFW
Graphs SFO 337 1843 802 ORD LAX 1233 DFW Graphs A graph is a pair (V, E), where V is a set of odes, called vertices E is a collectio of pairs of vertices, called edges Vertices ad edges are positios ad
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationThe Graphs of Polynomial Functions
Sectio 4.3 The Graphs of Polyomial Fuctios Objective 1: Uderstadig the Defiitio of a Polyomial Fuctio Defiitio Polyomial Fuctio 1 2 The fuctio ax a 1x a 2x a1x a0 is a polyomial fuctio of degree where
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationEmbedded Systems Design: A Unified Hardware/Software Introduction. Outline. Chapter 2: Custom single-purpose processors.
Hrdwre/Softwre Itroductio Chpter Custom sigle-purpose processors Itroductio Combitiol logic Sequetil logic Outlie Custom sigle-purpose processor desig RT-level custom sigle-purpose processor desig Hrdwre/Softwre
More informationSolution of Linear Algebraic Equations using the Gauss-Jordan Method
Solution of Liner Algebric Equtions using the Guss-Jordn Method Populr pproch for solving liner equtions The Guss Jordn method depends on two properties of liner equtions: Scling one or more of ny of the
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationCSE 2320 Notes 8: Sorting. (Last updated 10/3/18 7:16 PM) Idea: Take an unsorted (sub)array and partition into two subarrays such that.
CSE Notes 8: Sortig (Last updated //8 7:6 PM) CLRS 7.-7., 9., 8.-8. 8.A. QUICKSORT Cocepts Idea: Take a usorted (sub)array ad partitio ito two subarrays such that p q r x y z x y y z Pivot Customarily,
More informationLecture 2. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 2 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationOptimization of a precise integration method for seismic modeling based on graphic processing unit
Erthq Sci ()3: 387 393 387 Doi:.7/s589--736- Optimiztio of precise itegrtio method for seismic modelig bsed o grphic processig uit Jigyu Li Geyg Tg d Tiyue Hu, School of Erth d Spce Scieces, Pekig Uiversity,
More informationData Structures Week #9. Sorting
Data Structures Week #9 Sortig Outlie Motivatio Types of Sortig Elemetary (O( 2 )) Sortig Techiques Other (O(*log())) Sortig Techiques 21.Aralık.2010 Boraha Tümer, Ph.D. 2 Sortig 21.Aralık.2010 Boraha
More informationCOMPUTATIONAL INTELLIGENCE
COMPUTATIONAL INTELLIGENCE LABORATORY CLASSES Immentton smplstc verson of the or AANG network for some nference resons Adrn Horzyk IMPLEMENTATION OF THE SIMPLISTIC OR AANG Imment the smplstc verson of
More informationsuch that the S i cover S, or equivalently S
MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i
More informationThe Fundamental Theorem of Calculus
MATH 6 The Fundmentl Theorem of Clculus The Fundmentl Theorem of Clculus (FTC) gives method of finding the signed re etween the grph of f nd the x-xis on the intervl [, ]. The theorem is: FTC: If f is
More informationCOMPUTATIONAL INTELLIGENCE
COMPUTATIONAL INTELLIGENCE LABORATORY CLASSES Immentton smplstc verson of the network for some nference resons Adrn Horzyk IMPLEMENTATION OF THE SIMPLISTIC OR AANG Imment the smplstc verson of n structure
More informationComplete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li
2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min
More informationSpring 2018 Midterm Exam 1 March 1, You may not use any books, notes, or electronic devices during this exam.
15-112 Spring 2018 Midterm Exm 1 Mrch 1, 2018 Nme: Andrew ID: Recittion Section: You my not use ny books, notes, or electronic devices during this exm. You my not sk questions bout the exm except for lnguge
More informationLecture 3. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 3 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationDimensionality Reduction PCA
Dimesioality Reductio PCA Machie Learig CSE446 David Wadde (slides provided by Carlos Guestri) Uiversity of Washigto Feb 22, 2017 Carlos Guestri 2005-2017 1 Dimesioality reductio Iput data may have thousads
More informationCHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE
CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationLU Decomposition. Mechanical Engineering Majors. Authors: Autar Kaw
LU Decomposition Mechnicl Engineering Mjors Authors: Autr Kw Trnsforming Numericl Methods Eduction for STEM Undergrdutes // LU Decomposition LU Decomposition LU Decomposition is nother method to solve
More information