Question

Show that the following function PdSMat returns a positive definite symmetric matrix of size $n \times n$ ``` function A=PdSMat(n) A=SymmetricMat(n); // defined in Exercise 2.2 [P,D]=eig(A);D=abs(D); D=D+norm(D)*eye(size(D)); A=P*D*inv(P); ``` 1. For different values of $n$, compute the determinant of $\mathrm{A}=\mathrm{PdSMat}(\mathrm{n})$. What do you observe? Justify. 2. Fix $n=10$. For $k$ varying from 1 to $n$, define a matrix $A_k$ of size $k \times k$ by $\mathrm{Ak}=\mathrm{A}(1: \mathrm{k}, 1: \mathrm{k})$. Check that the determinants of all the matrices $A_k$ are positive. Prove this result. 3. Are the eigenvalues of $A_k$ eigenvalues of $A$ ?

   Show that the following function PdSMat returns a positive definite symmetric matrix of size $n \times n$
```
function A=PdSMat(n)
A=SymmetricMat(n); // defined in Exercise 2.2
[P,D]=eig(A);D=abs(D);
D=D+norm(D)*eye(size(D));
A=P*D*inv(P);
```
1. For different values of $n$, compute the determinant of $\mathrm{A}=\mathrm{PdSMat}(\mathrm{n})$. What do you observe? Justify.
2. Fix $n=10$. For $k$ varying from 1 to $n$, define a matrix $A_k$ of size $k \times k$ by $\mathrm{Ak}=\mathrm{A}(1: \mathrm{k}, 1: \mathrm{k})$. Check that the determinants of all the matrices $A_k$ are positive. Prove this result.
3. Are the eigenvalues of $A_k$ eigenvalues of $A$ ?
Show more…
Numerical Linear Algebra
Numerical Linear Algebra
Grégoire Allaire,… 1st Edition
Chapter 2, Problem 20 ↓
AceChat toggle button
Close icon
Ace pointing down

Please give Ace some feedback

Your feedback will help us improve your experience

Thumb up icon Thumb down icon
Thanks for your feedback!
Profile picture
Show that the following function PdSMat returns a positive definite symmetric matrix of size $n \times n$ ``` function A=PdSMat(n) A=SymmetricMat(n); // defined in Exercise 2.2 [P,D]=eig(A);D=abs(D); D=D+norm(D)*eye(size(D)); A=P*D*inv(P); ``` 1. For different values of $n$, compute the determinant of $\mathrm{A}=\mathrm{PdSMat}(\mathrm{n})$. What do you observe? Justify. 2. Fix $n=10$. For $k$ varying from 1 to $n$, define a matrix $A_k$ of size $k \times k$ by $\mathrm{Ak}=\mathrm{A}(1: \mathrm{k}, 1: \mathrm{k})$. Check that the determinants of all the matrices $A_k$ are positive. Prove this result. 3. Are the eigenvalues of $A_k$ eigenvalues of $A$ ?
Close icon
Play audio
Feedback
Powered by NumerAI
Kathleen Carty Ivan Kochetkov
Danielle Fairburn verified

Chris Trentman and 65 other educators are ready to help you.

Ask a new question

*

Labs

-

Want to see this concept in action?

NEW

Explore this concept interactively to see how it behaves as you change inputs.

View Labs

*

Recommended Videos

-
prove-theorem-714-aleftbeginarraylla-b-b-cendarrayright-is-positive-definite-if-and-only-if-a-and-d-

Prove Theorem $7.14: A=\left[\begin{array}{ll}a & b \\ b & c\end{array}\right]$ is positive definite if and only if $a$ and $d$ are positive and Let $u=[x, y]^{T} .$ Then \[f(u)=u^{T} A u=[x, y]\left[\begin{array}{ll} a & b \\ b & d\end{array}\right]\left[\begin{array}{l} x \\y \end{array}\right]=a x^{2}+2 b x y+d y^{2}\] Suppose $f(u)>0$ for every $u \neq 0 .$ Then $f(1,0)=a>0$ and $f(0,1)=d>0 .$ Also, we have $f(b,-a)=a\left(a d-b^{2}\right)>0 .$ Because $a>0,$ we get $a d-b^{2}>0$ Conversely, suppose $a>0, b=0, a d-b^{2}>0 .$ Completing the square gives us \[f(u)=a\left(x^{2}+\frac{2 b}{a} x y+\frac{b^{2}}{a_{2}} y^{2}\right)+d y^{2}-\frac{b^{2}}{a} y^{2}=a\left(x+\frac{b y}{a}\right)^{2}+\frac{a d-b^{2}}{a} y^{2}\] Accordingly, $f(u)>0$ for every $u \neq 0$

Linear Algebra


*

Transcript

-
00:01 We're asked to prove theorem 714.
00:05 Recall what this theorem says.
00:07 It says that a matrix a, two by two real matrix, with entries a, b, c, d is positive definite.
00:18 If and only if, diagonal elements a and d are positive.
00:34 And the determinant of a, which is ad minus, well, this is really the same as these two entries.
00:52 It's a symmetric.
00:53 Yeah, because he's like, actually what is going on here? the theorem 714 only applies to, sorry, symmetric real two by two matrices.
01:05 So a is a matrix of the form ab, b, b.
01:08 And therefore it's positive definite if and only if a and d are positive and the determined ad minus b squared is also positive.
01:19 To prove this statement, i'll begin by defining you to be the transpose of x, y.
01:35 Then it follows that f of u, this is u.
01:50 F of u this is u transpose times a times u.
01:56 This is x y row vector times a times the column vector xy which multiplying things out this is a -x squared plus 2b times x times y plus b squared.
02:18 Plus d is a -squared x -squared plus 2b x -y plus d times y -square, not an a -squared.
02:35 It's a times x squared plus 2b x -y plus d times y squared.
02:42 We're going to suppose that our function f of u is positive for every non -zero use.
02:52 Well, then this implies that f of 1, the vector 1 -0, well, this is, if you plug this in, a, is positive.
03:07 Also, f of the row vector 01, which is d, is also positive...
Need help? Use Ace
Ace is your personal tutor. It breaks down any question with clear steps so you can learn.
Start Using Ace
Ace is your personal tutor for learning
Step-by-step explanations
Instant summaries
Summarize YouTube videos
Understand textbook images or PDFs
Study tools like quizzes and flashcards
Listen to your notes as a podcast
Continue solving this problem
Create a free account to:
  • View full step-by-step solution
  • Ask follow-up questions with Ace AI
  • Save progress and study later
Continue Free
Join the community

18,000,000+

Students on Numerade


Trusted by students at 8,000+ universities

Numerade

Get step-by-step video solution
from top educators

Continue with Clever
or



By creating an account, you agree to the Terms of Service and Privacy Policy
Already have an account? Log In

A free answer
just for you

Watch the video solution with this free unlock.

Numerade

Log in to watch this video
...and 100,000,000 more!


EMAIL

PASSWORD

OR
Continue with Clever