Can the Graham-Schmidt Process Start with Any Vector?

  • Thread starter Thread starter rdfloyd
  • Start date Start date
  • Tags Tags
    Process
rdfloyd
Messages
29
Reaction score
0
We learned the GSP yesterday in class, but my teacher said something that seems to conflict with the textbook.

He said that we can set our first vector (w_{1}) equal to any vector in the set. However, I keep getting different answers than our textboook when I do this.

My question: Is it possible to set the starting vector equal to any vector in the set? Then, do I have to continue the GSP in the order of the vector subscripts?

For instance, assume that I have vectors v_{1}, v_{2}, and v_{3}. I want to set v_{3} as my first vector w_{1}. So then my list becomes v_{3}, v_{2}, and v_{1}. Do I now have to do the order backwards, or can I do the order v_{3}, v_{1} (going 1\rightarrow 2 \rightarrow 3), and v_{2}, etc.
 
Physics news on Phys.org
if your goals is to get the same answer in your textbook then you need to do it in the same order.

the fact that you get different (correct) answers shows that you can in fact do it in any order, you just get different answers.

if you think about it, it is obvious that there exist very many orthonormal bases for a given subspace.

to see what is going on, try it with (1,0) and (1,1) in both orders.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top