Converting an explicit series to a recursive form

regina_lee
Messages
2
Reaction score
0
Let e_i be a unit vector with one 1 in the i-th element. Is the following expression has a recursive presentation?

$$y_N = \sum_{k=0}^N {\frac{{{X^k} e_i}}{\|{{{X^k} e_i}\|}_2}} $$

where X is a n \times n square matrix, and {\| \cdot \|}_2 is a vector norm defined as {\|z\|}_2 = \sqrt{|z_1|^2+|z_2|^2+...+|z_n|^2}.

---

EDIT: I know that if y_N = \sum_{k=0}^N {{X^k} e_i}, it is easy to obtain the following recursive formula:

$$y_{k+1} = X y_{k} + e_i, \quad (k=0,1,2,...) \textrm{ with } \ \ \ y_0=e_i$$

However, after we add a normalized factor, is there a similar recursive expression? Thanks.
 
Physics news on Phys.org
Isn't it just
y_{k+1}= \frac{Xy_k+e_i}{|Xy_k+ e_i|}

(And I don't see why you wouldn't just write that as
y_{k+1}= \frac{Xy_k+ y_0}{|Xy_k+ y_0|})
 
regina_lee said:
Let e_i be a unit vector with one 1 in the i-th element. Is the following expression has a recursive presentation?

$$y_N = \sum_{k=0}^N {\frac{{{X^k} e_i}}{\|{{{X^k} e_i}\|}_2}} $$

where X is a n \times n square matrix, and {\| \cdot \|}_2 is a vector norm defined as {\|z\|}_2 = \sqrt{|z_1|^2+|z_2|^2+...+|z_n|^2}.

---

EDIT: I know that if y_N = \sum_{k=0}^N {{X^k} e_i}, it is easy to obtain the following recursive formula:

$$y_{k+1} = X y_{k} + e_i, \quad (k=0,1,2,...) \textrm{ with } \ \ \ y_0=e_i$$

However, after we add a normalized factor, is there a similar recursive expression? Thanks.

Hi, it seems your formula is not right because when I checked y_0,y_1,y_2, I find the following:

$$\begin{align}
& {{y}_{1}}=\frac{X{{e}_{i}}+{{e}_{i}}}{\left\| X{{e}_{i}}+{{e}_{i}} \right\|} \\
& {{y}_{2}}=\frac{X{{y}_{1}}+{{e}_{i}}}{\left\| X{{y}_{1}}+{{e}_{i}} \right\|} \\
& =\frac{X\frac{X{{e}_{i}}+{{e}_{i}}}{\left\| X{{e}_{i}}+{{e}_{i}} \right\|}+{{e}_{i}}}{\left\| X\frac{X{{e}_{i}}+{{e}_{i}}}{\left\| X{{e}_{i}}+{{e}_{i}} \right\|}+{{e}_{i}} \right\|} \\
& =\frac{\frac{{{X}^{2}}{{e}_{i}}+X{{e}_{i}}}{\left\| X{{e}_{i}}+{{e}_{i}} \right\|}+{{e}_{i}}}{\left\| \frac{{{X}^{2}}{{e}_{i}}+X{{e}_{i}}}{\left\| X{{e}_{i}}+{{e}_{i}} \right\|}+{{e}_{i}} \right\|} \\
\end{align}$$
 
##\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