Geometric Modeling Summer Semester 2010 Mathematical Tools (1)
|
|
- Dayna Aileen Howard
- 5 years ago
- Views:
Transcription
1 Geometric Modeling Summer Semester 2010 Mathematical Tools (1) Recap: Linear Algebra
2 Today... Topics: Mathematical Background Linear algebra Analysis & differential geometry Numerical techniques Geometric Modeling Summer Semester 2010 Mathematical Tools 2/ 78
3 Mathematical Tools Linear Algebra
4 Overview Linear algebra Vector spaces Linear maps Quadrics Geometric Modeling Summer Semester 2010 Mathematical Tools 4/ 78
5 Vectors Vector spaces Vectors, Coordinates & Points Formal definition of a vector space Vector algebra Generalizations: Infinite dimensional vector spaces Function spaces Approimation with finite dimensional spaces More Tools: Dot product and norms The cross product Geometric Modeling Summer Semester 2010 Mathematical Tools 5/ 78
6 Vectors vectors are arrows in space classically: 2 or 3 dim. Euclidian space Geometric Modeling Summer Semester 2010 Mathematical Tools 6/ 78
7 Vector Operations w v v + w Adding Vectors: Concatenation Geometric Modeling Summer Semester 2010 Mathematical Tools 7/ 78
8 Vector Operations 2.0 v 1.5 v v 1.0 v Scalar Multiplication: Scaling vectors (incl. mirroring) Geometric Modeling Summer Semester 2010 Mathematical Tools 8/ 78
9 You can combine it... v 2w + v w Linear Combinations: This is basically all you can do. n r = λ v i= 1 i i Geometric Modeling Summer Semester 2010 Mathematical Tools 9/ 78
10 Vector Spaces Many classes of objects share the same structure: Geometric Objects 1,2,3,4... dimensional Euclidian vectors But also a lot of other mathematical objects Vectors with comple numbers, or finite fields Certain sets of functions Polynomials... Approach the problem from a more abstract level More general: Saves time, reduces number of proofs Can still resort to geometric vectors to get an intuition about what s going on Geometric Modeling Summer Semester 2010 Mathematical Tools 10 / 78
11 Vector Spaces Definition: Vector Space V over a Field F Consists of a set of vectors V F is a field (usually: Real numbers, F = R) Provides two operations: Adding vectors u = v + w (u, v, w V) Scaling vectors w = λv (u V, λ F) The two operations are closed, i.e.: operations on any elements of the vector space will yields elements of the vector space itself....and finally: A number of properties that have to hold: Geometric Modeling Summer Semester 2010 Mathematical Tools 11 / 78
12 Vector Spaces Definition: Vector Space V over a Field F (cont.) (a1) u, v, w V : ( u + v) + w = u + ( v + w) (a2) u, v V : u + v = v + u (a3) 0 V : v V v + 0 = v V : V (a4) (s1) (s2) (s3) (s4) v V : w V : v + w = 0 V ( μ v) ( λμ )v v V, λ, μ F : λ = for 1 F : v V : v = v F 1F ( v + w) = λv λw λ F : v, w V : λ + ( λ + μ) v = λv μv λ, μ F, v V : + Geometric Modeling Summer Semester 2010 Mathematical Tools 12 / 78
13 Vector Spaces Vector spaces Out of these formal assumptions, a long list of derivative properties (theorems) can be deduced. Will hold for any vector space. In particular, we will see that the assumptions are sufficient to obtain the columns with coordinates, we started with (in the finite dimensional case). Geometric Modeling Summer Semester 2010 Mathematical Tools 13 / 78
14 Properties Some properties you can easily prove: The zero vector 0 V is unique. For 2D vectors: Multiplication with the scalar 0 F yields the zero vector. The additive inverse v is unique given v. Multiplication by 1 yields the inverse vector. And so on... 0 V 0 = 0 Geometric Modeling Summer Semester 2010 Mathematical Tools 14 / 78
15 Span and Basis v span {v} line through the origin {u,v} {u,v,w} form a basis of R 2 span {u,v,w} = R 2 u, v, w u, v, w Geometric Modeling Summer Semester 2010 Mathematical Tools 15 / 78
16 Geometric Modeling Summer Semester 2010 Mathematical Tools 16 / 78 Eample Spaces Eamples of finite dimensional vector spaces: Of course: R, R 2, R 3, R 4... Standard basis of R 3 : Coordinates: 1 0 0, 0 1 0, ^ : k j i z y z y z y + + = + + =
17 Eample Spaces Eamples of finite dimensional vector spaces: Polynomials of fied degree For eample, all polynomials of 2nd order: general form: a 2 + b + c addition: (a b 1 + c 1 ) + (a b 2 +c 2 ) = (a 1 + a 2 ) 2 + (b 1 + b 2 ) + (c 1 + c 2 ) scalar multiplication: λ(a 2 + b + c) = (λa) 2 + (λb) + (λc) Might be confusing: Evaluation of polynomials at is non linear, does not relate to the vector space structure Coordinates: [a, b, c] T Basis for these coordinates: { 2,, 1} Geometric Modeling Summer Semester 2010 Mathematical Tools 17 / 78
18 Eample Spaces Infinite dimensional vector spaces: Polynomials (of any degree) Need to represent coefficients of arbitrary degree Coordinate vectors can potentially become arbitrarily long i General form: ( ) = a i (only a finite subset of the a i nonzero) poly = i 0 Basis: { i i = 0,1,2,... } Coordinate vectors: ( a a, a,,...) 0, 1 2 a3 Geometric Modeling Summer Semester 2010 Mathematical Tools 18 / 78
19 Geometric Modeling Summer Semester 2010 Mathematical Tools 19 / 78 Spaces of Sequences First generalization: Make vectors infinitely long Spaces of sequences Dimension =, countable a i a a a z y 3 2 1
20 Eample Spaces More infinite dimensional vector spaces: Function spaces Space of all functions f: R R Space of all smooth C k functions f: R R Space of all functions f: [0..1] R Not a vector space: f: [0..1] [0..1] + = Geometric Modeling Summer Semester 2010 Mathematical Tools 20 / 78
21 Function Spaces Vector operations For f: Ω R, define: (f + g)() := f() + g() ( Ω) (λf)() := λ(f()) ( Ω) The zero vector is: 0 V = (f: f() 0) Geometric Modeling Summer Semester 2010 Mathematical Tools 21 / 78
22 Function Spaces Intuition: Start with a finite dimensional vector Increase sampling density towards infinity Real numbers: uncountable amount of dimensions [f 1,f 2,...,f 9 ] T [f 1,f 2,...,f 18 ] T f() d = 9 d = 18 d = Geometric Modeling Summer Semester 2010 Mathematical Tools 22 / 78
23 Approimation of Function Spaces Finite dimensional subspaces: Function spaces with infinite dimension are hard to represented on a computer For numerical purpose, finite dimensional subspaces are used to approimate the larger space Two basic approaches: Geometric Modeling Summer Semester 2010 Mathematical Tools 23 / 78
24 Approimation of Function Spaces Here is the recipe : We are given an infinite dimensional function space V. We are looking for f V with a certain property. From a function space V we choose linearly independent functions f 1,...,f d V to form the d dimensional subspace span{f 1,...,f d }. Instead of looking for the f V, we look only among the ~ d f : = i= 1 λ i f i for a function that best matches the desired property (might be just an approimation, though). ~ The good thing: f is described by (λ 1,...,λ d ). Good for the computer... Geometric Modeling Summer Semester 2010 Mathematical Tools 24 / 78
25 Approimation of Function Spaces Two Approaches: Construct a basis, that already provides a subspace containing the functions you want Typically, the coefficients will have an intuitive meaning then Bezier Splines, B Splines, NURBS are all about that Choose a basis that can approimate the functions you might want, then pick the closest Standard approach in numerical solutions to partial differential equations and integral equations Basic idea: Define a measure of correctness C(f), then try to ~ maimize C(f) Geometric Modeling Summer Semester 2010 Mathematical Tools 25 / 78
26 Finite Dimensional Function Spaces Typical Basis Sets: Consider the space of functions f: [a, b] R. Some d dimensional subspaces: span {,,...,, } (piecewise constant basis) span { 1,, 2,..., d 1 } (Monomial basis of degree d 1) span { 1, sin, cos, sin 2, cos 2,..., sin (d 1)/2, cos (d 1)/2 } (Fourier basis of order (d 1)/2, usually a = 0, b = 2π) It depends all on the application, of course... Geometric Modeling Summer Semester 2010 Mathematical Tools 26 / 78
27 Eamples 0 π 2π Monomial basis Fourier basis Geometric Modeling Summer Semester 2010 Mathematical Tools 27 / 78
28 More Tools for Vectors More operations: Dot product / scalar product / inner product (measures distances, angles) Cross product (only R 3 ) Geometric Modeling Summer Semester 2010 Mathematical Tools 28 / 78
29 Geometric Modeling Summer Semester 2010 Mathematical Tools 29 / 78 The Standard Scalar Product The standard dot product for vectors v,w R d is defined as: For v,w R 3 : = = = = d i v i w i 1 T, w : v w v w v z z y y z y z y w v w v w v w w w v v v + + = v w =
30 Properties Geometric properties: length( v): = v = v v (Pythagoras) 2 v w = v w cos ( v, w) (projection property) v v w w v w w w w w Geometric Modeling Summer Semester 2010 Mathematical Tools 30 / 78
31 Properties Geometric properties: length( v): = v = v v (Pythagoras) 2 v w = v w cos ( v, w) (projection property) In particular: v orthogonal to w v w = 0 Geometric Modeling Summer Semester 2010 Mathematical Tools 31 / 78
32 Properties Gram Schmidt Orthogonalization: v v w w w w v v w w w w v w w w Repeat for multiple vectors to create orthogonal set of vectors {v 1,..., v n } from set {v 1,...,v n } Geometric Modeling Summer Semester 2010 Mathematical Tools 32 / 78
33 Properties Scalar product properties: Symmetric: Bi linear: Positive: v w = w v u ( λv + w) = u λv + u w v v = 0 v = 0 abstract definition Geometric Modeling Summer Semester 2010 Mathematical Tools 33 / 78
34 Dot Product on Function Spaces We need dot products on function spaces... For square integrable functions f, g: Ω R n R, the standard scalar product is defined as: f g : = f ( ) g( ) d Ω It measures an abstract normal and angle between function (not in a geometric sense) Orthogonal functions: Don t influence each other in linear combinations. Adding one to the other does not change the value in the other ones direction. Geometric Modeling Summer Semester 2010 Mathematical Tools 34 / 78
35 Linear Maps Linear maps Linear maps and matrices Inverting and linear systems of equations Eigenvectors and eigenvalues Ill posed problems Geometric Modeling Summer Semester 2010 Mathematical Tools 35 / 78
36 Linear Maps A function f: V W between vector spaces V, W over a field F is a linear map, if and only if: v 1,v 2 V: f(v 1 +v 2 ) = f(v 1 ) + f(v 2 ) v V, λ F: f(λv) = λf(v) Theorem: A linear map is uniquely determined if we specify a mapping value for each basis vector of V. Geometric Modeling Summer Semester 2010 Mathematical Tools 36 / 78
37 Matri Representation Any linear map f between finite dimensional spaces can be represented as a matri: We fi a basis (usually the standard basis) For each basis vector v i of V, we specify the mapped vector w i. Then, the map f is given by: f v 1 v ) = f = v1w v v n ( 1 n w n Geometric Modeling Summer Semester 2010 Mathematical Tools 37 / 78
38 Geometric Modeling Summer Semester 2010 Mathematical Tools 38 / 78 Matri Representation This can be written as matri vector product: The columns are the images of the basis vectors (for which the coordinates of v are given) = n n v v v f 1 1 ) ( w w
39 Matri Multiplication Composition of linear maps corresponds to matri products: f ( g ) = f g = M M Matri product calculation: f g M f M g The (,y) th entry is the dot product of row of M f and column y of M g M f M g Geometric Modeling Summer Semester 2010 Mathematical Tools 39 / 78
40 Geometric Modeling Summer Semester 2010 Mathematical Tools 40 / 78 Eample Eample: rotation matri Eample: identity matri = α α α α cos sin sin cos M rot = : I
41 Orthogonal Matrices Orthogonal Matri A matri is called orthogonal if all of its columns (rows) are orthonormal, i.e. c c = 1, c c = 0 for i j i The inverse of an orthogonal matri is its transpose: 1 T MM = MM = I i T M i j M Geometric Modeling Summer Semester 2010 Mathematical Tools 41 / 78
42 Affine Maps Affine Maps Translations are not linear (ecept for zero translation) A combination of a linear map and a translation can be described by: f ( ) = M + t This is called an affine map Composition of affine maps are affine: f ( g( ) ) = M f ( M g + t g ) + t f = ( M M ) + ( M t + t ) f g f g For a vector space V, a subspace S V and a point p V, the set { = p + v, v V} is called an affine subspace of V. If p 0, this is not a vector space. Geometric Modeling Summer Semester 2010 Mathematical Tools 42 / 78 f
43 Linear Systems of Equations Problem: Invert an affine map Given: M = b We know M, b Looking for Solution The set of solution is always an affine subspace of R n (i.e., a point, a line, a plane...), or the empty set. There are innumerous algorithms for solving linear systems, here is a brief summary... Geometric Modeling Summer Semester 2010 Mathematical Tools 43 / 78
44 Solvers for Linear Systems Algorithms for solving linear systems of equations: Gaussian elimination: O(n 3 ) operations for n n matrices We can do better, in particular for special cases: Band matrices: constant bandwidth Sparse matrices: constant number of non zero entries per row Store only non zero entries Instead of (3.5, 0, 0, 0, 7, 0, 0), store [(1:3.5), (5:7)] Geometric Modeling Summer Semester 2010 Mathematical Tools 44 / 78
45 Solvers for Linear Systems Algorithms for solving linear systems of equations: Band matrices, constant bandwidth: modified elimination algorithm with O(n) operations. Iterative Gauss Seidel solver: converges for diagonally dominant matrices. Typically: O(n) iterations, each costs O(n) for a sparse matri. Conjugate Gradient solver: works for symmetric, positive definite matrices in O(n) iterations, but typically we get a good solution already after O( n) iterations. More details on iterative solvers: J. R. Shewchuk: An Introduction to the Conjugate Gradient Method Without the Agonizing Pain, Geometric Modeling Summer Semester 2010 Mathematical Tools 45 / 78
46 Determinants Determinants Assign a scalar det(m) to square matrices M The scalar measures the volume of the parallelepiped formed by the column vectors: M = v 1 v 2 v 3 v 2 v 3 det(m) v 1 Geometric Modeling Summer Semester 2010 Mathematical Tools 46 / 78
47 Properties A few properties: det(a)det(b) = det(ab) det(λa) = λ n det(a) (n n matri A) det(a 1 ) = det(a) 1 det(a T ) = det(a) Can be computed efficiently using Gaussian elimination Geometric Modeling Summer Semester 2010 Mathematical Tools 47 / 78
48 Eigenvectors & Eigenvalues Definition: If for a linear map M and a non zero vector we have M = λ we call λ an eigenvalue of M and the corresponding eigenvector. Geometric Modeling Summer Semester 2010 Mathematical Tools 48 / 78
49 Eample Intuition: In the direction of an eigenvector, the linear map acts like a scaling Eample: two eigenvalues (0.5 and 2) Two eigenvectors Standard basis contains no eigenvectors Geometric Modeling Summer Semester 2010 Mathematical Tools 49 / 78
50 Eigenvectors & Eigenvalues Diagonalization: In case an n n matri M has n linear independent eigenvectors, we can diagonalize M by transforming to this coordinate system: M = TDT 1. Geometric Modeling Summer Semester 2010 Mathematical Tools 50 / 78
51 Spectral Theorem Spectral Theorem: If M is a symmetric n n matri of real numbers (i.e. M = M T ), there eists an orthogonal set of n eigenvectors. This means, every (real) symmetric matri can be diagonalized: M = TDT T with an orthogonal matri T. Geometric Modeling Summer Semester 2010 Mathematical Tools 51 / 78
52 Computation Simple algorithm Power iteration for symmetric matrices Computes largest eigenvalue even for large matrices Algorithm: Start with a random vector (maybe multiple tries) Repeatedly multiply with matri Normalize vector after each step Repeat until ration before / after normalization converges (this is the eigenvalue) Important intuition: Largest eigenvalue is the dominant component of the linear map. Geometric Modeling Summer Semester 2010 Mathematical Tools 52 / 78
53 Powers of Matrices What happens: A symmetric matri can be written as: M = TDT T λ1 = T λ n T Taking it to the k th power yields: M k = TDT T TDT Bottom line: Eigenvalue analysis is the key to understanding powers of matrices. T k λ1 T T k T T... TDT = TD T = T T Geometric Modeling Summer Semester 2010 Mathematical Tools 53 / 78 λ k n
54 Improvements Improvements to the power method: Find smallest? use inverse matri. Find all (for a symmetric matri)? run repeatedly, orthogonalize current estimate to already known eigenvectors in each iteration (Gram Schmidt) How long does it take? ratio to net smaller eigenvalue, gap increases eponentially. There are more sophisticated algorithms based on this idea. Geometric Modeling Summer Semester 2010 Mathematical Tools 54 / 78
55 Generalization: SVD Singular value decomposition: Let M be an arbitrary real matri (may be rectangular) Then M can be written as: M = UDV T The matrices U, V are orthogonal D is a diagonal matri (might contain zeros) The diagonal entries are called singular values. U and V are different in general. For diagonalizable matrices, they are the same, and the singular values are the eigenvalues. Geometric Modeling Summer Semester 2010 Mathematical Tools 55 / 78
56 Singular Value Decomposition Singular value decomposition M = U orthogonal D σ σ σ σ T V orthogonal Geometric Modeling Summer Semester 2010 Mathematical Tools 56 / 78
57 Singular Value Decomposition Singular value decomposition Can be used to solve linear systems of equations For full rank, square M: M = UDV T M 1 = (UDV T ) 1 = (V T ) 1 D 1 (U 1 ) = VD 1 U T Good numerical properties (numerically stable), but epensive The OpenCV library provides a very good implementation of the SVD Geometric Modeling Summer Semester 2010 Mathematical Tools 57 / 78
58 Inverse Problems Settings A (physical) process f takes place It transforms the original input into an output b Task: recover from b Eamples: 3D structure from photographs Tomography: values from line integrals 3D geometry from a noisy 3D scan Geometric Modeling Summer Semester 2010 Mathematical Tools 58 / 78
59 Linear Inverse Problems Assumption: f is linear and finite dimensional f() = b M f = b Inversion of f is said to be an ill posed problem, if one of the following three conditions hold: There is no solution There is more than one solution There is eactly one solution, but the SVD contains very small singular values. Geometric Modeling Summer Semester 2010 Mathematical Tools 59 / 78
60 Ill posed Problems Ratio: Small singular values amplify errors Assume our input is ineact (e.g. measurement noise) Reminder: M 1 = VD 1 U T does not hurt does not hurt (orthogonal) (orthogonal) this one is decisive Orthogonal transforms preserve the norm of, so V and U do not cause problems Geometric Modeling Summer Semester 2010 Mathematical Tools 60 / 78
61 Ill posed Problems Ratio: Small singular values amplify errors Reminder: = M 1 b = (VD 1 U T )b Say D looks like that: D : = Any input noise in b in the direction of the fourth right singular vector will be amplified by If our measurement precision is less than that, the result will be unusable. Does not depend on how we invert the matri. Condition number: σ ma /σ min Geometric Modeling Summer Semester 2010 Mathematical Tools 61 /
62 Regularization Regularization Aims at avoiding the inversion problems Various techniques; in general the goal is to ignore the misleading information Subspace inversion: do not use directions with small singular values (needs an SVD) Additional assumptions: Assume smoothness (or something similar) in case of unclear or missing information so that compound problem (f + assumptions) is well posed Geometric Modeling Summer Semester 2010 Mathematical Tools 62 / 78
63 Quadrics Quadrics Multivariate polynomials Quadratic optimization Quadrics & eigenvalue problems Geometric Modeling Summer Semester 2010 Mathematical Tools 63 / 78
64 Multivariate Polynomials A multi variate polynomial of total degree d: A function f: R n R, f() f is a polynomial in the components of In any direction f(s+tr), we obtain a one dimensional polynomial of maimum degree d in t. Eamples: f([,y] T ) := + y + y is of total degree 2. In diagonal direction, we obtain f(t[1/ 2, 1/ 2] T ) = t 2. f([,y] T ) := c c 02 y 2 + c 11 y + c 10 + c 01 y + c 00 is a quadratic polynomial in two variables Geometric Modeling Summer Semester 2010 Mathematical Tools 64 / 78
65 Quadratic Polynomials In general, any quadratic polynomial in n variables can be written as: T A + b T + c A is an n n matri, b is an n dim. vector, c is a number Matri A can always be chosen to be symmetric If it isn t, we can substitute by 0.5 (A + A T ), not changing the polynomial Geometric Modeling Summer Semester 2010 Mathematical Tools 65 / 78
66 Geometric Modeling Summer Semester 2010 Mathematical Tools 66 / 78 Eample Eample: = + = = = = = = = = ) ( ) ( ] [ ] [ ) ( T T T y y y y y y y y y y y y y f y f
67 Geometric Modeling Summer Semester 2010 Mathematical Tools 67 / 78 Quadratic Polynomials Specifying quadratic polynomials: T A + b T + c b shifts the function in space (if A has full rank): c is an additive constant ( ) ( ) ( ) c c c + + = + + = + μ μ μ μ μ μ μ μ μ A A A A A A 2 T (A sym.) T T T T = b
68 Some Properties Important properties Multivariate polynomials form a vector space We can add them component wise: y 2 +4y y y 2 +1y y + 5 = y 2 +5y y + 9 In vector notation: T A 1 + b 1T + c 1 + λ( T A 2 + b 2T + c 2 ) = T (A 1 +λa 2 ) + (b 1 +λb 2 ) T + (c 1 +λc 2 ) Geometric Modeling Summer Semester 2010 Mathematical Tools 68 / 78
69 Quadratic Polynomials Quadrics The zero level set of such a quadratic polynomial is called a quadric Shape depends on eigenvalues of A b shifts the object in space c sets the level Geometric Modeling Summer Semester 2010 Mathematical Tools 69 / 78
70 Geometric Modeling Summer Semester 2010 Mathematical Tools 70 / 78 Shapes of Quadrics Shape analysis: A is symmetric A can be diagonalized with orthogonal eigenvectors Q contains the principal ais of the quadric The eigenvalues determine the quadratic growth (up, down, speed of growth) ( ) ( ) n n Q Q Q Q A = = λ λ λ λ 1 T 1 T T T
71 Shapes of Quadratic Polynomials λ 1 = 1, λ 2 = 1 λ 1 = 1, λ 2 = 1 λ 1 = 1, λ 2 = 0 Geometric Modeling Summer Semester 2010 Mathematical Tools 71 / 78
72 The Iso Lines: Quadrics elliptic hyperbolic degenerate case λ 1 > 0, λ 2 > 0 λ 1 < 0, λ 2 > 0 λ 1 = 0, λ 2 0 Geometric Modeling Summer Semester 2010 Mathematical Tools 72 / 78
73 Quadratic Optimization Quadratic Optimization Assume we want to minimize a quadratic objective function T A + b T + c A has only positive eigenvalues. Means: It s a paraboloid with a unique minimum The verte (critical point) of the paraboloid can be determined by simply solving a linear system More on this later (need some more analysis first) Geometric Modeling Summer Semester 2010 Mathematical Tools 73 / 78
74 Rayleigh Quotient Relation to eigenvalues: The minimum and maimum eigenvalues of a symmetric matri A can be epressed as constraint quadratic optimization problem: T ( A) T λ = min = min ( A) T λ = ma = ma min A T = 1 ma T A T = 1 The other way round eigenvalues solve a certain type of constrained, (non conve) optimization problem. Geometric Modeling Summer Semester 2010 Mathematical Tools 74 / 78
75 Geometric Modeling Summer Semester 2010 Mathematical Tools 75 / 78 Coordinate Transformations One more interesting property: Given a positive definite symmetric ( SPD ) matri M (all eigenvalues positive) Such a matri can always be written as square of another matri: ( ) ( )( ) ( ) = = = = = n T T T D D T D T D T T D D T λ λ 1 2 T TDT M
76 SPD Quadrics main ais T T M Identity I Interpretation: Start with a unit positive quadric T. Scale the main ais (diagonal of D) M = TDT ( ) T D 2 Rotate to a different coordinate system (columns of T) Recovering main ais from M: Compute eigensystem ( principal component analysis ) T = Geometric Modeling Summer Semester 2010 Mathematical Tools 76 / 78
77 Software
78 GeoX GeoX comes with several linear algebra libraries: 2D, 3D, 4D vectors and matrices: LinearAlgebra.h Large (dense) vectors and matrices: DynamicLinearAlgebra.h Gaussian elimination: invertmatri() Sparse matrices: SparseLinearAlgebra.h Iterative solvers (Gauss Seidel, conjugate gradients, power iteration): IterativeSolvers.h Geometric Modeling Summer Semester 2010 Mathematical Tools 78 / 78
Statistical Geometry Processing Winter Semester 2011/2012
Statistical Geometry Processing Winter Semester 2011/2012 Linear Algebra, Function Spaces & Inverse Problems Vector and Function Spaces 3 Vectors vectors are arrows in space classically: 2 or 3 dim. Euclidian
More informationGeometric Modeling Summer Semester 2012 Linear Algebra & Function Spaces
Geometric Modeling Summer Semester 2012 Linear Algebra & Function Spaces (Recap) Announcement Room change: On Thursday, April 26th, room 024 is occupied. The lecture will be moved to room 021, E1 4 (the
More informationReview problems for MA 54, Fall 2004.
Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on
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 informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationMobile Robotics 1. A Compact Course on Linear Algebra. Giorgio Grisetti
Mobile Robotics 1 A Compact Course on Linear Algebra Giorgio Grisetti SA-1 Vectors Arrays of numbers They represent a point in a n dimensional space 2 Vectors: Scalar Product Scalar-Vector Product Changes
More informationMath 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam
Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system
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 informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationMathematics 1. Part II: Linear Algebra. Exercises and problems
Bachelor Degree in Informatics Engineering Barcelona School of Informatics Mathematics Part II: Linear Algebra Eercises and problems February 5 Departament de Matemàtica Aplicada Universitat Politècnica
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 informationLinear Algebra - Part II
Linear Algebra - Part II Projection, Eigendecomposition, SVD (Adapted from Sargur Srihari s slides) Brief Review from Part 1 Symmetric Matrix: A = A T Orthogonal Matrix: A T A = AA T = I and A 1 = A T
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 informationLinear Algebra Review
Chapter 1 Linear Algebra Review It is assumed that you have had a course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc. I will review some of these terms here, but quite
More informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More informationLinear Algebra- Final Exam Review
Linear Algebra- Final Exam Review. Let A be invertible. Show that, if v, v, v 3 are linearly independent vectors, so are Av, Av, Av 3. NOTE: It should be clear from your answer that you know the definition.
More informationLINEAR ALGEBRA KNOWLEDGE SURVEY
LINEAR ALGEBRA KNOWLEDGE SURVEY Instructions: This is a Knowledge Survey. For this assignment, I am only interested in your level of confidence about your ability to do the tasks on the following pages.
More informationGlossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationMATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL
MATH 3 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MAIN TOPICS FOR THE FINAL EXAM:. Vectors. Dot product. Cross product. Geometric applications. 2. Row reduction. Null space, column space, row space, left
More information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationCS 143 Linear Algebra Review
CS 143 Linear Algebra Review Stefan Roth September 29, 2003 Introductory Remarks This review does not aim at mathematical rigor very much, but instead at ease of understanding and conciseness. Please see
More informationReview of some mathematical tools
MATHEMATICAL FOUNDATIONS OF SIGNAL PROCESSING Fall 2016 Benjamín Béjar Haro, Mihailo Kolundžija, Reza Parhizkar, Adam Scholefield Teaching assistants: Golnoosh Elhami, Hanjie Pan Review of some mathematical
More informationk is a product of elementary matrices.
Mathematics, Spring Lecture (Wilson) Final Eam May, ANSWERS Problem (5 points) (a) There are three kinds of elementary row operations and associated elementary matrices. Describe what each kind of operation
More informationComputational Methods. Eigenvalues and Singular Values
Computational Methods Eigenvalues and Singular Values Manfred Huber 2010 1 Eigenvalues and Singular Values Eigenvalues and singular values describe important aspects of transformations and of data relations
More informationIntroduction to Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz
Introduction to Mobile Robotics Compact Course on Linear Algebra Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz Vectors Arrays of numbers Vectors represent a point in a n dimensional space
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationDesigning Information Devices and Systems II
EECS 16B Fall 2016 Designing Information Devices and Systems II Linear Algebra Notes Introduction In this set of notes, we will derive the linear least squares equation, study the properties symmetric
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 informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationMath 302 Outcome Statements Winter 2013
Math 302 Outcome Statements Winter 2013 1 Rectangular Space Coordinates; Vectors in the Three-Dimensional Space (a) Cartesian coordinates of a point (b) sphere (c) symmetry about a point, a line, and a
More informationLINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
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 information33A Linear Algebra and Applications: Practice Final Exam - Solutions
33A Linear Algebra and Applications: Practice Final Eam - Solutions Question Consider a plane V in R 3 with a basis given by v = and v =. Suppose, y are both in V. (a) [3 points] If [ ] B =, find. (b)
More informationMATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION
MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether
More informationLinear Algebra Primer
Linear Algebra Primer David Doria daviddoria@gmail.com Wednesday 3 rd December, 2008 Contents Why is it called Linear Algebra? 4 2 What is a Matrix? 4 2. Input and Output.....................................
More informationBASIC ALGORITHMS IN LINEAR ALGEBRA. Matrices and Applications of Gaussian Elimination. A 2 x. A T m x. A 1 x A T 1. A m x
BASIC ALGORITHMS IN LINEAR ALGEBRA STEVEN DALE CUTKOSKY Matrices and Applications of Gaussian Elimination Systems of Equations Suppose that A is an n n matrix with coefficents in a field F, and x = (x,,
More informationMatrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A =
30 MATHEMATICS REVIEW G A.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = a 11 a 12... a 1N a 21 a 22... a 2N...... a M1 a M2... a MN A matrix can
More informationApplied Linear Algebra
Applied Linear Algebra Peter J. Olver School of Mathematics University of Minnesota Minneapolis, MN 55455 olver@math.umn.edu http://www.math.umn.edu/ olver Chehrzad Shakiban Department of Mathematics University
More informationLinear Algebra Highlights
Linear Algebra Highlights Chapter 1 A linear equation in n variables is of the form a 1 x 1 + a 2 x 2 + + a n x n. We can have m equations in n variables, a system of linear equations, which we want to
More informationMATH 235. Final ANSWERS May 5, 2015
MATH 235 Final ANSWERS May 5, 25. ( points) Fix positive integers m, n and consider the vector space V of all m n matrices with entries in the real numbers R. (a) Find the dimension of V and prove your
More information14 Singular Value Decomposition
14 Singular Value Decomposition For any high-dimensional data analysis, one s first thought should often be: can I use an SVD? The singular value decomposition is an invaluable analysis tool for dealing
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 informationA Brief Outline of Math 355
A Brief Outline of Math 355 Lecture 1 The geometry of linear equations; elimination with matrices A system of m linear equations with n unknowns can be thought of geometrically as m hyperplanes intersecting
More informationMATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)
MATH 20F: LINEAR ALGEBRA LECTURE B00 (T KEMP) Definition 01 If T (x) = Ax is a linear transformation from R n to R m then Nul (T ) = {x R n : T (x) = 0} = Nul (A) Ran (T ) = {Ax R m : x R n } = {b R m
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationIntroduction to Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Bastian Steder
Introduction to Mobile Robotics Compact Course on Linear Algebra Wolfram Burgard, Bastian Steder Reference Book Thrun, Burgard, and Fox: Probabilistic Robotics Vectors Arrays of numbers Vectors represent
More informationMathematical foundations - linear algebra
Mathematical foundations - linear algebra Andrea Passerini passerini@disi.unitn.it Machine Learning Vector space Definition (over reals) A set X is called a vector space over IR if addition and scalar
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 informationMATH 583A REVIEW SESSION #1
MATH 583A REVIEW SESSION #1 BOJAN DURICKOVIC 1. Vector Spaces Very quick review of the basic linear algebra concepts (see any linear algebra textbook): (finite dimensional) vector space (or linear space),
More informationA Review of Linear Algebra
A Review of Linear Algebra Mohammad Emtiyaz Khan CS,UBC A Review of Linear Algebra p.1/13 Basics Column vector x R n, Row vector x T, Matrix A R m n. Matrix Multiplication, (m n)(n k) m k, AB BA. Transpose
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationComputational Methods CMSC/AMSC/MAPL 460. Eigenvalues and Eigenvectors. Ramani Duraiswami, Dept. of Computer Science
Computational Methods CMSC/AMSC/MAPL 460 Eigenvalues and Eigenvectors Ramani Duraiswami, Dept. of Computer Science Eigen Values of a Matrix Recap: A N N matrix A has an eigenvector x (non-zero) with corresponding
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW JC Stuff you should know for the exam. 1. Basics on vector spaces (1) F n is the set of all n-tuples (a 1,... a n ) with a i F. It forms a VS with the operations of + and scalar multiplication
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 informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called
More informationRemark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial
More informationVectors To begin, let us describe an element of the state space as a point with numerical coordinates, that is x 1. x 2. x =
Linear Algebra Review Vectors To begin, let us describe an element of the state space as a point with numerical coordinates, that is x 1 x x = 2. x n Vectors of up to three dimensions are easy to diagram.
More informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
More informationLinear Algebra in Actuarial Science: Slides to the lecture
Linear Algebra in Actuarial Science: Slides to the lecture Fall Semester 2010/2011 Linear Algebra is a Tool-Box Linear Equation Systems Discretization of differential equations: solving linear equations
More information6 Inner Product Spaces
Lectures 16,17,18 6 Inner Product Spaces 6.1 Basic Definition Parallelogram law, the ability to measure angle between two vectors and in particular, the concept of perpendicularity make the euclidean space
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
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 informationIntroduction to Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello
Introduction to Mobile Robotics Compact Course on Linear Algebra Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello Vectors Arrays of numbers Vectors represent a point
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationBackground Mathematics (2/2) 1. David Barber
Background Mathematics (2/2) 1 David Barber University College London Modified by Samson Cheung (sccheung@ieee.org) 1 These slides accompany the book Bayesian Reasoning and Machine Learning. The book and
More informationTBP MATH33A Review Sheet. November 24, 2018
TBP MATH33A Review Sheet November 24, 2018 General Transformation Matrices: Function Scaling by k Orthogonal projection onto line L Implementation If we want to scale I 2 by k, we use the following: [
More information7. Symmetric Matrices and Quadratic Forms
Linear Algebra 7. Symmetric Matrices and Quadratic Forms CSIE NCU 1 7. Symmetric Matrices and Quadratic Forms 7.1 Diagonalization of symmetric matrices 2 7.2 Quadratic forms.. 9 7.4 The singular value
More informationEigenvalues and Eigenvectors A =
Eigenvalues and Eigenvectors Definition 0 Let A R n n be an n n real matrix A number λ R is a real eigenvalue of A if there exists a nonzero vector v R n such that A v = λ v The vector v is called an eigenvector
More informationMATH 304 Linear Algebra Lecture 34: Review for Test 2.
MATH 304 Linear Algebra Lecture 34: Review for Test 2. Topics for Test 2 Linear transformations (Leon 4.1 4.3) Matrix transformations Matrix of a linear mapping Similar matrices Orthogonality (Leon 5.1
More informationThe value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.
Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class
More information1 9/5 Matrices, vectors, and their applications
1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 1: Course Overview & Matrix-Vector Multiplication Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 20 Outline 1 Course
More informationMATH 221, Spring Homework 10 Solutions
MATH 22, Spring 28 - Homework Solutions Due Tuesday, May Section 52 Page 279, Problem 2: 4 λ A λi = and the characteristic polynomial is det(a λi) = ( 4 λ)( λ) ( )(6) = λ 6 λ 2 +λ+2 The solutions to the
More information22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationUNIT 6: The singular value decomposition.
UNIT 6: The singular value decomposition. María Barbero Liñán Universidad Carlos III de Madrid Bachelor in Statistics and Business Mathematical methods II 2011-2012 A square matrix is symmetric if A T
More informationLU Factorization. A m x n matrix A admits an LU factorization if it can be written in the form of A = LU
LU Factorization A m n matri A admits an LU factorization if it can be written in the form of Where, A = LU L : is a m m lower triangular matri with s on the diagonal. The matri L is invertible and is
More informationLINEAR ALGEBRA SUMMARY SHEET.
LINEAR ALGEBRA SUMMARY SHEET RADON ROSBOROUGH https://intuitiveexplanationscom/linear-algebra-summary-sheet/ This document is a concise collection of many of the important theorems of linear algebra, organized
More informationLinear Least-Squares Data Fitting
CHAPTER 6 Linear Least-Squares Data Fitting 61 Introduction Recall that in chapter 3 we were discussing linear systems of equations, written in shorthand in the form Ax = b In chapter 3, we just considered
More informationLinear Algebra Practice Problems
Linear Algebra Practice Problems Page of 7 Linear Algebra Practice Problems These problems cover Chapters 4, 5, 6, and 7 of Elementary Linear Algebra, 6th ed, by Ron Larson and David Falvo (ISBN-3 = 978--68-78376-2,
More informationEigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization
Eigenvalues for Triangular Matrices ENGI 78: Linear Algebra Review Finding Eigenvalues and Diagonalization Adapted from Notes Developed by Martin Scharlemann June 7, 04 The eigenvalues for a triangular
More informationIntroduction to Matrix Algebra
Introduction to Matrix Algebra August 18, 2010 1 Vectors 1.1 Notations A p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the line. When p
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationReview of Some Concepts from Linear Algebra: Part 2
Review of Some Concepts from Linear Algebra: Part 2 Department of Mathematics Boise State University January 16, 2019 Math 566 Linear Algebra Review: Part 2 January 16, 2019 1 / 22 Vector spaces A set
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 informationDS-GA 1002 Lecture notes 10 November 23, Linear models
DS-GA 2 Lecture notes November 23, 2 Linear functions Linear models A linear model encodes the assumption that two quantities are linearly related. Mathematically, this is characterized using linear functions.
More informationhomogeneous 71 hyperplane 10 hyperplane 34 hyperplane 69 identity map 171 identity map 186 identity map 206 identity matrix 110 identity matrix 45
address 12 adjoint matrix 118 alternating 112 alternating 203 angle 159 angle 33 angle 60 area 120 associative 180 augmented matrix 11 axes 5 Axiom of Choice 153 basis 178 basis 210 basis 74 basis test
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 informationLecture II: Linear Algebra Revisited
Lecture II: Linear Algebra Revisited Overview Vector spaces, Hilbert & Banach Spaces, etrics & Norms atrices, Eigenvalues, Orthogonal Transformations, Singular Values Operators, Operator Norms, Function
More informationMAT 1302B Mathematical Methods II
MAT 1302B Mathematical Methods II Alistair Savage Mathematics and Statistics University of Ottawa Winter 2015 Lecture 19 Alistair Savage (uottawa) MAT 1302B Mathematical Methods II Winter 2015 Lecture
More informationI. Multiple Choice Questions (Answer any eight)
Name of the student : Roll No : CS65: Linear Algebra and Random Processes Exam - Course Instructor : Prashanth L.A. Date : Sep-24, 27 Duration : 5 minutes INSTRUCTIONS: The test will be evaluated ONLY
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 informationUpon successful completion of MATH 220, the student will be able to:
MATH 220 Matrices Upon successful completion of MATH 220, the student will be able to: 1. Identify a system of linear equations (or linear system) and describe its solution set 2. Write down the coefficient
More informationMATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors.
MATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors. Orthogonal sets Let V be a vector space with an inner product. Definition. Nonzero vectors v 1,v
More informationChapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors
Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there
More informationNOTES on LINEAR ALGEBRA 1
School of Economics, Management and Statistics University of Bologna Academic Year 207/8 NOTES on LINEAR ALGEBRA for the students of Stats and Maths This is a modified version of the notes by Prof Laura
More informationImage Registration Lecture 2: Vectors and Matrices
Image Registration Lecture 2: Vectors and Matrices Prof. Charlene Tsai Lecture Overview Vectors Matrices Basics Orthogonal matrices Singular Value Decomposition (SVD) 2 1 Preliminary Comments Some of this
More information