Reducing a formula containing Sum and matrices.
$begingroup$
M and T is a NxN Matrix, a and b are vectors with N length.
g(x) is a function that takes a vector and returns a vector with the same length.
g(x) inverse exists.
The vector multiplication: t = u*v is defined:
begin{align*}
t_{i} = u_{i}*v_{i}
end{align*}
The Number of matriaces used here is 2*o, I would like to reduce this for my algorithm,
both for speed and memory purposes. Is this possible?.
begin{align*}
f(a,b)=frac{(sum_{k=1}^o
g_{k}^{-1}(M_{k}g_{k}(a)(M_{k}g_{k}(b) + frac{T_{k}g_{k}(b)}{2})+
frac{M_{k}g_{k}(a)T_{k}g_{k}(b)}{2}+
frac{T_{k}g_{k}(a)T_{k}g_{k}(b)}{3}))}{o} =
frac{(sum_{k=1}^o
g_{k}^{-1}(M_{k}g_{k}(a)M_{k}g_{k}(b)+
M_{k}g_{k}(a)T_{k}g_{k}(b)+
frac{T_{k}g_{k}(a)T_{k}g_{k}(b)}{3}))}{o}
end{align*}
I am totally stuck at this, any help is appreciated!
linear-algebra algorithms
$endgroup$
add a comment |
$begingroup$
M and T is a NxN Matrix, a and b are vectors with N length.
g(x) is a function that takes a vector and returns a vector with the same length.
g(x) inverse exists.
The vector multiplication: t = u*v is defined:
begin{align*}
t_{i} = u_{i}*v_{i}
end{align*}
The Number of matriaces used here is 2*o, I would like to reduce this for my algorithm,
both for speed and memory purposes. Is this possible?.
begin{align*}
f(a,b)=frac{(sum_{k=1}^o
g_{k}^{-1}(M_{k}g_{k}(a)(M_{k}g_{k}(b) + frac{T_{k}g_{k}(b)}{2})+
frac{M_{k}g_{k}(a)T_{k}g_{k}(b)}{2}+
frac{T_{k}g_{k}(a)T_{k}g_{k}(b)}{3}))}{o} =
frac{(sum_{k=1}^o
g_{k}^{-1}(M_{k}g_{k}(a)M_{k}g_{k}(b)+
M_{k}g_{k}(a)T_{k}g_{k}(b)+
frac{T_{k}g_{k}(a)T_{k}g_{k}(b)}{3}))}{o}
end{align*}
I am totally stuck at this, any help is appreciated!
linear-algebra algorithms
$endgroup$
1
$begingroup$
Usually the expectation on this site is that you type out your mathematics rather than place an image. Atleast in part this will make your post more attractive to answer. Logistically, it's easier on the answerers to have the mathematics that s/he may need to include in the answer already typed out. Then we can just cut and paste the needed symbols rather than retype it.
$endgroup$
– Mason
Dec 5 '18 at 4:21
add a comment |
$begingroup$
M and T is a NxN Matrix, a and b are vectors with N length.
g(x) is a function that takes a vector and returns a vector with the same length.
g(x) inverse exists.
The vector multiplication: t = u*v is defined:
begin{align*}
t_{i} = u_{i}*v_{i}
end{align*}
The Number of matriaces used here is 2*o, I would like to reduce this for my algorithm,
both for speed and memory purposes. Is this possible?.
begin{align*}
f(a,b)=frac{(sum_{k=1}^o
g_{k}^{-1}(M_{k}g_{k}(a)(M_{k}g_{k}(b) + frac{T_{k}g_{k}(b)}{2})+
frac{M_{k}g_{k}(a)T_{k}g_{k}(b)}{2}+
frac{T_{k}g_{k}(a)T_{k}g_{k}(b)}{3}))}{o} =
frac{(sum_{k=1}^o
g_{k}^{-1}(M_{k}g_{k}(a)M_{k}g_{k}(b)+
M_{k}g_{k}(a)T_{k}g_{k}(b)+
frac{T_{k}g_{k}(a)T_{k}g_{k}(b)}{3}))}{o}
end{align*}
I am totally stuck at this, any help is appreciated!
linear-algebra algorithms
$endgroup$
M and T is a NxN Matrix, a and b are vectors with N length.
g(x) is a function that takes a vector and returns a vector with the same length.
g(x) inverse exists.
The vector multiplication: t = u*v is defined:
begin{align*}
t_{i} = u_{i}*v_{i}
end{align*}
The Number of matriaces used here is 2*o, I would like to reduce this for my algorithm,
both for speed and memory purposes. Is this possible?.
begin{align*}
f(a,b)=frac{(sum_{k=1}^o
g_{k}^{-1}(M_{k}g_{k}(a)(M_{k}g_{k}(b) + frac{T_{k}g_{k}(b)}{2})+
frac{M_{k}g_{k}(a)T_{k}g_{k}(b)}{2}+
frac{T_{k}g_{k}(a)T_{k}g_{k}(b)}{3}))}{o} =
frac{(sum_{k=1}^o
g_{k}^{-1}(M_{k}g_{k}(a)M_{k}g_{k}(b)+
M_{k}g_{k}(a)T_{k}g_{k}(b)+
frac{T_{k}g_{k}(a)T_{k}g_{k}(b)}{3}))}{o}
end{align*}
I am totally stuck at this, any help is appreciated!
linear-algebra algorithms
linear-algebra algorithms
edited Dec 5 '18 at 5:00
Mikael Törnqvist
asked Dec 5 '18 at 3:39
Mikael TörnqvistMikael Törnqvist
1011
1011
1
$begingroup$
Usually the expectation on this site is that you type out your mathematics rather than place an image. Atleast in part this will make your post more attractive to answer. Logistically, it's easier on the answerers to have the mathematics that s/he may need to include in the answer already typed out. Then we can just cut and paste the needed symbols rather than retype it.
$endgroup$
– Mason
Dec 5 '18 at 4:21
add a comment |
1
$begingroup$
Usually the expectation on this site is that you type out your mathematics rather than place an image. Atleast in part this will make your post more attractive to answer. Logistically, it's easier on the answerers to have the mathematics that s/he may need to include in the answer already typed out. Then we can just cut and paste the needed symbols rather than retype it.
$endgroup$
– Mason
Dec 5 '18 at 4:21
1
1
$begingroup$
Usually the expectation on this site is that you type out your mathematics rather than place an image. Atleast in part this will make your post more attractive to answer. Logistically, it's easier on the answerers to have the mathematics that s/he may need to include in the answer already typed out. Then we can just cut and paste the needed symbols rather than retype it.
$endgroup$
– Mason
Dec 5 '18 at 4:21
$begingroup$
Usually the expectation on this site is that you type out your mathematics rather than place an image. Atleast in part this will make your post more attractive to answer. Logistically, it's easier on the answerers to have the mathematics that s/he may need to include in the answer already typed out. Then we can just cut and paste the needed symbols rather than retype it.
$endgroup$
– Mason
Dec 5 '18 at 4:21
add a comment |
0
active
oldest
votes
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%2f3026579%2freducing-a-formula-containing-sum-and-matrices%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
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%2f3026579%2freducing-a-formula-containing-sum-and-matrices%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
1
$begingroup$
Usually the expectation on this site is that you type out your mathematics rather than place an image. Atleast in part this will make your post more attractive to answer. Logistically, it's easier on the answerers to have the mathematics that s/he may need to include in the answer already typed out. Then we can just cut and paste the needed symbols rather than retype it.
$endgroup$
– Mason
Dec 5 '18 at 4:21