Linear Systems What is the Matrix?. Outline Announcements: –Homework III: due Wed. by 5, by e-mail Office Hours: Today & tomorrow, 11-1 –Ideas for Friday?

Slides:



Advertisements
Similar presentations
4/26/ LU Decomposition Civil Engineering Majors Authors: Autar Kaw Transforming.
Advertisements

Algebraic, transcendental (i.e., involving trigonometric and exponential functions), ordinary differential equations, or partial differential equations...
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
MA/CS 375 Fall MA/CS 375 Fall 2002 Lecture 18 Sit in your groups.
Linear Systems COS 323. Linear Systems Solve Ax=b, where A is an n  n matrix and b is an n  1 column vectorSolve Ax=b, where A is an n  n matrix and.
MATH 685/ CSI 700/ OR 682 Lecture Notes
Linear Systems of Equations
Solving Linear Systems (Numerical Recipes, Chap 2)
Major: All Engineering Majors Authors: Autar Kaw
Systems of Linear Equations
Grayson Ishihara Math 480 April 15,  What is Partial Pivoting?  What is the PA=LU Factorization?  What kinds of things can we use these tools.
SOLVING SYSTEMS OF LINEAR EQUATIONS. Overview A matrix consists of a rectangular array of elements represented by a single symbol (example: [A]). An individual.
Cojugate Gradient Method Zhengru Zhang ( 张争茹 ) Office: Math. Building 413(West) 2010 年教学实践周
Solution of linear system of equations
Lecture 11 - LU Decomposition
1cs542g-term Notes  Assignment 1 will be out later today (look on the web)
1cs542g-term Notes  Assignment 1 is out (questions?)
Linear Algebraic Equations
Dan Witzner Hansen  Groups?  Improvements – what is missing?
Part 3 Chapter 10 LU Factorization PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The McGraw-Hill Companies,
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 17 Solution of Systems of Equations.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 15 Solution of Systems of Equations.
ECIV 520 Structural Analysis II Review of Matrix Algebra.
Ordinary least squares regression (OLS)
CS240A: Conjugate Gradients and the Model Problem.
ECIV 301 Programming & Graphics Numerical Methods for Engineers REVIEW II.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 18 LU Decomposition and Matrix Inversion.
Chapter 8 Objectives Understanding matrix notation.
LU Decomposition 1. Introduction Another way of solving a system of equations is by using a factorization technique for matrices called LU decomposition.
Engineering Analysis ENG 3420 Fall 2009
Scientific Computing Linear Systems – LU Factorization.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
MA2213 Lecture 5 Linear Equations (Direct Solvers)
Using LU Decomposition to Optimize the modconcen.m Routine Matt Tornowske April 1, 2002.
G AUSSIAN E LIMINATION Presented by: Max Le Max Le Justin Lavorgna Data Structures II: Algorithm Design & Analysis Algorithm Design & Analysis.
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00.
Chapter 3 Solution of Algebraic Equations 1 ChE 401: Computational Techniques for Chemical Engineers Fall 2009/2010 DRAFT SLIDES.
MA/CS 375 Fall MA/CS 375 Fall 2002 Lecture 21.
Algebra 1 Notes Lesson 7-4 Elimination Using Multiplication.
Lecture 7 - Systems of Equations CVEN 302 June 17, 2002.
Linear algebra: matrix Eigen-value Problems Eng. Hassan S. Migdadi Part 1.
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 4. Least squares.
Lesson 3 CSPP58001.
Linear Systems What is the Matrix?. Outline Announcements: –Homework III: due Today. by 5, by –Ideas for Friday? Linear Systems Basics Matlab and.
Lecture 10 - Nonlinear gradient techniques and LU Decomposition CVEN 302 June 24, 2002.
Complete the DO NOW in your packets
1/18/ LU Decomposition Industrial Engineering Majors Authors: Autar Kaw Transforming.
1 Chapter 7 Numerical Methods for the Solution of Systems of Equations.
Lecture 6 - Single Variable Problems & Systems of Equations CVEN 302 June 14, 2002.
Outline Announcements –Add/drop today! –HWI due Friday Discrete Approximations Numerical Linear Algebra Solving ODE’s Solving PDE’s.
3/1/ LU Decomposition Computer Engineering Majors Authors: Autar Kaw Transforming.
Linear System expensive p=[0,0.2,0.4,0.45,0.5,0.55,0.6,0.8,1]; t=[1:8; 2:9]; e=[1,9]; n = length(p); % number of nodes m = size(t,2); % number of elements.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 26: Cholesky and Singular Value.
Conjugate gradient iteration One matrix-vector multiplication per iteration Two vector dot products per iteration Four n-vectors of working storage x 0.
Numerical Methods.  LU Decomposition is another method to solve a set of simultaneous linear equations  For most non-singular matrix [A] that one could.
Lecture 9 Numerical Analysis. Solution of Linear System of Equations Chapter 3.
Numerical Computation Lecture 6: Linear Systems – part II United International College.
Parallel Direct Methods for Sparse Linear Systems
ASEN 5070: Statistical Orbit Determination I Fall 2014
Simultaneous Linear Equations
Linear Equations.
Linear Algebra Lecture 15.
Chapter 10 and Matrix Inversion LU Decomposition
Matrix Methods Summary
Numerical Computation and Optimization
Part 3 Chapter 10 LU Factorization
Numerical Analysis Lecture10.
Linear Systems Numerical Methods.
Major: All Engineering Majors Authors: Autar Kaw
LU Decomposition.
Presentation transcript:

Linear Systems What is the Matrix?

Outline Announcements: –Homework III: due Wed. by 5, by Office Hours: Today & tomorrow, 11-1 –Ideas for Friday? Linear Systems Basics Matlab and Linear Algebra

Ecology of Linear Systems Linear Systems are found in every habitat: –simple algebra –solutions to ODEs & PDEs –statistics (especially, least squares) If you can formulate your problem as linear system, it will be easy to solve on a computer

“Standard Linear System” Simplest linear system: finding the equation of a line: –y=m*x + b The goal is to find m and b from observations of (x,y) pairs 2 points form a line, so we need two observations (x1, y1) & (x2,y2)

The 8th Grade Solution Solve for b in the first equation: Substitute this for b in 2nd equation & solve for m: Put this into the equation for b above

The Sophomoric Solution Write the equations as a matrix problem Perform Gaussian Elimination on Matrix:

Comparing methods Gaussian Elimination is a simpler algorithm –Easily generalizes to systems with more unknowns Gaussian Elimination is the starting point of much of numerical linear algebra

A Closer Look at GE (optional) For Am=y –GE reduces A to an upper triangular matrix –Perform “back substitution” using modified y –Modified y is equivalent to Ly L is a lower triangular matrix A=L*U

Other Algorithms for Solving Linear Systems GE aka LU decomposition -- any A Cholesky Factorization -- symmetric, positive definite A Iterative solvers (conjugate gradients, GMRES)

Linear Systems in Matlab Linear systems are easy in Matlab –To solve Ax=b, type x=A\b –To solve x’A’=b’, type x’=b’/A’ (transposed)

Matrix multiplication (*) is easy, fast Matrix “division” (\) is hard and computationally intensive –In general, performs GE with partial pivoting –But, \ is smart & looks closely at A for opportunities to speed up If A is LT, just does back substitution If A is over-determined, A\b is the least-squares solution More About \

Factorization Can explicitly factor A using LU: –[L,U]=lu(A) –useful if you have to solve A\bmany times (different b each time) To solve LUx=b: first solve Ly=b, then solve Ux=y In Matlab: y=L\b; x=U\y; Other factorizations: chol, svd

What about A -1 ? Matlab can compute A -1 using inv(A), but … –inv(A) is slower than lu(A) –There are numerical problems with inv(A) Rarely needed, use lu(A) or another factorization