Lecture Note 9: Orthogonal Reduction
|
|
- Abel Booth
- 5 years ago
- Views:
Transcription
1 MATH : Computtionl Methods of Liner Algebr 1 The Row Echelon Form Lecture Note 9: Orthogonl Reduction Our trget is to solve the norml eution: Xinyi Zeng Deprtment of Mthemticl Sciences, UTEP A t Ax = A t b, (11) where A R m n is rbitrry; we hve shown previously tht this is euivlent to the lest sures problem: min xrn Ax b (1) A first observtion we cn mke is tht (11) seems fmilir! As A t A R n n is symmetric semi-positive definite, we cn try to compute the Cholesky decomposition such tht A t A = L t L for some lower-tringulr mtrix L R n n One problem with this pproch is tht we re not fully exploring our informtion, prticulrly in Cholesky decomposition we tret A t A s single entity in ignornce of the informtion bout A itself Prticulrly, the structure A t A motivtes us to study fctoriztion A = QE, whereq R m m is orthogonl nd E R m n is to be determined Then we my trnsform the norml eution to: E t Ex = E t Q t b, (1) where the identity Q t Q = I m (the identity mtrix in R m m ) is used euivlent to the lest sures problem with E: This norml eution is min Ex Qt b (1) xr n Becuse orthogonl trnsformtion preserves the L -norm, (1) nd (1) re euivlent to ech other Indeed, for ny x R n : Ax b =(b Ax) t (b Ax)=(b QEx) t (b QEx)=[Q(Q t b Ex)] t [Q(Q t b Ex)] =(Q t b Ex) t Q t Q(Q t b Ex)=(Q t b Ex) t (Q t b Ex)= Ex Q t b Hence the trget is to find n E such tht (1) is esier to solve Motivted by the Cholesky decomposition, we d like to find n E with structure similr to the upper-tringulr mtrices To this end, we sy tht E R m n is of the row echelon form defined below Definition 1 Let E =[e ij ] R m n be rbitrry, we define for ech row number 1 pple i pple m positive number n i such tht e ini = nd e ij = for ll j<n i If the entire i-th row is zero, we set n i =n+1 Then the mtrix E is sid to hve the row echelon form if nd only if the seuence {n 1,n,,n m } is strictly incresing until it reches nd stys t the vlue n+1 1
2 Grphiclly, such mtrix looks like: E = (1) We will see tht for mtrix of row echelon form, the lest sures problem (1) is esy to solve Let d = Q t b, then the residul vector is given by: e 1n1 x n1 +e 1,n1 +1x n e 1n x n d 1 e n x n +e,n +1x n e n x n d Ex d = e lnl x nl +e l,nl +1x nl e ln x n d l, d l+1 d m where l is the lst non-zero row of E Note tht except for the first term, ll other components of the residul re independent of x n1 ;hencewemusthve: 1 x n1 = 1 nx e 1j x j A (1) e 1n1 j=n 1 +1 Similrly, if l wehvee n = nd we deduce: x n = e n 1 nx e j x j A (1) j=n +1 We cn continue on, nd eventully rech for ll 1 pple k pple l: 1 x nk = 1 k e kj x j A (18) e knk j=n k +1 Hence the solution to the lest sures problem (1) cn be computed s follows: 1 Choose x i, i/{n 1,,n l } rbitrrily (for exmple, zero) Use (18) to compute x nl, x nl 1,, x n1 recursively Menwhile, we reduce the problem to find fctoriztion A = QE such tht Q is orthogonl nd E is of the row echelon form
3 Givens Rottion A bsic tool to find the fctoriztion A = QE is to use Givens rottions Let us consider simple exmple in R : y Gx y x O x x Figure 1: Rottion by in R Prticulrly, we wnt to rotte vector x =[x, y] t by n ngle counter-clockwise to new vector Gx =[x,y ] t According to Figure 1, we ssume: x = rcos, y= rsin, where r = x = Gx Then the two coordintes of Gx re given by: x = rcos( + )=r(cos cos sin sin ) = cos x sin y, y = rsin( + )=r(sin cos +cos sin ) = cos y+sin x Thus we conclude tht the rottion mtrix G is defined: pple cos sin G = sin cos (1) In multiple dimensions, we consider the rottions tht keep ll but two coordintes constnt In R, these opertions re those rotte bout one of the three xises Prticulrly, let the indices for the two modified coordintes be i nd j, then the rottion by n ngle is euivlent to pre-multipliction with the Givens mtrix G i,j ( ) 1 cos( ) sin( ) G i,j ( )= () sin( ) cos( ) 1 All Givens mtrices re orthogonl
4 Orthogonl Reduction by Givens Rottions The ide here is to pply seuence of Givens rottions to the left of A so tht the ltter is trnsformed into the row echelon form We ve lerned from the process of Gussin elimintion tht left multipliction indictes row mnipultions; nd we see more fmilirities between the orthogonl reduction procedure here nd the Gussin elimintion Tht is, the lst elements of column of A re trnsformed to zeroes by row opertions The tool of choice is lower-tringulr mtrices for the Gussin elimintion, wheres it is orthogonl mtrices (or more specificlly the product of seuence of Givens mtrices) in the current sitution First we look t the product G 1, ( )A, where is number to be determined Denote the i-th row of A by t i,1pple i pple m, nd we denote the i-th column of generic mtrix M by [M] i,then: cos t 1 sin t sin t 1 +cos t G 1, ( )A = t t m cos 11 sin 1 sin 11 +cos 1 ) [G 1, ( )A] 1 = 1 Note tht ll the rows except for the first two ones re not chnged t ll We my choose such tht sin 11 +cos 1 =, or euivlently: 1 = rctn, (1) nd the (,1)-element of G 1, ( )A becomes zero The dvntge of the Givens trnsformtion over the Gussin elimintion is tht (1) is well-defined even when 11 =, in which cse = / nd G 1, ( ) cn still be computed We shll denote this prticulr Givens mtrix by G (1) 1, Another fct we notice fter the rottion is tht the L -norm of the first column of A is not chnged Prticulrly, note tht if =, there is: 11 m1 sin = p 1, cos = p 11 ; nd we hve: [A] 1! [G (1) 1, A] 1 is given by m1 p ! 1 m1 It is esy to check tht in the specil sitution =, the previous sttement remins true Preserving the L -norm of the first column vector is ctully true for ll (nd cn be derived from the L -norm preserving property of ny orthogonl mtrix); nd prticulrly we see tht the
5 L -norm of ll the column vectors of A remin the sme fter A! G (1) 1, A Next, we construct Givens mtrix G (1) 1, tht will mke the (,1)-element of G(1) 1, A zero: p [A] 1! [G (1) 1, G(1) 1, A] 1 is given by m1! 1 m1 The mtrix G (1) 1, is given by: G (1) 1, = G 1,( ), where = rctn 1 p ! As we continue, ll the remining non-zeroes in the first column of A cn be eliminted Eventully we obtin seuence of Givens mtrices nd define their product s G 1 : G 1 = G (1) 1,m G(1) 1,m 1 G(1) 1,, () so tht: [A] 1! [G 1 A] 1 is given by 11 1 m1 p m1! Let us denote A (1) = G 1 A, then the first column of A (1) is exctly wht we wnt for E; nd if (1) 11 = p m1 =, we hve n 1 = 1 The next step is to use Givens rottions to eliminte s mny non-zeroes elements of the second column of A (1) s possible If (1) 11 =, this process is the sme s wht we did before for the first column of A; butif (1) 11 =, we wnt to leve the first row of A(1) untouched! Prticulrly, we construct seuence of Givens mtrices nd define G s their products: ( G (),m G = G(),m 1 G(),, if (1) 11 =; G () 1,m G() 1,m 1 G() 1,, if (1) 11 = ()
6 such tht: [A (1) ]! [G A (1) ] is given by or (1) 1 () () (m) m (1) 1 () (m) m!! (1) 1 ( (1) ) +( (1) ) + +( (1) m ) ( (1) 1 ) +( (1) ) + +( (1) m ), if (1) 11 =;, if (1) 11 = Continuing this process, we obtin orthogonl m m mtrices G 1, G,, nd G n such tht: G n G n 1 G 1 A = E, () where E is of the row echelon form Defining Q=(G n G n 1 G 1 ) t we obtin the desired fctoriztion A = QE Now we write down the lgorithm rigorously in Algorithm 1 Here we use n integer p to keep trck of the row number, below which the non-zero entries re trnsformed to zero Algorithm 1 Orthogonl Reduction by Givens Rottions 1: Set p = 1 nd Q = I m : for i =1,,,n do : for j = p+1,p+,,m do : if ji = then : Continue : end if : Compute = rctn( ji / pi ) 8: Compute A G p,j ( )A 9: Compute Q QG p,j ( ) t 1: end for 11: if pi!= then 1: Set p p+1 1: end if 1: end for At the end of the lgorithm, the mtrix A is trnsformed into the row echelon form E Note tht in the line, we do not hve to ctully compute from line nd form the mtrix G p,j ( ) but insted compute nd store: c pj = pi ji + pi, s pj = ji ji + pi ;
7 nd then compute for A: jk c pj jk s pj pk pk s pj jk +c pj jk, k= i,i+1,,n () Similrly for the line, if the mtrix Q is not explicitly needed immeditely, ll we need to do is to keep trck of ll pirs c pj nd s pj so tht Q cn be reconstructed lter Anlysis of Algorithm 1 The preceding fctoriztion is more robust thn the Gussin elimintion becuse we cn obtin n prioriestimte on ll the components tht my pper during the orthogonliztion process In prticulr, whenever we pply the Givens rottion, the L -norm of the column vectors re not chnged; hence we hve: v mx mx e ji = u mx ji ) e ki pplet ji, j=1 j=1 for ll i =1,,n nd k =1,,m Next, we study the complexity of Algorithm 1 Note tht in the outer loop, no computtion ctully tkes plce if p is not incresed t ll Thus the mximum possible computtionl cost includes r =min(m,n) inner loops, which correspond to the vlue of p s p = 1, p =,, p = r, respectively For given such p, the inner loop hs m p itertions Ech itertion contins (we tke the pproch without computing explicitly) five flops nd one sure root opertion to compute c pj nd s pj The opertions () re thusly completed with (n i+1) flops Note tht we lwys hve i p, the totl number of flops is thusly bounded s: j=1 rx mx (+(n p=1j=p+1 rx mx i+1)) pple (+(n p+1)) = p=1j=p+1 rx [(n p)(m p)+11(m p)] mr(n r)+nr(m r)+r p=1 Finlly, we improve the lgorithm 1 in computer science considertions Looking t ech outer loop, sy the first one, we strt to work on the row 1 nd row, then on the row 1 nd row, nd finlly move on to row 1 nd row m The objective is to rotte ll the non-zero entries of the first column of A to the first element If we tke into memory storge into ccount, it is usul prctice to store the elements of mtrix A row by row (this cn be true for both full mtrices nd sprse mtrices); hence we re motivted to operte on djcent rows s often s possible in order to improve the bndwidth usge nd reduce cche misses Such considertion results in roll-bck lgorithm to eliminte the non-zeros we first work on the lst two rows nd mke the m-th element zero, then Givens rottion is pplied to the rows m nd m 1 to mke the (m 1)-th element zero, nd finlly we rech the top of the column This modifiction is reflected in Algorithm 1 Note tht we lso incorporte the computtions of c s nd s s insted of in this modified version
8 Algorithm 1 Orthogonl Reduction by Givens Rottions (Modified) 1: Set p = 1 nd Q = I m : for i =1,,,n do : for j = m,m 1,,p+1 do : if ji = then : Continue : end if : Compute c j 1,j = j 1,i / ji + j 1,i nd s j 1,j = ji / ji + j 1,i 8: Compute A G j 1,j ( )A 9: Compute Q QG j 1,j ( ) t 1: end for 11: if pi!= then 1: Set p p+1 1: end if 1: end for 8
Numerical Linear Algebra Assignment 008
Numericl Liner Algebr Assignment 008 Nguyen Qun B Hong Students t Fculty of Mth nd Computer Science, Ho Chi Minh University of Science, Vietnm emil. nguyenqunbhong@gmil.com blog. http://hongnguyenqunb.wordpress.com
More information1 Linear Least Squares
Lest Squres Pge 1 1 Liner Lest Squres I will try to be consistent in nottion, with n being the number of dt points, nd m < n being the number of prmeters in model function. We re interested in solving
More informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More informationThe Islamic University of Gaza Faculty of Engineering Civil Engineering Department. Numerical Analysis ECIV Chapter 11
The Islmic University of Gz Fculty of Engineering Civil Engineering Deprtment Numericl Anlysis ECIV 6 Chpter Specil Mtrices nd Guss-Siedel Associte Prof Mzen Abultyef Civil Engineering Deprtment, The Islmic
More informationMath 61CM - Solutions to homework 9
Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ
More informationHere we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.
Section 24 Nonsingulr Liner Systems Here we study squre liner systems nd properties of their coefficient mtrices s they relte to the solution set of the liner system Let A be n n Then we know from previous
More informationODE: Existence and Uniqueness of a Solution
Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =
More informationLecture 19: Continuous Least Squares Approximation
Lecture 19: Continuous Lest Squres Approximtion 33 Continuous lest squres pproximtion We begn 31 with the problem of pproximting some f C[, b] with polynomil p P n t the discrete points x, x 1,, x m for
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationf(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral
Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one
More informationCMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature
CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationHW3, Math 307. CSUF. Spring 2007.
HW, Mth 7. CSUF. Spring 7. Nsser M. Abbsi Spring 7 Compiled on November 5, 8 t 8:8m public Contents Section.6, problem Section.6, problem Section.6, problem 5 Section.6, problem 7 6 5 Section.6, problem
More informationN 0 completions on partial matrices
N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver
More informationMatrix Solution to Linear Equations and Markov Chains
Trding Systems nd Methods, Fifth Edition By Perry J. Kufmn Copyright 2005, 2013 by Perry J. Kufmn APPENDIX 2 Mtrix Solution to Liner Equtions nd Mrkov Chins DIRECT SOLUTION AND CONVERGENCE METHOD Before
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationGeometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio.
Geometric Sequences Geometric Sequence sequence whose consecutive terms hve common rtio. Geometric Sequence A sequence is geometric if the rtios of consecutive terms re the sme. 2 3 4... 2 3 The number
More informationA recursive construction of efficiently decodable list-disjunct matrices
CSE 709: Compressed Sensing nd Group Testing. Prt I Lecturers: Hung Q. Ngo nd Atri Rudr SUNY t Bufflo, Fll 2011 Lst updte: October 13, 2011 A recursive construction of efficiently decodble list-disjunct
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationBest Approximation. Chapter The General Case
Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given
More informationIntroduction to Group Theory
Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements
More informationThe First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).
The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples
More informationMatrices, Moments and Quadrature, cont d
Jim Lmbers MAT 285 Summer Session 2015-16 Lecture 2 Notes Mtrices, Moments nd Qudrture, cont d We hve described how Jcobi mtrices cn be used to compute nodes nd weights for Gussin qudrture rules for generl
More informationMath 360: A primitive integral and elementary functions
Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationMatrix Eigenvalues and Eigenvectors September 13, 2017
Mtri Eigenvlues nd Eigenvectors September, 7 Mtri Eigenvlues nd Eigenvectors Lrry Cretto Mechnicl Engineering 5A Seminr in Engineering Anlysis September, 7 Outline Review lst lecture Definition of eigenvlues
More informationLinear Algebra 1A - solutions of ex.4
Liner Algebr A - solutions of ex.4 For ech of the following, nd the inverse mtrix (mtritz hofkhit if it exists - ( 6 6 A, B (, C 3, D, 4 4 ( E i, F (inverse over C for F. i Also, pick n invertible mtrix
More informationDEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS
3 DEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS This chpter summrizes few properties of Cli ord Algebr nd describe its usefulness in e ecting vector rottions. 3.1 De nition of Associtive
More information1 Online Learning and Regret Minimization
2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in
More informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
More informationODE: Existence and Uniqueness of a Solution
Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry dierentil eqution (ODE) du f(t) dt with initil condition u() : Just
More information1 The Lagrange interpolation formula
Notes on Qudrture 1 The Lgrnge interpoltion formul We briefly recll the Lgrnge interpoltion formul. The strting point is collection of N + 1 rel points (x 0, y 0 ), (x 1, y 1 ),..., (x N, y N ), with x
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1
MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further
More informationChapter 3 Polynomials
Dr M DRAIEF As described in the introduction of Chpter 1, pplictions of solving liner equtions rise in number of different settings In prticulr, we will in this chpter focus on the problem of modelling
More informationapproaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below
. Eponentil nd rithmic functions.1 Eponentil Functions A function of the form f() =, > 0, 1 is clled n eponentil function. Its domin is the set of ll rel f ( 1) numbers. For n eponentil function f we hve.
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationMATRICES AND VECTORS SPACE
MATRICES AND VECTORS SPACE MATRICES AND MATRIX OPERATIONS SYSTEM OF LINEAR EQUATIONS DETERMINANTS VECTORS IN -SPACE AND -SPACE GENERAL VECTOR SPACES INNER PRODUCT SPACES EIGENVALUES, EIGENVECTORS LINEAR
More informationEngineering Analysis ENG 3420 Fall Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00
Engineering Anlysis ENG 3420 Fll 2009 Dn C. Mrinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00 Lecture 13 Lst time: Problem solving in preprtion for the quiz Liner Algebr Concepts Vector Spces,
More informationMath 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 2-5pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of
More informationHandout: Natural deduction for first order logic
MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes
More informationMath 270A: Numerical Linear Algebra
Mth 70A: Numericl Liner Algebr Instructor: Michel Holst Fll Qurter 014 Homework Assignment #3 Due Give to TA t lest few dys before finl if you wnt feedbck. Exercise 3.1. (The Bsic Liner Method for Liner
More informationSection 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
More information1 Probability Density Functions
Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationMORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
More informationLecture 3. Limits of Functions and Continuity
Lecture 3 Limits of Functions nd Continuity Audrey Terrs April 26, 21 1 Limits of Functions Notes I m skipping the lst section of Chpter 6 of Lng; the section bout open nd closed sets We cn probbly live
More informationThe Algebra (al-jabr) of Matrices
Section : Mtri lgebr nd Clculus Wshkewicz College of Engineering he lgebr (l-jbr) of Mtrices lgebr s brnch of mthemtics is much broder thn elementry lgebr ll of us studied in our high school dys. In sense
More informationMath 426: Probability Final Exam Practice
Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationc n φ n (x), 0 < x < L, (1) n=1
SECTION : Fourier Series. MATH4. In section 4, we will study method clled Seprtion of Vribles for finding exct solutions to certin clss of prtil differentil equtions (PDEs. To do this, it will be necessry
More information4.4 Areas, Integrals and Antiderivatives
. res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order
More informationThings to Memorize: A Partial List. January 27, 2017
Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors - Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved
More informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
More informationContinuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht
More information4.5 JACOBI ITERATION FOR FINDING EIGENVALUES OF A REAL SYMMETRIC MATRIX. be a real symmetric matrix. ; (where we choose θ π for.
4.5 JACOBI ITERATION FOR FINDING EIGENVALUES OF A REAL SYMMETRIC MATRIX Some reliminries: Let A be rel symmetric mtrix. Let Cos θ ; (where we choose θ π for Cos θ 4 purposes of convergence of the scheme)
More informationReview of basic calculus
Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below
More information19 Optimal behavior: Game theory
Intro. to Artificil Intelligence: Dle Schuurmns, Relu Ptrscu 1 19 Optiml behvior: Gme theory Adversril stte dynmics hve to ccount for worst cse Compute policy π : S A tht mximizes minimum rewrd Let S (,
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationContents. Outline. Structured Rank Matrices Lecture 2: The theorem Proofs Examples related to structured ranks References. Structure Transport
Contents Structured Rnk Mtrices Lecture 2: Mrc Vn Brel nd Rf Vndebril Dept. of Computer Science, K.U.Leuven, Belgium Chemnitz, Germny, 26-30 September 2011 1 Exmples relted to structured rnks 2 2 / 26
More informationChapter 2. Determinants
Chpter Determinnts The Determinnt Function Recll tht the X mtrix A c b d is invertible if d-bc0. The expression d-bc occurs so frequently tht it hs nme; it is clled the determinnt of the mtrix A nd is
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationMath 33A Discussion Example Austin Christian October 23, Example 1. Consider tiling the plane by equilateral triangles, as below.
Mth 33A Discussion Exmple Austin Christin October 3 6 Exmple Consider tiling the plne by equilterl tringles s below Let v nd w be the ornge nd green vectors in this figure respectively nd let {v w} be
More informationARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac
REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b
More informationTHE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p
THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ
More informationMatrices and Determinants
Nme Chpter 8 Mtrices nd Determinnts Section 8.1 Mtrices nd Systems of Equtions Objective: In this lesson you lerned how to use mtrices, Gussin elimintion, nd Guss-Jordn elimintion to solve systems of liner
More informationElementary Linear Algebra
Elementry Liner Algebr Anton & Rorres, 1 th Edition Lecture Set 5 Chpter 4: Prt II Generl Vector Spces 163 คณ ตศาสตร ว ศวกรรม 3 สาขาว ชาว ศวกรรมคอมพ วเตอร ป การศ กษา 1/2555 163 คณตศาสตรวศวกรรม 3 สาขาวชาวศวกรรมคอมพวเตอร
More informationImproper Integrals. Type I Improper Integrals How do we evaluate an integral such as
Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph
More informationWeek 10: Line Integrals
Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.
More informationLecture Solution of a System of Linear Equation
ChE Lecture Notes, Dept. of Chemicl Engineering, Univ. of TN, Knoville - D. Keffer, 5/9/98 (updted /) Lecture 8- - Solution of System of Liner Eqution 8. Why is it importnt to e le to solve system of liner
More informationAnti-derivatives/Indefinite Integrals of Basic Functions
Anti-derivtives/Indefinite Integrls of Bsic Functions Power Rule: In prticulr, this mens tht x n+ x n n + + C, dx = ln x + C, if n if n = x 0 dx = dx = dx = x + C nd x (lthough you won t use the second
More informationAbstract inner product spaces
WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the
More informationIndefinite Integral. Chapter Integration - reverse of differentiation
Chpter Indefinite Integrl Most of the mthemticl opertions hve inverse opertions. The inverse opertion of differentition is clled integrtion. For exmple, describing process t the given moment knowing the
More informationChapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY
Chpter 3 MTRIX In this chpter: Definition nd terms Specil Mtrices Mtrix Opertion: Trnspose, Equlity, Sum, Difference, Sclr Multipliction, Mtrix Multipliction, Determinnt, Inverse ppliction of Mtrix in
More informationSection 14.3 Arc Length and Curvature
Section 4.3 Arc Length nd Curvture Clculus on Curves in Spce In this section, we ly the foundtions for describing the movement of n object in spce.. Vector Function Bsics In Clc, formul for rc length in
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More information5.7 Improper Integrals
458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.
More information1 The Riemann Integral
The Riemnn Integrl. An exmple leding to the notion of integrl (res) We know how to find (i.e. define) the re of rectngle (bse height), tringle ( (sum of res of tringles). But how do we find/define n re
More information8 Laplace s Method and Local Limit Theorems
8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER /2019
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS MATH00030 SEMESTER 208/209 DR. ANTHONY BROWN 7.. Introduction to Integrtion. 7. Integrl Clculus As ws the cse with the chpter on differentil
More information1 Sets Functions and Relations Mathematical Induction Equivalence of Sets and Countability The Real Numbers...
Contents 1 Sets 1 1.1 Functions nd Reltions....................... 3 1.2 Mthemticl Induction....................... 5 1.3 Equivlence of Sets nd Countbility................ 6 1.4 The Rel Numbers..........................
More informationLecture notes. Fundamental inequalities: techniques and applications
Lecture notes Fundmentl inequlities: techniques nd pplictions Mnh Hong Duong Mthemtics Institute, University of Wrwick Emil: m.h.duong@wrwick.c.uk Februry 8, 207 2 Abstrct Inequlities re ubiquitous in
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More informationNOTES ON HILBERT SPACE
NOTES ON HILBERT SPACE 1 DEFINITION: by Prof C-I Tn Deprtment of Physics Brown University A Hilbert spce is n inner product spce which, s metric spce, is complete We will not present n exhustive mthemticl
More informationLecture 2e Orthogonal Complement (pages )
Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process
More informationProperties of the Riemann Integral
Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University Februry 15, 2018 Outline 1 Some Infimum nd Supremum Properties 2
More information