(a) Show that the diagonal entries of a positive definite matrix
are positive numbers.
(b) Show that if B is a nonsingular square matrix, then
BTB is an SPD matrix.(Hint. you simply need to show the
positive definiteness, which does requires the nonsingularity of
B.)
Is it true that every symmetric positive definite matrix is
necessarily nonsingular? (Need to show some form of proof, not just
yes or no answer)
Please add some commentary for better understanding.
Prove that the range of a matrix A is equal to the number of
singular non-null values of the matrix and Explain how the
condition number of a matrix A relates to its singular values.
Rules for positive definite matrix.
What are they? My text book explains them in a very confusing
way.
Also:
"A matrix A is said to be positive definite if it is symmetric
and if and only if each of its leading principal sub matrices has a
positive determinate"
How do I get the leading principal sub matrices?
Consider A, B and C, all nxn matrices.
Show that:
1) det(A)=det(A^T)
2) if C was obtained from A by changing the i-th row (column) with
the j-th row (column). Show that det(C)=-det(A)
3) det(AB)=det(A)det(B)
4) Let C be a matrix obtained from A by multiplying a row by c ∈ F.
Show that det(B)=c · det(A)
Write a recursive program in C++ to compute the determinant of
an NxN matrix, A. Your program should ask the user to enter the
value of N, followed by the path of a file where the entries of the
matrix could be found. It should then read the file, compute the
determinant and return its value. Compile and run your
program.
1) Let A be nxn matrix and Ax=b, if we need change A to Upper
triangular matrix using Gaussian Elimination, how many
additions/subtraction operations are involved? how many
multiplication/division operations are involved?
2) Once we got the upper triangular matrix, now we need to apply
back-substitution, how many additions/subtraction operations are
involved? how many multiplication/division operations are
involved?