DOCSLIB.ORG

Lecture Notes for Linear Algebra

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lecture Notes for Linear Algebra Lecture Notes for Linear Algebra James S. Cook Liberty University Department of Mathematics and Physics Fall 2009 2 introduction and motivations for these notes These notes should cover what is said in lecture at a minimum. However, I’m still learning so I may have a new thought or two in the middle of the semester, especially if there are interesting questions. We will have a number of short quizzes and the solutions and/or commentary about those is not in these notes for the most part. It is thus important that you never miss class. The text is good, but it does not quite fit the lecture plan this semester. I probably would have changed it if I realized earlier but alas it is too late. Fortunately, these notes are for all intents and purposes a text for the course. But, these notes lack exercises, hence the required text. The text does have a good assortment of exercises but please bear in mind that the ordering of the exercises assigned matches my lecture plan for the course and not the text’s. Finally, there are a couple topics missing from the text which we will cover and I will write up some standard homework problems for those sections. As usual there are many things in lecture which you will not really understand until later. I will regularly give quizzes on the material we covered in previous lectures. I expect you to keep up with the course. Procrastinating until the test to study will not work in this course. The difficulty and predictability of upcoming quizzes will be a function of how I percieve the class is following along. Doing the homework is doing the course. I cannot overemphasize the importance of thinking through the homework. I would be happy if you left this course with a working knowledge of: ✓ how to solve a system of linear equations ✓ Gaussian Elimination and how to interpret the rref (A) ✓ concrete and abstract matrix calculations ✓ determinants ✓ real vector spaces both abstract and concrete ✓ subspaces of vector space ✓ how to test for linear independence ✓ how to prove a set spans a space ✓ coordinates and bases ✓ column, row and null spaces for a matrix ✓ basis of an abstract vector space ✓ linear transformations 3 ✓ matrix of linear transformation ✓ change of basis on vector space ✓ geometry of Euclidean Space ✓ orthogonal bases and the Gram-Schmidt algorthim ✓ least squares fitting of experimental data ✓ best fit trigonmetric polynomials (Fourier Analysis) ✓ Eigenvalues and Eigenvectors ✓ Diagonalization ✓ how to solve a system of linear differential equations ✓ principle axis theorems for conic sections and quadric surfaces I hope that I have struck a fair balance between pure theory and application. The treatment of systems of differential equations is somewhat unusual for a first course in linear algebra. No apolo- gies though, I love the example because it shows nontrivial applications of a large swath of the theory in the course while at the same time treating problems that are simply impossible to solve without theory. Generally speaking, I tried to spread out the applications so that if you hate the theoretical part then there is still something fun in every chapter. If you don’t like the applications then you’ll just have to deal (as my little sister says) Before we begin, I should warn you that I assume quite a few things from the reader. These notes are intended for someone who has already grappled with the problem of constructing proofs. I assume you know the difference between ⇒ and ⇔. I assume the phrase ”iff” is known to you. I assume you are ready and willing to do a proof by induction, strong or weak. I assume you know what ℝ, ℂ, ℚ, ℕ and ℤ denote. I assume you know what a subset of a set is. I assume you know how to prove two sets are equal. I assume you are familar with basic set operations such as union and intersection (although we don’t use those much). More importantly, I assume you have started to appreciate that mathematics is more than just calculations. Calculations without context, without theory, are doomed to failure. At a minimum theory and proper mathematics allows you to communicate analytical concepts to other like-educated individuals. Some of the most seemingly basic objects in mathematics are insidiously complex. We’ve been taught they’re simple since our childhood, but as adults, mathematical adults, we find the actual definitions of such objects as ℝ or ℂ are rather involved. I will not attempt to provide foundational arguments to build numbers from basic set theory. I believe it is possible, I think it’s well-thought- out mathematics, but we take the existence of the real numbers as an axiom for these notes. We assume that ℝ exists and that the real numbers possess all their usual properties. In fact, I assume ℝ, ℂ, ℚ, ℕ and ℤ all exist complete with their standard properties. In short, I assume we have numbers to work with. We leave the rigorization of numbers to a different course. 4 Contents 1 Gauss-Jordon elimination 9 1.1 systems of linear equations . 9 1.2 Gauss-Jordon algorithm . 13 1.3 classification of solutions . 18 1.4 applications to curve fitting and circuits . 23 1.5 conclusions ........................................ 27 2 matrix arithmetic 29 2.1 basic terminology and notation . 29 2.2 addition and multiplication by scalars . 31 2.3 matrixmultiplication................................ 33 2.4 elementarymatrices ................................. 38 2.5 invertiblematrices ................................ 40 2.6 systems of linear equations revisited . 44 2.6.1 concatenation for solving many systems at once . 45 2.7 how to calculate the inverse of a matrix . 46 2.8 all your base are belong to us ( ei and Eij thatis).................... 47 2.9 matriceswithnames .................................. 51 2.9.1 symmetric and antisymmetric matrices . 52 2.9.2 exponent laws for matrices . 54 2.9.3 diagonal and triangular matrices . 55 2.10 applications . 57 2.11conclusions ........................................ 60 3 determinants 61 3.1 determinants and geometry . 61 3.2 cofactor expansion for the determinant . 63 3.3 adjointmatrix....................................... 69 3.4 Kramer’sRule ...................................... 71 3.5 propertiesofdeterminants. 73 3.6 examplesofdeterminants .............................. 78 3.7 applications........................................ 80 5 6 CONTENTS 3.8 conclusions ........................................ 82 4 linear algebra 83 4.1 definitionandexamples ................................ 84 4.2 subspaces ......................................... 87 4.3 spanningsetsandsubspaces. 90 4.4 linearindependence................................ 98 4.5 basesanddimension ................................... 106 4.5.1 how to calculate a basis for a span of row or column vectors . 109 4.5.2 calculating basis of a solution set . 113 4.5.3 what is dimension? . 115 4.6 general theory of linear systems . 122 4.7 applications........................................ 125 4.8 conclusions ........................................ 127 5 linear transformations 129 5.1 examples of linear transformations . 129 5.2 matrix of a linear operator . 132 5.3 composition of linear transformations . 133 5.4 isomorphism of vector spaces . 136 5.5 change we can believe in (no really, no joke) . 138 5.6 applications........................................ 143 5.7 conclusions ........................................ 143 6 linear geometry 145 6.1 Euclidean geometry of ℝn .................................146 6.2 orthogonality in ℝ n×1 ...................................150 6.3 orthogonal complements and projections . 158 6.4 theclosestvectorproblem ............................. 164 6.5 inconsistentequations ............................... 166 6.6 least squares analysis . 167 6.6.1 linear least squares problem . 167 6.6.2 nonlinear least squares . 169 6.7 orthogonal transformations . 174 6.8 innerproducts .................................... 177 6.8.1 examplesofinner-products . 179 6.8.2 Fourier analysis . 183 7 eigenvalues and eigenvectors 185 7.1 geometry of linear transformations . 186 7.2 definition and properties of eigenvalues . 188 7.2.1 eigenwarning . 190 7.3 eigenvalueproperties................................ 190 CONTENTS 7 7.4 real eigenvector examples . 192 7.5 complex eigenvector examples . 196 7.6 linear independendence of real eigenvectors . 199 7.7 linear independendence of complex eigenvectors . 203 7.8 determinants and eigenvalues . 205 7.9 diagonalization . 206 7.10 calculus of matrices . 209 7.11 introduction to systems of linear differential equations . 210 7.12 the matrix exponential . 213 7.12.1 analysis for matrices . 214 7.12.2 formulas for the matrix exponential . 215 7.13 solutions for systems of DEqns with real eigenvalues . 219 7.14 solutions for systems of DEqns with complex eigenvalues . 224 7.15 geometry and difference equations revisited . 225 7.16 conic sections and quadric surfaces . 226 8 appendix on finite sums 227 8 CONTENTS Chapter 1 Gauss-Jordon elimination Gauss-Jordon elimination is an optimal method for solving a system of linear equations. Logically it may be equivalent to methods you are already familar with but the matrix notation is by far the most efficient method. This is important since throughout this course we will be faced with the problem of solving linear equations. Additionally, the Gauss-Jordon produces the reduced row echelon form (rref) of the matrix. Given a particular matrix the rref is unique. This is of particular use in theoretical applications. 1.1 systems of linear equations Let me begin with a few examples before I state the general definition. Example 1.1.1. Consider the following system of 2 equations and 2 unknowns, x + y = 2 x − y = 0 Adding equations reveals 2x = 2 hence x = 1 . Then substitute that into either equation to deduce y = 1 . Hence the solution (1 , 1) is unique Example 1.1.2. Consider the following system of 2 equations and 2 unknowns, x + y = 2 3x + 3 y = 6 We can multiply the second equation by 1/3 to see that it is equivalent to x + y = 2 thus our two equations are in fact the same equation.
Load more

Recommended publications
  • Final Exam Outline 1.1, 1.2 Scalars and Vectors in R N. the Magnitude
    Final Exam Outline 1.1, 1.2 Scalars and vectors in Rn. The magnitude of a vector. Row and column vectors. Vector addition. Scalar multiplication. The zero vector. Vector subtraction. Distance in Rn. Unit vectors. Linear combinations. The dot product. The angle between two vectors. Orthogonality. The CBS and triangle inequalities. Theorem 1.5. 2.1, 2.2 Systems of linear equations. Consistent and inconsistent systems. The coefficient and augmented matrices. Elementary row operations. The echelon form of a matrix. Gaussian elimination. Equivalent matrices. The reduced row echelon form. Gauss-Jordan elimination. Leading and free variables. The rank of a matrix. The rank theorem. Homogeneous systems. Theorem 2.2. 2.3 The span of a set of vectors. Linear dependence. Linear dependence and independence. Determining n whether a set {~v1, . ,~vk} of vectors in R is linearly dependent or independent. 3.1, 3.2 Matrix operations. Scalar multiplication, matrix addition, matrix multiplication. The zero and identity matrices. Partitioned matrices. The outer product form. The standard unit vectors. The transpose of a matrix. A system of linear equations in matrix form. Algebraic properties of the transpose. 3.3 The inverse of a matrix. Invertible (nonsingular) matrices. The uniqueness of the solution to Ax = b when A is invertible. The inverse of a nonsingular 2 × 2 matrix. Elementary matrices and EROs. Equivalent conditions for invertibility. Using Gauss-Jordan elimination to invert a nonsingular matrix. Theorems 3.7, 3.9. n n n 3.5 Subspaces of R . {0} and R as subspaces of R . The subspace span(v1,..., vk). The the row, column and null spaces of a matrix.
    [Show full text]
  • Introduction to MATLAB®
    Introduction to MATLAB® Lecture 2: Vectors and Matrices Introduction to MATLAB® Lecture 2: Vectors and Matrices 1 / 25 Vectors and Matrices Vectors and Matrices Vectors and matrices are used to store values of the same type A vector can be either column vector or a row vector. Matrices can be visualized as a table of values with dimensions r × c (r is the number of rows and c is the number of columns). Introduction to MATLAB® Lecture 2: Vectors and Matrices 2 / 25 Vectors and Matrices Creating row vectors Place the values that you want in the vector in square brackets separated by either spaces or commas. e.g 1 >> row vec=[1 2 3 4 5] 2 row vec = 3 1 2 3 4 5 4 5 >> row vec=[1,2,3,4,5] 6 row vec= 7 1 2 3 4 5 Introduction to MATLAB® Lecture 2: Vectors and Matrices 3 / 25 Vectors and Matrices Creating row vectors - colon operator If the values of the vectors are regularly spaced, the colon operator can be used to iterate through these values. (first:last) produces a vector with all integer entries from first to last e.g. 1 2 >> row vec = 1:5 3 row vec = 4 1 2 3 4 5 Introduction to MATLAB® Lecture 2: Vectors and Matrices 4 / 25 Vectors and Matrices Creating row vectors - colon operator A step value can also be specified with another colon in the form (first:step:last) 1 2 >>odd vec = 1:2:9 3 odd vec = 4 1 3 5 7 9 Introduction to MATLAB® Lecture 2: Vectors and Matrices 5 / 25 Vectors and Matrices Exercise In using (first:step:last), what happens if adding the step value would go beyond the range specified by last? e.g: 1 >>v = 1:2:6 Introduction to MATLAB® Lecture 2: Vectors and Matrices 6 / 25 Vectors and Matrices Exercise Use (first:step:last) to generate the vector v1 = [9 7 5 3 1 ]? Introduction to MATLAB® Lecture 2: Vectors and Matrices 7 / 25 Vectors and Matrices Creating row vectors - linspace function linspace (Linearly spaced vector) 1 >>linspace(x,y,n) linspace creates a row vector with n values in the inclusive range from x to y.
    [Show full text]
  • Math 102 -- Linear Algebra I -- Study Guide
    Math 102 Linear Algebra I Stefan Martynkiw These notes are adapted from lecture notes taught by Dr.Alan Thompson and from “Elementary Linear Algebra: 10th Edition” :Howard Anton. Picture above sourced from (http://i.imgur.com/RgmnA.gif) 1/52 Table of Contents Chapter 3 – Euclidean Vector Spaces.........................................................................................................7 3.1 – Vectors in 2-space, 3-space, and n-space......................................................................................7 Theorem 3.1.1 – Algebraic Vector Operations without components...........................................7 Theorem 3.1.2 .............................................................................................................................7 3.2 – Norm, Dot Product, and Distance................................................................................................7 Definition 1 – Norm of a Vector..................................................................................................7 Definition 2 – Distance in Rn......................................................................................................7 Dot Product.......................................................................................................................................8 Definition 3 – Dot Product...........................................................................................................8 Definition 4 – Dot Product, Component by component..............................................................8
    [Show full text]
  • Lesson 1 Introduction to MATLAB
    Math 323 Linear Algebra and Matrix Theory I Fall 1999 Dr. Constant J. Goutziers Department of Mathematical Sciences [email protected] Lesson 1 Introduction to MATLAB MATLAB is an interactive system whose basic data element is an array that does not require dimensioning. This allows easy solution of many technical computing problems, especially those with matrix and vector formulations. For many colleges and universities MATLAB is the Linear Algebra software of choice. The name MATLAB stands for matrix laboratory. 1.1 Row and Column vectors, Formatting In linear algebra we make a clear distinction between row and column vectors. • Example 1.1.1 Entering a row vector. The components of a row vector are entered inside square brackets, separated by blanks. v=[1 2 3] v = 1 2 3 • Example 1.1.2 Entering a column vector. The components of a column vector are also entered inside square brackets, but they are separated by semicolons. w=[4; 5/2; -6] w = 4.0000 2.5000 -6.0000 • Example 1.1.3 Switching between a row and a column vector, the transpose. In MATLAB it is possible to switch between row and column vectors using an apostrophe. The process is called "taking the transpose". To illustrate the process we print v and w and generate the transpose of each of these vectors. Observe that MATLAB commands can be entered on the same line, as long as they are separated by commas. v, vt=v', w, wt=w' v = 1 2 3 vt = 1 2 3 w = 4.0000 2.5000 -6.0000 wt = 4.0000 2.5000 -6.0000 • Example 1.1.4 Formatting.
    [Show full text]
  • Linear Algebra I: Vector Spaces A
    Linear Algebra I: Vector Spaces A 1 Vector spaces and subspaces 1.1 Let F be a field (in this book, it will always be either the field of reals R or the field of complex numbers C). A vector space V D .V; C; o;˛./.˛2 F// over F is a set V with a binary operation C, a constant o and a collection of unary operations (i.e. maps) ˛ W V ! V labelled by the elements of F, satisfying (V1) .x C y/ C z D x C .y C z/, (V2) x C y D y C x, (V3) 0 x D o, (V4) ˛ .ˇ x/ D .˛ˇ/ x, (V5) 1 x D x, (V6) .˛ C ˇ/ x D ˛ x C ˇ x,and (V7) ˛ .x C y/ D ˛ x C ˛ y. Here, we write ˛ x and we will write also ˛x for the result ˛.x/ of the unary operation ˛ in x. Often, one uses the expression “multiplication of x by ˛”; but it is useful to keep in mind that what we really have is a collection of unary operations (see also 5.1 below). The elements of a vector space are often referred to as vectors. In contrast, the elements of the field F are then often referred to as scalars. In view of this, it is useful to reflect for a moment on the true meaning of the axioms (equalities) above. For instance, (V4), often referred to as the “associative law” in fact states that the composition of the functions V ! V labelled by ˇ; ˛ is labelled by the product ˛ˇ in F, the “distributive law” (V6) states that the (pointwise) sum of the mappings labelled by ˛ and ˇ is labelled by the sum ˛ C ˇ in F, and (V7) states that each of the maps ˛ preserves the sum C.
    [Show full text]
  • Week 1 – Vectors and Matrices
    Week 1 – Vectors and Matrices Richard Earl∗ Mathematical Institute, Oxford, OX1 2LB, October 2003 Abstract Algebra and geometry of vectors. The algebra of matrices. 2x2 matrices. Inverses. Determinants. Simultaneous linear equations. Standard transformations of the plane. Notation 1 The symbol R2 denotes the set of ordered pairs (x, y) – that is the xy-plane. Similarly R3 denotes the set of ordered triples (x, y, z) – that is, three-dimensional space described by three co-ordinates x, y and z –andRn denotes a similar n-dimensional space. 1Vectors A vector can be thought of in two different ways. Let’s for the moment concentrate on vectors in the xy-plane. From one point of view a vector is just an ordered pair of numbers (x, y). We can associate this • vector with the point in R2 which has co-ordinates x and y. We call this vector the position vector of the point. From the second point of view a vector is a ‘movement’ or translation. For example, to get from • the point (3, 4) to the point (4, 5) we need to move ‘one to the right and one up’; this is the same movement as is required to move from ( 2, 3) to ( 1, 2) or from (1, 2) to (2, 1) . Thinking about vectors from this second point of− view,− all three− of− these movements− are the− same vector, because the same translation ‘one right, one up’ achieves each of them, even though the ‘start’ and ‘finish’ are different in each case. We would write this vector as (1, 1) .
    [Show full text]
  • Linear Algebra: Matrices, Vectors, Determinants. Linear Systems
    c07.qxd 10/28/10 7:30 PM Page 256 CHAPTER 7 Linear Algebra: Matrices, Vectors, Determinants. Linear Systems Linear algebra is a fairly extensive subject that covers vectors and matrices, determinants, systems of linear equations, vector spaces and linear transformations, eigenvalue problems, and other topics. As an area of study it has a broad appeal in that it has many applications in engineering, physics, geometry, computer science, economics, and other areas. It also contributes to a deeper understanding of mathematics itself. Matrices, which are rectangular arrays of numbers or functions, and vectors are the main tools of linear algebra. Matrices are important because they let us express large amounts of data and functions in an organized and concise form. Furthermore, since matrices are single objects, we denote them by single letters and calculate with them directly. All these features have made matrices and vectors very popular for expressing scientific and mathematical ideas. The chapter keeps a good mix between applications (electric networks, Markov processes, traffic flow, etc.) and theory. Chapter 7 is structured as follows: Sections 7.1 and 7.2 provide an intuitive introduction to matrices and vectors and their operations, including matrix multiplication. The next block of sections, that is, Secs. 7.3–7.5 provide the most important method for solving systems of linear equations by the Gauss elimination method. This method is a cornerstone of linear algebra, and the method itself and variants of it appear in different areas of mathematics and in many applications. It leads to a consideration of the behavior of solutions and concepts such as rank of a matrix, linear independence, and bases.
    [Show full text]
  • Chapter 9 Matrices and Determinants
    Chapter 9 222 Matrices and Determinants Chapter 9 Matrices and Determinants 9.1 Introduction: In many economic analysis, variables are assumed to be related by sets of linear equations. Matrix algebra provides a clear and concise notation for the formulation and solution of such problems, many of which would be complicated in conventional algebraic notation. The concept of determinant and is based on that of matrix. Hence we shall first explain a matrix. 9.2 Matrix: A set of mn numbers (real or complex), arranged in a rectangular formation (array or table) having m rows and n columns and enclosed by a square bracket [ ] is called mn matrix (read “m by n matrix”) . An mn matrix is expressed as a11 a 12 a 1n a21 a 22 a 2n A= am1 a m2 a mn The letters aij stand for real numbers. Note that aij is the element in the ith row and jth column of the matrix .Thus the matrix A is sometimes denoted by simplified form as (aij) or by {aij} i.e., A = (aij) Matrices are usually denoted by capital letters A, B, C etc and its elements by small letters a, b, c etc. Order of a Matrix: The order or dimension of a matrix is the ordered pair having as first component the number of rows and as second component the number of columns in the matrix. If there are 3 rows and 2 columns in a matrix, then its order is written as (3, 2) or (3 x 2) read as three by two.
    [Show full text]
  • Quantum Algorithms Via Linear Algebra: a Primer / Richard J
    QUANTUM ALGORITHMS VIA LINEAR ALGEBRA A Primer Richard J. Lipton Kenneth W. Regan The MIT Press Cambridge, Massachusetts London, England c 2014 Massachusetts Institute of Technology All rights reserved. No part of this book may be reproduced in any form or by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher. MIT Press books may be purchased at special quantity discounts for business or sales promotional use. For information, please email special [email protected]. This book was set in Times Roman and Mathtime Pro 2 by the authors, and was printed and bound in the United States of America. Library of Congress Cataloging-in-Publication Data Lipton, Richard J., 1946– Quantum algorithms via linear algebra: a primer / Richard J. Lipton and Kenneth W. Regan. p. cm. Includes bibliographical references and index. ISBN 978-0-262-02839-4 (hardcover : alk. paper) 1. Quantum computers. 2. Computer algorithms. 3. Algebra, Linear. I. Regan, Kenneth W., 1959– II. Title QA76.889.L57 2014 005.1–dc23 2014016946 10987654321 We dedicate this book to all those who helped create and nourish the beautiful area of quantum algorithms, and to our families who helped create and nourish us. RJL and KWR Contents Preface xi Acknowledgements xiii 1 Introduction 1 1.1 The Model 2 1.2 The Space and the States 3 1.3 The Operations 5 1.4 Where Is the Input? 6 1.5 What Exactly Is the Output? 7 1.6 Summary and Notes 8 2 Numbers and Strings 9 2.1 Asymptotic Notation
    [Show full text]
  • Computational Foundations of Cognitive Science Lecture 11: Matrices in Matlab
    Basic Matrix Operations Special Matrices Matrix Products Transpose, Inner and Outer Product Computational Foundations of Cognitive Science Lecture 11: Matrices in Matlab Frank Keller School of Informatics University of Edinburgh [email protected] February 23, 2010 Frank Keller Computational Foundations of Cognitive Science 1 Basic Matrix Operations Special Matrices Matrix Products Transpose, Inner and Outer Product 1 Basic Matrix Operations Sum and Difference Size; Product with Scalar 2 Special Matrices Zero and Identity Matrix Diagonal and Triangular Matrices Block Matrices 3 Matrix Products Row and Column Vectors Mid-lecture Problem Matrix Product Product with Vector 4 Transpose, Inner and Outer Product Transpose Symmetric Matrices Inner and Outer Product Reading: McMahon, Ch. 2 Frank Keller Computational Foundations of Cognitive Science 2 Basic Matrix Operations Special Matrices Sum and Difference Matrix Products Size; Product with Scalar Transpose, Inner and Outer Product Sum and Difference In Matlab, matrices are input as lists of numbers; columns are separated by spaces or commas, rows by semicolons or newlines: > A = [2, 1, 0, 3; -1, 0, 2, 4; 4, -2, 7, 0]; > B = [-4, 3, 5, 1 2, 2, 0, -1 3, 2, -4, 5]; > C = [1 1; 2 2]; The sum and difference of two matrices can be computed using the operators + and -: > disp(A + B); -2 4 5 4 1 2 2 3 7 0 3 5 Frank Keller Computational Foundations of Cognitive Science 3 Basic Matrix Operations Special Matrices Sum and Difference Matrix Products Size; Product with Scalar Transpose, Inner and Outer Product
    [Show full text]
  • INTRODUCTION to MATRIX ALGEBRA 1.1. Definition of a Matrix
    INTRODUCTION TO MATRIX ALGEBRA 1. DEFINITION OF A MATRIX AND A VECTOR 1.1. Definition of a matrix. A matrix is a rectangular array of numbers arranged into rows and columns. It is written as a11 a12 ... a1n a a ... a 21 22 2n .. (1) .. .. am1 am2 ... amn The above array is called an m by n (m x n) matrix since it has m rows and n columns. Typically upper-case letters are used to denote a matrix and lower case letters with subscripts the elements. The matrix A is also often denoted A = kaijk (2) 1.2. Definition of a vector. A vector is a n-tuple of numbers. In R2 a vector would be an ordered 3 n pair of numbers {x, y}.InR a vector is a 3-tuple, i.e., {x1,x2,x3}. Similarly for R . Vectors are usually denoted by lower case letters such as a or b, or more formally ~a or ~b. 1.3. Row and column vectors. 1.3.1. Row vector. A matrix with one row and n columns (1xn) is called a row vector. It is usually written ~x 0 or 0 ~x = x1,x2,x3, ..., xn (3) The use of the prime 0 symbol indicates we are writing the n-tuple horizontally as if it were the row of a matrix. Note that each row of a matrix is a row vector. 1.3.2. Column vector. A matrix with one column and n rows (nx1) is called a column vector. It is written as x1 x 2 x3 ~x = .
    [Show full text]
  • 1.1. Elementary Matrices, Row and Column Transformations. We Have
    1. ROW OPERATION AND COLUMN OPERATIONS 1.1. Elementary Matrices, Row and Column Transformations. We have already studied in the last section that we can view the matrix multiplication as linear combi- nation of column vectors of the first matrix, or row vectors of the second matrix. And the coefficient of matrix multiplication is exactly given by other matrix. This shows that to understand matrix multiplication, we have to study the linear combination of row and column vectors. In this section, we will study the most basic linear combination of rows and columns, row and column transformation. 1.1.1. Elementary Row transformation. We have three types of row transformation. row switching This transformation swiches two row of matrix. 0 1 4 8 1 0 3 3 5 1 r1$r3 Switch the 1st and 3rd row of matrix @ 2 0 9 A −−−−! @ 2 0 9 A 3 3 5 1 4 8 row multiplying This transformation multiplies some row with a non-zero scalar λ 0 1 4 8 1 0 1 4 8 1 2×r2 Multiply the 2nd row of matrix by 2 : @ 2 0 9 A −−−! @ 4 0 18 A 3 3 5 3 3 5 row adding In this transformation, we multiply some row by a scalar, but add that into another row. 0 1 4 8 1 0 1 4 8 1 r3+2×r2 Add twice of the 2nd row to the 3rd row : @ 2 0 9 A −−−−−! @ 2 0 9 A 3 3 5 7 3 23 Caution: Write 2 × r instead of r × 2, the reason for that is simple, because scalar is 1 × 1 matrix.
    [Show full text]