Completing the square using a matrix in quadratic form

Click For Summary
The discussion focuses on completing the square for a quadratic form defined by a symmetric matrix. Participants emphasize the importance of not reducing the matrix to row echelon form, as this could affect the eigenvalues and eigenvectors necessary for the completion process. Instead, a method involving the upper-triangular matrix form is suggested, allowing for the quadratic to be expressed as a sum of squares. The approach involves identifying a specific transformation that maintains the structure of the quadratic while facilitating the completion of the square. Overall, the method aims to simplify the quadratic without losing essential properties.
PhizKid
Messages
477
Reaction score
2

Homework Statement


Complete the square using the symmetric matrix that defines the given quadratic form: ##x^2 - 4xy + 6xz + 2xt + 4y^2 + 2yz + 4yt + 5z^2 - 6zt - t^2## and write this quadratic as the sum and difference of squares after completing the square using the matrix.

The Attempt at a Solution



So first I found the 4x4 matrix, using x as the first column, y as the 2nd, z as the 3rd, and t as the 4th. Also x is 1st order, y is 2nd order, z is 3rd, and t is 4th:

http://i2.minus.com/inT7VWSkOu3GH.png

If I want this in reduced row form, I have to switch some rows, name the 2nd and 3rd rows. What implications will this have on my work in completing the square?

Also, I couldn't find anything online about how to complete the square using matrices.
 
Last edited by a moderator:
Physics news on Phys.org
You don't want to reduce it. You want to find the eigenvalues and eigenvectors of the matrix and those are not "preserved" by row operations.
 
The assignment says to row eliminate into the row echelon form and use this row echelon form of the matrix to complete the square. Is there a method to complete the square using the row echelon form?
 
PhizKid said:
The assignment says to row eliminate into the row echelon form and use this row echelon form of the matrix to complete the square. Is there a method to complete the square using the row echelon form?

If I were doing the problem I would write
Q_4(x,y,z,t) = x^2 - 4xy + 6xz + 2xt + 4y^2 + 2yz + 4yt + 5z^2 - 6zt - t^2
as
Q_4(x,y,z,t) = u_1(x,y,z,t)^2 + Q_3(y,z,t)
by noting that
S_n = a_{11}x_1^2 + 2 a_{12} x_1 x_2 + \cdots + 2 a_{1n} x_1 x_n \\<br /> = \left( \sqrt{a_{11}}x_1 + \frac{a_{12}}{\sqrt{a_{11}}} x_2 + <br /> \cdots + \frac{a_{1n}}{\sqrt{a_{11}}} x_n \right)^2 - S_{n-1},
where ##S_{n-1}## is a quadratic form not involving ##x_1##. It has the form
S_{n-1} = (a_{12}^2 /a_{11}) x_2^2 + \cdots + (a_{1n}^2/a_{11})x_n^2<br /> <br /> + 2 (a_{12}a_{13}/a_{11}) x_2 x_3 + \cdots + 2(a_{1,n-1}a_{1n}/a_{11})x_{n-1} x_n
So,
u_1 = x - 2 y + 3z + t,
and you can figure out what is ##Q_3(y,z,t)##. Do the same type of operation on ##Q_3##. If you never take the square root of a negative number throughout, you will reduce your quadratic form to a sum of squares. If you encounter the square root of a negative number at some point, you get a difference of (real) squares.

This method is attempting to write your 4x4 matrix ##A## in the form ##A = U^T U,## where ##U## is an upper-triangular matrix. I suppose you could regard ##U^T## as a matrix in row-echelon form, so I suppose that could be what the question is asking about.
 
To do this by finding RREF, you want to use the form

EnT...E2TE1TDE1E2...En

Where D = diag(eigenvalues), which is found by solving En...E2E1AE1TE2T...EnT = ARREF. In order to find D, take the column & row reductions one at a time - noting that you have to do AEET for every row manipulation E. (E is an elementary matrix s.t. det(E) = 1)
 
Honors LinAlg said:
To do this by finding RREF, you want to use the form

EnT...E2TE1TDE1E2...En

Where D = diag(eigenvalues), which is found by solving En...E2E1AE1TE2T...EnT = ARREF. In order to find D, take the column & row reductions one at a time - noting that you have to do AEET for every row manipulation E. (E is an elementary matrix s.t. det(E) = 1)

Using the method in post #4 (which is essentially Cholesky Decomposition, adapted to an indefinite matrix) you do not ever need to find eigenvalues, so is much faster and much more efficient, and possibly much more accurate as well.
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K