Convergence of Vector Combinations
up vote
0
down vote
favorite
I have $n$ vectors $v_1(t), dots, v_n(t)$.
Time is divided into discrete rounds.
Initially, all vectors have length $leq 1$.
The vectors at the next time step $t+1$ can be calculated as follows:
begin{align*}
v_1(t+1) &= frac{v_1(t)}{2|v_1(t)|} + frac{1}{2}v_2(t)\
v_i(t+1) &= frac{1}{2}v_{i-1}(t) + frac{1}{2}v_{i+1}(t) \
v_n(t+1) &= frac{1}{2}v_{n-1}(t) + frac{v_n(t)}{2|v_n(t)|}\
end{align*}
, where $||v_i(t)||$ denotes the Euclidean norm of $v_i(t)$.
It turns out that this procedure converges for $t rightarrow infty $ and in the end all vectors are the same. However, I cannot predict the limit vector.
Does anyone have an idea?
linear-algebra vectors vector-analysis heat-equation
add a comment |
up vote
0
down vote
favorite
I have $n$ vectors $v_1(t), dots, v_n(t)$.
Time is divided into discrete rounds.
Initially, all vectors have length $leq 1$.
The vectors at the next time step $t+1$ can be calculated as follows:
begin{align*}
v_1(t+1) &= frac{v_1(t)}{2|v_1(t)|} + frac{1}{2}v_2(t)\
v_i(t+1) &= frac{1}{2}v_{i-1}(t) + frac{1}{2}v_{i+1}(t) \
v_n(t+1) &= frac{1}{2}v_{n-1}(t) + frac{v_n(t)}{2|v_n(t)|}\
end{align*}
, where $||v_i(t)||$ denotes the Euclidean norm of $v_i(t)$.
It turns out that this procedure converges for $t rightarrow infty $ and in the end all vectors are the same. However, I cannot predict the limit vector.
Does anyone have an idea?
linear-algebra vectors vector-analysis heat-equation
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I have $n$ vectors $v_1(t), dots, v_n(t)$.
Time is divided into discrete rounds.
Initially, all vectors have length $leq 1$.
The vectors at the next time step $t+1$ can be calculated as follows:
begin{align*}
v_1(t+1) &= frac{v_1(t)}{2|v_1(t)|} + frac{1}{2}v_2(t)\
v_i(t+1) &= frac{1}{2}v_{i-1}(t) + frac{1}{2}v_{i+1}(t) \
v_n(t+1) &= frac{1}{2}v_{n-1}(t) + frac{v_n(t)}{2|v_n(t)|}\
end{align*}
, where $||v_i(t)||$ denotes the Euclidean norm of $v_i(t)$.
It turns out that this procedure converges for $t rightarrow infty $ and in the end all vectors are the same. However, I cannot predict the limit vector.
Does anyone have an idea?
linear-algebra vectors vector-analysis heat-equation
I have $n$ vectors $v_1(t), dots, v_n(t)$.
Time is divided into discrete rounds.
Initially, all vectors have length $leq 1$.
The vectors at the next time step $t+1$ can be calculated as follows:
begin{align*}
v_1(t+1) &= frac{v_1(t)}{2|v_1(t)|} + frac{1}{2}v_2(t)\
v_i(t+1) &= frac{1}{2}v_{i-1}(t) + frac{1}{2}v_{i+1}(t) \
v_n(t+1) &= frac{1}{2}v_{n-1}(t) + frac{v_n(t)}{2|v_n(t)|}\
end{align*}
, where $||v_i(t)||$ denotes the Euclidean norm of $v_i(t)$.
It turns out that this procedure converges for $t rightarrow infty $ and in the end all vectors are the same. However, I cannot predict the limit vector.
Does anyone have an idea?
linear-algebra vectors vector-analysis heat-equation
linear-algebra vectors vector-analysis heat-equation
edited Nov 26 at 21:55
asked Nov 24 at 16:19
Jannik
587
587
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
1
down vote
Here's my idea...
It reminds me a discrete version of the heat equation for a vector valued function on the interval $(1,2,...,n)$, with Von Neumann conditions imposing the norm of the function at the boundary to be $1$.
I think this since the discrete version of the laplacian operator at one point of a graph-like domain is just the mean taken on all the adiacent vertexes.
That said we can understand that the limit will have norm equal to $1$, but the exact value seems harder to determine. We may also note that all vectors will have the same limit value if the norm we use in the recursion is not the $infty$-norm, otherwhise they may take different values.
I wouldn't know how to prove it formally, I was rather using intuition. The idea is that, without considering the normalization part for the first and last vector, we have there a diffusive process (we are averaging the neighbours) like the heat equation, which conserves the total heat (which in this analogy is the sum af all vectors) and converges to a uniform solution. In fact in that case would converge to the baricenter.
– Dinisaur
Nov 26 at 15:06
In this analogy our domain is an interval which consider a discrete sequence of n points, and our quantity is vector valued. When we add the normalization at the extremal points (which would be the boundary of the domain) we are forcing our vectors to have norm 1, but since the process is diffusive all points tend to have the same value (i.e. all vectors tend to be the same) the limit will have norm 1.
– Dinisaur
Nov 26 at 15:10
We may conjecture that the limit will be the normalization of the baricenter, which is the case for two points, but I'm not really sure about it.
– Dinisaur
Nov 26 at 15:15
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3011743%2fconvergence-of-vector-combinations%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
Here's my idea...
It reminds me a discrete version of the heat equation for a vector valued function on the interval $(1,2,...,n)$, with Von Neumann conditions imposing the norm of the function at the boundary to be $1$.
I think this since the discrete version of the laplacian operator at one point of a graph-like domain is just the mean taken on all the adiacent vertexes.
That said we can understand that the limit will have norm equal to $1$, but the exact value seems harder to determine. We may also note that all vectors will have the same limit value if the norm we use in the recursion is not the $infty$-norm, otherwhise they may take different values.
I wouldn't know how to prove it formally, I was rather using intuition. The idea is that, without considering the normalization part for the first and last vector, we have there a diffusive process (we are averaging the neighbours) like the heat equation, which conserves the total heat (which in this analogy is the sum af all vectors) and converges to a uniform solution. In fact in that case would converge to the baricenter.
– Dinisaur
Nov 26 at 15:06
In this analogy our domain is an interval which consider a discrete sequence of n points, and our quantity is vector valued. When we add the normalization at the extremal points (which would be the boundary of the domain) we are forcing our vectors to have norm 1, but since the process is diffusive all points tend to have the same value (i.e. all vectors tend to be the same) the limit will have norm 1.
– Dinisaur
Nov 26 at 15:10
We may conjecture that the limit will be the normalization of the baricenter, which is the case for two points, but I'm not really sure about it.
– Dinisaur
Nov 26 at 15:15
add a comment |
up vote
1
down vote
Here's my idea...
It reminds me a discrete version of the heat equation for a vector valued function on the interval $(1,2,...,n)$, with Von Neumann conditions imposing the norm of the function at the boundary to be $1$.
I think this since the discrete version of the laplacian operator at one point of a graph-like domain is just the mean taken on all the adiacent vertexes.
That said we can understand that the limit will have norm equal to $1$, but the exact value seems harder to determine. We may also note that all vectors will have the same limit value if the norm we use in the recursion is not the $infty$-norm, otherwhise they may take different values.
I wouldn't know how to prove it formally, I was rather using intuition. The idea is that, without considering the normalization part for the first and last vector, we have there a diffusive process (we are averaging the neighbours) like the heat equation, which conserves the total heat (which in this analogy is the sum af all vectors) and converges to a uniform solution. In fact in that case would converge to the baricenter.
– Dinisaur
Nov 26 at 15:06
In this analogy our domain is an interval which consider a discrete sequence of n points, and our quantity is vector valued. When we add the normalization at the extremal points (which would be the boundary of the domain) we are forcing our vectors to have norm 1, but since the process is diffusive all points tend to have the same value (i.e. all vectors tend to be the same) the limit will have norm 1.
– Dinisaur
Nov 26 at 15:10
We may conjecture that the limit will be the normalization of the baricenter, which is the case for two points, but I'm not really sure about it.
– Dinisaur
Nov 26 at 15:15
add a comment |
up vote
1
down vote
up vote
1
down vote
Here's my idea...
It reminds me a discrete version of the heat equation for a vector valued function on the interval $(1,2,...,n)$, with Von Neumann conditions imposing the norm of the function at the boundary to be $1$.
I think this since the discrete version of the laplacian operator at one point of a graph-like domain is just the mean taken on all the adiacent vertexes.
That said we can understand that the limit will have norm equal to $1$, but the exact value seems harder to determine. We may also note that all vectors will have the same limit value if the norm we use in the recursion is not the $infty$-norm, otherwhise they may take different values.
Here's my idea...
It reminds me a discrete version of the heat equation for a vector valued function on the interval $(1,2,...,n)$, with Von Neumann conditions imposing the norm of the function at the boundary to be $1$.
I think this since the discrete version of the laplacian operator at one point of a graph-like domain is just the mean taken on all the adiacent vertexes.
That said we can understand that the limit will have norm equal to $1$, but the exact value seems harder to determine. We may also note that all vectors will have the same limit value if the norm we use in the recursion is not the $infty$-norm, otherwhise they may take different values.
answered Nov 24 at 18:29
Dinisaur
1009
1009
I wouldn't know how to prove it formally, I was rather using intuition. The idea is that, without considering the normalization part for the first and last vector, we have there a diffusive process (we are averaging the neighbours) like the heat equation, which conserves the total heat (which in this analogy is the sum af all vectors) and converges to a uniform solution. In fact in that case would converge to the baricenter.
– Dinisaur
Nov 26 at 15:06
In this analogy our domain is an interval which consider a discrete sequence of n points, and our quantity is vector valued. When we add the normalization at the extremal points (which would be the boundary of the domain) we are forcing our vectors to have norm 1, but since the process is diffusive all points tend to have the same value (i.e. all vectors tend to be the same) the limit will have norm 1.
– Dinisaur
Nov 26 at 15:10
We may conjecture that the limit will be the normalization of the baricenter, which is the case for two points, but I'm not really sure about it.
– Dinisaur
Nov 26 at 15:15
add a comment |
I wouldn't know how to prove it formally, I was rather using intuition. The idea is that, without considering the normalization part for the first and last vector, we have there a diffusive process (we are averaging the neighbours) like the heat equation, which conserves the total heat (which in this analogy is the sum af all vectors) and converges to a uniform solution. In fact in that case would converge to the baricenter.
– Dinisaur
Nov 26 at 15:06
In this analogy our domain is an interval which consider a discrete sequence of n points, and our quantity is vector valued. When we add the normalization at the extremal points (which would be the boundary of the domain) we are forcing our vectors to have norm 1, but since the process is diffusive all points tend to have the same value (i.e. all vectors tend to be the same) the limit will have norm 1.
– Dinisaur
Nov 26 at 15:10
We may conjecture that the limit will be the normalization of the baricenter, which is the case for two points, but I'm not really sure about it.
– Dinisaur
Nov 26 at 15:15
I wouldn't know how to prove it formally, I was rather using intuition. The idea is that, without considering the normalization part for the first and last vector, we have there a diffusive process (we are averaging the neighbours) like the heat equation, which conserves the total heat (which in this analogy is the sum af all vectors) and converges to a uniform solution. In fact in that case would converge to the baricenter.
– Dinisaur
Nov 26 at 15:06
I wouldn't know how to prove it formally, I was rather using intuition. The idea is that, without considering the normalization part for the first and last vector, we have there a diffusive process (we are averaging the neighbours) like the heat equation, which conserves the total heat (which in this analogy is the sum af all vectors) and converges to a uniform solution. In fact in that case would converge to the baricenter.
– Dinisaur
Nov 26 at 15:06
In this analogy our domain is an interval which consider a discrete sequence of n points, and our quantity is vector valued. When we add the normalization at the extremal points (which would be the boundary of the domain) we are forcing our vectors to have norm 1, but since the process is diffusive all points tend to have the same value (i.e. all vectors tend to be the same) the limit will have norm 1.
– Dinisaur
Nov 26 at 15:10
In this analogy our domain is an interval which consider a discrete sequence of n points, and our quantity is vector valued. When we add the normalization at the extremal points (which would be the boundary of the domain) we are forcing our vectors to have norm 1, but since the process is diffusive all points tend to have the same value (i.e. all vectors tend to be the same) the limit will have norm 1.
– Dinisaur
Nov 26 at 15:10
We may conjecture that the limit will be the normalization of the baricenter, which is the case for two points, but I'm not really sure about it.
– Dinisaur
Nov 26 at 15:15
We may conjecture that the limit will be the normalization of the baricenter, which is the case for two points, but I'm not really sure about it.
– Dinisaur
Nov 26 at 15:15
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3011743%2fconvergence-of-vector-combinations%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown