100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
COMP 361 or 5611 Assignment 1 complete material update Concordia University CA$17.99   Add to cart

Exam (elaborations)

COMP 361 or 5611 Assignment 1 complete material update Concordia University

 9 views  0 purchase

COMP 361 or 5611 Assignment 1 complete material update Concordia University

Preview 2 out of 5  pages

  • March 7, 2024
  • 5
  • 2023/2024
  • Exam (elaborations)
  • Unknown
All documents for this subject (1)
avatar-seller
smartzone
COMP 361 or 5611 Assignment 1 complete material update 2024-2025 Concordia

University



Each problem is worth equal marks.

Problem 1. Let
 1 1 0
A = −2 2 0 .
 0 0 3
(a) Find ǁAǁ1 and ǁAǁ∞.

(b) Determine the eigenvalues of AT A.

(c) Find ǁAǁ2.

Solution

(a) ǁAǁ1 = max{1+2+0, 1+2+0, 0+0+3} = 3, ǁAǁ∞ = max{1+1+0, 2+2+0, 0+0+3} = 4.
(b)
    
1 −2 0 1 1 0 5 −3 0
AT A = 1 2 0 −2 2 0 = −3 5 0
0 0 0 0 3 0 0
The eigenvalues of AT A are the 3solutions, λ, of det(AT A − λI) =90.
 
5−λ −3 0
det(AT A − λI) = det  −3 5−λ 0 
0 0 9−λ
= (λ − 8)(λ − 2)(9 − λ)
So the eigenvalues of AT A are {2, 8, 9}.
√ √ √
(c) ǁAǁ2 = max{ 2, 8, 9} = 3.

Problem 2. Let A be an n × n matrix and let C be the maximum absolute column sum of
A, that is,
n
Σ
C = max a| ij .
j
i=1
n
(a) Prove that for any nonzero vector x ∈ R , we
| have
ǁAxǁ1
ǁxǁ1 ≤ C.
1

, (b) Show that we can always find a vector y such that
ǁAyǁ1
ǁyǁ1 = C,

and conclude that ǁAǁ1 = C.

Solution

(a) Let x 0. Then
Σn Σ n
a x|
ǁAxǁ1 | j=1 ij j
i=1
ǁxǁ1 = ǁxǁ1
Σn Σ n |a ||x |
i=1 j=1 ij j

ǁxǁ1
Σn Σni=1 |aij ||xj |
j=1
=
Σn Σ ǁxǁ1
| |aij |
n
j=1 |x i=1
=
j ǁxǁ1
Σn |xj | Cǁxǁ1
j=1
C =

ǁxǁ1 ǁxǁ1
=
C.

(b)
Σ Let kn be the index of the column of A achieving the maximum absolute column sum; so
C = i=1 |aik|. Let y be the vector such that yk = 1 and yi = 0 for all i /= k. Then Ay is
Σn
equal to the kth column of A, so ǁAyǁ1 = i=1 |aik| = C. Also, ǁyǁ1 = 1, so ǁAyǁ 1
ǁyǁ
= C.
1
This proves that ǁAǁ1 ≥ C, which together with part (a) proves that ǁAǁ1 = C.

Problem 3. If x = (x1, . . . , xn) and y = (y1, . . . , yn) are vectors in Rn, then the following
inequality, called the Cauchy-Schwartz inequality, is always true:
n !2 ! !
n n
2Σ 2
xiyi ≤ xi yi .
Σi=1 Σi=1 i=1

Using the Cauchy-Schwartz inequality, prove that

ǁx + yǁ2 ≤ ǁxǁ2 + ǁyǁ2
(this is the triangle inequality for the two-norm).

Solution

2

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller smartzone. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for CA$17.99. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

67474 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
CA$17.99
  • (0)
  Add to cart