Quadratic Forms. Quadratic Forms

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Quadratic Forms. Quadratic Forms"

Transcription

1 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 nonliner functions with ffine functions: given nonliner function f : R n R, our pproximting function will e of the form + g( x), where g is liner function nd x = x x. For exmple, in the cse n = 1, if we wish to pproximte f ner point x in the domin of f, our pproximting function is f(x) + x, where the coefficient is f (x), the derivtive of f t x: f(x) plys the role of in the expression + g( x) ove, nd the liner function x i.e., f (x) x plys the role of g( x). In words, the ffine pproximtion of f ner x is the ffine function with (i) the sme vlue s f t x, nd (ii) the sme slope (the sme derivtive) s f t x. We re going to find tht it s importnt to pproximte nonliner functions not only with liner (ctully, ffine) functions, ut lso with qudrtic functions. For exmple, for rel function f : R R, our qudrtic pproximting function will e f(x) + f (x) x f (x)( x) 2. The qudrtic pproximtion is therefore the qudrtic function tht hs (i) the sme vlue s f t x, (ii) the sme slope (the sme derivtive) s f t x, nd (iii) the sme curvture (the sme second derivtive) s f t x. When we generlize from functions with the one-dimensionl domin R to multivrite functions, with domin R n, things get little it more complicted. The derivtive of function f : R n R t point x R n is no longer just numer, ut vector in R n specificlly, the grdient of f t x, which we write s f(x). And the qudrtic term in the qudrtic pproximtion to f is qudrtic form, which is defined y n n n mtrix H(x) the second derivtive of f t x. In these notes we re going to study qudrtic forms. Qudrtic Forms You lredy know tht qudrtic function (from R into R) is 2nd-degree polynomil, i.e., rel function f(x) = x 2 + x + c in which 0. If ech of the coefficients,, nd c is non-zero, then the function hs second-degree (qudrtic) term, first-degree (liner) term, nd zero-degree (constnt) term. However, qudrtic form is rel-vlued function on R n tht hs only seconddegree (qudrtic) terms. So qudrtic form on R (i.e., on R n, where n = 1) is function of the form f(x) = x 2 for some non-zero coefficient R. Wht out the cse n = 2? A qudrtic form on R 2 is function of the form f(x 1, x 2 ) = 11 x 1 x x 1 x x 2 x x 2 x 2, or equivlently, f(x 1, x 2 ) = 11 x ( )x 1 x x 2 2. Note tht in the second expression for f we comined the coefficients 12 nd 21 into their sum, so we cn lso write the sme function s f(x 1, x 2 ) = 11 x x 1x x 2 2, where 12 = , which is common wy to write qudrtic forms (ut without the prime). But for now we re going to use the first expression, writing the generic qudrtic form on R 2 s f(x 1, x 2 ) = 11 x 1 x x 1 x x 2 x x 2 x 2.

2 Note tht the generic qudrtic form on R 2 cn lso e s written f(x 1, x 2 ) = x 1 x x x 2. Moreover, without loss of generlity we cn ssume tht 12 = 21 for if 12 nd 21 re not equl, we cn write them insted s ã 12 nd ã 21 nd then define 12 = 21 = 1 2 (ã 12 +ã 21 ). Therefore the qudrtic forms on R 2 re precisely the functions f : R 2 R of the form f(x) = f(x 1, x 2 ) = x 1 x x x 2 = xax, where A is symmetric mtrix. Note: As in the expression xax ove, I m not going to indicte trnsposes of vectors in these Qudrtic Forms notes. The expression xax will lwys men tht the vector x R n is written s row vector if it s on the left of the mtrix nd s column vector if it s on the right, so tht xax is lwys well-defined nd its vlue is lwys rel numer. Before moving to the generl cse of R n, let s consider the cse of R 3. In this cse the generic qudrtic form is f(x 1, x 2, x 3 ) = 11 x 1 x x 2 x x 3 x x 1 x x 2 x x 1 x x 3 x x 2 x x 3 x 2, nd we cn ssume, s efore, tht 12 = 21, 13 = 31, nd 23 = 32. Therefore we cn write the qudrtic form s f(x) = f(x 1, x 2, x 3 ) = x 1 x 2 x x 1 x 2 = xax, where A is symmetric 3 3 mtrix x 3 Now it should e cler how we wnt to define the generl qudrtic form, on R n : Definition: A qudrtic form on R n is function f : R n R of the form f(x) = xax, where A is symmetric n n mtrix. One importnt property of qudrtic forms is immeditely ovious: Remrk: The vlue of qudrtic form t the vector 0 R n is zero. Becuse every qudrtic form corresponds to unique symmetric mtrix, we cn chrcterize vrious clsses of qudrtic forms completely in terms of properties of symmetric mtrices. For exmple, how cn we identify which qudrtic forms lwys hve nonnegtive vlues for every vector x R n? How cn we identify which ones re strictly concve functions? We nswer questions like these y identifying the properties of symmetric mtrices tht yield qudrtic forms with the desired properties. 2

3 Definiteness of Qudrtic Forms nd Mtrices We ended the preceding section y sking how we cn identify which qudrtic forms on R n lwys hve nonnegtive vlues, or which ones re strictly concve functions, etc. The pttern for generl n is foreshdowed y the simple cse n = 1, where the qudrtic forms re the functions f(x) = x 2. If > 0 this qudrtic form is positive for ll nonzero vlues of x, nd if < 0 the qudrtic form is negtive for ll nonzero vlues of x. Moreover, in the > 0 cse the function f( ) is strictly convex, nd when < 0 the function is strictly concve. Before trying to nlyze the generl cse of qudrtic forms on R n for ny n, let s spend some time studying the cse n = 2. Here the qudrtic form is f(x) = f(x 1, x 2 ) = x 1 x where A is symmetric mtrix. Let s rewrite the mtrix s the suscripts. So we hve f(x) = xax = x 1 x 2 c x 1 x 2 x 1 x 2 = xax, so we won t hve to del with c = x x 1 x 2 + cx 2 2. (1) Wht we wnt to know out this qudrtic form is whether its vlue is positive (or t lest nonnegtive) for ll vectors x 0; or whether it s negtive (or t lest non-positive) for ll x 0; or whether neither of these is true i.e., it s positive for some vectors nd negtive for others. If the first ( positive ) sttement is true, we sy the qudrtic form is positive definite; if ll we cn sy is tht it s non-negtive for ll nonzero vectors, we sy the qudrtic form is positive semi-definite. If the qudrtic form is negtive for ll x 0, we sy it s negtive definite; nd if we cn only sy it s non-positive for ll nonzero vectors, we sy it s negtive semi-definite. If the sign cn go either wy, we sy the qudrtic form is indefinite. We use the sme terms positive definite, etc. to descrie the mtrix A. Now let s see if we cn figure out some conditions on the mtrix A tht will tell us which definiteness property it hs nd therefore which property the qudrtic form xax hs. Certinly if = c = 0 then the qudrtic form in (1) is indefinite: x 1 x 2 > 0 for some vectors x, nd x 1 x 2 < 0 for other vectors x. In fct, if just one of the coefficients or c is zero, the qudrtic form is indefinite: for exmple, if = 0 then xax = 2x 1 x 2 + cx 2 2 = (2x 1 + cx 2 )x 2, so the sign of xax depends on the sign of 2x 1 + cx 2, which will clerly e positive for some vectors x nd negtive for others. So let s ssume tht oth 0 nd c 0. Now we cn use the trick of completing the squre to chnge this expression into sum of two squres, s follows: 3

4 xax = x x 1 x 2 + cx 2 2 = ( x x ) 1x 2 + cx x2 2 2 x2 2 = ( x x 1x ( 2) 2 ) 2 x2 + c x 2 2 = ( x 1 + x ) (c 2 )x 2 2 = ( x 1 + x ) A x2 2. Now it s cler tht if > 0 nd A > 0, then xax is positive definite: these two inequlities ensure tht the only wy oth terms in the sum cn e zero is if x 2 = 0 (to mke the second term zero), in which cse x 1 hs to e zero s well in order to mke the first term zero. Of course, > 0 nd A > 0 lso gurntee tht xax cn t e negtive for ny vector x, so xax is indeed positive definite. A prllel rgument shows tht xax is negtive definite if < 0 nd A > 0: in this cse the coefficient on the second term is negtive if nd only if nd A hve opposite signs. Notice tht lthough we ssumed tht nd c re oth nonzero, we didn t ctully use the fct tht c 0. However, one of the conditions for definiteness (positive or negtive) is tht A > 0, nd this requires tht c > 0 i.e., tht nd c hve the sme sign. Also note tht we could hve crried out the ove rgument with the roles of nd c reversed. Therefore, we hve the following theorem, where we revert to the nottion ij for the entries in the mtrix A: Theorem: A 2 2 symmetric mtrix A is positive definite if nd only if A > 0 nd either 11 > 0 or 22 > 0, which is equivlent to A > 0 nd oth 11 > 0 nd 22 > 0; negtive definite if nd only if A > 0 nd either 11 < 0 or 22 < 0, which is equivlent to A > 0 nd oth 11 < 0 nd 22 < 0. Wht re necessry nd sufficient conditions for the mtrix A nd the ssocited qudrtic form xax to e positive or negtive semidefinite? If A is positive semidefinite i.e., xax 0 for ll x 0 we clerly must hve 0 nd c 0. If either > 0 or c > 0, then we must hve A 0; nd if = c = 0, then we must hve = 0 s well, in which cse A = 0. Therefore the conditions 0, c 0, nd A 0 together must ll hold if A is positive semidefinite. Are these conditions lso sufficient? Suppose tht A 0. If = c = 0, then A 0 implies tht = 0, so tht A is the zero mtrix, nd xax = 0 for ll x R 2. And it s cler in the ove expression for xax tht if > 0 (or, symmetriclly, c > 0) nd lso A 0, then xax 0 for ll x 0. Therefore the conditions 0, c 0, nd A 0 re sufficient s well s necessry for A to e positive semidefinite. A prllel rgument provides the conditions for A to e negtive semidefinite, nd we hve the following theorem: Theorem: A 2 2 symmetric mtrix A is positive semidefinite if nd only if 11 0, 22 0, nd A 0; negtive semidefinite if nd only if 11 0, 22 0, nd A 0. 4

5 This pttern generlizes to R n for ritrry n s follows: first think of the components ij of the 2 2 mtrix A s 1 1 sumtrices of A; ecuse they re 1 1 we ll cll them order-1 sumtrices, nd we ll sy tht A itself, which is 2 2, is n order-2 sumtrix. For n n n mtrix A we ll sy tht sumtrix of order k consists of k of the rows nd k of the columns of A or we could equivlently sy tht n order-k sumtrix is formed y deleting n k rows nd columns. Now note tht in the 2 2 exmple, the conditions we developed involved only sumtrices on the digonl, 11 nd 22, s well s A. We could sy ech of these sumtrices ws formed y deleting the sme row nd column: for 11 we deleted the second row nd the second column; for 22 we deleted the first row nd column; for A itself we deleted no rows nd columns. Finlly, note tht the conditions in the 2 2 cse were conditions on the signs of the determinnts of these sumtrices. The following definition generlizes these ides to n n mtrices. Definition: Let A e n n n mtrix. For ech k = 1, 2,..., n n order-k principl sumtrix of A is k k mtrix formed y deleting the sme n k rows nd columns. The order-k sumtrices formed y deleting the lst n k rows nd columns re clled the leding principl sumtrices of A. The determinnt of sumtrix of A is clled minor of A. Therefore the leding principl sumtrices of 2 2 mtrix A re the mtrices 11 nd A itself; the leding principl minors re 11 nd A. The leding principl minors of 3 3 mtrix A re nd nd A The leding principl minors of 4 4 mtrix A re nd nd nd A. The generl versions of our 2 2 theorems re s follows: Theorem: An n n symmetric mtrix is positive definite if nd only if ll of its leding principl minors re positive, or equivlently, if nd only if ll of its principl minors re positive; negtive definite if nd only if ll of its order-k leding principl minors hve sign ( 1) k ; or equivlently, if nd only if ll of its order-k leding principl minors hve sign ( 1) k. Theorem: An n n symmetric mtrix is positive semidefinite if nd only if ll of its principl minors re non-negtive; negtive semidefinite if nd only if ll of its nonzero order-k principl minors hve sign ( 1) k. Corollry: An n n symmetric mtrix is indefinite if nd only if it hs oth negtive principl minor nd n order-k principl minor with sign ( 1) k+1. (Note tht these could oth e the sme principl minor, s in the following exmple.) 5

6 Exmple: In order tht the mtrix A e positive definite it s necessry nd sufficient tht the leding principl minors ll e positive. It therefore seems nturl to think tht the prllel result should hold for positive semidefiniteness: tht A is positive semidefinite if nd only if ll of its leding principl minors re nonnegtive. Here s counterexmple, which shows tht merely hving nonnegtive leding principl minors is not sufficient to ensure tht A is positive semidefinite: we need to consider ll the principl minors Let A = All three leding principl minors re either positive or zero: A 1 = 11 = 1, A 2 = 0 0 = 0, nd A 3 = A = 0. However, the order-2 non-leding principl minor = = 2, which is inconsistent with oth positive nd negtive semidefiniteness: it s negtive, which is inconsistent with positive semidefiniteness; nd its order is k = 2 nd its sign is 1 ( 1) k, which is inconsistent with negtive semidefiniteness. Note tht xax = x x x 1x 3. When x = (1, 0, 1), then xax = 7; when x = (1, 0, 1), then xax = 1; this verifies directly, without hving to consider principl minors, tht A is neither negtive semidefinite nor positive semidefinite i.e., tht it s indefinite. 6

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

Recitation 3: More Applications of the Derivative

Recitation 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 information

p-adic Egyptian Fractions

p-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 information

The Regulated and Riemann Integrals

The 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 information

Best Approximation in the 2-norm

Best Approximation in the 2-norm Jim Lmbers MAT 77 Fll Semester 1-11 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the -norm Suppose tht we wish to obtin function f n (x) tht is liner combintion

More information

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.

Here 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 information

Best Approximation. Chapter The General Case

Best 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 information

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 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 information

Math 1B, lecture 4: Error bounds for numerical methods

Math 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 information

Theoretical foundations of Gaussian quadrature

Theoretical 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 information

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24 Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the

More information

Lecture 3: Equivalence Relations

Lecture 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 information

Lecture 2e Orthogonal Complement (pages )

Lecture 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 information

Jim Lambers MAT 169 Fall Semester Lecture 4 Notes

Jim Lambers MAT 169 Fall Semester Lecture 4 Notes Jim Lmbers MAT 169 Fll Semester 2009-10 Lecture 4 Notes These notes correspond to Section 8.2 in the text. Series Wht is Series? An infinte series, usully referred to simply s series, is n sum of ll of

More information

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O 1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the

More information

ODE: Existence and Uniqueness of a Solution

ODE: 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 information

Section 3.2 Maximum Principle and Uniqueness

Section 3.2 Maximum Principle and Uniqueness Section 3. Mximum Principle nd Uniqueness Let u (x; y) e smooth solution in. Then the mximum vlue exists nd is nite. (x ; y ) ; i.e., M mx fu (x; y) j (x; y) in g Furthermore, this vlue cn e otined y point

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

Abstract inner product spaces

Abstract 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 information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, Lecture 15: Equations for Deterministic Automata Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

More information

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Math 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 information

Things to Memorize: A Partial List. January 27, 2017

Things 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 information

Linear Inequalities. Work Sheet 1

Linear Inequalities. Work Sheet 1 Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend

More information

MATH1050 Cauchy-Schwarz Inequality and Triangle Inequality

MATH1050 Cauchy-Schwarz Inequality and Triangle Inequality MATH050 Cuchy-Schwrz Inequlity nd Tringle Inequlity 0 Refer to the Hndout Qudrtic polynomils Definition (Asolute extrem for rel-vlued functions of one rel vrile) Let I e n intervl, nd h : D R e rel-vlued

More information

MORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)

MORE 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 information

How 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?

How 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 information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties 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 information

Review of Calculus, cont d

Review 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 information

Advanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015

Advanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015 Advnced Clculus: MATH 410 Uniform Convergence of Functions Professor Dvid Levermore 11 December 2015 12. Sequences of Functions We now explore two notions of wht it mens for sequence of functions {f n

More information

How 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?

How 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 information

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows: Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

Overview of Calculus I

Overview of Calculus I Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

Lecture 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 information

7.2 The Definite Integral

7.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 information

set is not closed under matrix [ multiplication, ] and does not form a group.

set 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 information

Lecture Solution of a System of Linear Equation

Lecture 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 information

2. VECTORS AND MATRICES IN 3 DIMENSIONS

2. VECTORS AND MATRICES IN 3 DIMENSIONS 2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the

More information

Linear Algebra 1A - solutions of ex.4

Linear 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 information

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature

CMDA 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 information

N 0 completions on partial matrices

N 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 information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate 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 information

1 Linear Least Squares

1 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 information

Chapter 3. Vector Spaces

Chapter 3. Vector Spaces 3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce

More information

MA Handout 2: Notation and Background Concepts from Analysis

MA Handout 2: Notation and Background Concepts from Analysis MA350059 Hndout 2: Nottion nd Bckground Concepts from Anlysis This hndout summrises some nottion we will use nd lso gives recp of some concepts from other units (MA20023: PDEs nd CM, MA20218: Anlysis 2A,

More information

HW3, Math 307. CSUF. Spring 2007.

HW3, 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 information

Improper Integrals, and Differential Equations

Improper 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 information

The 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 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 information

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.

Duality # 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 information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004 Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

More information

Module 6: LINEAR TRANSFORMATIONS

Module 6: LINEAR TRANSFORMATIONS Module 6: LINEAR TRANSFORMATIONS. Trnsformtions nd mtrices Trnsformtions re generliztions of functions. A vector x in some set S n is mpped into m nother vector y T( x). A trnsformtion is liner if, for

More information

Recitation 3: Applications of the Derivative. 1 Higher-Order Derivatives and their Applications

Recitation 3: Applications of the Derivative. 1 Higher-Order Derivatives and their Applications Mth 1c TA: Pdric Brtlett Recittion 3: Applictions of the Derivtive Week 3 Cltech 013 1 Higher-Order Derivtives nd their Applictions Another thing we could wnt to do with the derivtive, motivted by wht

More information

MA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.

MA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp. MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27-233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.

More information

CSCI 5525 Machine Learning

CSCI 5525 Machine Learning CSCI 555 Mchine Lerning Some Deini*ons Qudrtic Form : nn squre mtri R n n : n vector R n the qudrtic orm: It is sclr vlue. We oten implicitly ssume tht is symmetric since / / I we write it s the elements

More information

Elements of Matrix Algebra

Elements of Matrix Algebra Elements of Mtrix Algebr Klus Neusser Kurt Schmidheiny September 30, 2015 Contents 1 Definitions 2 2 Mtrix opertions 3 3 Rnk of Mtrix 5 4 Specil Functions of Qudrtic Mtrices 6 4.1 Trce of Mtrix.........................

More information

Geometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio.

Geometric 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 information

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER /2019

ACCESS 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 information

CHAPTER 2d. MATRICES

CHAPTER 2d. MATRICES CHPTER d. MTRICES University of Bhrin Deprtment of Civil nd rch. Engineering CEG -Numericl Methods in Civil Engineering Deprtment of Civil Engineering University of Bhrin Every squre mtrix hs ssocited

More information

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies

State 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 information

MATH 573 FINAL EXAM. May 30, 2007

MATH 573 FINAL EXAM. May 30, 2007 MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.

More information

UNIFORM 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 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 information

g i fφdx dx = x i i=1 is a Hilbert space. We shall, henceforth, abuse notation and write g i f(x) = f

g i fφdx dx = x i i=1 is a Hilbert space. We shall, henceforth, abuse notation and write g i f(x) = f 1. Appliction of functionl nlysis to PEs 1.1. Introduction. In this section we give little introduction to prtil differentil equtions. In prticulr we consider the problem u(x) = f(x) x, u(x) = x (1) where

More information

Chapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY

Chapter 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 information

2.4 Linear Inequalities and Interval Notation

2.4 Linear Inequalities and Interval Notation .4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or

More information

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors: Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )

More information

A 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. 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 information

Polynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230

Polynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230 Polynomil Approimtions for the Nturl Logrithm nd Arctngent Functions Mth 23 You recll from first semester clculus how one cn use the derivtive to find n eqution for the tngent line to function t given

More information

Matrices and Determinants

Matrices 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 information

Continuous Random Variables

Continuous 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 information

n f(x i ) x. i=1 In section 4.2, we defined the definite integral of f from x = a to x = b as n f(x i ) x; f(x) dx = lim i=1

n f(x i ) x. i=1 In section 4.2, we defined the definite integral of f from x = a to x = b as n f(x i ) x; f(x) dx = lim i=1 The Fundmentl Theorem of Clculus As we continue to study the re problem, let s think bck to wht we know bout computing res of regions enclosed by curves. If we wnt to find the re of the region below the

More information

Convex Sets and Functions

Convex Sets and Functions B Convex Sets nd Functions Definition B1 Let L, +, ) be rel liner spce nd let C be subset of L The set C is convex if, for ll x,y C nd ll [, 1], we hve 1 )x+y C In other words, every point on the line

More information

Chapter 14. Matrix Representations of Linear Transformations

Chapter 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 information

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

W. 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 information

ECON 331 Lecture Notes: Ch 4 and Ch 5

ECON 331 Lecture Notes: Ch 4 and Ch 5 Mtrix Algebr ECON 33 Lecture Notes: Ch 4 nd Ch 5. Gives us shorthnd wy of writing lrge system of equtions.. Allows us to test for the existnce of solutions to simultneous systems. 3. Allows us to solve

More information

MATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1

MATH34032: 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 information

20 MATHEMATICS POLYNOMIALS

20 MATHEMATICS POLYNOMIALS 0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of

More information

The Evaluation Theorem

The Evaluation Theorem These notes closely follow the presenttion of the mteril given in Jmes Stewrt s textook Clculus, Concepts nd Contexts (2nd edition) These notes re intended primrily for in-clss presenttion nd should not

More information

10. AREAS BETWEEN CURVES

10. AREAS BETWEEN CURVES . AREAS BETWEEN CURVES.. Ares etween curves So res ove the x-xis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in

More information

MTH 505: Number Theory Spring 2017

MTH 505: Number Theory Spring 2017 MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c

More information

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams

Chapter 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 information

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

REPRESENTATION THEORY OF PSL 2 (q)

REPRESENTATION THEORY OF PSL 2 (q) REPRESENTATION THEORY OF PSL (q) YAQIAO LI Following re notes from book [1]. The im is to show the qusirndomness of PSL (q), i.e., the group hs no low dimensionl representtion. 1. Representtion Theory

More information

Anti-derivatives/Indefinite Integrals of Basic Functions

Anti-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 information

Math 61CM - Solutions to homework 9

Math 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 information

Lecture 3. Limits of Functions and Continuity

Lecture 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 information

Math 231E, Lecture 33. Parametric Calculus

Math 231E, Lecture 33. Parametric Calculus Mth 31E, Lecture 33. Prmetric Clculus 1 Derivtives 1.1 First derivtive Now, let us sy tht we wnt the slope t point on prmetric curve. Recll the chin rule: which exists s long s /. = / / Exmple 1.1. Reconsider

More information

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac

ARITHMETIC 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 information

Taylor Polynomial Inequalities

Taylor Polynomial Inequalities Tylor Polynomil Inequlities Ben Glin September 17, 24 Abstrct There re instnces where we my wish to pproximte the vlue of complicted function round given point by constructing simpler function such s polynomil

More information

INTRODUCTION TO LINEAR ALGEBRA

INTRODUCTION TO LINEAR ALGEBRA ME Applied Mthemtics for Mechnicl Engineers INTRODUCTION TO INEAR AGEBRA Mtrices nd Vectors Prof. Dr. Bülent E. Pltin Spring Sections & / ME Applied Mthemtics for Mechnicl Engineers INTRODUCTION TO INEAR

More information

Polynomials and Division Theory

Polynomials and Division Theory Higher Checklist (Unit ) Higher Checklist (Unit ) Polynomils nd Division Theory Skill Achieved? Know tht polynomil (expression) is of the form: n x + n x n + n x n + + n x + x + 0 where the i R re the

More information

Riemann Sums and Riemann Integrals

Riemann 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 information

Riemann Sums and Riemann Integrals

Riemann 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 information

Math 4310 Solutions to homework 1 Due 9/1/16

Math 4310 Solutions to homework 1 Due 9/1/16 Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1

More information

Chapter 6 Techniques of Integration

Chapter 6 Techniques of Integration MA Techniques of Integrtion Asst.Prof.Dr.Suprnee Liswdi Chpter 6 Techniques of Integrtion Recll: Some importnt integrls tht we hve lernt so fr. Tle of Integrls n+ n d = + C n + e d = e + C ( n ) d = ln

More information

a a a a a a a a a a a a a a a a a a a a a a a a In this section, we introduce a general formula for computing determinants.

a a a a a a a a a a a a a a a a a a a a a a a a In this section, we introduce a general formula for computing determinants. Section 9 The Lplce Expnsion In the lst section, we defined the determinnt of (3 3) mtrix A 12 to be 22 12 21 22 2231 22 12 21. In this section, we introduce generl formul for computing determinnts. Rewriting

More information

Rudimentary Matrix Algebra

Rudimentary Matrix Algebra Rudimentry Mtrix Alger Mrk Sullivn Decemer 4, 217 i Contents 1 Preliminries 1 1.1 Why does this document exist?.................... 1 1.2 Why does nyone cre out mtrices?................ 1 1.3 Wht is mtrix?...........................

More information