[ L ] = Lower triangular matrix [ U ] = Upper triangular matrix

Similar documents
Binary Representation of Numbers Autar Kaw

Reasoning to Solve Equations and Inequalities

Or more simply put, when adding or subtracting quantities, their uncertainties add.

Homework 3 Solutions

Multiplication and Division - Left to Right. Addition and Subtraction - Left to Right.

Babylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity

Rotating DC Motors Part II

Math 135 Circles and Completing the Square Examples

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES

Math 314, Homework Assignment Prove that two nonvertical lines are perpendicular if and only if the product of their slopes is 1.

Answer, Key Homework 10 David McIntyre 1

5.6 POSITIVE INTEGRAL EXPONENTS

Integration by Substitution

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100

EQUATIONS OF LINES AND PLANES

Section 5-4 Trigonometric Functions

and thus, they are similar. If k = 3 then the Jordan form of both matrices is

Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm

Pentominoes. Pentominoes. Bruce Baguley Cascade Math Systems, LLC. The pentominoes are a simple-looking set of objects through which some powerful

1.2 The Integers and Rational Numbers

Operations with Polynomials

PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY

A.7.1 Trigonometric interpretation of dot product A.7.2 Geometric interpretation of dot product

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 16 th May Time: 14:00 16:00

P.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn

Algebra Review. How well do you remember your algebra?

1. Definition, Basic concepts, Types 2. Addition and Subtraction of Matrices 3. Scalar Multiplication 4. Assignment and answer key 5.

Experiment 6: Friction

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

Lecture 3 Gaussian Probability Distribution

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.

Chapter. Contents: A Constructing decimal numbers

Graphs on Logarithmic and Semilogarithmic Paper

SPECIAL PRODUCTS AND FACTORIZATION

Quick Reference Guide: One-time Account Update

Factoring Polynomials

The Velocity Factor of an Insulated Two-Wire Transmission Line

15.6. The mean value and the root-mean-square value of a function. Introduction. Prerequisites. Learning Outcomes. Learning Style

Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.

Vectors Recap of vectors

4.11 Inner Product Spaces

The remaining two sides of the right triangle are called the legs of the right triangle.

Vectors. The magnitude of a vector is its length, which can be determined by Pythagoras Theorem. The magnitude of a is written as a.

9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes

Basically, logarithmic transformations ask, a number, to what power equals another number?

Module 2. Analysis of Statically Indeterminate Structures by the Matrix Force Method. Version 2 CE IIT, Kharagpur

Treatment Spring Late Summer Fall Mean = 1.33 Mean = 4.88 Mean = 3.

Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:

2 DIODE CLIPPING and CLAMPING CIRCUITS

COMPLEX FRACTIONS. section. Simplifying Complex Fractions

LECTURE #05. Learning Objectives. How does atomic packing factor change with different atom types? How do you calculate the density of a material?

CS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001

Linear Equations in Two Variables

SINCLAIR COMMUNITY COLLEGE DAYTON, OHIO DEPARTMENT SYLLABUS FOR COURSE IN MAT COLLEGE ALGEBRA (4 SEMESTER HOURS)

MA Lesson 16 Notes Summer 2016 Properties of Logarithms. Remember: A logarithm is an exponent! It behaves like an exponent!

Solution to Problem Set 1

1. In the Bohr model, compare the magnitudes of the electron s kinetic and potential energies in orbit. What does this imply?

Econ 4721 Money and Banking Problem Set 2 Answer Key

Unit 6: Exponents and Radicals

Physics 43 Homework Set 9 Chapter 40 Key

4 Approximations. 4.1 Background. D. Levy

One Minute To Learn Programming: Finite Automata

1.00/1.001 Introduction to Computers and Engineering Problem Solving Fall Final Exam

0.1 Basic Set Theory and Interval Notation

Second Term MAT2060B 1. Supplementary Notes 3 Interchange of Differentiation and Integration

Vector differentiation. Chapters 6, 7

Pure C4. Revision Notes

Exponential and Logarithmic Functions

Vectors and dyadics. Chapter 2. Summary. 2.1 Examples of scalars, vectors, and dyadics

QUADRATURE METHODS. July 19, Kenneth L. Judd. Hoover Institution

MATH 150 HOMEWORK 4 SOLUTIONS

NQF Level: 2 US No: 7480

LECTURE #05. Learning Objective. To describe the geometry in and around a unit cell in terms of directions and planes.

Review guide for the final exam in Math 233

PHY 222 Lab 8 MOTION OF ELECTRONS IN ELECTRIC AND MAGNETIC FIELDS

APPLICATION OF INTEGRALS

Module Summary Sheets. C3, Methods for Advanced Mathematics (Version B reference to new book) Topic 2: Natural Logarithms and Exponentials

Firm Objectives. The Theory of the Firm II. Cost Minimization Mathematical Approach. First order conditions. Cost Minimization Graphical Approach

Integration. 148 Chapter 7 Integration

6.5 - Areas of Surfaces of Revolution and the Theorems of Pappus

19. The Fermat-Euler Prime Number Theorem

Regular Sets and Expressions

g(y(a), y(b)) = o, B a y(a)+b b y(b)=c, Boundary Value Problems Lecture Notes to Accompany

Lecture 5. Inner Product

RIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS

6.2 Volumes of Revolution: The Disk Method

FUNCTIONS AND EQUATIONS. xεs. The simplest way to represent a set is by listing its members. We use the notation

1. Find the zeros Find roots. Set function = 0, factor or use quadratic equation if quadratic, graph to find zeros on calculator

10 AREA AND VOLUME 1. Before you start. Objectives

Basic Analysis of Autarky and Free Trade Models

CUBIC-FOOT VOLUME OF A LOG

Warm-up for Differential Calculus

Rotational Equilibrium: A Question of Balance

Vectors and dyadics. Chapter 2. Summary. 2.1 Examples of scalars, vectors, and dyadics

MODULE 3. 0, y = 0 for all y

UNIVERSITY OF OSLO FACULTY OF MATHEMATICS AND NATURAL SCIENCES

4. DC MOTORS. Understand the basic principles of operation of a DC motor. Understand the operation and basic characteristics of simple DC motors.

Summary: Vectors. This theorem is used to find any points (or position vectors) on a given line (direction vector). Two ways RT can be applied:

Transcription:

U Decomposition Method Autr Kw After reding this chpter, you should e le to:. identify when U decomposition is numericlly more efficient thn Gussin elimintion,. decompose nonsingulr mtrix into U, nd. show how U decomposition is used to find the inverse of mtrix. I her out U decomposition used s method to solve set of simultneous liner equtions. Wht is it? We lredy studied two numericl methods of finding the solution to simultneous liner equtions Nïve Guss elimintion nd Gussin elimintion with prtil pivoting. Then, why do we need to lern nother method? To pprecite why U decomposition could e etter choice thn the Guss elimintion techniques in some cses, let us discuss first wht U decomposition is out. For nonsingulr mtrix [ A ] on which one cn successfully conduct the Nïve Guss elimintion forwrd elimintion steps, one cn lwys write it s [ A ] [ ][ U] where [ ] ower tringulr mtrix [ U ] Upper tringulr mtrix Then if one is solving set of equtions [ A ][ X ] [ C], then [ ][ U][ X] [ C] s ([ A ] [ ][ U] ) Multiplying oth sides y [ ], [ ] [ ][ U][ X] [ ] [ C] Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge of 6

( [ I ]) [ I ][ U][ X] [ ] [ C] s [ ] [ ] [ U][ X] [ ] [ C] s ([ I ][ U] [U ]) et [ ] [ C] [ Z] then nd [ ][ Z] [ C] () [ ][ X] [ Z] U () So we cn solve Eqution () first for [Z] y using forwrd sustitution nd then use Eqution () to clculte the solution vector [ X ] y ck sustitution. This is ll exciting ut U decomposition looks more complicted thn Gussin elimintion. Do we use U decomposition ecuse it is computtionlly more efficient thn Gussin elimintion to solve set of n equtions given y [A][X][C]? For squre mtrix [A] of n n sie, the computtionl time DE to decompose the [A] mtrix to [ ][ U ] form is given y n n T, DE 8 + 4n where T clock cycle time. The time is clculted y first seprtely clculting the numer of dditions, sutrctions, multiplictions, nd divisions in procedure such s ck sustitution, etc. We then ssume 4 clock cycles ech for n dd, sutrct, or multiply opertion, nd 6 clock cycles for divide opertion s is the cse for typicl AMD -K7 chip. http://www.isi.edu/~drper/ppers/mwscs7_kwon.pdf Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge of 6

The computtionl time T( 4n 4n) FS The computtionl time T( 4n + n) BS to solve y forwrd sustitution [ ][ Z] [ C] FS to solve y ck sustitution [ U ][ X] [ Z] BS is given y is given y So, the totl computtionl time to solve set of equtions y U decomposition is U DE + FS + BS 8 n n + 4n T + T( 4n 4n) + T( 4n + n) 8 n 4n T + n + Now let us look t the computtionl time tken y Gussin elimintion. The computtionl time for the forwrd elimintion prt, FE T, FE 8 n n + 8n nd the computtionl time T( 4n + n) BS So, the totl computtionl time Elimintion is GE FE + BS BS for the ck sustitution prt is GE to solve set of equtions y Gussin 9 As n exmple,. GH CPU hs clock cycle of /(. ).8ns Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge of 6

8 n n + 8n T + T( 4n + n) 8 n 4n T + n + The computtionl time for Gussin elimintion nd U decomposition is identicl. This hs confused me further! Why lern U decomposition method when it tkes the sme computtionl time s Gussin elimintion, nd tht too when the two methods re closely relted. Plese convince me tht U decomposition hs its plce in solving liner equtions! We hve the knowledge now to convince you tht U decomposition method hs its plce in the solution of simultneous liner equtions. et us look t n exmple where the U decomposition method is computtionlly more efficient thn Gussin elimintion. Rememer in trying to find the inverse of the mtrix [A] in Chpter 4., the prolem reduces to solving n sets of equtions with the n columns of the identity mtrix s the RHS vector. For clcultions of ech column of the inverse of the [A] mtrix, the coefficient mtrix [A] mtrix in the set of eqution [ A ][ X] [ C] chnge. So if we use the U decomposition method, the [ ] [ ][ U] does not A decomposition needs to e done only once, the forwrd sustitution (Eqution ) n times, nd the ck sustitution (Eqution ) n times. Therefore, the totl computtionl time mtrix using U decomposition is inverse U DE + n FS + n BS inverse U required to find the inverse of 8n n T + 4n + T 4n 4n + T 4n + n n n T + n n ( ) n ( ) In comprison, if Gussin elimintion method were used to find the inverse of mtrix, the forwrd elimintion s well s the ck sustitution will hve to e done n times. Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge 4 of 6

The totl computtionl time Gussin elimintion then is inversege FE n + n BS inversege required to find the inverse of mtrix y using Clerly for lrge n, 4 n nd inverse U n 8 n n T + 8n + T 4n + n 4 8n 4n T + n + inversege >> inverse U hs the dominting terms of n ( ) s inversege hs the dominting terms of n. For lrge vlues of n, Gussin elimintion method would tke more computtionl time (pproximtely n / 4 times prove it) thn the U decomposition method. Typicl vlues of the rtio of the computtionl time for different vlues of n re given in Tle. Tle Compring computtionl times of finding inverse of mtrix using U decomposition nd Gussin elimintion. n inversege / inverse U.8.8.8 Are you convinced now tht U decomposition hs its plce in solving systems of equtions? We re now redy to nswer other curious questions such s ) How do I find U mtrices for nonsingulr mtrix [A]? ) How do I conduct forwrd nd ck sustitution steps of Equtions () nd (), respectively? Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge of 6

How do I decompose non-singulr mtrix ] [A, tht is, how do I find [ ] [ ][ U] A? If forwrd elimintion steps of the Nïve Guss elimintion methods cn e pplied on nonsingulr mtrix, then [ A ] cn e decomposed into U s [ A] M n M n K n n M nn l M l n l M n K M u M u u M K u n u n M unn The elements of the [ U ] mtrix re exctly the sme s the coefficient mtrix one otins t the end of the forwrd elimintion steps in Nïve Guss elimintion. The lower tringulr mtrix [ ] hs in its digonl entries. The non-ero elements on the non-digonl elements in [ ] re multipliers tht mde the corresponding entries ero in the upper tringulr mtrix [ U ] during forwrd elimintion. et us look t this using the sme exmple s used in Nïve Gussin elimintion. Exmple Find the U decomposition of the mtrix [ A ] Solution 64 44 [ A ] [ ][ U] 8 Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge 6 of 6

l l l u u u u u u The [ U ] mtrix is the sme s found t the end of the forwrd elimintion of Nïve Guss elimintion method, tht is [ U ].6.7 To find l nd l, find the multiplier tht ws used to mke the nd elements ero in the first step of forwrd elimintion of the Nïve Guss elimintion method. It ws l 64.6 l 44.76 To find l, wht multiplier ws used to mke element ero? Rememer element ws mde ero in the second step of forwrd elimintion. The [ A ] mtrix t the eginning of the second step of forwrd elimintion ws 6.8.6 4.76 So l 6.8. Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge 7 of 6

Hence [ ].6.76 Confirm [ ][ U] [ A].. [ ][ U].6.76..6.7 64 44 8 Exmple Use the U decomposition method to solve the following simultneous liner equtions. 64 44 8 6. 8 77. 79. Solution Recll tht [ A ][ X] [ C] nd if [ A ] [ ][ U] then first solving nd then [ ][ Z] [ C] Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge 8 of 6

[ U ][ X] [ Z] gives the solution vector [ X ]. Now in the previous exmple, we showed [ A ] [ ][ U].6.76..6.7 First solve [ ][ Z] [ C].6.76. 6.8 77. 79. to give 6.8.6 + 77..76 +. + 79. Forwrd sustitution strting from the first eqution gives 6.8 77.. 6 77..6 6.8 96.8..76. 79 79..76 6.8. ( 96.8) Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge 9 of 6

.76 Hence [ Z ] 6.8 96.8.76 This mtrix is sme s the right hnd side otined t the end of the forwrd elimintion steps of Nïve Guss elimintion method. Is this coincidence? Now solve [ U ][ X] [ Z] 6. 8.6 96. 8.7 76. + +.6.7 6.8.76 From the third eqution.7.76 96.8. 76. 7.87 Sustituting the vlue of in the second eqution, Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge of 6

.6 96.8 96.8+.6 96.8+.6.87 9.69 Sustituting the vlue of nd in the first eqution, + + 6.8 6.8 6.8 9.69.87.948 Hence the solution vector is.948 9.69.87 How do I find the inverse of squre mtrix using U decomposition? A mtrix [ B ] is the inverse of [ ] [ A ][ B] [ I] [ B][ A]. A if How cn we use U decomposition to find the inverse of the mtrix? Assume the first A ) is column of [ B ] (the inverse of [ ] T [...... n ] Then from the ove definition of n inverse nd the definition of mtrix multipliction Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge of 6

[ A ] M n M Similrly the second column of [ B ] is given y [ A ] M n M Similrly, ll columns of [ B ] cn e found y solving n different sets of equtions with the column of the right hnd side eing the n columns of the identity mtrix. Exmple Use U decomposition to find the inverse of [ A ] 64 44 8 Solution Knowing tht [ A ] [ ][ U].6.76..6.7 We cn solve for the first column of [ B] [ A] y solving for Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge of 6

64 44 8 First solve tht is [ ][ Z] [ C],.6.76. to give.6 +.76 +. + Forwrd sustitution strting from the first eqution gives Hence. 6.6( ).6.76. ( ).(.6).76. Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge of 6

[ Z ].6. Now solve tht is [ U ][ X] [ Z].6.7.6. + +.6.7..6 Bckwrd sustitution strting from the third eqution gives..7 4.7.6+.6.6+.6(4.7).94 Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge 4 of 6

(.94) 4.7.476 Hence the first column of the inverse of [ A ] is.476.94 4.7 Similrly y solving 64 44 8 gives.8.47. nd solving 64 44 8 gives.7.464.49 Hence [ A ].476.94 4.7.8.47..7.464.49 Cn you confirm the following for the ove exmple? [ A][ A] [ I] [ A] [ A] Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge of 6

Key Terms: U decomposition Inverse Sylor UR: http://www.sylor.org/courses/me/ Attriuted to: University of South Florid: Holistic Numericl Methods Institute Pge 6 of 6