7.3 The Jacobi and GaussSeidel Iterative Methods


 Marilynn Harvey
 3 years ago
 Views:
Transcription
1 7.3 The Jacobi and GaussSeidel Iterative Methods 1
2 The Jacobi Method Two assumptions made on Jacobi Method: 1.The system given by aa 11 xx 1 + aa 12 xx 2 + aa 1nn xx nn = bb 1 aa 21 xx 1 + aa 22 xx 2 + aa 2nn xx nn = bb 2 aa nn1 xx 1 + aa nn2 xx 2 + aa nnnn xx nn = bb nn Has a unique solution. 2.The coefficient matrix AA has no zeros on its main diagonal, namely, aa 11, aa 22,, aa nnnn are nonzeros. 2
3 Main idea of Jacobi To begin, solve the 1 st equation for xx 1, the 2 nd equation for xx 2 and so on to obtain the rewritten equations: xx 1 = 1 (bb aa 1 aa 12 xx 2 aa 13 xx 3 aa 1nn xx nn ) 11 xx 2 = 1 (bb aa 2 aa 21 xx 1 aa 23 xx 3 aa 2nn xx nn ) 22 xx nn = 1 (bb aa nn aa nn1 xx 1 aa nn2 xx 2 aa nn,nn 1 xx nn 1 ) nnnn Then make an initial guess of the solution xx (0) (0) (0) (0) (0) = (xx 1, xx2, xx3, xxnn ). Substitute these values into the right hand side the of the rewritten (1) (1) (1) (1) equations to obtain the first approximation, xx 1, xx2, xx3, xxnn. This accomplishes one iteration. 3
4 In the same way, the second approximation xx 1 (2), xx2 (2), xx3 (2), xxnn (2) is computed by substituting the first approximation s value xx 1 (1), xx2 (1), xx3 (1), xxnn (1) into the right hand side of the rewritten equations. By repeated iterations, we form a sequence of approximations xx (kk) = xx 1 (kk), xx2 (kk), xx3 (kk), xxnn (kk) tt, kk = 1,2,3, The Jacobi Method. For each kk 1, generate the components xx ii (kk) of xx (kk) from xx (kk 11) by nn (kk) 1 (kk 1) xx ii = ( aa aa iiii xx jj ) + bb ii iiii, for ii = 1,2,, nn jj=1, jj ii 4
5 Example. Apply the Jacobi method to solve 5xx 1 2xx 2 + 3xx 3 = 1 3xx 1 + 9xx 2 + xx 3 = 2 2xx 1 xx 2 7xx 3 = 3 Continue iterations until two successive approximations are identical when rounded to three significant digits. Solution nn kk = 0 kk = 1 kk = 2 kk = 3 kk = 4 kk = 5 kk = 6 xx 1 (kk) xx 2 (kk) xx 2 (kk)
6 When to stop: 1. xx(kk) xx (kk 1) xx (kk) < εε; or xx (kk) xx (kk 1) < εε. Here εε is a given small number. Another stopping criterion: xx(kk) xx (kk 1) xx (kk) Definition 7.1 A vector norm on RR nn is a function,, from RR nn to RR with the properties: (i) xx 0 for all xx RR nn (ii) xx = 0 if and only if xx = 00 (iii) ααxx = αα xx for all αα RR and xx RR nn (iv) xx + yy xx + yy for all xx, yy RR nn Definition 7.2 The Euclidean norm ll 2 and the infinity norm ll for the vector xx = [xx 1, xx 2,, xx nn ] tt are defined by and nn 2 xx 2 = xx ii ii=
7 xx = max 1 ii nn xx ii Example. Determine the ll 2 and ll norms of the vector xx = ( 1,1, 2) tt. Solution: xx 2 = ( 1) 2 + (1) 2 + ( 2) 2 = 6. xx = max{ 1, 1, 2 } = 2. 7
8 The Jacobi Method in Matrix Form Consider to solve an nn nn size system of linear equations AAxx = bb with aa 11 aa 12 aa 1nn bb 1 xx 1 aa AA = 21 aa 22 aa 2nn bb and bb = 2 xx for xx = 2. aa nn1 aa nn2 aa nnnn bb nn xx nn We split AA into 8
9 aa aa AA = 22 0 aa aa nnnn aa nn1 aa nn,nn aa 12 aa 1nn 0 0 aa = DD LL UU nn 1,nn aa aa Where DD = 22 0 aa LL =, 0 0 aa nnnn aa nn1 aa nn,nn 1 0 9
10 0 aa 12 aa 1nn UU = AAxx = bb is transformed into (DD LL UU)xx = bb. DDxx = (LL + UU)xx + bb Assume DD 1 exists and DD 1 = 1 0 aa nn 1,nn aa aa aa nnnn Then xx = DD 1 (LL + UU)xx + DD 1 bb The matrix form of Jacobi iterative method is xx (kk) = DD 1 (LL + UU)xx (kk 1) + DD 1 bb kk = 1,2,3, 10
11 Define TT jj = DD 1 (LL + UU) and cc = DD 1 bb, Jacobi iteration method can also be written as xx (kk) = TT jj xx (kk 1) + cc kk = 1,2,3, The GaussSeidel Method Main idea of GaussSeidel 11
12 (kk) With the Jacobi method, only the values of xx ii obtained in the kk th (kk+1) iteration are used to compute xx ii. With the GaussSeidel method, we (kk+1) use the new values xx ii as soon as they are known. For example, once (kk+1) we have computed xx 1 from the first equation, its value is then used in (kk+1) the second equation to obtain the new xx 2, and so on. Example. Use the GaussSeidel method to solve 12
13 5xx 1 2xx 2 + 3xx 3 = 1 3xx 1 + 9xx 2 + xx 3 = 2 2xx 1 xx 2 7xx 3 = 3 Choose the initial guess xx 1 = 0, xx 2 = 0, xx 3 = 0 nn kk = 0 kk = 1 kk = 2 kk = 3 kk = 4 kk = 5 kk = 6 (kk) xx xx 2 (kk) xx 2 (kk) The GaussSeidel Method. For each kk 1, generate the components xx ii (kk) of xx (kk) from xx (kk 11) by 13
14 ii 1 (kk) 1 (kk) xx ii = (aa aa iiii xx jj ) iiii Namely, jj=1 = 1,2,, nn nn (aa iiii xx jj (kk 1) ) jj=ii+1 + bb ii, for ii (kk) (kk 1) (kk 1) aa 11 xx 1 = aa12 xx 2 aa1nn xx nn + bb1 (kk) (kk) (kk 1) (kk 1) aa 22 xx 2 = aa21 xx 1 aa23 xx 3 aa2nn xx nn + bb2 (kk) (kk) (kk) (kk 1) (kk 1) aa 33 xx 3 = aa31 xx 1 aa32 xx 2 aa34 xx 4 aa3nn xx nn + bb3 (kk) (kk) (kk) (kk) aa nnnn xx nn = aann1 xx 1 aann2 xx 2 aann,nn 1 xx nn 1 + bbnn Matrix form of GaussSeidel method. 14
15 (DD LL)xx (kk) = UUxx (kk 1) + bb xx (kk) = (DD LL) 1 UUxx (kk 1) + (DD LL) 1 bb Define TT gg = (DD LL) 1 UU and cc gg = (DD LL) 1 bb, GaussSeidel method can be written as xx (kk) = TT gg xx (kk 1) + cc gg kk = 1,2,3, Convergence theorems of the iteration methods 15
16 Let the iteration method be written as xx (kk) = TTxx (kk 1) + cc for each kk = 1,2,3, Definition 7.14 The spectral radius ρρ(aa) of a matrix AA is defined by ρρ(aa) = max λλ, where λλ is an eigenvalue of AA. Remark: For complex λλ = aa + bbbb, we define λλ = aa 2 + bb 2. Lemma 7.18 If the spectral radius satisfies ρρ(tt) < 1, then (II TT) 1 exists, and (II TT) 1 = II + TT + TT 2 + = TT jj jj=0 Theorem 7.19 For any xx (0) RR nn, the sequence {xx (kk) } kk=0 defined by 16
17 xx (kk) = TTxx (kk 1) + cc for each kk 1 converges to the unique solution of xx = TTxx + cc if and only if ρρ(tt) < 1. Proof (only show ρρ(tt) < 1 is sufficient condition) xx (kk) = TTxx (kk 1) + cc = TT TTxx (kk 2) + cc + cc = = TT kk xx (0) + (TT kk TT + II)cc Since ρρ(tt) < 1, lim kk TT kk xx (0) = 00 kk 1 lim kk xx(kk) = 00 + lim ( TT jj ) cc = (II TT) 1 cc kk jj=0 17
18 Definition 7.8 A matrix norm on nn nn matrices is a realvalued function satisfying (i) AA 0 (ii) AA = 0 if and only if AA = 0 (iii) αααα = αα AA (iv) AA + BB AA + BB (v) AAAA AA BB Theorem 7.9. If is a vector norm, the induced (or natural) matrix norm is given by AA = max xx =1 AAxx Example. AA = max AAxx, the ll induced norm. xx =1 AA 2 = max AAxx 2, the ll 2 induced norm. xx 2 =1 18
19 Theorem If AA = [aa iiii ] is an nn nn matrix, then AA = max nn aa iiii 1 ii nn jj= Example. Determine AA for the matrix AA = Corollary 7.20 If TT < 1 for any natural matrix norm and cc is a given vector, then the sequence {xx (kk) } kk=0 defined by xx (kk) = TTxx (kk 1) + cc converges, for any xx (0) RR nn, to a vector xx RR nn, with xx = TTxx + cc, and the following error bound hold: (i) xx xx (kk) TT kk xx (0) xx 19
20 (ii) xx xx (kk) TT kk 1 TT xx(1) xx (0) Theorem 7.21 If AA is strictly diagonally dominant, then for any choice of xx (0), both the Jacobi and GaussSeidel methods give sequences {xx (kk) } kk=0 that converges to the unique solution of AAxx = bb. Rate of Convergence Corollary 7.20 (i) implies xx xx (kk) ρρ(tt) kk xx (0) xx Theorem 7.22 (SteinRosenberg) If aa iiii 0, for each ii jj and aa iiii 0, for each ii = 1,2,, nn, then one and only one of following statements holds: (i) 0 ρρ TT gg < ρρ TT jj < 1; (ii) 1 < ρρ TT jj < ρρ TT gg ; (iii)ρρ TT jj = ρρ TT gg = 0; (iv) ρρ TT jj = ρρ TT gg = 1. 20
21 21
Worksheets for GCSE Mathematics. Quadratics. mrmathematics.com Maths Resources for Teachers. Algebra
Worksheets for GCSE Mathematics Quadratics mrmathematics.com Maths Resources for Teachers Algebra Quadratics Worksheets Contents Differentiated Independent Learning Worksheets Solving x + bx + c by factorisation
More informationSolving Fuzzy Nonlinear Equations by a General Iterative Method
2062062062062060 Journal of Uncertain Systems Vol.4, No.3, pp.20625, 200 Online at: www.jus.org.uk Solving Fuzzy Nonlinear Equations by a General Iterative Method Anjeli Garg, S.R. Singh * Department
More informationWorksheets for GCSE Mathematics. Algebraic Expressions. Mr Black 's Maths Resources for Teachers GCSE 19. Algebra
Worksheets for GCSE Mathematics Algebraic Expressions Mr Black 's Maths Resources for Teachers GCSE 19 Algebra Algebraic Expressions Worksheets Contents Differentiated Independent Learning Worksheets
More informationIntegrating Rational functions by the Method of Partial fraction Decomposition. Antony L. Foster
Integrating Rational functions by the Method of Partial fraction Decomposition By Antony L. Foster At times, especially in calculus, it is necessary, it is necessary to express a fraction as the sum of
More informationA Posteriori Error Estimates For Discontinuous Galerkin Methods Using Nonpolynomial Basis Functions
Lin Lin A Posteriori DG using NonPolynomial Basis 1 A Posteriori Error Estimates For Discontinuous Galerkin Methods Using Nonpolynomial Basis Functions Lin Lin Department of Mathematics, UC Berkeley;
More information10.2 ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS. The Jacobi Method
54 CHAPTER 10 NUMERICAL METHODS 10. ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS As a numerical technique, Gaussian elimination is rather unusual because it is direct. That is, a solution is obtained after
More information10.4 The Cross Product
Math 172 Chapter 10B notes Page 1 of 9 10.4 The Cross Product The cross product, or vector product, is defined in 3 dimensions only. Let aa = aa 1, aa 2, aa 3 bb = bb 1, bb 2, bb 3 then aa bb = aa 2 bb
More informationCOURSE Iterative methods for solving linear systems
COURSE 0 4.3. Iterative methods for solving linear systems Because of roundoff errors, direct methods become less efficient than iterative methods for large systems (>00 000 variables). An iterative scheme
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationVariations. ECE 6540, Lecture 02 Multivariate Random Variables & Linear Algebra
Variations ECE 6540, Lecture 02 Multivariate Random Variables & Linear Algebra Last Time Probability Density Functions Normal Distribution Expectation / Expectation of a function Independence Uncorrelated
More informationClassical RSA algorithm
Classical RSA algorithm We need to discuss some mathematics (number theory) first ModuloNN arithmetic (modular arithmetic, clock arithmetic) 9 (mod 7) 4 3 5 (mod 7) congruent (I will also use = instead
More informationJACOBI S ITERATION METHOD
ITERATION METHODS These are methods which compute a sequence of progressively accurate iterates to approximate the solution of Ax = b. We need such methods for solving many large linear systems. Sometimes
More informationMathematics Ext 2. HSC 2014 Solutions. Suite 403, 410 Elizabeth St, Surry Hills NSW 2010 keystoneeducation.com.
Mathematics Ext HSC 4 Solutions Suite 43, 4 Elizabeth St, Surry Hills NSW info@keystoneeducation.com.au keystoneeducation.com.au Mathematics Extension : HSC 4 Solutions Contents Multiple Choice... 3 Question...
More informationSecondary 3H Unit = 1 = 7. Lesson 3.3 Worksheet. Simplify: Lesson 3.6 Worksheet
Secondary H Unit Lesson Worksheet Simplify: mm + 2 mm 2 4 mm+6 mm + 2 mm 2 mm 20 mm+4 5 2 9+20 2 0+25 4 +2 2 + 2 8 2 6 5. 2 yy 2 + yy 6. +2 + 5 2 2 2 0 Lesson 6 Worksheet List all asymptotes, holes and
More informationLecture 3. Linear Regression
Lecture 3. Linear Regression COMP90051 Statistical Machine Learning Semester 2, 2017 Lecturer: Andrey Kan Copyright: University of Melbourne Weeks 2 to 8 inclusive Lecturer: Andrey Kan MS: Moscow, PhD:
More informationAPPROXIMATING A COMMON SOLUTION OF A FINITE FAMILY OF GENERALIZED EQUILIBRIUM AND FIXED POINT PROBLEMS
SINET: Ethiop. J. Sci., 38():7 28, 205 ISSN: 0379 2897 (Print) College of Natural Sciences, Addis Ababa University, 205 2520 7997 (Online) APPROXIMATING A COMMON SOLUTION OF A FINITE FAMILY OF GENERALIZED
More informationSECTION 5: POWER FLOW. ESE 470 Energy Distribution Systems
SECTION 5: POWER FLOW ESE 470 Energy Distribution Systems 2 Introduction Nodal Analysis 3 Consider the following circuit Three voltage sources VV sss, VV sss, VV sss Generic branch impedances Could be
More informationSolving Linear Systems
Solving Linear Systems Iterative Solutions Methods Philippe B. Laval KSU Fall 207 Philippe B. Laval (KSU) Linear Systems Fall 207 / 2 Introduction We continue looking how to solve linear systems of the
More informationSection 4.1: Exponential Growth and Decay
Section 4.1: Exponential Growth and Decay A function that grows or decays by a constant percentage change over each fixed change in input is called an exponential function. Exponents A quick review 1.
More informationProf. Dr.Ing. Armin Dekorsy Department of Communications Engineering. Stochastic Processes and Linear Algebra Recap Slides
Prof. Dr.Ing. Armin Dekorsy Department of Communications Engineering Stochastic Processes and Linear Algebra Recap Slides Stochastic processes and variables XX tt 0 = XX xx nn (tt) xx 2 (tt) XX tt XX
More informationSECTION 7: FAULT ANALYSIS. ESE 470 Energy Distribution Systems
SECTION 7: FAULT ANALYSIS ESE 470 Energy Distribution Systems 2 Introduction Power System Faults 3 Faults in threephase power systems are short circuits Linetoground Linetoline Result in the flow
More informationOn The Cauchy Problem For Some Parabolic Fractional Partial Differential Equations With Time Delays
Journal of Mathematics and System Science 6 (216) 194199 doi: 1.17265/21595291/216.5.3 D DAVID PUBLISHING On The Cauchy Problem For Some Parabolic Fractional Partial Differential Equations With Time
More informationMath Introduction to Numerical Analysis  Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.
Math 5620  Introduction to Numerical Analysis  Class Notes Fernando Guevara Vasquez Version 1990. Date: January 17, 2012. 3 Contents 1. Disclaimer 4 Chapter 1. Iterative methods for solving linear systems
More informationGeneral Strong Polarization
General Strong Polarization Madhu Sudan Harvard University Joint work with Jaroslaw Blasiok (Harvard), Venkatesan Gurswami (CMU), Preetum Nakkiran (Harvard) and Atri Rudra (Buffalo) December 4, 2017 IAS:
More informationDEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to uppertriangular
form) Given: matrix C = (c i,j ) n,m i,j=1 ODE and num math: Linear algebra (N) [lectures] c phabala 2016 DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix
More informationDefinition: A sequence is a function from a subset of the integers (usually either the set
Math 3336 Section 2.4 Sequences and Summations Sequences Geometric Progression Arithmetic Progression Recurrence Relation Fibonacci Sequence Summations Definition: A sequence is a function from a subset
More informationIterative techniques in matrix algebra
Iterative techniques in matrix algebra TsungMing Huang Department of Mathematics National Taiwan Normal University, Taiwan September 12, 2015 Outline 1 Norms of vectors and matrices 2 Eigenvalues and
More informationData Preprocessing. Jilles Vreeken IRDM 15/ Oct 2015
Data Preprocessing Jilles Vreeken 22 Oct 2015 So, how do you pronounce Jilles Yillless Vreeken Fraycan Okay, now we can talk. Questions of the day How do we preprocess data before we can extract anything
More informationNow, suppose that the signal is of finite duration (length) NN. Specifically, the signal is zero outside the range 0 nn < NN. Then
EE 464 Discrete Fourier Transform Fall 2018 Read Text, Chapter 4. Recall that for a complexvalued discretetime signal, xx(nn), we can compute the Ztransform, XX(zz) = nn= xx(nn)zz nn. Evaluating on
More informationLecture 3. STAT161/261 Introduction to Pattern Recognition and Machine Learning Spring 2018 Prof. Allie Fletcher
Lecture 3 STAT161/261 Introduction to Pattern Recognition and Machine Learning Spring 2018 Prof. Allie Fletcher Previous lectures What is machine learning? Objectives of machine learning Supervised and
More informationLarge Scale Data Analysis Using Deep Learning
Large Scale Data Analysis Using Deep Learning Linear Algebra U Kang Seoul National University U Kang 1 In This Lecture Overview of linear algebra (but, not a comprehensive survey) Focused on the subset
More informationReview for Exam Hyunse Yoon, Ph.D. Adjunct Assistant Professor Department of Mechanical Engineering, University of Iowa
Review for Exam3 12. 9. 2015 Hyunse Yoon, Ph.D. Adjunct Assistant Professor Department of Mechanical Engineering, University of Iowa Assistant Research Scientist IIHRHydroscience & Engineering, University
More informationHalf Circular Vector in 2D space
Half Circular Vector in D space CLAUDE ZIAD BAYEH 1, 1 Faculty of Engineering II, Lebanese University EGRDI transaction on mathematics (003) LEBANON Email: claude_bayeh_cbegrdi@hotmail.com NIKOS E.MASTORAKIS
More informationA brief summary of the chapters and sections that we cover in Math 141. Chapter 2 Matrices
A brief summary of the chapters and sections that we cover in Math 141 Chapter 2 Matrices Section 1 Systems of Linear Equations with Unique Solutions 1. A system of linear equations is simply a collection
More informationChapter 7 Iterative Techniques in Matrix Algebra
Chapter 7 Iterative Techniques in Matrix Algebra PerOlof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition
More informationLesson 23: Deriving the Quadratic Formula
: Deriving the Quadratic Formula Opening Exercise 1. Solve for xx. xx 2 + 2xx = 8 7xx 2 12xx + 4 = 0 Discussion 2. Which of these problems makes more sense to solve by completing the square? Which makes
More informationReview for Exam Hyunse Yoon, Ph.D. Assistant Research Scientist IIHRHydroscience & Engineering University of Iowa
57:020 Fluids Mechanics Fall2013 1 Review for Exam3 12. 11. 2013 Hyunse Yoon, Ph.D. Assistant Research Scientist IIHRHydroscience & Engineering University of Iowa 57:020 Fluids Mechanics Fall2013 2 Chapter
More informationP.3 Division of Polynomials
00 section P3 P.3 Division of Polynomials In this section we will discuss dividing polynomials. The result of division of polynomials is not always a polynomial. For example, xx + 1 divided by xx becomes
More informationIterative Methods. Splitting Methods
Iterative Methods Splitting Methods 1 Direct Methods Solving Ax = b using direct methods. Gaussian elimination (using LU decomposition) Variants of LU, including Crout and Doolittle Other decomposition
More informationLINEAR SYSTEMS (11) Intensive Computation
LINEAR SYSTEMS () Intensive Computation 278 prof. Annalisa Massini Viviana Arrigoni EXACT METHODS:. GAUSSIAN ELIMINATION. 2. CHOLESKY DECOMPOSITION. ITERATIVE METHODS:. JACOBI. 2. GAUSSSEIDEL 2 CHOLESKY
More informationThe Solution of Linear Systems AX = B
Chapter 2 The Solution of Linear Systems AX = B 21 Uppertriangular Linear Systems We will now develop the backsubstitution algorithm, which is useful for solving a linear system of equations that has
More informationRational Expressions and Functions
1 Rational Expressions and Functions In the previous two chapters we discussed algebraic expressions, equations, and functions related to polynomials. In this chapter, we will examine a broader category
More informationPredicting Winners of Competitive Events with Topological Data Analysis
Predicting Winners of Competitive Events with Topological Data Analysis Conrad D Souza Ruben SanchezGarcia R.SanchezGarcia@soton.ac.uk Tiejun Ma tiejun.ma@soton.ac.uk Johnnie Johnson J.E.Johnson@soton.ac.uk
More informationMath 171 Spring 2017 Final Exam. Problem Worth
Math 171 Spring 2017 Final Exam Problem 1 2 3 4 5 6 7 8 9 10 11 Worth 9 6 6 5 9 8 5 8 8 8 10 12 13 14 15 16 17 18 19 20 21 22 Total 8 5 5 6 6 8 6 6 6 6 6 150 Last Name: First Name: Student ID: Section:
More information(1) Introduction: a new basis set
() Introduction: a new basis set In scattering, we are solving the S eq. for arbitrary VV in integral form We look for solutions to unbound states: certain boundary conditions (EE > 0, plane and spherical
More informationInternational Journal of Mathematical Archive5(12), 2014, Available online through ISSN
International Journal of Mathematical Archive5(12), 2014, 7579 Available online through www.ijma.info ISSN 2229 5046 ABOUT WEAK ALMOST LIMITED OPERATORS A. Retbi* and B. El Wahbi Université Ibn Tofail,
More informationThe Arithmetic Mean Solver in Lagged Diffusivity Method for Nonlinear Diffusion Equations
American Journal of Computational and Applied Matematics 2012, 2(6): 241248 DOI: 10.5923/j.ajcam.20120206.01 Te Aritmetic Mean Solver in Lagged Diffusivity Metod for Nonlinear Diffusion Equations Emanuele
More informationOn one Application of Newton s Method to Stability Problem
Journal of Multidciplinary Engineering Science Technology (JMEST) ISSN: 3590040 Vol. Issue 5, December  204 On one Application of Newton s Method to Stability Problem Şerife Yılmaz Department of Mathematics,
More informationContinuous Random Variables
Continuous Random Variables Page Outline Continuous random variables and density Common continuous random variables Moment generating function Seeking a Density Page A continuous random variable has an
More informationLesson 1: Successive Differences in Polynomials
Lesson 1 Lesson 1: Successive Differences in Polynomials Classwork Opening Exercise John noticed patterns in the arrangement of numbers in the table below. 2.4 3.4 4.4 5.4 6.4 5.76 11.56 19.36 29.16 40.96
More informationPHY103A: Lecture # 4
Semester II, 201718 Department of Physics, IIT Kanpur PHY103A: Lecture # 4 (Text Book: Intro to Electrodynamics by Griffiths, 3 rd Ed.) Anand Kumar Jha 10Jan2018 Notes The Solutions to HW # 1 have been
More informationSystems of Linear Equations
Systems of Linear Equations As stated in Section G, Definition., a linear equation in two variables is an equation of the form AAAA + BBBB = CC, where AA and BB are not both zero. Such an equation has
More informationR.3 Properties and Order of Operations on Real Numbers
1 R.3 Properties and Order of Operations on Real Numbers In algebra, we are often in need of changing an expression to a different but equivalent form. This can be observed when simplifying expressions
More informationCOURSE Numerical methods for solving linear systems. Practical solving of many problems eventually leads to solving linear systems.
COURSE 9 4 Numerical methods for solving linear systems Practical solving of many problems eventually leads to solving linear systems Classification of the methods:  direct methods  with low number of
More informationExam 2 Fall 2015
1 95.144 Exam 2 Fall 2015 Section instructor Section number Last/First name Last 3 Digits of Student ID Number: Show all work. Show all formulas used for each problem prior to substitution of numbers.
More informationLecture No. 5. For all weighted residual methods. For all (Bubnov) Galerkin methods. Summary of Conventional Galerkin Method
Lecture No. 5 LL(uu) pp(xx) = 0 in ΩΩ SS EE (uu) = gg EE on ΓΓ EE SS NN (uu) = gg NN on ΓΓ NN For all weighted residual methods NN uu aaaaaa = uu BB + αα ii φφ ii For all (Bubnov) Galerkin methods ii=1
More information1. The graph of a function f is given above. Answer the question: a. Find the value(s) of x where f is not differentiable. Ans: x = 4, x = 3, x = 2,
1. The graph of a function f is given above. Answer the question: a. Find the value(s) of x where f is not differentiable. x = 4, x = 3, x = 2, x = 1, x = 1, x = 2, x = 3, x = 4, x = 5 b. Find the value(s)
More informationRotational Motion. Chapter 10 of Essential University Physics, Richard Wolfson, 3 rd Edition
Rotational Motion Chapter 10 of Essential University Physics, Richard Wolfson, 3 rd Edition 1 We ll look for a way to describe the combined (rotational) motion 2 Angle Measurements θθ ss rr rrrrrrrrrrrrrr
More informationSECTION 2: VECTORS AND MATRICES. ENGR 112 Introduction to Engineering Computing
SECTION 2: VECTORS AND MATRICES ENGR 112 Introduction to Engineering Computing 2 Vectors and Matrices The MAT in MATLAB 3 MATLAB The MATrix (not MAThematics) LABoratory MATLAB assumes all numeric variables
More informationDSGE (3): BASIC NEOCLASSICAL MODELS (2): APPROACHES OF SOLUTIONS
DSGE (3): Stochastic neoclassical growth models (2): how to solve? 27 DSGE (3): BASIC NEOCLASSICAL MODELS (2): APPROACHES OF SOLUTIONS. Recap of basic neoclassical growth models and loglinearisation 2.
More informationApproximate Second Order Algorithms. Seo Taek Kong, Nithin Tangellamudi, Zhikai Guo
Approximate Second Order Algorithms Seo Taek Kong, Nithin Tangellamudi, Zhikai Guo Why Second Order Algorithms? Invariant under affine transformations e.g. stretching a function preserves the convergence
More informationA note on the Adomian decomposition method for generalized BurgersFisher equation
INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTERS IN SIMULATION Volume 11, 017 A note on the Adomian decomposition method for generalized BurgersFisher equation M. Meštrović, E. Ocvirk and D. Kunštek
More informationSolid Rocket Motor Combustion Instability Modeling in COMSOL Multiphysics
Solid Rocket Motor Combustion Instability Modeling in COMSOL Multiphysics Sean R. Fischbach Mashall Space Flight Center / Qualis Corp. / Jacobs ESSSA Group *MSFC Huntsville sean.r.fischbach@nasa.gov Outline
More informationCAAM 454/554: Stationary Iterative Methods
CAAM 454/554: Stationary Iterative Methods Yin Zhang (draft) CAAM, Rice University, Houston, TX 77005 2007, Revised 2010 Abstract Stationary iterative methods for solving systems of linear equations are
More informationToday s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn
Today s class Linear Algebraic Equations LU Decomposition 1 Linear Algebraic Equations Gaussian Elimination works well for solving linear systems of the form: AX = B What if you have to solve the linear
More informationLecture 6. Notes on Linear Algebra. Perceptron
Lecture 6. Notes on Linear Algebra. Perceptron COMP90051 Statistical Machine Learning Semester 2, 2017 Lecturer: Andrey Kan Copyright: University of Melbourne This lecture Notes on linear algebra Vectors
More informationCHAPTER 5 Wave Properties of Matter and Quantum Mechanics I
CHAPTER 5 Wave Properties of Matter and Quantum Mechanics I 1 5.1 XRay Scattering 5.2 De Broglie Waves 5.3 Electron Scattering 5.4 Wave Motion 5.5 Waves or Particles 5.6 Uncertainty Principle Topics 5.7
More informationM.5 Modeling the Effect of Functional Responses
M.5 Modeling the Effect of Functional Responses The functional response is referred to the predation rate as a function of the number of prey per predator. It is recognized that as the number of prey increases,
More informationQuadratic Equations and Functions
50 Quadratic Equations and Functions In this chapter, we discuss various ways of solving quadratic equations, aaxx 2 + bbbb + cc 0, including equations quadratic in form, such as xx 2 + xx 1 20 0, and
More informationLecture No. 1 Introduction to Method of Weighted Residuals. Solve the differential equation L (u) = p(x) in V where L is a differential operator
Lecture No. 1 Introduction to Method of Weighted Residuals Solve the differential equation L (u) = p(x) in V where L is a differential operator with boundary conditions S(u) = g(x) on Γ where S is a differential
More informationON CALCULATION OF EFFECTIVE ELASTIC PROPERTIES OF MATERIALS WITH CRACKS
Materials Physics and Mechanics 32 (2017) 213221 Received: November 7, 2017 ON CALCULATION OF EFFECTIVE ELASTIC PROPERTIES OF MATERIALS WITH CRACKS Ruslan L. Lapin 1, Vitaly A. Kuzkin 1,2 1 Peter the
More informationQ. 1 Q. 25 carry one mark each.
Q. 1 Q. 25 carry one mark each. Q.1 Given ff(zz) = gg(zz) + h(zz), where ff, gg, h are complex valued functions of a complex variable zz. Which one of the following statements is TUE? (A) If ff(zz) is
More informationIntegrated Attitude Determination and Control System via Magnetic Measurements and Actuation
Proceedings of the th WSEAS International Conference on Automatic Control, Modelling and Simulation Integrated Attitude Determination and Control System via Magnetic Measurements and Actuation MOHAMMAD
More information10.1 Three Dimensional Space
Math 172 Chapter 10A notes Page 1 of 12 10.1 Three Dimensional Space 2D space 0 xx.. xx, 0 yy yy, PP(xx, yy) [Fig. 1] Point PP represented by (xx, yy), an ordered pair of real nos. Set of all ordered
More informationMath 3 Unit 3: Polynomial Functions
Math 3 Unit 3: Polynomial Functions Unit Title Standards 3.1 End Behavior of Polynomial Functions F.IF.7c 3.2 Graphing Polynomial Functions F.IF.7c, A.APR3 3.3 Writing Equations of Polynomial Functions
More informationLesson 23: The Defining Equation of a Line
Classwork Exploratory Challenge/Exercises 1 3 1. Sketch the graph of the equation 9xx +3yy = 18 using intercepts. Then, answer parts (a) (f) that follow. a. Sketch the graph of the equation yy = 3xx +6
More informationAdvanced data analysis
Advanced data analysis Akisato Kimura ( 木村昭悟 ) NTT Communication Science Laboratories Email: akisato@ieee.org Advanced data analysis 1. Introduction (Aug 20) 2. Dimensionality reduction (Aug 20,21) PCA,
More informationPHL424: Nuclear Shell Model. Indian Institute of Technology Ropar
PHL424: Nuclear Shell Model Themes and challenges in modern science Complexity out of simplicity Microscopic How the world, with all its apparent complexity and diversity can be constructed out of a few
More informationReview for Exam Hyunse Yoon, Ph.D. Adjunct Assistant Professor Department of Mechanical Engineering, University of Iowa
Review for Exam2 11. 13. 2015 Hyunse Yoon, Ph.D. Adjunct Assistant Professor Department of Mechanical Engineering, University of Iowa Assistant Research Scientist IIHRHydroscience & Engineering, University
More informationTECHNICAL NOTE AUTOMATIC GENERATION OF POINT SPRING SUPPORTS BASED ON DEFINED SOIL PROFILES AND COLUMNFOOTING PROPERTIES
COMPUTERS AND STRUCTURES, INC., FEBRUARY 2016 TECHNICAL NOTE AUTOMATIC GENERATION OF POINT SPRING SUPPORTS BASED ON DEFINED SOIL PROFILES AND COLUMNFOOTING PROPERTIES Introduction This technical note
More informationSolving Linear Systems
Solving Linear Systems Iterative Solutions Methods Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) Linear Systems Fall 2015 1 / 12 Introduction We continue looking how to solve linear systems of
More informationLecture Note 7: Iterative methods for solving linear systems. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 7: Iterative methods for solving linear systems Xiaoqun Zhang Shanghai Jiao Tong University Last updated: December 24, 2014 1.1 Review on linear algebra Norms of vectors and matrices vector
More informationLecture 11. Kernel Methods
Lecture 11. Kernel Methods COMP90051 Statistical Machine Learning Semester 2, 2017 Lecturer: Andrey Kan Copyright: University of Melbourne This lecture The kernel trick Efficient computation of a dot product
More informationIterative Methods for Solving A x = b
Iterative Methods for Solving A x = b A good (free) online source for iterative methods for solving A x = b is given in the description of a set of iterative solvers called templates found at netlib: http
More informationMath 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March 22, 2018
1 Linear Systems Math 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March, 018 Consider the system 4x y + z = 7 4x 8y + z = 1 x + y + 5z = 15. We then obtain x = 1 4 (7 + y z)
More informationTranslator Design Lecture 16 Constructing SLR Parsing Tables
SLR Simple LR An LR(0) item (item for short) of a grammar G is a production of G with a dot at some position of the right se. Thus, production A XYZ yields the four items AA XXXXXX AA XX YYYY AA XXXX ZZ
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 3 Chapter 10 LU Factorization PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGrawHill Companies, Inc. Permission required for reproduction or display.
More informationMath 3336 Section 4.3 Primes and Greatest Common Divisors. Prime Numbers and their Properties Conjectures and Open Problems About Primes
Math 3336 Section 4.3 Primes and Greatest Common Divisors Prime Numbers and their Properties Conjectures and Open Problems About Primes Greatest Common Divisors and Least Common Multiples The Euclidian
More informationQuantum Mechanics. An essential theory to understand properties of matter and light. Chemical Electronic Magnetic Thermal Optical Etc.
Quantum Mechanics An essential theory to understand properties of matter and light. Chemical Electronic Magnetic Thermal Optical Etc. Fall 2018 Prof. Sergio B. Mendes 1 CHAPTER 3 Experimental Basis of
More information6. Iterative Methods for Linear Systems. The stepwise approach to the solution...
6 Iterative Methods for Linear Systems The stepwise approach to the solution Miriam Mehl: 6 Iterative Methods for Linear Systems The stepwise approach to the solution, January 18, 2013 1 61 Large Sparse
More informationScientific Computing WS 2018/2019. Lecture 9. Jürgen Fuhrmann Lecture 9 Slide 1
Scientific Computing WS 2018/2019 Lecture 9 Jürgen Fuhrmann juergen.fuhrmann@wiasberlin.de Lecture 9 Slide 1 Lecture 9 Slide 2 Simple iteration with preconditioning Idea: Aû = b iterative scheme û = û
More informationAngular Momentum, Electromagnetic Waves
Angular Momentum, Electromagnetic Waves Lecture33: Electromagnetic Theory Professor D. K. Ghosh, Physics Department, I.I.T., Bombay As before, we keep in view the four Maxwell s equations for all our discussions.
More informationComputational Linear Algebra
Computational Linear Algebra PD Dr. rer. nat. habil. Ralf Peter Mundani Computation in Engineering / BGU Scientific Computing in Computer Science / INF Winter Term 2017/18 Part 3: Iterative Methods PD
More informationMath 3 Unit 3: Polynomial Functions
Math 3 Unit 3: Polynomial Functions Unit Title Standards 3.1 End Behavior of Polynomial Functions F.IF.7c 3.2 Graphing Polynomial Functions F.IF.7c, A.APR3 3.3 Writing Equations of Polynomial Functions
More informationF.4 Solving Polynomial Equations and Applications of Factoring
section F4 243 F.4 ZeroProduct Property Many application problems involve solving polynomial equations. In Chapter L, we studied methods for solving linear, or firstdegree, equations. Solving higher
More informationLesson 7: Linear Transformations Applied to Cubes
Classwork Opening Exercise Consider the following matrices: AA = 1 2 0 2, BB = 2, and CC = 2 2 4 0 0 2 2 a. Compute the following determinants. i. det(aa) ii. det(bb) iii. det(cc) b. Sketch the image of
More informationPHY103A: Lecture # 1
Semester II, 201718 Department of Physics, IIT Kanpur PHY103A: Lecture # 1 (Text Book: Introduction to Electrodynamics by David J Griffiths) Anand Kumar Jha 05Jan2018 Course Information: Course Webpage:
More informationDiscrete Structures Lecture Solving Congruences. mathematician of the eighteenth century). Also, the equation gggggg(aa, bb) =
First Introduction Our goal is to solve equations having the form aaaa bb (mmmmmm mm). However, first we must discuss the last part of the previous section titled gcds as Linear Combinations THEOREM 6
More information10.4 Controller synthesis using discretetime model Example: comparison of various controllers
10. Digital 10.1 Basic principle of digital control 10.2 Digital PID controllers 10.2.1 A 2DOF continuoustime PID controller 10.2.2 Discretisation of PID controllers 10.2.3 Implementation and tuning 10.3
More informationPassingBablok Regression for Method Comparison
Chapter 313 PassingBablok Regression for Method Comparison Introduction PassingBablok regression for method comparison is a robust, nonparametric method for fitting a straight line to twodimensional
More information