Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Advanced Engineering Mathematics - Problem Set 1 | MATH 348, Assignments of Mathematics

Material Type: Assignment; Class: ADVANCED ENGINEERING MATHEMATI; Subject: Mathematics; University: Colorado School of Mines; Term: Spring 2009;

Typology: Assignments

Pre 2010

Uploaded on 08/19/2009

koofers-user-9q0
koofers-user-9q0 🇺🇸

4

(1)

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
MATH348 - Advanced Engineering Mathematics 1
E. Kreyszig, Advanced Engineering Mathematics, 9th ed. Section 7.4, pgs. 296-302
Lecture: Linear Independence and Vector Spaces Module: 05
Suggested Problem Set: Suggested Problems : {2, 4, 6, 7, 14, 20}January 26, 2009
E. Kreyszig, Advanced Engineering Mathematics, 9th ed. Section 7.9, pgs. 308-315
Lecture: Abstract V.S. and Inner Product Spaces Module: 06
Suggested Problem Set: Suggested Problems : {8, 9, 10, 27, 29 }January 26, 2009
Quote of Lecture 5
Springfield Scientist: Let’s not listen.
The Simpsons: Bye Bye Nerdie (2001)
Again, we study the problem Ax =bby asking the question, given Aand b, does a solution exist and is this
solution unique. In general the linear system can be solved explicitly using the algorithm of row-reduction.
For the case where there exists a unique solution to the system there are many things, which can be said.
1. Ais an invertible matrix
2. AI
3. Ahas npivot positions
4. Ax =0has only the trivial solution
5. Ax =bhas the unique solution x=A1bfor all bRn
The previous statements are equivalent. That is, they are all true or all false. In the case that Ax =bdoes
not admit a unique solution then they are all false. How can we characterize the problem in this case?
At this point it makes sense to introduce some of the more abstract concepts in linear algebra. The idea
is that if we have unique solutions then we have as many pivots as columns and if we don’t have unique
solutions1then we can expect that pivots6=number-of-columns. Thus it makes sense to determine, given a set
of vectors, which are ‘important.’ We say that the ‘important vectors’ are the linearly independent vectors
of that set and more importantly any vector in the set can be constructed using the linearly independent ones.
Using this concept we then approach the problem in the following way:
1. Given a set of vectors, say the columns of a coefficient matrix, determine which are linearly indepen-
dent.
2. Construct a space of vectors, called the column space of A, defined by the set of all linear combinations
of the linearly independent vectors.
3. Ask if the vector bis in this space. If it is then Ax =bhas a solution. If not, then no solution exists.
This approach will define some new concepts whose vocabulary is listed below:
Linear Combination
Linear Independence
Rank
Vector Space
1Notice that this would be either no solutions or infinitely many solutions.
pf2

Partial preview of the text

Download Advanced Engineering Mathematics - Problem Set 1 | MATH 348 and more Assignments Mathematics in PDF only on Docsity!

MATH348 - Advanced Engineering Mathematics 1

E. Kreyszig, Advanced Engineering Mathematics, 9 th^ ed. Section 7.4, pgs. 296-

Lecture: Linear Independence and Vector Spaces Module: 05

Suggested Problem Set: Suggested Problems : {2, 4, 6, 7, 14, 20} January 26, 2009

E. Kreyszig, Advanced Engineering Mathematics, 9 th^ ed. Section 7.9, pgs. 308-

Lecture: Abstract V.S. and Inner Product Spaces Module: 06

Suggested Problem Set: Suggested Problems : { 8, 9, 10, 27, 29 } January 26, 2009

Quote of Lecture 5

Springfield Scientist: Let’s not listen.

The Simpsons: Bye Bye Nerdie (2001)

Again, we study the problem Ax = b by asking the question, given A and b, does a solution exist and is this solution unique. In general the linear system can be solved explicitly using the algorithm of row-reduction. For the case where there exists a unique solution to the system there are many things, which can be said.

  1. A is an invertible matrix
  2. A ∼ I
  3. A has n pivot positions
  4. Ax = 0 has only the trivial solution
  5. Ax = b has the unique solution x = A−^1 b for all b ∈ Rn

The previous statements are equivalent. That is, they are all true or all false. In the case that Ax = b does not admit a unique solution then they are all false. How can we characterize the problem in this case?

At this point it makes sense to introduce some of the more abstract concepts in linear algebra. The idea is that if we have unique solutions then we have as many pivots as columns and if we don’t have unique solutions^1 then we can expect that pivots 6 =number-of-columns. Thus it makes sense to determine, given a set of vectors, which are ‘important.’ We say that the ‘important vectors’ are the linearly independent vectors of that set and more importantly any vector in the set can be constructed using the linearly independent ones.

Using this concept we then approach the problem in the following way:

  1. Given a set of vectors, say the columns of a coefficient matrix, determine which are linearly indepen- dent.
  2. Construct a space of vectors, called the column space of A, defined by the set of all linear combinations of the linearly independent vectors.
  3. Ask if the vector b is in this space. If it is then Ax = b has a solution. If not, then no solution exists.

This approach will define some new concepts whose vocabulary is listed below:

  • Linear Combination
  • Linear Independence
  • Rank
  • Vector Space (^1) Notice that this would be either no solutions or infinitely many solutions.

MATH348 - Advanced Engineering Mathematics 2

  • Dimension
  • Column Space
  • Null Space
  • Row Space
  • Abstract Vector Space
  • Inner Product Space

When this is complete then we will robustly characterize solutions to linear systems in terms of the vocabulary and concepts presented. This will complete our study of chapter 7 with caveat that these concepts underpin the study of all linear problems and will come back again when studying Fourier series and linear PDE.

Goals

  • Understand the concepts and vocabulary of vector spaces as they relate solubility of Ax = b.
  • Abstract the concepts of vector spaces to include abstract inner-product spaces.

Objectives

  • Calculate the dependence relation given a set of vectors.
  • Define the terminology of matrix vector-spaces and how these terms can be realized by determining the linearly independent columns of coefficient matrices.
  • Join the concepts of matrix spaces by the rank-nullity theorem and apply this to solubility of Ax = b.
  • Define abstract inner-product spaces and provide examples.