The solution of linear differential equations in Chebyshev series
|
|
- Jessica Rice
- 5 years ago
- Views:
Transcription
1 The solution of linear differential equations in Chebyshev series By R. E. Scraton* The numerical solution of the linear differential equation Any linear differential equation can be transformed into an infinite set of simultaneous equations in the Chebyshev coefficients of its solution. In suitable ces these equations can be solved by iterative procedures, which are particularly suitable for automatic computation. Similar iterative methods can also be used for certain eigenvalue problems. y M + "l! Pi(x)y U) = F( X ) (l) in the form of a Chebyshev series y = a T (x) + a T (x) = ' a r T r {x) r= h been the subject of a number of papers in recent years. The so-called 'direct' method of determining the coefficients a r w first proposed by Clenshaw (97), h been subsequently discussed by Fox (96). This method is only practicable when the functions P,-(JC) are polynomials of small degree. A later paper by Clenshaw Norton (96) gave an iterative procedure bed on Picard's method the principle of collocation; this is applicable to a wider cls of differential equations, but is usually considerably more lengthy than the direct method. The purpose of the present paper is to consider the extension of Clenshaw's original method to the ce the Pi(x) are general functions with nown Chebyshev expansions. It will be sumed throughout that the independent variable h been suitably transformed so that the solution is required in the range < x <. It should be noted that in writing the differential equation in the form () suming that the Pi(x) have Chebyshev expansions, it h been implicitly sumed that the differential equation h no singularities in the range < JC <. First-order equations The first-order linear equation may be put in the form y + P{x)y = F{x) = S' p,.txx) r= = ' f r T r {x). It will be sumed for the sae of definiteness that the initial condition is specified at x =, i.e. y(l) = -q. The modifications to the equations below when the initial condition is specified at some other point should be reonably obvious. If in the usual way the Chebyshev coefficients of y are denoted by a n those of y' by a' r, it is eily seen that a' r + ' (j> f+i +p\ r - s \)a s = /,, r >. s= The d r term can be eliminated in the customary manner by maing use of the relation a,_, = ra r to yield ra r + ^ r r+, +»,->, = <A r, r >, () -n r = />,._, p r+u TT =, ir_ r = -n r <t>r=f,-\-fr+\- The initial condition is given by,?o' s = ^ if this is used to eliminate a equation () becomes rs)a s = {<f> r 7)TT r ), r>\. () Now () is an infinite set of equations in the infinite set of unnowns a u a, a,... It is always possible to get approximate values for these unnowns by suming that a s is negligible for s > n, solving the first n of the set of equations () for a u a,... a n. In fact Fox (96) derived sets of equations equivalent to () for a few simple differential equations, obtained solutions by this method. If, however, P(x) is not too large if, say, P(x) is of order the terms n r+s, -n r, -n r^s in () will be small compared with the term r. In other words, the set of equations will have a "strong diagonal." This suggests that an iterative procedure of the Gauss- Seidel type might be appropriate. Such a process would be defined follows: (r + n r - T7>W Mathematics Department, Northampton College of Advanced Technology, St. John St., London, E.C.I. 7 Downloaded from by guest on 8 November 8
2 Table Steps in the iterative solution of y' %e*y =, y{\) = a\ a* 6 ( s=r+l d denotes the /cth approximation to a r. The initial approximations a^ would normally be taen zero. It is not necessary to decide beforeh how many of the coefficients a r will be significant; at each stage in the iteration the a r s are calculated successively, those which are negligible to the number of decimal places being retained are ignored. The whole process reduces to the repetitive use of equation (), such it is very simple to program for automatic computation. As an example, Table shows the steps in the solution of the differential equation The final solution is 6 () y> - $e*y =, () y = T y {x) +89 T (x) + T (x) + T (x) + T s (x) + 8 T 6 (x) + 6 r 7 (jc) + T 8 (x) +... (6) The correct solution of () is y = exp [^(e* e)], so that X) = y(- ) = -689; the corresponding values of y given by the series (6) are respectively. Simultaneous differential equations For the set of simultaneous differential equations y'm + S P mn (x)y n = F m (x), m =,,,... N, 8 6 y m = S' 77^", (f> are related to P mn {x), F m (x) in the same way that -n r, <f> r are related to P(x), F(x). This equation will, of course, need some changes if any of the initial conditions are specified at points other than x =, but the bic approach remains the same. The solution of the set of equations (7) may be obtained by an iterative procedure, before. Furthermore, since a differential equation of any order can be rewritten a set of first-order simultaneous differential equations, the general linear equation () can be dealt with by a simple extension of the method described above for first-order equations. The second-order equation y" + P(x)y = F(x) Equations of the form y" + P(x) y = F(x) occur sufficiently often to merit special consideration. With the same notation before H' + S' (p r+s +/v_,,)fl, = /,, r >, s = hence Ara' r + ' (*>+, + *-,_,K = <f>r, After elimination of a' r, this reduces to oo r j Sra r + ' :K +J - r>\. Downloaded from by guest on 8 November 8 y m ( = Vm, the equivalent of the set of equations () is (7) 8 The initial or boundary conditions attached to a particular problem give two more equations in the coefficients a r ; these may be used to eliminate a a, from (8), so to leave a set of equations for the unnowns a, a, a,... For example, the initial-value problem
3 Table Steps in the iterative solution of /' (x 6 + x )y =, y(l) = X" V) = a OlO an in which XI) = V>.V'O) = V'h the additional equations s flj = "<)' s=l Equation (8) therefore becomes -l V ~ oo (s - r_ s+,] rs \a r - V r _ (77 Tj')"-,- V("V r On the other h, for the boundary-value problem in which y(l) = 7 y{ ) = T^_,, the additional equations are a + a a 6 a + a + a + a = v /x = 77, + ry_, v = ^(77, TI_,). ce equation (8) can be put in the form (U r _ Us t/ r>, = -("" r+j?r r + TT-r.^) if s is even (9) In this () U r, s = -(«v + s 77 r+, 77 r _, + 7T r _,) if j is odd. A similar procedure may be adopted in the more general 9 ce the boundary conditions involve linear combinations of y y'. The sets of equations (9) () may again be solved by an iterative Gauss-Seidel procedure. It should be noted, however, that the coefficient of a s in (9) contains terms of order s. This means that the set of equations h large terms away from the diagonal, consequently the efficiency of the iterative process will be diminished; indeed, in some ces the process may not converge at all. In these circumstances, it may be preferable to discard the iterative method use an elimination procedure to solve the first («) of equations (9) for the unnowns a, a, a,... a n. A similar situation arises in boundary-value problems when the boundary conditions involve y' well y. When, however, the boundary conditions involve y only, the s terms do not occur; it will be seen that the set of equations () h a very strong diagonal, the iterative process is therefore rapidly convergent. (Strictly speaing, of course, the convergence of the Gauss-Seidel process depends on the magnitude of the latent roots of an sociated matrix, rather than on the strength of the diagonal; but a strong diagonal is usually a fair indication that the process will converge quicly.) As an example, the equation /' - (x* + x )y =, XI) = X- ) =, () will be considered. The solution is clearly an even function of x, so that only a, a, a 6,... need be found. The steps in the solution are set out in Table ; the final solution is y = T (x) + 8 T {x) + 77 T 6 (x) +6 T 8 (x) + T lq (x) + r, (JC) +... () The correct solution of () is y = exp {K* )}, so that y() = -7788; the value of y() obtained from the series () is Eigenvalue problems Since any linear differential equation can be transformed into an infinite set of simultaneous equations in the coefficients a n any linear eigenvalue problem can similarly be transformed into a determinantal equation of infinite dimensions. In general this equation can be solved approximately by ignoring all except the first n Downloaded from by guest on 8 November 8
4 Table Steps in the solution of the eigenvalue problem y" + A(.r + \)y =, y(l) = y( ) = A = I/A a, Of, a, rows columns of the determinant. When, however, the eigenvalue problem involves a differential equation of the form y" + XP(x)y = a more powerful method of solution is available, bed on the iterative procedure already described. This type of problem will therefore be considered in detail. Suppose first that the boundary conditions are of the form y{ ) = y{\) =. With the same notation before, it follows immediately from equation () that A (tf,-i,, - </, s= This may be written b rs a s = Aa n r >, s=l r =, r >. A = I/A. The eigenvalues A of the differential equation are therefore given immediately by the latent roots A of the infinite matrix [b rs \; the determination of the fundamental eigenvalue (which is often the only one required) is equivalent to the evaluation of the largest latent root of the matrix. The iterative method suggested below for determining the fundamental eigenvalue is in fact a slight modification of the familiar iterative procedure for calculating a dominant latent root. In general a may be expected to be the largest of the a r s when a a x have been eliminated; it is convenient therefore to tae a unity throughout. (A few obvious changes will be necessary if a vanishes, e.g. if y is an odd function of x.) The iterative procedure is then defined by the formulae t-i) = s= df = «)-6 rr )a»)=.= ^+ () It will usually be convenient to start with a ), aw = for r >. As before many a r s are significant are retained at each stage of the iteration. As an example, consider the equation y" + X(x + l)y =, = y(~ ) =. () The steps in the solution are set out in Table. It will be seen that A = -, so A = -696; the correct fundamental eigenvalue of () is in fact -69. The corresponding solution of the differential equation is y = A[ T,(x) + T (x) + - T-lx) - 8 T (x) - 87 T (x) - O-OOO7 T 6 (x) + 6 T 7 (x) + T 8 (x)...]. The above method can also be used when the boundary conditions involve y' well y. For differential equations of the form y" + XP(x)y =, equation (8) can be written in the form A = I/A before. The two boundary conditions may be used to eliminate a a t from (), so that it reduces to the form GO b t fl s = Aa r, r >. s= The values of A a r can then be determined by the iterative procedure (). For example, for the equation /' + A.y =, y{\) =, y'(- ) =, equation () reduces to a r-, a r a r+ r(r ) T {r - r(r = Aa r, Downloaded from by guest on 8 November 8
5 Table Steps in the solution of the eigenvalue problem y" + \y =, y(l) =, y'( l) = A = l/a. a the initial conditions are given by $a + a x + a + a + a +.. = a x o + 9a 6a +.. =. The iterative procedure is therefore A<«= - ^ - 88a<*-» + (8A<«= = - (r + \)a«± - (r - l)a» + -!), r >. The steps in the solution are set out in Table. It will be seen that A = -6, so A = -669; the correct value of A is, of course, 77 /6 = In order to find eigenvalues other than the fundamental, it is necessary to eliminate the dominant latent root from the matrix [b rs ]\ the method of doing this h been well described in Modern Computing Methods (96), page 6, need not be repeated here. When References 7 7 this root h been removed, the next eigenvalue may be found by an iterative procedure similar to that described above. Conclusions It h been shown that Chebyshev expansions may be used to find the numerical solutions of a general cls of linear differential equations; but the method appears to be particularly advantageous for the following three types of problem: (a) First-order equations of the form y' -\-P(x)y=F(x), P(x) is of order or smaller, systems of such equations. (b) Second-order equations of the form y" + P(x)y = F{x), especially when the boundary conditions specify values of y only. (c) Eigenvalue problems involving differential equations of the form y" + hp(x)y =. For each of these types of problem, iterative procedures are available which are particularly suitable for automatic computation. CLENSHAW, C. W. (97). "The Numerical Solution of Linear Differential Equations in Chebyshev Series," Proc. Catnb. Phil. Soc, Vol., p.. CLENSHAW, C. W., NORTON, H. J. (96). "The solution of non-linear ordinary differential equations in Chebyshev series," The Computer Journal, Vol. 6, p. 88. Fox, L. (96). "Chebyshev Methods for Ordinary Differential Equations," The Computer Journal, Vol., p. 8. Modern Computing Methods (96). N.P.L. Notes on Applied Science, No. 6 (H.M.S.O.). Downloaded from by guest on 8 November 8 6
ƒ f(x)dx ~ X) ^i,nf(%i,n) -1 *=1 are the zeros of P«(#) and where the num
ZEROS OF THE HERMITE POLYNOMIALS AND WEIGHTS FOR GAUSS' MECHANICAL QUADRATURE FORMULA ROBERT E. GREENWOOD AND J. J. MILLER In the numerical integration of a function ƒ (x) it is very desirable to choose
More informationReview of matrices. Let m, n IN. A rectangle of numbers written like A =
Review of matrices Let m, n IN. A rectangle of numbers written like a 11 a 12... a 1n a 21 a 22... a 2n A =...... a m1 a m2... a mn where each a ij IR is called a matrix with m rows and n columns or an
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 informationis a 3 4 matrix. It has 3 rows and 4 columns. The first row is the horizontal row [ ]
Matrices: Definition: An m n matrix, A m n is a rectangular array of numbers with m rows and n columns: a, a, a,n a, a, a,n A m,n =...... a m, a m, a m,n Each a i,j is the entry at the i th row, j th column.
More informationNext topics: Solving systems of linear equations
Next topics: Solving systems of linear equations 1 Gaussian elimination (today) 2 Gaussian elimination with partial pivoting (Week 9) 3 The method of LU-decomposition (Week 10) 4 Iterative techniques:
More informationSeries Solutions of Differential Equations
Chapter 6 Series Solutions of Differential Equations In this chapter we consider methods for solving differential equations using power series. Sequences and infinite series are also involved in this treatment.
More informationNotes on Special Functions
Spring 25 1 Notes on Special Functions Francis J. Narcowich Department of Mathematics Texas A&M University College Station, TX 77843-3368 Introduction These notes are for our classes on special functions.
More informationMATH 304 Linear Algebra Lecture 8: Vector spaces. Subspaces.
MATH 304 Linear Algebra Lecture 8: Vector spaces. Subspaces. Linear operations on vectors Let x = (x 1, x 2,...,x n ) and y = (y 1, y 2,...,y n ) be n-dimensional vectors, and r R be a scalar. Vector sum:
More informationMassachusetts Institute of Technology Instrumentation Laboratory Cambridge, Massachusetts
Massachusetts Institute of Technology Instrumentation Laboratory Cambridge, Massachusetts Space Guidance Analysis Memo #9 To: From: SGA Distribution James E. Potter Date: November 0, 96 Subject: Error
More informationSPACES OF MATRICES WITH SEVERAL ZERO EIGENVALUES
SPACES OF MATRICES WITH SEVERAL ZERO EIGENVALUES M. D. ATKINSON Let V be an w-dimensional vector space over some field F, \F\ ^ n, and let SC be a space of linear mappings from V into itself {SC ^ Horn
More informationMath 343 Midterm I Fall 2006 sections 002 and 003 Instructor: Scott Glasgow
Math 343 Midterm I Fall 006 sections 00 003 Instructor: Scott Glasgow 1 Assuming A B are invertible matrices of the same size, prove that ( ) 1 1 AB B A 1 = (11) B A 1 1 is the inverse of AB if only if
More informationOptimization using Calculus. Optimization of Functions of Multiple Variables subject to Equality Constraints
Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints 1 Objectives Optimization of functions of multiple variables subjected to equality constraints
More informationSolution of System of Linear Equations & Eigen Values and Eigen Vectors
Solution of System of Linear Equations & Eigen Values and Eigen Vectors P. Sam Johnson March 30, 2015 P. Sam Johnson (NITK) Solution of System of Linear Equations & Eigen Values and Eigen Vectors March
More information(308 ) EXAMPLES. 1. FIND the quotient and remainder when. II. 1. Find a root of the equation x* = +J Find a root of the equation x 6 = ^ - 1.
(308 ) EXAMPLES. N 1. FIND the quotient and remainder when is divided by x 4. I. x 5 + 7x* + 3a; 3 + 17a 2 + 10* - 14 2. Expand (a + bx) n in powers of x, and then obtain the first derived function of
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More information2 Eigenvectors and Eigenvalues in abstract spaces.
MA322 Sathaye Notes on Eigenvalues Spring 27 Introduction In these notes, we start with the definition of eigenvectors in abstract vector spaces and follow with the more common definition of eigenvectors
More informationHence a root lies between 1 and 2. Since f a is negative and f(x 0 ) is positive The root lies between a and x 0 i.e. 1 and 1.
The Bisection method or BOLZANO s method or Interval halving method: Find the positive root of x 3 x = 1 correct to four decimal places by bisection method Let f x = x 3 x 1 Here f 0 = 1 = ve, f 1 = ve,
More informationTransactions on Modelling and Simulation vol 12, 1996 WIT Press, ISSN X
Simplifying integration for logarithmic singularities R.N.L. Smith Department ofapplied Mathematics & OR, Cranfield University, RMCS, Shrivenham, Swindon, Wiltshire SN6 SLA, UK Introduction Any implementation
More informationPhysics 741 Graduate Quantum Mechanics 1 Solutions to Midterm Exam, Fall x i x dx i x i x x i x dx
Physics 74 Graduate Quantum Mechanics Solutions to Midterm Exam, Fall 4. [ points] Consider the wave function x Nexp x ix (a) [6] What is the correct normaliation N? The normaliation condition is. exp,
More informationSAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra
1.1. Introduction SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear algebra is a specific branch of mathematics dealing with the study of vectors, vector spaces with functions that
More informationFall Math 3410 Name (Print): Solution KEY Practice Exam 2 - November 4 Time Limit: 50 Minutes
Fall 206 - Math 340 Name (Print): Solution KEY Practice Exam 2 - November 4 Time Limit: 50 Minutes This exam contains pages (including this cover page) and 5 problems. Check to see if any pages are missing.
More informationVH-G(A)=IIVHGF(S)"J=1.
ON A GENERALIZED PRINCIPAL IDEAL THEOREM FUMIYUKI TERADA (Received May 27, 1954) 1. Introduction. The author proved several years ago following theorem1), which is a generalization of the Hilbert's principal
More informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationDigital Workbook for GRA 6035 Mathematics
Eivind Eriksen Digital Workbook for GRA 6035 Mathematics November 10, 2014 BI Norwegian Business School Contents Part I Lectures in GRA6035 Mathematics 1 Linear Systems and Gaussian Elimination........................
More informationGenerated for Bernard Russo;Bernard Russo (University of California, Irvine) on :28 GMT /
PART I DEFINITIONS, ILLUSTRATIONS AND ELEMENTARY THEOREMS 1. Arithmetical definition of ordinary complex numbers. The following purely arithmetical theory of couples (a, b) of real numbers differs only
More informationColumn 3 is fine, so it remains to add Row 2 multiplied by 2 to Row 1. We obtain
Section Exercise : We are given the following augumented matrix 3 7 6 3 We have to bring it to the diagonal form The entries below the diagonal are already zero, so we work from bottom to top Adding the
More information2 Series Solutions near a Regular Singular Point
McGill University Math 325A: Differential Equations LECTURE 17: SERIES SOLUTION OF LINEAR DIFFERENTIAL EQUATIONS II 1 Introduction Text: Chap. 8 In this lecture we investigate series solutions for the
More informationLINEAR SYSTEMS (11) Intensive Computation
LINEAR SYSTEMS () Intensive Computation 27-8 prof. Annalisa Massini Viviana Arrigoni EXACT METHODS:. GAUSSIAN ELIMINATION. 2. CHOLESKY DECOMPOSITION. ITERATIVE METHODS:. JACOBI. 2. GAUSS-SEIDEL 2 CHOLESKY
More informationPower Series and Analytic Function
Dr Mansoor Alshehri King Saud University MATH204-Differential Equations Center of Excellence in Learning and Teaching 1 / 21 Some Reviews of Power Series Differentiation and Integration of a Power Series
More informationDifference equations. Definitions: A difference equation takes the general form. x t f x t 1,,x t m.
Difference equations Definitions: A difference equation takes the general form x t fx t 1,x t 2, defining the current value of a variable x as a function of previously generated values. A finite order
More informationSeries Solutions Near a Regular Singular Point
Series Solutions Near a Regular Singular Point MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Background We will find a power series solution to the equation:
More informationTHREE DIMENSIONAL SIMILARITY SOLUTIONS OF THE NONLINEAR DIFFUSION EQUATION FROM OPTIMIZATION AND FIRST INTEGRALS
J. Austral. Math. Soc. {Series B) 23 (1982), 297-309 THREE DIMENSIONAL SIMILARITY SOLUTIONS OF THE NONLINEAR DIFFUSION EQUATION FROM OPTIMIZATION AND FIRST INTEGRALS J.-Y. PARLANGE, R. D. BRADDOCK, G.
More informationSAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra
SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to 1.1. Introduction Linear algebra is a specific branch of mathematics dealing with the study of vectors, vector spaces with functions that
More informationThe Conjugate Gradient Method
CHAPTER The Conjugate Gradient Method Exercise.: A-norm Let A = LL be a Cholesy factorization of A, i.e.l is lower triangular with positive diagonal elements. The A-norm then taes the form x A = p x T
More information1.2. Indices. Introduction. Prerequisites. Learning Outcomes
Indices 1.2 Introduction Indices, or powers, provide a convenient notation when we need to multiply a number by itself several times. In this Section we explain how indices are written, and state the rules
More informationSolving Linear Systems of Equations
November 6, 2013 Introduction The type of problems that we have to solve are: Solve the system: A x = B, where a 11 a 1N a 12 a 2N A =.. a 1N a NN x = x 1 x 2. x N B = b 1 b 2. b N To find A 1 (inverse
More informationA LAGRANGIAN FORMULATION OF THE JOOS-WEINBERG WAVE EQUATIONS FOR SPIN-S PARTICLES. D. Shay
IC/68/13 INTERNAL REPORT (Limited distribution) A LAGRANGIAN FORMULATION OF THE JOOS-WEINBERG WAVE EQUATIONS FOR SPIN-S PARTICLES D. Shay ABSTRACT The Lorentz covariant, spin-s, Joos-Weinberg equations
More informationThe Exponential of a Matrix
The Exponential of a Matrix 5-8- The solution to the exponential growth equation dx dt kx is given by x c e kt It is natural to ask whether you can solve a constant coefficient linear system x A x in a
More informationx = x y and y = x + y.
8. Conic sections We can use Legendre s theorem, (7.1), to characterise all rational solutions of the general quadratic equation in two variables ax 2 + bxy + cy 2 + dx + ey + ef 0, where a, b, c, d, e
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 informationEigenvalue and Eigenvector Homework
Eigenvalue and Eigenvector Homework Olena Bormashenko November 4, 2 For each of the matrices A below, do the following:. Find the characteristic polynomial of A, and use it to find all the eigenvalues
More informationSolving Differential Equations Using Power Series
LECTURE 25 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form (25.) y + p(x)y + q(x)y = 0 where the functions
More informationSolving Differential Equations Using Power Series
LECTURE 8 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form () y + p(x)y + q(x)y = 0 where the functions
More informationCoupled differential equations
Coupled differential equations Example: dy 1 dy 11 1 1 1 1 1 a y a y b x a y a y b x Consider the case with b1 b d y1 a11 a1 y1 y a1 ay dy y y e y 4/1/18 One way to address this sort of problem, is to
More informationA MATHEMATICAL NOTE. Algorithm for the efficient evaluation of the trace of the inverse of a matrix
A MATHEMATICAL NOTE Algorithm for the efficient evaluation of the trace of the inverse of a matrix Nicholas Wheeler, Reed College Physics Department December 996 Introductory reminiscence It was after
More informationSolutions Preliminary Examination in Numerical Analysis January, 2017
Solutions Preliminary Examination in Numerical Analysis January, 07 Root Finding The roots are -,0, a) First consider x 0 > Let x n+ = + ε and x n = + δ with δ > 0 The iteration gives 0 < ε δ < 3, which
More informationON THE DIVERGENCE OF FOURIER SERIES
ON THE DIVERGENCE OF FOURIER SERIES RICHARD P. GOSSELIN1 1. By a well known theorem of Kolmogoroff there is a function whose Fourier series diverges almost everywhere. Actually, Kolmogoroff's proof was
More informationINTEGRAL EQUATIONS. Introduction à la Théorie des Equations intégrales. By T.
236 INTEGRAL EQUATIONS. [Feb., it is obvious that we have also (r + 1)P 2 = r p2 + 1 mod p\ But this congruence is implied by (7) alone, as one may readily verify by multiplying (7) by r p \ Other cases
More informationCHAPTER III THE CURVE AND THE EQUATION. The bisectors of the adjacent angles formed by two lines is. To solve any locus problem involves two things :
CHAPTER III THE CURVE AND THE EQUATION 24. Locus of a point satisfying a given condition. The curve* (or group of curves) passing through all points which satisfy a given condition, and through no other
More informationFurther Mathematical Methods (Linear Algebra) 2002
Further Mathematical Methods (Linear Algebra) 00 Solutions For Problem Sheet 0 In this Problem Sheet we calculated some left and right inverses and verified the theorems about them given in the lectures.
More informationQuantum Mechanics for Scientists and Engineers. David Miller
Quantum Mechanics for Scientists and Engineers David Miller Background mathematics 5 Sum, factorial and product notations Summation notation If we want to add a set of numbers a 1, a 2, a 3, and a 4, we
More informationLecture Notes in Linear Algebra
Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................
More informationM.SC. PHYSICS - II YEAR
MANONMANIAM SUNDARANAR UNIVERSITY DIRECTORATE OF DISTANCE & CONTINUING EDUCATION TIRUNELVELI 627012, TAMIL NADU M.SC. PHYSICS - II YEAR DKP26 - NUMERICAL METHODS (From the academic year 2016-17) Most Student
More informationUnit I (Testing of Hypothesis)
SUBJECT NAME : Statistics and Numerical Methods SUBJECT CODE : MA645 MATERIAL NAME : Part A questions REGULATION : R03 UPDATED ON : November 07 (Upto N/D 07 Q.P) Unit I (Testing of Hypothesis). State level
More informationMath 0312 EXAM 2 Review Questions
Name Decide whether the ordered pair is a solution of the given system. 1. 4x + y = 2 2x + 4y = -20 ; (2, -6) Solve the system by graphing. 2. x - y = 6 x + y = 16 Solve the system by substitution. If
More informationPolynomial Solutions of Nth Order Nonhomogeneous Differential Equations
Polynomial Solutions of th Order onhomogeneous Differential Equations Lawrence E. Levine Ray Maleh Department of Mathematical Sciences Stevens Institute of Technology Hoboken,J 07030 llevine@stevens-tech.edu
More information6 Second Order Linear Differential Equations
6 Second Order Linear Differential Equations A differential equation for an unknown function y = f(x) that depends on a variable x is any equation that ties together functions of x with y and its derivatives.
More informationChebyshev finite difference method for a Two Point Boundary Value Problems with Applications to Chemical Reactor Theory
Iranian Journal of Mathematical Chemistry, Vol. 3, o., February 22, pp. 7 IJMC Chebyshev finite difference method for a Two Point Boundary Value Problems with Applications to Chemical Reactor Theory ABBAS
More informationSolving Linear Systems Using Gaussian Elimination
Solving Linear Systems Using Gaussian Elimination DEFINITION: A linear equation in the variables x 1,..., x n is an equation that can be written in the form a 1 x 1 +...+a n x n = b, where a 1,...,a n
More informationMath Exam 2, October 14, 2008
Math 96 - Exam 2, October 4, 28 Name: Problem (5 points Find all solutions to the following system of linear equations, check your work: x + x 2 x 3 2x 2 2x 3 2 x x 2 + x 3 2 Solution Let s perform Gaussian
More informationSTOP, a i+ 1 is the desired root. )f(a i) > 0. Else If f(a i+ 1. Set a i+1 = a i+ 1 and b i+1 = b Else Set a i+1 = a i and b i+1 = a i+ 1
53 17. Lecture 17 Nonlinear Equations Essentially, the only way that one can solve nonlinear equations is by iteration. The quadratic formula enables one to compute the roots of p(x) = 0 when p P. Formulas
More informationDeterminants connected with the Periodic Solutions of Mathieu's Equations. (Read 11th June Received 28th June 1915.)
122 Determinants connected with the Periodic Solutions of Mathieu's Equations. By A. G. BURGESS, Research Student, Edinburgh University Mathematical Laboratory. (Read 11th June 1915. Received 28th June
More informationRectangular Systems and Echelon Forms
CHAPTER 2 Rectangular Systems and Echelon Forms 2.1 ROW ECHELON FORM AND RANK We are now ready to analyze more general linear systems consisting of m linear equations involving n unknowns a 11 x 1 + a
More informationSystems of Linear Equations
Systems of Linear Equations Linear Equation Definition Any equation that is equivalent to the following format a a ann b (.) where,,, n are unknown variables and a, a,, an, b are known numbers (the so
More information(Received 11 October 1996; accepted 7 March 1997)
Padé approximant algorithm for solving nonlinear ordinary differential equation boundary value problems on an unbounded domain John P. Boyd a Department of Atmospheric, Oceanic and Space Science, University
More informationCOMPOSITIO MATHEMATICA
COMPOSITIO MATHEMATICA H. S. THURSTON On factoring a matric polynomial with scalar coefficients Compositio Mathematica, tome 6 (1939), p. 235-238 Foundation
More informationWeek_4: simplex method II
Week_4: simplex method II 1 1.introduction LPs in which all the constraints are ( ) with nonnegative right-hand sides offer a convenient all-slack starting basic feasible solution. Models involving (=)
More informationL=/o U701 T. jcx3. 1L2,Z fr7. )vo. A (a) [20%) Find the steady-state temperature u(x). M,(Y 7( it) X(o) U ç (ock. Partial Differential Equations 3150
it) O 2h1 i / k ov A u(1,t) L=/o [1. (H3. Heat onduction in a Bar) 1 )vo nstructions: This exam is timed for 12 minutes. You will be given extra time to complete Exam Date: Thursday, May 2, 213 textbook.
More informationComputer Vision Group Prof. Daniel Cremers. 9. Gaussian Processes - Regression
Group Prof. Daniel Cremers 9. Gaussian Processes - Regression Repetition: Regularized Regression Before, we solved for w using the pseudoinverse. But: we can kernelize this problem as well! First step:
More informationIntroduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX
Introduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX September 2007 MSc Sep Intro QT 1 Who are these course for? The September
More informationarxiv: v4 [math.nt] 31 Jul 2017
SERIES REPRESENTATION OF POWER FUNCTION arxiv:1603.02468v4 [math.nt] 31 Jul 2017 KOLOSOV PETRO Abstract. In this paper described numerical expansion of natural-valued power function x n, in point x = x
More informationALEXANDER E. HOLROYD AND THOMAS M. LIGGETT
SYMMETRIC DEPENDENT COLORINGS OF THE INTEGERS ALEXANDER E. HOLROYD AND THOMAS M. LIGGETT Abstract. In a recent paper by the same authors, we constructed a stationary dependent 4 coloring of the integers
More informationRepresentation theory and quantum mechanics tutorial Spin and the hydrogen atom
Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Justin Campbell August 3, 2017 1 Representations of SU 2 and SO 3 (R) 1.1 The following observation is long overdue. Proposition
More informationLECTURE 14: REGULAR SINGULAR POINTS, EULER EQUATIONS
LECTURE 14: REGULAR SINGULAR POINTS, EULER EQUATIONS 1. Regular Singular Points During the past few lectures, we have been focusing on second order linear ODEs of the form y + p(x)y + q(x)y = g(x). Particularly,
More informationCircular Membranes. Farlow, Lesson 30. November 21, Department of Mathematical Sciences Florida Atlantic University Boca Raton, FL 33431
The Problem Polar coordinates Solving the Problem by Separation of Variables Circular Membranes Farlow, Lesson 30 Department of Mathematical Sciences Florida Atlantic University Boca Raton, FL 33431 November
More informationON DIVISION ALGEBRAS*
ON DIVISION ALGEBRAS* BY J. H. M. WEDDERBURN 1. The object of this paper is to develop some of the simpler properties of division algebras, that is to say, linear associative algebras in which division
More informationInfinite series, improper integrals, and Taylor series
Chapter 2 Infinite series, improper integrals, and Taylor series 2. Introduction to series In studying calculus, we have explored a variety of functions. Among the most basic are polynomials, i.e. functions
More informationRandom variables (discrete)
Random variables (discrete) Saad Mneimneh 1 Introducing random variables A random variable is a mapping from the sample space to the real line. We usually denote the random variable by X, and a value that
More informationLinear Algebra Homework and Study Guide
Linear Algebra Homework and Study Guide Phil R. Smith, Ph.D. February 28, 20 Homework Problem Sets Organized by Learning Outcomes Test I: Systems of Linear Equations; Matrices Lesson. Give examples of
More informationKINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK
KINGS COLLEGE OF ENGINEERING MA5-NUMERICAL METHODS DEPARTMENT OF MATHEMATICS ACADEMIC YEAR 00-0 / EVEN SEMESTER QUESTION BANK SUBJECT NAME: NUMERICAL METHODS YEAR/SEM: II / IV UNIT - I SOLUTION OF EQUATIONS
More informationLecture 8: Discrete-Time Signals and Systems Dr.-Ing. Sudchai Boonto
Dr-Ing Sudchai Boonto Department of Control System and Instrumentation Engineering King Mongut s Unniversity of Technology Thonburi Thailand Outline Introduction Some Useful Discrete-Time Signal Models
More informationExamination paper for TMA4130 Matematikk 4N: SOLUTION
Department of Mathematical Sciences Examination paper for TMA4 Matematikk 4N: SOLUTION Academic contact during examination: Morten Nome Phone: 9 84 97 8 Examination date: December 7 Examination time (from
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationTwo special equations: Bessel s and Legendre s equations. p Fourier-Bessel and Fourier-Legendre series. p
LECTURE 1 Table of Contents Two special equations: Bessel s and Legendre s equations. p. 259-268. Fourier-Bessel and Fourier-Legendre series. p. 453-460. Boundary value problems in other coordinate system.
More informationEquations with regular-singular points (Sect. 5.5).
Equations with regular-singular points (Sect. 5.5). Equations with regular-singular points. s: Equations with regular-singular points. Method to find solutions. : Method to find solutions. Recall: The
More informationA L A BA M A L A W R E V IE W
A L A BA M A L A W R E V IE W Volume 52 Fall 2000 Number 1 B E F O R E D I S A B I L I T Y C I V I L R I G HT S : C I V I L W A R P E N S I O N S A N D TH E P O L I T I C S O F D I S A B I L I T Y I N
More informationCHAPTER XVI The search for consistency for intricate exponential algebras.
16.1. Introduction. CHAPTER XVI The Dw hyperintricate exponential algebras We use the hyperintricate representation of matrices and explore exponentiation for these objects. Proofs by contradiction are
More informationLocal regression I. Patrick Breheny. November 1. Kernel weighted averages Local linear regression
Local regression I Patrick Breheny November 1 Patrick Breheny STA 621: Nonparametric Statistics 1/27 Simple local models Kernel weighted averages The Nadaraya-Watson estimator Expected loss and prediction
More informationVector Spaces. (1) Every vector space V has a zero vector 0 V
Vector Spaces 1. Vector Spaces A (real) vector space V is a set which has two operations: 1. An association of x, y V to an element x+y V. This operation is called vector addition. 2. The association of
More informationMath /Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined
Math 400-001/Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined using limits. As a particular case, the derivative of f(x)
More informationI I. R E L A T E D W O R K
A c c e l e r a t i n g L a r g e S c a l e C e n t r o i d - B a s e d C l u s t e r i n g w i t h L o c a l i t y S e n s i t i v e H a s h i n g R y a n M c C o n v i l l e, X i n C a o, W e i r u L
More information2-f-eV. 542 Mr Thomas, The calculation of atomic fields
542 Mr Thomas, The calculation of atomic fields The calculation of atomic fields. By L. H. THOMAS, B.A., Trinity College. [Received 6 November, read 22 November 1926.] The theoretical calculation of observable
More informationand A", where (1) p- 8/+ 1 = X2 + Y2 = C2 + 2D2, C = X=\ (mod4).
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 87, Number 3. March 1983 THE Odie PERIOD POLYNOMIAL RONALD J. EVANS1 Abstract. The coefficients and the discriminant of the octic period polynomial
More informationON THE AVERAGE NUMBER OF REAL ROOTS OF A RANDOM ALGEBRAIC EQUATION
ON THE AVERAGE NUMBER OF REAL ROOTS OF A RANDOM ALGEBRAIC EQUATION M. KAC 1. Introduction. Consider the algebraic equation (1) Xo + X x x + X 2 x 2 + + In-i^" 1 = 0, where the X's are independent random
More informationMath 291-2: Final Exam Solutions Northwestern University, Winter 2016
Math 29-2: Final Exam Solutions Northwestern University, Winter 206 Determine whether each of the following statements is true or false f it is true, explain why; if it is false, give a counterexample
More informationBACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES
No. of Printed Pages : 5 BCS-054 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 058b9 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES Time : 3 hours Maximum Marks
More information(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by
1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How
More informationPhysics 250 Green s functions for ordinary differential equations
Physics 25 Green s functions for ordinary differential equations Peter Young November 25, 27 Homogeneous Equations We have already discussed second order linear homogeneous differential equations, which
More informationIn numerical analysis quadrature refers to the computation of definite integrals.
Numerical Quadrature In numerical analysis quadrature refers to the computation of definite integrals. f(x) a x i x i+1 x i+2 b x A traditional way to perform numerical integration is to take a piece of
More informationLinear Algebra Practice Problems
Linear Algebra Practice Problems Math 24 Calculus III Summer 25, Session II. Determine whether the given set is a vector space. If not, give at least one axiom that is not satisfied. Unless otherwise stated,
More information