The KMO Method for Solving Non-homogenous, m th Order Differential Equations
|
|
- Joshua Norris
- 5 years ago
- Views:
Transcription
1 The KMO Method for Solvng Non-homogenous, m th Order Dfferental Equatons Davd Krohn Danel Marño-Johnson John Paul Ouyang March 14, 2013 Abstract Ths paper shows a smple tabular procedure for fndng the partcular soluton to dfferental equatons of the form: a j d j y j = P (x)eαx (1) Ths procedure reduces the dervatves of the product of a general polynomal and an exponental to rows of constants representng the coeffcents of the terms. The rows are each multpled by a j and summed to produce a m th order dfferental equaton of the general polynomal. The underlyng mechancs of ths converson and ts formulac mplcaton are then dscussed. Usng the formula derved, the partcular soluton for equaton 1 wll be found. Ths procedure s dfferent than the method of undetermned coeffcents because whle the method of undetermned coeffcent requres substtuton of a product of a polynomal and an exponental nto the dfferental equaton mmedately, ths procedure s derved from the examnaton of the substtuton of the product of any fucton and an exponental. Ths allows for a rcher understandng of the relatonshp between the dfferental equaton n y and the dfferental equaton n Q. Ultmately ths method s better than the method of undetermned coeffcents because t s more straghtforward. 1 Introducton Dfferental equatons are a very old feld of research. In modern tmes much attenton s beng spent on nonlnear equatons due to the ncrease n computatonal abltes and geometrc technques. Lnear dfferental equatons are well understood especally those wth constant coeffcents. Of these are the ones lke equaton 1. The establshed method for solvng these equatons s the method of undetermned coeffcents. Ths procedure nvolves the substtuton of partcular soluton y p = e αx x s n u=1 c ux u or y p = e αx Q(x) where s s the number of tmes α s a root of the characterstc polynomal. Ths leads to a to a system of equatons whch yeld c u. We nstead consder the correspondng dfferental equaton n Q frst by means of a tabular procedure, then by means of
2 a formula derved. Couplng ths formula wth trangular matrx nverson and a more general procedure we show the partcular soluton and n nduced map κ. 2 Example Applcaton of the Tabular Procedure We consder the followng dfferental equaton: 2 d2 y dy + y = (5x + 3)e 2x (2) The general soluton to ths equaton s found by addng the partcular soluton to the soluton of the correspondng homogenous equaton. The homogenous soluton s of the form: (wth c 1 and c 2 constants) y h = c 1 e λ1x + c 2 e λ2x Where c 1 and c 2 are constants. By the quadratc equaton, the solutons of the characterstc equaton may be found: λ 1,2 = 3 ± 3 2 4(2)(1) 2(2) The KMO method s concerned exclusvely wth fndng the partcular soluton. Thus henceforth let y mean y p. Usually y s found wth the method of undetermned coeffcents as detaled n [1]. The method of undetermned coeffcents s somewhat tme consumng as t often nvolves arduous algebra. The tabular procedure begns wth a soluton of the form y = Q(x)e αx where Q s a polynomal. In the case of equaton 2 ths s y = Q(x)e 2x. Usng a general polynomal elmnates the tral and error that sometmes occurs n the method of undetermned coeffcents. We take dervatves of y: y = Q(x)e 2x dy = dq e 2x 2Q(x)e 2x d 2 y 2 = d2 Q 2 e 2x 4 dq e 2x + 4Q(x)e 2x Now we place the coeffcents nto a table: Q(x) dq d 2 Q 2 y dy d 2 y
3 The tabular format s useful for examnng the coeffcents because when the dervatves of y are summed along wth ther coeffcents, the coeffcents of terms wth lke order dervatves of Q are summed together. For example, when the y term s added to the frst dervatve terms, the coeffcent 1 of Q(x)e 2x n y s added to the coeffcent 2 of Q(x)e 2x n dy. However, before the summaton the coeffcents of the dfferental equaton n y must be accounted for. Now we multply each of the rows by the correspondng coeffcents of the dervatves of y: Q(x) dq d 2 Q 2 1 y dy d2 y The sum of the components n each column produces the coeffcents for the dervatves of Q n the correspondng dfferental equaton n Q. Snce all terms contan the same exponental term, whch s never zero, t may be dvded out yeldng: 2 d2 Q 2 5dQ + 3Q(x) = 5x + 3 (3) In equaton 3, the thrd term s the polynomal of hghest degree and by equvalence must be of frst degree. Ths means wth Q(x) = ax + b, dq = a, and d2 Q = 0. Substtuton nto equaton 3 2 yelds 5a + 3ax + 3b = 5x + 3. By algebra a = and b = 9. Thus y = ( 5 3 x )e 2x. 3 Removal of the Exponental The coeffcents of the dfferental equaton n Q are: b = ( ) j a j α j Proof. The dfferental equaton may be compacted by vewng the left sde of the equaton as the nner product of a and y D where a = [a 0, a 1,..., a m ] and y D = [ d0 y, d1 y 0... dm y 1 ]. Thus, equaton m 1 reduces to the followng equaton: < a, y D >= P (x)e αx (4) The goal, usng ths new notaton, s to fnd the value of b n the dfferental equaton < b, Q D >= P (x). Snce takng successve dervatves of a product of functons derves ths equaton, a rule for the n th dervatves of ths product would be useful. The Lebnz rule s just such a rule [2]. The Lebnz rule states that dn n f(x)g(x) = n =0 ( n 3 ) d f d n g where ( n ) s the bnomal coeffcent. n
4 If f s let to be Q and g s let to be e αx, then by the Lebnz rule, Substtuton nto equaton 4 yelds the followng equaton: d j y j = j ( j ) d Q =0 α j e αx. [ j ( ) j d Q < a, αj e αx] >= P (x)e αx 1n+1 =0 As demonstrated n the prevous specfc example, the next step to obtan a dfferental equaton of the form < b, Q D >= P (x) s to dvde both sdes by a factor of e αx. Explctly wrtng out the sum mpled by the nner product allows ths dvson. The combnaton of the sum defnng elements of y D and the sum that s the nner product yelds the followng double summaton over ndces and j: j a j =0 ( ) j d Q αj e αx = P (x)e αx The e αx may be now be dvded out because t s not summed over. j a j =0 ( ) j d Q αj = P (x) The a j can be moved nsde the nner summaton snce ether way all terms wth j are summed by the frst summaton. The nner summaton may be summed to m nstead snce terms ndexed by > j vansh due to the bnomal coeffcent. Ths s useful snce as a result the orders of summaton may now be swtched due to the commutatve property of summaton. A smple example of ths 2 =1 a j = (a 11 + a 21 ) + (a 12 + a 22 ) and 2 =1 2 j=1 a j = property s the equavalence of 2 j=1 (a 11 + a 12 ) + (a 21 + a 22 ) due to regroupng. Wth ths new orderng, d Q the nner summaton to yeld the followng equaton: =0 d Q ( ) j a j α j = P (x) may be moved outsde of Ths left sde of ths equaton may be recognzed as the nner product of Q D and b where b s the nner summaton. 3.1 Applcaton to Equaton 2 The vector a may be quckly seen to be [1, 3, 2], α = 2, and m = 2. Thus the expresson for b s as follows: 2 ( ) j a j ( 2) j The calculatons of the coeffcent are as follows: b 0 = (1 1 1) + (1 3 ( 2)) + (1 2 4) = 3 4
5 b 1 = 0 + (1 3 1) + (2 2 ( 2)) = 5 Thus the result s the same as equaton 3. b 2 = (1 2 1) = 2 4 Partcular Soluton of Equaton 4 The partcular soluton s Q(x)e αx. The order of Q s n + p where p s the ndex of the frst nonvanshng b j and n s the order of P. Thus Q(x) = n+p u=0 c ux u. From u equals 0 to p 1, c u = 0. Let T = { Z, n m + p < n} and R = { Z + {0}, 0 n m + p}. Also for future convenence let a j = (+j)!! b j. The leadng coeffcent of Q s the leadng coeffcent of P dvded by a p n; the remanng coeffcents are determned recursvely [3] the followng way. For t such that n t T, c p+ = 1 (k a p t =1 ap+ c p++ ) and for t such that n t R, c p+ = 1 (k a p n T =1 ap+ c p++ ). The ks are coeffcents of P and n T s the order of the dfferental equaton mnus p. Proof. Let P n (x) specfy the order of P as n. The converted dfferental equaton of m th order may now be explctly wrtten as the followng: b j d j Q j = P n(x) (5) The order of Q deps on the value of j such that b j s the frst non-vanshng coeffcent. Ths may be attrbuted to the fact that f j = 3 then the lowest order dervatve s d3 Q meanng 3 that f n for P n (x) s 4, d3 Q must be of order 4 snce there are no hgher order polynomals beng 3 summed. For maxmum generalty, the partcular soluton wll assume that j = p. The maxmum order of Q s n + p snce the p th dervatve of Q reduces to a polynomal of degree n, whch s the same order as P. Ths also mples c u for u < p are zero snce they do not appear n the equaton and therefore are not determned by t. Consequently, Q(x) = n+p =0 c x where the constant coeffcents, c, are to be found. Snce dj Q = n+p j (+j)! j =0! c +j x, substtuton nto equaton 5 yelds m j=p b j n+p j =0 (+j)!! c +j x or more smply: j=p n+p j =0 a j c +jx Ths s due to the fact that as prevously noted, vectors ndexed by the dummy varable of the outer sum may be moved nto the nner sum. The product of (+j)!! and b j produces a j as prevously defned. Ths double summaton may be magned as summaton over the parallelogram of ntegers pctured (see fgure 1). The th row represents the th order term of the resultng polynomal on the left hand sde of the equaton. The unknown varable n queston s c. As Q s dfferentated, the c u coeffcents are pushed back to terms of lower degrees, ths means that f a c u n column h s on row t, n column 5
6 Fgure 1: Regon over whch the summaton takes place h + 1, that c u s on row t 1. Thus the components of c are on the dagonals pctured (see fgure 2). Regardless of m, p, or n, a p nc n+p s not summed wth any other coeffcent and thus solvng for c n+p s smple. It s the soluton to a p nc n+p = k n whch s c n+p = kn a. There are three p n possbltes for the rest of the summaton. These possbltes dep on shape of the regon over whch the summatons take place. If p = 0 and m n, the regon s trangular. If p = m, the regon s the rectangular strp of a m s wth s = 0... n. If otherwse, the regon s trapezodal. If p = m t s easy to see that the c u are solved n the same way as c n+p. For trangles and trapezods, even though there s a summaton takng place, the soluton for the thrd from last coeffcent deps on the last and second from last coeffcents. Ths s due to the fact that the dagonals dep on the same coeffcent. The trangular regon T may be seen to occur from = n + p m + 1 to n snce for less than that all terms of order p or more are beng summed. The rectangular regon R s thus n + p m f t exsts. The sum of a row n T that s t unts from the top s the sum of the p th term to the t th term from t and the sum of these coeffcents s the t th term from the leadng coeffcent of P. Mathematcally, ths equaton s a p c n+p t + t =1 ap+ c n+p t+ = k. As prevously dscussed, the c u n the summaton are already known; therefore wth algebra we may solve for c n+p t. That s, subtracton by the summaton and dvson by a p yelds c p+ = 1 (k a p t =1 ap+ c p++ ). The expresson for c u whos ndces are n R are smlar except that the upper ndex of the sum has no depence on t rather s fxed by the number of js from p such that p plus ths number s m. Ths s n T. Thus the c u may be determned recursvely by c p+ = 1 (k a p t =1 ap+ c p++ ) and c p+ = 1 (k a p n T =1 ap+ c p++ ). 6
7 Fgure 2: One-dmensonal subregons over whch u s constant 4.1 Applcaton to Equaton 2 A quck examnaton of order and vanshng coeffcents yelds that m = 2, n = 1, and p = 0. As a result, the leadng coeffcent of Q s c 1 and the regon over whch the summaton takes place s the trangular one pctured (see fgure 3). Snce c p+n = kn a p n and the leadng coeffcent of P s 5, c 1 = 5 a 0 1 b 0 = 3, a 0 1 = 1(3) = 3. By calculaton c 1 = 5 3. Snce c p+ = 1 a p c 0 = 1 (3 a 1 a 0( ). a0 0 = 3 and a 1 0 = 5 so therefore c 0 = 4 3 Q(x) = 5 3 x The soluton s the same as prevously shown. 5 Concluson. Snce a j = (+j)!! b j and (k t =1 ap+ c p++ ),. Combnng ths nformaton, The KMO method provdes a quck alternatve to solvng dfferental equatons by usng the formulas derved. Substtuton of parameters a, k and α nto the formulae quckly yeld the partcular soluton to equaton 4 n the form of a vector c. In ths sense KMO s a map κ : R m R n R = R m+n+1 R n+j. Furthermore, these formulae may be programed nto a computer wth fractonal arthmetc to obtan exact solutons. Included s the MATLAB code for κ wth trangular summaton regons. 6 Aknowledgements We would lke to thank Dr. Bell, our teacher, for hs support and encouragement. At the same tme, we would lke to thank our parents and the Heghts School for ther patence and generosty. 7
8 Fgure 3: Regon over whch the summaton takes place for equaton 2 References [1] W.E. Boyce, R.C. DPrma, Elementary Dfferental Equatons and Boundary Value Problems. John Wley and Sons, New York, 6th Edton, [2] A.B. Israel, R. Glbert, Computer Supported Calculus, Sprnger Wen, New York, [3] R.L. Devaney, A Frst Course n Chaotc Dynamcal Systems, Perseus Books, Boston, A MATLAB code for κ functon [ c ] = kappa(a, k, alpha) m = numel(a) - 1; n = numel(k) - 1; % calculate b b = zeros(1, m + 1); for =0:m for j=:m b(+1) = b(+1) + nchoosek(j,)*a(j+1)*(alphaˆ(j-)); % get j*, nt, and the order of Q jstar = fnd(b, 1, frst )-1; nt = m - jstar; c = zeros(1,n + jstar + 1); % calculate c 8
9 c(jstar + n + 1) = (1/(b(jstar + 1)*factoral(jstar + n))/factoral(n))*(k(n + 1)); for t=1:nt - 1 sum = 0; for =1:t; sum = sum + (c(jstar + n - t + + 1)*(b(jstar )* factoral(jstar + n - t + ))/factoral(n - t)); c(jstar + n - t + 1) = (1/(b(jstar + 1)*factoral(jstar + n -t))/factoral(n - t))* (k(n - t + 1)-sum); 9
Difference 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 informationThe KMO Method for Solving Non-homogenous, mth Order Differential Equations
Rose-Hulman Undergraduate Mathematics Journal Volume 15 Issue 1 Article 8 The KMO Method for Solving Non-homogenous, mth Order Differential Equations David Krohn University of Notre Dame Daniel Mariño-Johnson
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
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 informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
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 informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationQuantum Mechanics for Scientists and Engineers. David Miller
Quantum Mechancs for Scentsts and Engneers Davd Mller Types of lnear operators Types of lnear operators Blnear expanson of operators Blnear expanson of lnear operators We know that we can expand functons
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
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 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 informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
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 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 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 informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationModelli Clamfim Equazione del Calore Lezione ottobre 2014
CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
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 informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
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 informationImplicit Integration Henyey Method
Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationChapter 3 Differentiation and Integration
MEE07 Computer Modelng Technques n Engneerng Chapter Derentaton and Integraton Reerence: An Introducton to Numercal Computatons, nd edton, S. yakowtz and F. zdarovsky, Mawell/Macmllan, 990. Derentaton
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationEffects of Ignoring Correlations When Computing Sample Chi-Square. John W. Fowler February 26, 2012
Effects of Ignorng Correlatons When Computng Sample Ch-Square John W. Fowler February 6, 0 It can happen that ch-square must be computed for a sample whose elements are correlated to an unknown extent.
More informationLECTURE 9 CANONICAL CORRELATION ANALYSIS
LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of
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 informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
More informationSolution Thermodynamics
Soluton hermodynamcs usng Wagner Notaton by Stanley. Howard Department of aterals and etallurgcal Engneerng South Dakota School of nes and echnology Rapd Cty, SD 57701 January 7, 001 Soluton hermodynamcs
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
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 informationFrom Biot-Savart Law to Divergence of B (1)
From Bot-Savart Law to Dvergence of B (1) Let s prove that Bot-Savart gves us B (r ) = 0 for an arbtrary current densty. Frst take the dvergence of both sdes of Bot-Savart. The dervatve s wth respect to
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 informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationUnit 5: Quadratic Equations & Functions
Date Perod Unt 5: Quadratc Equatons & Functons DAY TOPIC 1 Modelng Data wth Quadratc Functons Factorng Quadratc Epressons 3 Solvng Quadratc Equatons 4 Comple Numbers Smplfcaton, Addton/Subtracton & Multplcaton
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationProfessor Terje Haukaas University of British Columbia, Vancouver The Q4 Element
Professor Terje Haukaas Unversty of Brtsh Columba, ancouver www.nrsk.ubc.ca The Q Element Ths document consders fnte elements that carry load only n ther plane. These elements are sometmes referred to
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 information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationWaveguides and resonant cavities
Wavegudes and resonant cavtes February 8, 014 Essentally, a wavegude s a conductng tube of unform cross-secton and a cavty s a wavegude wth end caps. The dmensons of the gude or cavty are chosen to transmt,
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationOpen Systems: Chemical Potential and Partial Molar Quantities Chemical Potential
Open Systems: Chemcal Potental and Partal Molar Quanttes Chemcal Potental For closed systems, we have derved the followng relatonshps: du = TdS pdv dh = TdS + Vdp da = SdT pdv dg = VdP SdT For open systems,
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More information12. The Hamilton-Jacobi Equation Michael Fowler
1. The Hamlton-Jacob Equaton Mchael Fowler Back to Confguraton Space We ve establshed that the acton, regarded as a functon of ts coordnate endponts and tme, satsfes ( ) ( ) S q, t / t+ H qpt,, = 0, and
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 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 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 informationWorkshop: Approximating energies and wave functions Quantum aspects of physical chemistry
Workshop: Approxmatng energes and wave functons Quantum aspects of physcal chemstry http://quantum.bu.edu/pltl/6/6.pdf Last updated Thursday, November 7, 25 7:9:5-5: Copyrght 25 Dan Dll (dan@bu.edu) Department
More informationSELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table:
SELECTED PROOFS DeMorgan s formulas: The frst one s clear from Venn dagram, or the followng truth table: A B A B A B Ā B Ā B T T T F F F F T F T F F T F F T T F T F F F F F T T T T The second one can be
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationCHAPTER 4. Vector Spaces
man 2007/2/16 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrel. Abstracton s what makes mathematcs work. Ian Stewart The man am of ths tet s to stud lnear
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 information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationComplex Numbers Alpha, Round 1 Test #123
Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationFundamental loop-current method using virtual voltage sources technique for special cases
Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,
More information7. Products and matrix elements
7. Products and matrx elements 1 7. Products and matrx elements Based on the propertes of group representatons, a number of useful results can be derved. Consder a vector space V wth an nner product ψ
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationwhere the sums are over the partcle labels. In general H = p2 2m + V s(r ) V j = V nt (jr, r j j) (5) where V s s the sngle-partcle potental and V nt
Physcs 543 Quantum Mechancs II Fall 998 Hartree-Fock and the Self-consstent Feld Varatonal Methods In the dscusson of statonary perturbaton theory, I mentoned brey the dea of varatonal approxmaton schemes.
More informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
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 informationCALCULUS CLASSROOM CAPSULES
CALCULUS CLASSROOM CAPSULES SESSION S86 Dr. Sham Alfred Rartan Valley Communty College salfred@rartanval.edu 38th AMATYC Annual Conference Jacksonvlle, Florda November 8-, 202 2 Calculus Classroom Capsules
More informationIntegrals and Invariants of Euler-Lagrange Equations
Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,
More informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
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 informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationDifferentiating Gaussian Processes
Dfferentatng Gaussan Processes Andrew McHutchon Aprl 17, 013 1 Frst Order Dervatve of the Posteror Mean The posteror mean of a GP s gven by, f = x, X KX, X 1 y x, X α 1 Only the x, X term depends on the
More informationShort running title: A generating function approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI
Short runnng ttle: A generatng functon approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI JASON FULMAN Abstract. A recent paper of Church, Ellenberg,
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More information