Solving Homework Equation: x^TAx

  • Thread starter Thread starter shaon0
  • Start date Start date
  • Tags Tags
    Homework
Click For Summary
SUMMARY

The discussion focuses on solving the quadratic form x^TAx, where x is a vector and A is a 3x3 matrix. Participants suggest using Cholesky factorization to simplify the problem instead of calculating eigenvalues. The Cholesky factorization method involves finding an upper-triangular matrix U such that A = U^T * U, which can be computed efficiently by hand for small matrices. The final result expresses the quadratic form as a sum of squares, confirming the effectiveness of this approach.

PREREQUISITES
  • Understanding of quadratic forms in linear algebra
  • Familiarity with Cholesky factorization
  • Knowledge of matrix operations and properties
  • Basic skills in handling eigenvalues and eigenvectors
NEXT STEPS
  • Study the Cholesky factorization algorithm in detail
  • Learn how to derive and apply the properties of upper-triangular matrices
  • Explore the relationship between eigenvalues and quadratic forms
  • Practice solving quadratic forms using various matrix decompositions
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, as well as anyone involved in computational mathematics or numerical analysis seeking efficient methods for solving quadratic forms.

shaon0
Messages
48
Reaction score
0

Homework Statement


See Attachment.

Homework Equations


x^TAx where x=<x,y,z> and A is some 3x3 matrix

The Attempt at a Solution


See Attachment. From here i have found the eigenvalues and vectors. What should I do next?.\
 

Attachments

  • Sum of Squares.png
    Sum of Squares.png
    6.9 KB · Views: 494
  • Matrix A.png
    Matrix A.png
    1.3 KB · Views: 475
Physics news on Phys.org
shaon0 said:

Homework Statement


See Attachment.

Homework Equations


x^TAx where x=<x,y,z> and A is some 3x3 matrix

The Attempt at a Solution


See Attachment. From here i have found the eigenvalues and vectors. What should I do next?.\

I would have not bothered at all to get the eigenvalues; I would just perform Cholesky factorization on A: find an upper-triangular matrix U such that A = U^T * U. Just expand this out to find the following algorithm for U:
U[1,1] = sqrt(A[1,1]) and for j=2,...,n, U[1,j] = A[1,j]/U[1,1].
for i from 2 to n do U[i,i]=sqrt(A[i,i]-sum_{k=1..i-1} U[k,i]^2) and for j=i+1,...,n,
U[i,j] = (A[i,j] - sum_{k=1..i-1} U[k,i]*U[k,j])/U[i,i].
(Note: even if you have not seen this before, it only takes about 5-10 minutes to master, and then you can do it quickly by hand for matrices up to about 10x10 or even a bit more, using nothing beyond a hand-held calculator.)

For your matrix A we have U = [[1,1,2],[0,sqrt(3),4sqrt(3)],[0,0,2]] (= [row1,row2,row3])
So, if u1 = (row1 of U) * <x,y,z> = x+y+2z, u2 = (row2 of U) * <x,y,z> = sqrt(3)y + 4sqrt(3)z and u3 = (row3 of U) * <x,y,z> = 2z, then Q = x^T A x = u1^2 + u2^2 + u3^2. If you expand this out you will see that you get back to your original form, so it gives you exactly what you want: Q written as a sum of squares. No eigenvalues need be involved at all.

RGV
 
Ray Vickson said:
I would have not bothered at all to get the eigenvalues; I would just perform Cholesky factorization on A: find an upper-triangular matrix U such that A = U^T * U. Just expand this out to find the following algorithm for U:
U[1,1] = sqrt(A[1,1]) and for j=2,...,n, U[1,j] = A[1,j]/U[1,1].
for i from 2 to n do U[i,i]=sqrt(A[i,i]-sum_{k=1..i-1} U[k,i]^2) and for j=i+1,...,n,
U[i,j] = (A[i,j] - sum_{k=1..i-1} U[k,i]*U[k,j])/U[i,i].
(Note: even if you have not seen this before, it only takes about 5-10 minutes to master, and then you can do it quickly by hand for matrices up to about 10x10 or even a bit more, using nothing beyond a hand-held calculator.)

For your matrix A we have U = [[1,1,2],[0,sqrt(3),4sqrt(3)],[0,0,2]] (= [row1,row2,row3])
So, if u1 = (row1 of U) * <x,y,z> = x+y+2z, u2 = (row2 of U) * <x,y,z> = sqrt(3)y + 4sqrt(3)z and u3 = (row3 of U) * <x,y,z> = 2z, then Q = x^T A x = u1^2 + u2^2 + u3^2. If you expand this out you will see that you get back to your original form, so it gives you exactly what you want: Q written as a sum of squares. No eigenvalues need be involved at all.

RGV

Thanks RGV. I've actually devised a less memory draining way by writing U as a generic upper triangular matrix which I presume is the way the Cholesky decomposition was devised.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
Replies
3
Views
2K
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K