Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2010-03-28 23:59:02

onako
Member
Registered: 2010-03-28
Posts: 43

Positive definite matrix

Note the following:
A symmetric matrix is positive definite if:

   1. all the diagonal entries are positive, and
   2. each diagonal entry is greater than the sum of the absolute values of all other entries in the same row.
...........................................................................
However, the following matrix seems to have Cholesky decomposition (therefore, it is positive definite):
5.000  2.000  3.000  2.000
2.000  3.000  1.000  1.000
3.000  1.000  4.000 -1.000
2.000  1.000 -1.000  7.000

Here, the second condition is not satisfied. Any suggestions on the positive definite matrix criteria?
I would need a simple positive definiteness test. (The above seems simple, but might not be correct/complete).
Thanks

Offline

#2 2010-03-29 23:18:31

onako
Member
Registered: 2010-03-28
Posts: 43

Re: Positive definite matrix

Anyone?

Offline

#3 2010-03-30 08:56:29

Ricky
Moderator
Registered: 2005-12-04
Posts: 3,791

Re: Positive definite matrix

Off hand, I know of no easy computable equivalent condition on positive definite matrices.  You could use the criteria and if that fails then check the hard way.


"In the real world, this would be a problem.  But in mathematics, we can just define a place where this problem doesn't exist.  So we'll go ahead and do that now..."

Offline

#4 2010-03-30 23:06:55

onako
Member
Registered: 2010-03-28
Posts: 43

Re: Positive definite matrix

The problem is that the hard way is computationally expensive. I would need simple strategy to check positive definiteness of symmetric matrices.
The above criteria seems incomplete. Any suggestions on how to check this relatively easily?

Offline

#5 2010-03-31 02:47:10

Ricky
Moderator
Registered: 2005-12-04
Posts: 3,791

Re: Positive definite matrix

Sylvester's criterion seems to be your best bet.


"In the real world, this would be a problem.  But in mathematics, we can just define a place where this problem doesn't exist.  So we'll go ahead and do that now..."

Offline

#6 2010-03-31 05:37:37

onako
Member
Registered: 2010-03-28
Posts: 43

Re: Positive definite matrix

Good choice, but expensive in terms of the computational time/power. Completion of the first criterion would be better.

Offline

#7 2010-03-31 08:16:27

Ricky
Moderator
Registered: 2005-12-04
Posts: 3,791

Re: Positive definite matrix

Completion of the first criterion would be better.

You're assuming it's possible.  Another option is to use the Cholesky decomposition algorithm.  A symmetric matrix is positive definite if and only if it has a Cholesky decomposition, and there exists an algorithm for computing this.  Use the algorithm, and if it blows up somewhere (i.e. division by zero or a certain condition is not met like A^(n) = I), then the matrix must not be positive definite.


"In the real world, this would be a problem.  But in mathematics, we can just define a place where this problem doesn't exist.  So we'll go ahead and do that now..."

Offline

#8 2010-03-31 08:55:00

John E. Franklin
Member
Registered: 2005-08-29
Posts: 3,588

Re: Positive definite matrix

I spent a few minutes computing the 4x4 determinant by hand.
I obtained minus 281, -281, a negative number.  I didn't check my answers though.
All by hand.   (Sylvester says should be positive and smaller upper-left ones)


igloo myrtilles fourmis

Offline

#9 2010-03-31 15:15:33

Ricky
Moderator
Registered: 2005-12-04
Posts: 3,791

Re: Positive definite matrix

John, I've verified that the matrix posted is in fact positive definite.  I think you have an error.


"In the real world, this would be a problem.  But in mathematics, we can just define a place where this problem doesn't exist.  So we'll go ahead and do that now..."

Offline

#10 2010-04-01 03:08:24

onako
Member
Registered: 2010-03-28
Posts: 43

Re: Positive definite matrix

Actually, I should use the checking prior to invoking the Cholesky decomposition. This means the checking is preparation for Cholesky (further used as a preconditioner for Conjugate Gradient). I could, however, start Cholesky and wait until its eventual completion.

Offline

#11 2010-04-01 10:06:03

Ricky
Moderator
Registered: 2005-12-04
Posts: 3,791

Re: Positive definite matrix

Actually, I should use the checking prior to invoking the Cholesky decomposition. This means the checking is preparation for Cholesky

I've only glanced at the algorithm, but it seems like it will terminate in a finite number of steps whether or not the matrix is positive definite.  Assuming this to be true, the algorithm can be used as a check.


"In the real world, this would be a problem.  But in mathematics, we can just define a place where this problem doesn't exist.  So we'll go ahead and do that now..."

Offline

Board footer

Powered by FluxBB