Multigrid Methods and Applications in CFD
|
|
- Myrtle Freeman
- 5 years ago
- Views:
Transcription
1 Multgrd Metods and Applcatons n CFD Mcael Wurst 0 May 009 Contents Introducton Typcal desgn of CFD solvers 3 Basc metods and ter propertes for solvng lnear systems of equatons 4 Geometrc Multgrd 3 5 Algebrac Multgrd 7 6 Examples 9 7. Advantages and Dsadvantages of Algebrac Multgrd Introducton Multgrd Metods are a group of algortms n numercal analyss for solvng lnear systems of equatons. Tey are especally elgble for ellptcal problems, for example te Posson equaton. Ts type of equaton arses among oters from te dscretsaton of te pressure correcton equaton n te soluton of te Naver-Stokes equaton. Te advantage ere s te lnear dependence of te soluton tme from te number of grd ponts N wc could be stated as optmal. In ts work, two dfferent multgrd metods (geometrc multgrd and algebrac multgrd) are presented and te dfferences between tem are sown. Addtonally ter applcaton to computatonal flud dynamcs s demonstrated wt an example. Typcal desgn of CFD solvers Tere are bascally two approaces for te soluton of te Naver-Stokes equaton, te coupled solver and te segregated solver. Te Naver-Stokes equaton s a nonlnear system of equaton. It contans 4 unknowns, tree velocty components and te pressure, but conssts only of tree equatons. Terefore te conservaton of mass s used as an addtonal equaton. In te segregated solver one uses an teratve - -
2 sceme for te soluton. Frst te momentum equaton s solved wt te pressure dstrbuton from te last tme step wle n a second step te flud velocty s corrected based on te pressure from te pressure-correcton equaton. Ts pressure-correcton equaton s a Posson equaton wose coeffcent matrx s ll condtoned. Neverteless te soluton of te pressure-correcton equaton s needed to a tgt tolerance for guaranteeng mass conservaton. Ts makes a fast, robust lnear solver necessary wc can be aceved by multgrd metods. Te coupled solver dscretses te momentum and te pressure correcton equaton n suc a way tat one gets a bg coupled block equaton system wc solves te pressure and te tree velocty components n one matrx system. Ts system can become qute large wc explans te need for a fast lnear solver based on multgrd metods. 3 Basc metods and ter propertes for solvng lnear systems of equatons In te coupled as well as n te segregated approac one gets a lnear system of equatons gven by or n components A u = f au = f In ts context u s te exact soluton, A s a sparse (symmetrc) matrx of sze n n and v denotes an approxmaton to te exact soluton u. Tere are now two mportant measures of v as an approxmaton to u: Absolute error e gven by e = u v. Te problem s tat te absolute error s naccessable as te exact soluton tself. Resdual r; s te amount by wc te approxmaton v fals to satsfy te orgnal problem Au=f: r = f A v. Bot measurements are vectors and can be measured by any vector norm, lke te L or te L norm: e = max e n and e = n = e. - -
3 In general, tere are now two possbltes for te soluton of te lnear system of equatons, drect metods and teratve or relaxaton metods. Drect metods lke Gauss elmnaton solve te problem to te computatonal accuracy but ave g computatonal costs. Iteratve metods nstead solve te problem only by an approxmaton but ts could be sometmes suffcent and terefore less tme consumng. Two teratve metods are te Jacob relaxaton and te Gauss-Sedel relaxaton. Te dea of te Jacob metod s to solve te t equaton for te t unknown usng te approxmatons from te last teraton for te oter unknowns. It can be wrtten by u f a u ( n+ ) ( n) =. a Te Gauss-Sedel metod ncorporates a smple cange: components of te new approxmaton are used as soon as tey are computed: Ts means tat components of te approxmaton vector v are used as soon as tey are updated: u = f - au - au a < > (n+) (n+) (n). Applyng tese teratve metods one can observe tat te error decreases eac teraton. But after some teratons te error does not reduce anymore. One can explan ts beavour assumng te error beng a vector sum from te egenvectors of te matrx A: (0) e n = k = c w k k. Tese egenvectors are connected closely to te egen modes of te problem. If we now apply an teratve metod, t s found out tat te error components from gfrequent egenvectors (or modes) dsappear soon and te error components from low-frequent egenvectors (or modes) do not dsappear. Terefore tese teratve metods are also called smooters. 4 Geometrc Multgrd Te open queston s now ow to mprove tese teratve metods n order to reduce all error components. Te dea bend te multgrd metods s now to ave at least two dfferent grds of dfferent sze, one coarse grd and one fne grd. One can sow tat te error on te coarse grd looks more oscllatory tan on te fne grd or n oter - 3 -
4 words te error on a fne grd looks less smot tan on a coarse grd. Ts can be used now for te followng procedure. Frst oen apples an teratve sceme on a fne grd untl te error only conssts of smoot, low frequent components. Ten ts error s transformed to te coarse grd were t looks more oscllatory. If we now relax on ts grd t sould effectvely elmnate addtonal error modes. Ts could be contnued wt more tan one coarse grd but t leaves te problem f te error s stll smoot on te fne grd. Anoter possblty s te use of te resdual equaton and applyng te followng sceme, called te correcton sceme: Here Relax on A u = f on Ω to obtan an approxmaton v Compute te resdual r = f-av and relax on te resdual equaton Ω to obtan an approxmaton to te error e Correct te approxmaton obtaned on Ω Ω : v v + e wt superscrpt denotes te fne grd wle Ae = r on Ω wt te error estmate obtaned on Ω wt superscrpt denotes te coarse grd. Ts basc sceme could also be used for more tan one coarse grd wc wll be sown later. Based on ts sceme te followng formal steps ave to be defned: Selecton of te coarse grd(s) Defnton of transformaton operators for vectors and te matrx A from coarse to fne grds and vce versa In geometrd multgrd te selecton of coarse grds s based on geometrc relatons, for example n a one dmensonal problem every second fne grd pont s defned as a coarse grd pont. Wt ts relaton t s possble to desgn as many coarse grds as desred. Te defnton of transformaton operators s spltted nto two parts. Te transformaton from coarse to fne grds s denoted as nterpolaton / prolongaton and te transformaton from fne to coarse grd s called restrcton. Te prolongaton s defned as a lnear nterpolaton. In te one-dmensonal case ts s gven by v v = f te pont s bot on te fne and on te coarse grd and by ( v + = v + v + ) wt n 0-4 -
5 f te pont s only on te fne grd. Ts relaton can be seen n Fgure. Fgure : Interpolaton / Prolongaton n te one-dmensonal case Te restrcton s normally calculated by full wegtenng wc means tat te coarse grd pont s defned by an wegted average of ts negbours. For te onedmensonal case t s gven by (compare Fgure ) n v = ( v + v + v+ ) 0. 4 Fgure : Restrcton n te one-dmensonal case For te one-dmensonal case te restrcton operator and te prolongaton operator can also be wrtten n matrx form: Restrcton operator: I =
6 Prolongaton operator: I =... It can be seen tat te restrcton and te prolongaton operator are transpose to eac oter except for a constant: I ( ) T = c I. Ts property s called varatonal property. Anoter mportant concept s te calculaton of te matrx A on te coarse grd. Ts can eter be done by dscretzng te problem on te coarse problem or n general by multplyng te fne grd matrx condton): A wt te prolongaton and restrcton operator (called Galerkn A = I A I. Now ts possble to apply any multgrd sceme, for example te V-cycle wc s based on te correcton sceme. It s buld up by arbtrary coarse grds and s called V-cycle because t goes from te fnest grd down to te coarsest grd and te up agan (compare Fgure 3): Relax on u = f Contents f = A I r ν tmes wt ntal guess v Relax on Compute A u = f f = I r 4 4 ν tmes wt ntal guess v Relax on Compute A u = f f = I r ν wt ntal guess 4 v. Solve A L u L = f L (maybe possble wt drect solver)
7 Correct v v + I v Relax A u = f ν tmes wt ntal guess v 4 Correct v v + I v 4 4 Relax A u = f ν tmes wt ntal guess v Correct v v + I v Relax on A u = f ν tmes wt ntal Relax g uess v Restrcton 4 8 Prolongaton 6 5 Algebrac Multgrd Geometrc multgrd s very effectve f a problem s solved on a structured mes but for many problems an unstructured mes s necessary were t s dffcult to defne coarse grd based on geometrc relatons. Instead one wants to defne coarse grds n an algebrac sense. But for transformng a multgrd sceme lke te V-cycle from geometrc to algebrac multgrd one also needs to defne te followng tngs n an algebrac sense: Smootness of an error Fgure 3: V-cycle Transfer of vectors and te matrx A from coarse to fne grds and vce versa Applcablty of smooters (Gauss-Sedel, Jacob) - 7 -
8 In algebrac multgrd an error s defned as a smoot error f or n components: Ae 0 ae + ae 0 ae ae Tat means a smoot error can be approxmated by a wegted average of negbourng varables. An mportant concept for te selecton of te coarse grd s te defnton of strong nfluence and dependence. Bot defntons take nto account tat for dagonal domnant matrx te t row s assocated wt t unknown. Of course, t usually takes all of te equaton varables to determne any gven varable precsely but maybe t s possble to ave a preselecton of varables tat are more mportant tan oters Defnton : Gven a tresold value 0< θ, te varable (pont) u strongly depends on te varable (pont) u f a θ max{ a }. k k Ts says tat te varable strongly depends on grd a pont f te coeffcent s comparable n magntude to te largest off-dagonal coeffcent n te t equaton. We can state ts defnton from anoter perspectve. Defnton : If te varable u strongly depends on te varable u, ten te varable u strongly nfluences te varable. Two sets can be derved from tese two defntons. S : set of ponts tat strongly nfluence, tat s te ponts on wc te pont strongly depends. { : θ max { k} } S = a a k T S : set of ponts tat strongly depend on te pont. { : } T S = S Tese sets are mportant for te selecton sceme of te coarse grd. Te coarse grd sould fulfl te followng condtons: u
9 Smoot error can be approxmated accurately Good nterpolaton to te fne grd Sould ave substantally fewer ponts, so te problem on te coarse grd can be solved wt lttle expense Te selecton process s carred out lke ts: ) Defne a measure to eac pont of ts potental qualty as a coarse (C) pont: amount λ T of members of S ) Assgn pont wt maxmum λ to C-pont T 3) All ponts n S become fne (F) ponts 4) For eac new F pont : ncrease te measeure λ k for all eac unassgned pont k tat strongly nfluence : k S 5) Do )-4) untl all ponts are ass gned If te coarse grds are selected, transformaton operators must be defned between te grds. In general te component ( ) determned lke ts: e f C = e f F ( I e) ω C Te nterpolaton wegts I e of a vector on te fne grd can be ω ave nformaton about te negbourng, off-dagonal elements wc can be dvded nto te negborng coarse grd ponts tat strongly nfluence I, te negborng fne grd ponts tat strongly nfluence I and nto ponts tat do not strongly nfluence I (fne and coarse grd ponts). 6 Examples For testng te algebrac multgrd a test case (compare [3]) was set up. Te Posson equaton s solved n four dfferent varants at four dfferent domans: - 9 -
10 Te coeffcents a, b and c are dfferent on eac doman: a=000 a= c= c= b=0 b= a= a=000 c= c= b=0 b=0 Te equaton s dscretzed usng te fnte volume metod and solved on a 00 x 00 mes. Fgure 4 tll Fgure 6 sow te tree frst coarse levels wt red ponts beng te coarse varables on te next grd 'Y' 'X' Fgure 4: Grd - 0 -
11 'Y' 'X' Fgure 5: Grd 'Y' 'X' Fgure 6: Grd 8 7. Advantages and Dsadvantages of Algebrac Multgrd Advantages of algebrac multgrd are tat te soluton s fast and robust and s very effectve for segregated solvers. Dsadvantages are tat te trple matrx operaton at te Galerkn step s a very expensve step and ard to parallse. Te defnton of coarse grds leads to a g setup-pase and g storage requrements. Addtonally ts algortm s not sutable - -
12 for coupled solvers were te aggregaton based algebrac multgrd s a cure aganst t []. - -
13 Bblograpy [] M. Raw, Robustness of coupled Algebrac Multgrd for te Naver-Stokes equatons, AIAA Paper (996) [] W. Brggs, V. Henson und S. MacCormck:, A multgrd tutoral;. edton; SIAM Pladelpa (000); [3] K. Stüben, Algebrac Multgrd (AMG): An Introducton wt Applcatons; GMD Report 70 (999); - 3 -
CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,
More informationParallel VLSI CAD Algorithms. Lecture 7 Iterative methods for IC thermal analysis Zhuo Feng
Parallel VLSI CAD Algortms Lecture 7 Iteratve metods for IC termal analyss Zuo Feng 7. We ve taled about usng LU to solve a sparse lnear matr t problem Anoter way of dealng wt sparse matr problems s to
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationNumerical Simulation of One-Dimensional Wave Equation by Non-Polynomial Quintic Spline
IOSR Journal of Matematcs (IOSR-JM) e-issn: 78-578, p-issn: 319-765X. Volume 14, Issue 6 Ver. I (Nov - Dec 018), PP 6-30 www.osrournals.org Numercal Smulaton of One-Dmensonal Wave Equaton by Non-Polynomal
More informationRelaxation Methods for Iterative Solution to Linear Systems of Equations
Relaxaton Methods for Iteratve Soluton to Lnear Systems of Equatons Gerald Recktenwald Portland State Unversty Mechancal Engneerng Department gerry@pdx.edu Overvew Techncal topcs Basc Concepts Statonary
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationCOMP4630: λ-calculus
COMP4630: λ-calculus 4. Standardsaton Mcael Norrs Mcael.Norrs@ncta.com.au Canberra Researc Lab., NICTA Semester 2, 2015 Last Tme Confluence Te property tat dvergent evaluatons can rejon one anoter Proof
More informationOn Pfaff s solution of the Pfaff problem
Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationA Spline based computational simulations for solving selfadjoint singularly perturbed two-point boundary value problems
ISSN 746-769 England UK Journal of Informaton and Computng Scence Vol. 7 No. 4 pp. 33-34 A Splne based computatonal smulatons for solvng selfadjont sngularly perturbed two-pont boundary value problems
More informationThe Finite Element Method: A Short Introduction
Te Fnte Element Metod: A Sort ntroducton Wat s FEM? Te Fnte Element Metod (FEM) ntroduced by engneers n late 50 s and 60 s s a numercal tecnque for solvng problems wc are descrbed by Ordnary Dfferental
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationAn Multigrid Tutorial
An Multgrd Tutoral Van Emden Henson Center for Appled Scentfc Computng Lawrence Lvermore Natonal Laboratory vhenson@llnl.gov http://www.casc.gov//people/henson Aprl 0, 999 AMG: What s Algebrac Multgrd??
More informationSolution for singularly perturbed problems via cubic spline in tension
ISSN 76-769 England UK Journal of Informaton and Computng Scence Vol. No. 06 pp.6-69 Soluton for sngularly perturbed problems va cubc splne n tenson K. Aruna A. S. V. Rav Kant Flud Dynamcs Dvson Scool
More informationComputational Astrophysics
Computatonal Astrophyscs Solvng for Gravty Alexander Knebe, Unversdad Autonoma de Madrd Computatonal Astrophyscs Solvng for Gravty the equatons full set of equatons collsonless matter (e.g. dark matter
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More information2.29 Numerical Fluid Mechanics Fall 2011 Lecture 12
REVIEW Lecture 11: 2.29 Numercal Flud Mechancs Fall 2011 Lecture 12 End of (Lnear) Algebrac Systems Gradent Methods Krylov Subspace Methods Precondtonng of Ax=b FINITE DIFFERENCES Classfcaton of Partal
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationMultivariate Ratio Estimator of the Population Total under Stratified Random Sampling
Open Journal of Statstcs, 0,, 300-304 ttp://dx.do.org/0.436/ojs.0.3036 Publsed Onlne July 0 (ttp://www.scrp.org/journal/ojs) Multvarate Rato Estmator of te Populaton Total under Stratfed Random Samplng
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationIntroduction to Computational Fluid Dynamics
Introducton to Computatonal Flud Dynamcs M. Zanub 1, T. Mahalakshm 2 1 (PG MATHS), Department of Mathematcs, St. Josephs College of Arts and Scence for Women-Hosur, Peryar Unversty 2 Assstance professor,
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationThe Finite Element Method
The Fnte Element Method GENERAL INTRODUCTION Read: Chapters 1 and 2 CONTENTS Engneerng and analyss Smulaton of a physcal process Examples mathematcal model development Approxmate solutons and methods of
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationTR/28. OCTOBER CUBIC SPLINE INTERPOLATION OF HARMONIC FUNCTIONS BY N. PAPAMICHAEL and J.R. WHITEMAN.
TR/8. OCTOBER 97. CUBIC SPLINE INTERPOLATION OF HARMONIC FUNCTIONS BY N. PAPAMICHAEL and J.R. WHITEMAN. W960748 ABSTRACT It s sown tat for te two dmensonal Laplace equaton a unvarate cubc splne approxmaton
More informationSE Story Shear Frame. Final Project. 2 Story Bending Beam. m 2. u 2. m 1. u 1. m 3. u 3 L 3. Given: L 1 L 2. EI ω 1 ω 2 Solve for m 2.
SE 8 Fnal Project Story Sear Frame Gven: EI ω ω Solve for Story Bendng Beam Gven: EI ω ω 3 Story Sear Frame Gven: L 3 EI ω ω ω 3 3 m 3 L 3 Solve for Solve for m 3 3 4 3 Story Bendng Beam Part : Determnng
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More information[7] R.S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Clis, New Jersey, (1962).
[7] R.S. Varga, Matrx Iteratve Analyss, Prentce-Hall, Englewood ls, New Jersey, (962). [8] J. Zhang, Multgrd soluton of the convecton-duson equaton wth large Reynolds number, n Prelmnary Proceedngs of
More informationρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to
THE INVERSE POWER METHOD (or INVERSE ITERATION) -- applcaton of the Power method to A some fxed constant ρ (whch s called a shft), x λ ρ If the egenpars of A are { ( λ, x ) } ( ), or (more usually) to,
More informationORDINARY DIFFERENTIAL EQUATIONS EULER S METHOD
Numercal Analss or Engneers German Jordanan Unverst ORDINARY DIFFERENTIAL EQUATIONS We wll eplore several metods o solvng rst order ordnar derental equatons (ODEs and we wll sow ow tese metods can be appled
More informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
More informationTR/95 February Splines G. H. BEHFOROOZ* & N. PAPAMICHAEL
TR/9 February 980 End Condtons for Interpolatory Quntc Splnes by G. H. BEHFOROOZ* & N. PAPAMICHAEL *Present address: Dept of Matematcs Unversty of Tabrz Tabrz Iran. W9609 A B S T R A C T Accurate end condtons
More informationChapter 12. Ordinary Differential Equation Boundary Value (BV) Problems
Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(
More informationDeriving the X-Z Identity from Auxiliary Space Method
Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve
More informationNorms, Condition Numbers, Eigenvalues and Eigenvectors
Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationUNIVERSITY OF BOLTON RAK ACADEMIC CENTRE BENG(HONS) MECHANICAL ENGINEERING SEMESTER TWO EXAMINATION 2017/2018 FINITE ELEMENT AND DIFFERENCE SOLUTIONS
OCD0 UNIVERSITY OF BOLTON RAK ACADEMIC CENTRE BENG(HONS) MECHANICAL ENGINEERING SEMESTER TWO EXAMINATION 07/08 FINITE ELEMENT AND DIFFERENCE SOLUTIONS MODULE NO. AME6006 Date: Wednesda 0 Ma 08 Tme: 0:00
More informationThe Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method
Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationGrid Generation around a Cylinder by Complex Potential Functions
Research Journal of Appled Scences, Engneerng and Technolog 4(): 53-535, 0 ISSN: 040-7467 Mawell Scentfc Organzaton, 0 Submtted: December 0, 0 Accepted: Januar, 0 Publshed: June 0, 0 Grd Generaton around
More informationComparison of Newton Raphson and Hard Darcy methods for gravity main nonlinear water network
IOSR Journal of Mecancal and Cvl Engneerng (IOSRJMCE) eissn:,pissn: 0X, Volume, Issue Ver. III (May. June. 0), PP 0 www.osrjournals.org Comparson of Newton Rapson and Hard Darcy metods for gravty man nonlnear
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More information2 Finite difference basics
Numersche Methoden 1, WS 11/12 B.J.P. Kaus 2 Fnte dfference bascs Consder the one- The bascs of the fnte dfference method are best understood wth an example. dmensonal transent heat conducton equaton T
More informationSolution of the Navier-Stokes Equations
Numercal Flud Mechancs Fall 2011 Lecture 25 REVIEW Lecture 24: Soluton of the Naver-Stokes Equatons Dscretzaton of the convectve and vscous terms Dscretzaton of the pressure term Conservaton prncples Momentum
More informationOptimal Control of Temperature in Fluid Flow
Kawahara Lab. 5 March. 27 Optmal Control of Temperature n Flud Flow Dasuke YAMAZAKI Department of Cvl Engneerng, Chuo Unversty Kasuga -3-27, Bunkyou-ku, Tokyo 2-855, Japan E-mal : d33422@educ.kc.chuo-u.ac.jp
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationPubH 7405: REGRESSION ANALYSIS. SLR: INFERENCES, Part II
PubH 7405: REGRESSION ANALSIS SLR: INFERENCES, Part II We cover te topc of nference n two sessons; te frst sesson focused on nferences concernng te slope and te ntercept; ts s a contnuaton on estmatng
More informationSolving Singularly Perturbed Differential Difference Equations via Fitted Method
Avalable at ttp://pvamu.edu/aam Appl. Appl. Mat. ISSN: 193-9466 Vol. 8, Issue 1 (June 013), pp. 318-33 Applcatons and Appled Matematcs: An Internatonal Journal (AAM) Solvng Sngularly Perturbed Dfferental
More informationAerodynamics. Finite Wings Lifting line theory Glauert s method
α ( y) l Γ( y) r ( y) V c( y) β b 4 V Glauert s method b ( y) + r dy dγ y y dy Soluton procedure that transforms the lftng lne ntegro-dfferental equaton nto a system of algebrac equatons - Restrcted to
More informationImage classification. Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing i them?
Image classfcaton Gven te bag-of-features representatons of mages from dfferent classes ow do we learn a model for dstngusng tem? Classfers Learn a decson rule assgnng bag-offeatures representatons of
More informationSolution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method
Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222
More informationNew Method for Solving Poisson Equation. on Irregular Domains
Appled Mathematcal Scences Vol. 6 01 no. 8 369 380 New Method for Solvng Posson Equaton on Irregular Domans J. Izadan and N. Karamooz Department of Mathematcs Facult of Scences Mashhad BranchIslamc Azad
More informationSecond Order Analysis
Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to
More informationELE B7 Power Systems Engineering. Power Flow- Introduction
ELE B7 Power Systems Engneerng Power Flow- Introducton Introducton to Load Flow Analyss The power flow s the backbone of the power system operaton, analyss and desgn. It s necessary for plannng, operaton,
More informationGaussian Mixture Models
Lab Gaussan Mxture Models Lab Objectve: Understand the formulaton of Gaussan Mxture Models (GMMs) and how to estmate GMM parameters. You ve already seen GMMs as the observaton dstrbuton n certan contnuous
More information5 The Laplace Equation in a convex polygon
5 Te Laplace Equaton n a convex polygon Te most mportant ellptc PDEs are te Laplace, te modfed Helmoltz and te Helmoltz equatons. Te Laplace equaton s u xx + u yy =. (5.) Te real and magnary parts of an
More informationComputational Fluid Dynamics. Smoothed Particle Hydrodynamics. Simulations. Smoothing Kernels and Basis of SPH
Computatonal Flud Dynamcs If you want to learn a bt more of the math behnd flud dynamcs, read my prevous post about the Naver- Stokes equatons and Newtonan fluds. The equatons derved n the post are the
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationBootstrap AMG for Markov Chain Computations
Bootstrap AMG for Markov Chan Computatons Karsten Kahl Bergsche Unverstät Wuppertal May 27, 200 Outlne Markov Chans Subspace Egenvalue Approxmaton Ingredents of Least Squares Interpolaton Egensolver Bootstrap
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationLecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES
COMPUTATIONAL FLUID DYNAMICS: FDM: Appromaton of Second Order Dervatves Lecture APPROXIMATION OF SECOMD ORDER DERIVATIVES. APPROXIMATION OF SECOND ORDER DERIVATIVES Second order dervatves appear n dffusve
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationCase A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.
THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationA New Recursive Method for Solving State Equations Using Taylor Series
I J E E E C Internatonal Journal of Electrcal, Electroncs ISSN No. (Onlne) : 77-66 and Computer Engneerng 1(): -7(01) Specal Edton for Best Papers of Mcael Faraday IET Inda Summt-01, MFIIS-1 A New Recursve
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationJAB Chain. Long-tail claims development. ASTIN - September 2005 B.Verdier A. Klinger
JAB Chan Long-tal clams development ASTIN - September 2005 B.Verder A. Klnger Outlne Chan Ladder : comments A frst soluton: Munch Chan Ladder JAB Chan Chan Ladder: Comments Black lne: average pad to ncurred
More informationShuai Dong. Isaac Newton. Gottfried Leibniz
Computatonal pyscs Sua Dong Isaac Newton Gottred Lebnz Numercal calculus poston dervatve ntegral v velocty dervatve ntegral a acceleraton Numercal calculus Numercal derentaton Numercal ntegraton Roots
More informationModule 3: Element Properties Lecture 1: Natural Coordinates
Module 3: Element Propertes Lecture : Natural Coordnates Natural coordnate system s bascally a local coordnate system whch allows the specfcaton of a pont wthn the element by a set of dmensonless numbers
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models
More informationCommon loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:
15-745 Lecture 6 Data Dependence n Loops Copyrght Seth Goldsten, 2008 Based on sldes from Allen&Kennedy Lecture 6 15-745 2005-8 1 Common loop optmzatons Hostng of loop-nvarant computatons pre-compute before
More informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationNegative Binomial Regression
STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...
More informationMEM 255 Introduction to Control Systems Review: Basics of Linear Algebra
MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A
More informationFeb 14: Spatial analysis of data fields
Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s
More informationHigh resolution entropy stable scheme for shallow water equations
Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal
More informationFormal solvers of the RT equation
Formal solvers of the RT equaton Formal RT solvers Runge- Kutta (reference solver) Pskunov N.: 979, Master Thess Long characterstcs (Feautrer scheme) Cannon C.J.: 970, ApJ 6, 55 Short characterstcs (Hermtan
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationThe Discretization Process
FMIA F Moukalled L Mangan M Darwsh An Advanced Introducton wth OpenFOAM and Matlab Ths textbook explores both the theoretcal foundaton of the Fnte Volume Method (FVM) and ts applcatons n Computatonal Flud
More information