Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems
|
|
- Allen Nichols
- 5 years ago
- Views:
Transcription
1 Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems Tom Lyche University of Oslo Norway Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.1/33
2 Plan for the day 1. Notation 2. Splines Cubic spline interpolation Strictly diagonally dominant matrices LU-factorization of tridiagonal matrices 3. A two point boundary value problem The finite difference scheme Formulation as a matrix equation Weakly diagonally dominant tridiagonal matrices 4. An eigenvalue problem Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.2/33
3 Notation The set of natural numbers, integers, rational numbers, real numbers, and complex numbers are denoted by N, Z, Q, R, C, respectively. R n (C n ) is the set of n-tuples of real(complex) numbers which we will represent as column vectors. Thus x R n means x = x 1 x 2. x n, where x i R for i = 1,..., n. Row vectors are normally identified using the transpose operation. Thus if x R n then x is a column vector and x T is a row vector. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.3/33
4 Notation2 R m,n (C m,n ) is the set of m n matrices with real(complex) entries represented as a 11 a 12 a 1n a A = 21 a 22 a 2n.... a m1 a m2 a mn The entry in the ith row and jth column of a matrix A will be denoted by a i,j, a ij, A(i, j) or (A) i,j. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.4/33
5 Vector norms 1. x 1 = n j=1 x j, (the one-norm or l 1 -norm) 2. x 2 = ( n j=1 x j 2) 1/2, the two-norm, l2 -norm, or Euclidian norm) 3. x = max 1 j n x j, (the infinity-norm, l -norm, or max norm.) 4. x p := ( n j=1 x j p) 1/p, 1 p, (p-norm) Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.5/33
6 Nonsingular matrix Definition 1. A square matrix A is said to be nonsingular if the only solution of the homogenous system Ax = 0 is x = 0. The matrix is singular if it is not nonsingular. Theorem 2. Suppose A R n,n (C n,n ). The linear system Ax = b has a unique solution x R n (C n ) for any b R n (C n ) if and only if the matrix A is nonsingular. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.6/33
7 The inverse matrix A square matrix is invertible if BA = AB = I for some square matrix B. B is unique and is called the inverse of A, denoted A 1 := B. Theorem 3. A square matrix is invertible if and only if it is nonsingular. Lemma 4. If A, B, C R n,n (C n,n ) with AB = C then C is nonsingular if and only if both A and B are nonsingular. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.7/33
8 Spline Definition 5. Given a positive integer K, a partition := [t 1,..., t k ] of R, with t 1 < t 2 < < t K, and integers r, d with r 1 and d 0. We say that a function s : R R is a C r -spline of degree d with knots if s(x) = s 0 (x), if x < t 1, s i (x), if t i x < t i+1 for i = 1,..., K 1, s K (x), if x t K, where each function s i is a polynomial of degree d and s (j) i 1 (t i) = s (j) i (t i ) for j = 0, 1,..., r and i = 1, 2,..., K. (2) We often call s a linear, quadratic, cubic, quartic, quintic C r -spline if d = 1, 2, 3, 4, 5, respectively. (1) Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.8/33
9 A cubic C 2 -spline B(x) := s 0 (x) = 0, if x < 2, s 1 (x) = 1 6 (x + 2)3, if 2 x < 1, s 2 (x) = 1 2 x3 x , if 1 x < 0, s 3 (x) = 1 2 x3 x , if 0 x < 1, s 4 (x) = 1 6 (2 x)3, if 1 x < 2, s 5 (x) = 0, if x 2, (3) Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.9/33
10 Spline s has r continuous derivatives on R, in other words s C r (R). The value at a knot t i is defined using the polynomial s i defining s to the right of t i. This means that the one sided(right) derivatives D j + s(x) := lim h 0 h>0 s(x + h) s(x) h exist for all integers j 0 and all x R. The one sided derivative of s equals the usual derivative of s for j r and all x R, and for j r for x /. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.10/33
11 Derivatives of a spline We have D j + s(x) = s (j) 0 (x), if x < t 1, s (j) i (x), if t i x < t i+1 for i = 1,..., K 1, K (x), if x t K, s (j) (4) Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.11/33
12 Derivative 1 example Figure 1: A C 2 -cubic spline(left); the first derivative (center); the second derivative (right). The first derivative of B is a C 1 -quadratic spline with knots [ 2, 1, 0, 1, 2], Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.12/33
13 Cubic spline interpolation Given data (x i, y i ) n i=1 in R2 with x 1 < x 2 < < x n. We shall construct a cubic C 2 -spline s : R R such that s(x i ) = y i for i = 1,..., n. The knots of the spline will be chosen at the interior data abscissas = {x 2,..., x n 1 }. The spline has n 1 unknown cubic polynomial pieces s 1 (x), if x < x 2, s(x) = s i (x), if x i x < x i+1 for i = 2,..., n 2, s n 1 (x), if x x n 1. (5) Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.13/33
14 The interpolation problem We write each s i in the local power form s i (x) = s i3 (x x i ) 3 + s i2 (x x i ) 2 + s i1 (x x i ) + s i0, (6) For such a spline we have n + 2 degrees of freedom. Since we only have n interpolation points we need two extra conditons to specify the spline uniquely. We will only consider the clamped (first derivative) boundary conditions s (x 1 ) = y 1 and s (x n ) = y n, where y 1 and y n are given numbers. Thus we seek a cubic C 2 -spline s with knots x 2,..., x n 1 such that s(x i ) = y i, for i = 1,..., n and s (x i ) = y i for i = 1, n. (7) Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.14/33
15 You just need a moment We can express the coefficients s ij in terms of the (at this point unknown) 2. derivatives (moments) as follows: s i3 = m i+1 m i 6h i where m i := s (x i ), for i = 1,..., n (8), s i2 = m i 2, s i1 = δ i h i ( ) 2mi +m i+1, si0 = y i 6 (9) h i := x i+1 x i, and δ i = y i+1 y i h i. (10) Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.15/33
16 A linear system It remains to determine the second derivatives m i. For this we use the continuity of the first derivative of s. After some calculation d 1 h 1 m 1 b 1 h 1 d 2 h 2 m 2 b =. h n 2 d n 1 h n 1 m n 1 b n 1 h n 1 d n m n b n, (11) where d i = 2 ( h i 1 + h i ), bi = 6 ( δ i δ i 1 ), i = 1,..., n, h 0 = h n = 0, and δ 0 = y 1, δ n = y n. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.16/33
17 Strict diagonal dominance Note that in the spline coefficient matrix the diagonal entry is strictly larger than the sum of the off-diagonal entries in that row. A matrix A C n,n is said to be strictly diagonally dominant if a ii > j i a ij for i = 1,..., n. Lemma 6. Suppose A C n,n is strictly diagonally dominant. Then the linear system Ax = b has a unique solution for any b C n. If b C n, then the solution x of Ax = b is bounded as follows: x := max x ( b j ) i max, (12) 1 i n 1 j n σ j where σ i := a ii j i a ij for i = 1,..., n. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.17/33
18 The spline linear system d 1 h 1 h 1 d 2 h h n 2 d n 1 h n 1 h n 1 d n m 1 m 2. m n 1 m n = b 1 b 2. b n 1 b n, where d i = 2 ( ) h i 1 + h i, i = 1,..., n. Strictly diagonally dominant and nonsingular Tridiagonal Solve linear system by LU-factorization Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.18/33
19 LU-factorization of a tridiagonal matri d 1 c 1 1 u a 2 d 2 c 2 1 c l = a n 1 d n 1 c n 1 l n 1 a n d n u n 1 Note that L has ones on the diagonal, and that A and U have the same super-diagonal. By equating entries we find d 1 = u 1, a k = l k u k 1, d k = l k c k 1 + u k, k = 2, 3,..., n. c n 1 u n (13). Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.19/33
20 The Algorithm A = LU (LU-factorization) Ly = b (forward substitution) Ux = y (backward substituion) u 1 = d 1, l k = a k u k 1, u k = d k l k c k 1, k = 2, 3,..., n. y 1 = b 1, y k = b k l k y k 1, k = 2, 3,..., n, x n = y n /d n, x k = (y k c k x k+1 )/u k, k = n 1,..., 2, 1. This process is well defined if A is strictly diagonally dominant. The number of arithmetic operations (flops) is O(n). Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.20/33
21 s (1976) = y 1981 y and s (2006) = y 2006 y x Figure 2: Foreign citizens in Norway Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.21/33
22 A boundary value problem u (x) = f(x), x [0, 1], (14) u(0) = 0, u(1) = 0. f is a given continuous function on [0, 1]. Solve using a finite difference method Choose positive integer m Define discretization parameter h := 1/(m + 1) Replace the interval [0, 1] by grid points x j := jh for j = 0, 1,..., m + 1. Replace derivative with finite difference approximation u (x) u(x h) 2u(x)+u(x+h) h 2. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.22/33
23 Tridiagonalt linear system u (x) = f(x), u(0) = u(1) = 0 v j u(x j ) for all j v j 1 +2v j v j+1 h 2 = f(jh), j = 1,..., m, v 0 = v m+1 = 0 This leads to a linear system T [v 1,..., v m ] T = h 2 [f(h),..., f(mh)] T T := tridiag m ( 1, 2, 1) = R m,m (15) Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.23/33
24 Weak diagonal dominance Definition 7. The tridiagonal matrix A = A := tridiag(a i, d i, c i ) = d 1 c 1 a 2 d 2 c a n 1 d n 1 c n 1 a n d n is weakly diagonally dominant if d 1 > c 1, d n > a n, d k a k + c k, k = 2, 3,..., n 1. T is weakly diagonally dominant. The matrix A 1 = also weakly diagonally dominant, but it is singular. [ (16) ] is Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.24/33
25 Irreducibility Definition 8. A tridiagonal matrix tridiag(a i, d i, c i ) is irreducible if and only if all the a i, c i are nonzero. A matrix which is not irreducible is called reducible. Clearly the matrix T is irreducible, while the matrix A 1 = [ ] is reducible and singular. Theorem 9. Suppose A is tridiagonal, weakly diagonally dominant, and irreducible. Then A is nonsingular and has a unique LU-factorization. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.25/33
26 LU of T T = LU, where L = m 1 m 1, U = m m m+1 m (17) We can now solve T v = h 2 f by a forward and backward substitution. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.26/33
27 An eigenvalue problem Consider a horizontal beam of length L located between 0 and L on the x-axis of the plane. We assume that the beam is fixed at x = 0 and x = L A force F is applied at (L, 0) in the direction towards the origin. This situation can be modeled by the boundary value problem Ry (x) = F y(x), y(0) = y(l) = 0 y(x) is the vertical displacement of the beam at x R is a constant defined by the rigidity of the beam. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.27/33
28 The transformed system We can transform the problem to the unit interval [0, 1] by considering the function u : [0, 1] R given by u(t) := y(tl). Since u (t) = L 2 y (tl), the problem Ry (x) = F y(x), y(0) = y(l) = 0 becomes u (t) = Ku(t), u(0) = u(1) = 0, K := F L2 R Eigenvalue problem When F is increased it will reach a critical value where the beam will buckle and maybe break. This corresponds to the smallest eigenvalue of u = Ku. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.28/33
29 The smallest eigenvalue With u(t) = sin πt we find u = π 2 u K = π 2 gives a nonzero solution. It can be shown that this is the smallest eigenvalue. Since π 2 = K = F L2 R we find F = π2 R/L 2. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.29/33
30 Eigenvalue approximation A discrete version of u = Ku is v j 1 + 2v j v j+1 h 2 = Kv j, j = 1,..., m, h = 1 m + 1 v 0 = v m+1 = 0, v j u(jh) for j = 0,..., m + 1. If we define λ := h 2 K then we obtain the matrix eigenvalue problem T v = λv v = [v 1,..., v m ] T, and T := tridiag m ( 1, 2, 1) The problem is to determine the smallest eigenvalue λ min of T. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.30/33
31 The eigenvalues of tridiag(a, b, a) for a, b R C := tridiag(a, b, a) = b a a b a a b a 0... a b R m,m. Cs j = λ j s j for j = 1,..., m, λ j = b + 2a cos(jπh), with h = 1/(m + 1) s j = [sin (jπh), sin (2jπh),..., sin (mjπh)] T The eigenvalues are distinct The eigenvectors are orthogonal s T j s k = 1 2h δ j,k Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.31/33
32 The smallest eigenvalue of T Normally we need a numerical method to find λ min. λ min = 2 2 cos (πh) = 4 sin 2 (πh/2) Since λ = h 2 K = h2 F L 2 R we can solve for F to obtain F = 4 sin2 (πh/2)r h 2 L 2. For small h this is a good approximation to the value we computed above. π 2 R L 2 F = 4 sin2 (πh/2)r h 2 L 2 = π2 R L 2 + O(h 2 ). Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.32/33
33 Summary Studied 3 problems Each leads to a tridiagonal matrix Introduced the concepts; diagonal dominance (strict, weak) Irreducibility for a tridiagonal matrix Introduced the 2. derivative matrix T Found the eigenvalues and eigenvector of T Eigenvectors of T are orthogonal. Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems p.33/33
Lecture 2 INF-MAT : A boundary value problem and an eigenvalue problem; Block Multiplication; Tridiagonal Systems
Lecture 2 INF-MAT 4350 2008: A boundary value problem and an eigenvalue problem; Block Multiplication; Tridiagonal Systems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University
More informationLecture 1 INF-MAT : Chapter 2. Examples of Linear Systems
Lecture 1 INF-MAT 4350 2010: Chapter 2. Examples of Linear Systems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo August 26, 2010 Notation The set of natural
More informationLecture Notes for Inf-Mat 3350/4350, Tom Lyche
Lecture Notes for Inf-Mat 3350/4350, 2007 Tom Lyche August 5, 2007 2 Contents Preface vii I A Review of Linear Algebra 1 1 Introduction 3 1.1 Notation............................... 3 2 Vectors 5 2.1 Vector
More informationLecture4 INF-MAT : 5. Fast Direct Solution of Large Linear Systems
Lecture4 INF-MAT 4350 2010: 5. Fast Direct Solution of Large Linear Systems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 16, 2010 Test Matrix
More informationLecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky
Lecture 2 INF-MAT 4350 2009: 7.1-7.6, LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Tom Lyche and Michael Floater Centre of Mathematics for Applications, Department of Informatics,
More informationNumerical Analysis of Differential Equations Numerical Solution of Elliptic Boundary Value
Numerical Analysis of Differential Equations 188 5 Numerical Solution of Elliptic Boundary Value Problems 5 Numerical Solution of Elliptic Boundary Value Problems TU Bergakademie Freiberg, SS 2012 Numerical
More informationMatrix operations Linear Algebra with Computer Science Application
Linear Algebra with Computer Science Application February 14, 2018 1 Matrix operations 11 Matrix operations If A is an m n matrix that is, a matrix with m rows and n columns then the scalar entry in the
More informationLinear Algebra and Matrix Inversion
Jim Lambers MAT 46/56 Spring Semester 29- Lecture 2 Notes These notes correspond to Section 63 in the text Linear Algebra and Matrix Inversion Vector Spaces and Linear Transformations Matrices are much
More information10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections )
c Dr. Igor Zelenko, Fall 2017 1 10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections 7.2-7.4) 1. When each of the functions F 1, F 2,..., F n in right-hand side
More informationSection 9.2: Matrices. Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns.
Section 9.2: Matrices Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns. That is, a 11 a 12 a 1n a 21 a 22 a 2n A =...... a m1 a m2 a mn A
More informationMATH2210 Notebook 2 Spring 2018
MATH2210 Notebook 2 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 2 MATH2210 Notebook 2 3 2.1 Matrices and Their Operations................................
More informationRadial Basis Functions I
Radial Basis Functions I Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 14, 2008 Today Reformulation of natural cubic spline interpolation Scattered
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More information2 Two-Point Boundary Value Problems
2 Two-Point Boundary Value Problems Another fundamental equation, in addition to the heat eq. and the wave eq., is Poisson s equation: n j=1 2 u x 2 j The unknown is the function u = u(x 1, x 2,..., x
More informationLecture 7. Econ August 18
Lecture 7 Econ 2001 2015 August 18 Lecture 7 Outline First, the theorem of the maximum, an amazing result about continuity in optimization problems. Then, we start linear algebra, mostly looking at familiar
More information1 Piecewise Cubic Interpolation
Piecewise Cubic Interpolation Typically the problem with piecewise linear interpolation is the interpolant is not differentiable as the interpolation points (it has a kinks at every interpolation point)
More informationChapter 7. Tridiagonal linear systems. Solving tridiagonal systems of equations. and subdiagonal. E.g. a 21 a 22 a A =
Chapter 7 Tridiagonal linear systems The solution of linear systems of equations is one of the most important areas of computational mathematics. A complete treatment is impossible here but we will discuss
More informationFundamentals of Engineering Analysis (650163)
Philadelphia University Faculty of Engineering Communications and Electronics Engineering Fundamentals of Engineering Analysis (6563) Part Dr. Omar R Daoud Matrices: Introduction DEFINITION A matrix is
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationMAT 2037 LINEAR ALGEBRA I web:
MAT 237 LINEAR ALGEBRA I 2625 Dokuz Eylül University, Faculty of Science, Department of Mathematics web: Instructor: Engin Mermut http://kisideuedutr/enginmermut/ HOMEWORK 2 MATRIX ALGEBRA Textbook: Linear
More informationGaussian Elimination and Back Substitution
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 4 Notes These notes correspond to Sections 31 and 32 in the text Gaussian Elimination and Back Substitution The basic idea behind methods for solving
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationSPLINE INTERPOLATION
Spline Background SPLINE INTERPOLATION Problem: high degree interpolating polynomials often have extra oscillations. Example: Runge function f(x = 1 1+4x 2, x [ 1, 1]. 1 1/(1+4x 2 and P 8 (x and P 16 (x
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationApplied Linear Algebra
Applied Linear Algebra Gábor P. Nagy and Viktor Vígh University of Szeged Bolyai Institute Winter 2014 1 / 262 Table of contents I 1 Introduction, review Complex numbers Vectors and matrices Determinants
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationMAT Linear Algebra Collection of sample exams
MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More informationChapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in
Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column
More informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More informationSection September 6, If n = 3, 4, 5,..., the polynomial is called a cubic, quartic, quintic, etc.
Section 2.1-2.2 September 6, 2017 1 Polynomials Definition. A polynomial is an expression of the form a n x n + a n 1 x n 1 + + a 1 x + a 0 where each a 0, a 1,, a n are real numbers, a n 0, and n is a
More informationEcon Slides from Lecture 7
Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationComputing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices
Computing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 8, 2009 Today
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationMatrix Algebra: Summary
May, 27 Appendix E Matrix Algebra: Summary ontents E. Vectors and Matrtices.......................... 2 E.. Notation.................................. 2 E..2 Special Types of Vectors.........................
More informationDirect Methods for Solving Linear Systems. Matrix Factorization
Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationPrepared by: M. S. KumarSwamy, TGT(Maths) Page
Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 50 - CHAPTER 3: MATRICES QUICK REVISION (Important Concepts & Formulae) MARKS WEIGHTAGE 03 marks Matrix A matrix is an ordered rectangular array of numbers
More informationJim Lambers MAT 610 Summer Session Lecture 2 Notes
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 2 Notes These notes correspond to Sections 2.2-2.4 in the text. Vector Norms Given vectors x and y of length one, which are simply scalars x and y, the
More information2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian
FE661 - Statistical Methods for Financial Engineering 2. Linear algebra Jitkomut Songsiri matrices and vectors linear equations range and nullspace of matrices function of vectors, gradient and Hessian
More informationA Review of Matrix Analysis
Matrix Notation Part Matrix Operations Matrices are simply rectangular arrays of quantities Each quantity in the array is called an element of the matrix and an element can be either a numerical value
More informationChapter 3. Linear and Nonlinear Systems
59 An expert is someone who knows some of the worst mistakes that can be made in his subject, and how to avoid them Werner Heisenberg (1901-1976) Chapter 3 Linear and Nonlinear Systems In this chapter
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More informationOR MSc Maths Revision Course
OR MSc Maths Revision Course Tom Byrne School of Mathematics University of Edinburgh t.m.byrne@sms.ed.ac.uk 15 September 2017 General Information Today JCMB Lecture Theatre A, 09:30-12:30 Mathematics revision
More informationELE/MCE 503 Linear Algebra Facts Fall 2018
ELE/MCE 503 Linear Algebra Facts Fall 2018 Fact N.1 A set of vectors is linearly independent if and only if none of the vectors in the set can be written as a linear combination of the others. Fact N.2
More informationComputing Eigenvalues and/or Eigenvectors;Part 2, The Power method and QR-algorithm
Computing Eigenvalues and/or Eigenvectors;Part 2, The Power method and QR-algorithm Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 13, 2009 Today
More informationMATH 3511 Lecture 1. Solving Linear Systems 1
MATH 3511 Lecture 1 Solving Linear Systems 1 Dmitriy Leykekhman Spring 2012 Goals Review of basic linear algebra Solution of simple linear systems Gaussian elimination D Leykekhman - MATH 3511 Introduction
More informationSection 9.2: Matrices.. a m1 a m2 a mn
Section 9.2: Matrices Definition: A matrix is a rectangular array of numbers: a 11 a 12 a 1n a 21 a 22 a 2n A =...... a m1 a m2 a mn In general, a ij denotes the (i, j) entry of A. That is, the entry in
More informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
More informationMath 304 (Spring 2010) - Lecture 2
Math 304 (Spring 010) - Lecture Emre Mengi Department of Mathematics Koç University emengi@ku.edu.tr Lecture - Floating Point Operation Count p.1/10 Efficiency of an algorithm is determined by the total
More informationCS100: DISCRETE STRUCTURES. Lecture 3 Matrices Ch 3 Pages:
CS100: DISCRETE STRUCTURES Lecture 3 Matrices Ch 3 Pages: 246-262 Matrices 2 Introduction DEFINITION 1: A matrix is a rectangular array of numbers. A matrix with m rows and n columns is called an m x n
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More information9. Numerical linear algebra background
Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization
More informationScientific Computing: Dense Linear Systems
Scientific Computing: Dense Linear Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Spring 2012 February 9th, 2012 A. Donev (Courant Institute)
More informationCubic Splines MATH 375. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Cubic Splines
Cubic Splines MATH 375 J. Robert Buchanan Department of Mathematics Fall 2006 Introduction Given data {(x 0, f(x 0 )), (x 1, f(x 1 )),...,(x n, f(x n ))} which we wish to interpolate using a polynomial...
More informationChapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form
Chapter 5. Linear Algebra A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are real numbers. 1
More informationLinear Algebra: Lecture notes from Kolman and Hill 9th edition.
Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices
More informationMatrices and Linear Algebra
Contents Quantitative methods for Economics and Business University of Ferrara Academic year 2017-2018 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2
More informationJim Lambers MAT 610 Summer Session Lecture 1 Notes
Jim Lambers MAT 60 Summer Session 2009-0 Lecture Notes Introduction This course is about numerical linear algebra, which is the study of the approximate solution of fundamental problems from linear algebra
More informationLinear Algebra. Solving Linear Systems. Copyright 2005, W.R. Winfrey
Copyright 2005, W.R. Winfrey Topics Preliminaries Echelon Form of a Matrix Elementary Matrices; Finding A -1 Equivalent Matrices LU-Factorization Topics Preliminaries Echelon Form of a Matrix Elementary
More informationBasic Concepts in Linear Algebra
Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University February 2, 2015 Grady B Wright Linear Algebra Basics February 2, 2015 1 / 39 Numerical Linear Algebra Linear
More informationLinear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.
Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the
More informationSymmetric and anti symmetric matrices
Symmetric and anti symmetric matrices In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, matrix A is symmetric if. A = A Because equal matrices have equal
More informationInverses. Stephen Boyd. EE103 Stanford University. October 28, 2017
Inverses Stephen Boyd EE103 Stanford University October 28, 2017 Outline Left and right inverses Inverse Solving linear equations Examples Pseudo-inverse Left and right inverses 2 Left inverses a number
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 12: Gaussian Elimination and LU Factorization Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 10 Gaussian Elimination
More informationCHAPTER 10 Shape Preserving Properties of B-splines
CHAPTER 10 Shape Preserving Properties of B-splines In earlier chapters we have seen a number of examples of the close relationship between a spline function and its B-spline coefficients This is especially
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS
More information1 Matrices and vector spaces
Matrices and vector spaces. Which of the following statements about linear vector spaces are true? Where a statement is false, give a counter-example to demonstrate this. (a) Non-singular N N matrices
More informationReview of Basic Concepts in Linear Algebra
Review of Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University September 7, 2017 Math 565 Linear Algebra Review September 7, 2017 1 / 40 Numerical Linear Algebra
More information235 Final exam review questions
5 Final exam review questions Paul Hacking December 4, 0 () Let A be an n n matrix and T : R n R n, T (x) = Ax the linear transformation with matrix A. What does it mean to say that a vector v R n is an
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - (Alberto Bressan, Spring 7) sec: Orthogonal diagonalization of symmetric matrices When we seek to diagonalize a general n n matrix A, two difficulties may arise:
More informationMAT 1332: CALCULUS FOR LIFE SCIENCES. Contents. 1. Review: Linear Algebra II Vectors and matrices Definition. 1.2.
MAT 1332: CALCULUS FOR LIFE SCIENCES JING LI Contents 1 Review: Linear Algebra II Vectors and matrices 1 11 Definition 1 12 Operations 1 2 Linear Algebra III Inverses and Determinants 1 21 Inverse Matrices
More informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University February 6, 2018 Linear Algebra (MTH
More informationMatrix Arithmetic. j=1
An m n matrix is an array A = Matrix Arithmetic a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn of real numbers a ij An m n matrix has m rows and n columns a ij is the entry in the i-th row and j-th column
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More information6.1 Matrices. Definition: A Matrix A is a rectangular array of the form. A 11 A 12 A 1n A 21. A 2n. A m1 A m2 A mn A 22.
61 Matrices Definition: A Matrix A is a rectangular array of the form A 11 A 12 A 1n A 21 A 22 A 2n A m1 A m2 A mn The size of A is m n, where m is the number of rows and n is the number of columns The
More informationMidterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015
Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015 The test lasts 1 hour and 15 minutes. No documents are allowed. The use of a calculator, cell phone or other equivalent electronic
More informationHomework 1 Elena Davidson (B) (C) (D) (E) (F) (G) (H) (I)
CS 106 Spring 2004 Homework 1 Elena Davidson 8 April 2004 Problem 1.1 Let B be a 4 4 matrix to which we apply the following operations: 1. double column 1, 2. halve row 3, 3. add row 3 to row 1, 4. interchange
More informationComputing Eigenvalues and/or Eigenvectors;Part 2, The Power method and QR-algorithm
Computing Eigenvalues and/or Eigenvectors;Part 2, The Power method and QR-algorithm Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 19, 2010 Today
More informationSymmetric Matrices and Eigendecomposition
Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions
More informationIntroduction to PDEs and Numerical Methods Lecture 7. Solving linear systems
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Introduction to PDEs and Numerical Methods Lecture 7. Solving linear systems Dr. Noemi Friedman, 09.2.205. Reminder: Instationary heat
More informationA Review of Linear Algebra
A Review of Linear Algebra Gerald Recktenwald Portland State University Mechanical Engineering Department gerry@me.pdx.edu These slides are a supplement to the book Numerical Methods with Matlab: Implementations
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationChapter 1 Matrices and Systems of Equations
Chapter 1 Matrices and Systems of Equations System of Linear Equations 1. A linear equation in n unknowns is an equation of the form n i=1 a i x i = b where a 1,..., a n, b R and x 1,..., x n are variables.
More informationReview of Linear Algebra
Review of Linear Algebra Dr Gerhard Roth COMP 40A Winter 05 Version Linear algebra Is an important area of mathematics It is the basis of computer vision Is very widely taught, and there are many resources
More informationDifferential equations
Differential equations Math 7 Spring Practice problems for April Exam Problem Use the method of elimination to find the x-component of the general solution of x y = 6x 9x + y = x 6y 9y Soln: The system
More informationMath 489AB Exercises for Chapter 2 Fall Section 2.3
Math 489AB Exercises for Chapter 2 Fall 2008 Section 2.3 2.3.3. Let A M n (R). Then the eigenvalues of A are the roots of the characteristic polynomial p A (t). Since A is real, p A (t) is a polynomial
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationMATRICES. a m,1 a m,n A =
MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of
More informationLinear Algebra. Linear Equations and Matrices. Copyright 2005, W.R. Winfrey
Copyright 2005, W.R. Winfrey Topics Preliminaries Systems of Linear Equations Matrices Algebraic Properties of Matrix Operations Special Types of Matrices and Partitioned Matrices Matrix Transformations
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 998 Comments to the author at krm@mathsuqeduau All contents copyright c 99 Keith
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More information