Find the periodicity with the help of Laplace transform
I have a function
$$x(t) = picos(21omega_0t)+0.1cos(39omega_0t)$$
that I want to solve T from the periodicity identity, $x(t)=x(t+T)$.
What I have tried now is basically just solving $x(t)=x(t+T)$, but this gets really complex. So I tried to do the laplace transform of the function in order to maybe find out a way of solving it more simple, the laplace transform is,
$$X(s) = pi frac{s}{s^2+(21omega_0)^2}+0.1frac{s}{s^2+(39omega_0)^2}$$
What struck me here is that I do not really know how to find the periodicity when I am in the frequency plane. I get a feeling it should be a better way of doing it than the latter, but how?
laplace-transform periodic-functions
add a comment |
I have a function
$$x(t) = picos(21omega_0t)+0.1cos(39omega_0t)$$
that I want to solve T from the periodicity identity, $x(t)=x(t+T)$.
What I have tried now is basically just solving $x(t)=x(t+T)$, but this gets really complex. So I tried to do the laplace transform of the function in order to maybe find out a way of solving it more simple, the laplace transform is,
$$X(s) = pi frac{s}{s^2+(21omega_0)^2}+0.1frac{s}{s^2+(39omega_0)^2}$$
What struck me here is that I do not really know how to find the periodicity when I am in the frequency plane. I get a feeling it should be a better way of doing it than the latter, but how?
laplace-transform periodic-functions
1
They are just sums of cosines with periods $T_1 = frac{2pi}{21omega_0}$ and $T_2 = frac{2pi}{39omega_0}$ so it is definitely periodic of period at most $T$ such that $T = nT_1 = mT_2$ for some integers $n$ and $m$. Simplifying a bit, we have $39n = 21m implies 3 cdot 13n = 3 cdot 7m implies 13n = 7m$ so the optimal integers are $n = 7, m = 13$. So $T = frac{2pi}{3omega_0}$.
– Pratyush Sarkar
15 mins ago
Ohh, talking about making it more simple. Thank you!
– Salviati
13 mins ago
add a comment |
I have a function
$$x(t) = picos(21omega_0t)+0.1cos(39omega_0t)$$
that I want to solve T from the periodicity identity, $x(t)=x(t+T)$.
What I have tried now is basically just solving $x(t)=x(t+T)$, but this gets really complex. So I tried to do the laplace transform of the function in order to maybe find out a way of solving it more simple, the laplace transform is,
$$X(s) = pi frac{s}{s^2+(21omega_0)^2}+0.1frac{s}{s^2+(39omega_0)^2}$$
What struck me here is that I do not really know how to find the periodicity when I am in the frequency plane. I get a feeling it should be a better way of doing it than the latter, but how?
laplace-transform periodic-functions
I have a function
$$x(t) = picos(21omega_0t)+0.1cos(39omega_0t)$$
that I want to solve T from the periodicity identity, $x(t)=x(t+T)$.
What I have tried now is basically just solving $x(t)=x(t+T)$, but this gets really complex. So I tried to do the laplace transform of the function in order to maybe find out a way of solving it more simple, the laplace transform is,
$$X(s) = pi frac{s}{s^2+(21omega_0)^2}+0.1frac{s}{s^2+(39omega_0)^2}$$
What struck me here is that I do not really know how to find the periodicity when I am in the frequency plane. I get a feeling it should be a better way of doing it than the latter, but how?
laplace-transform periodic-functions
laplace-transform periodic-functions
asked 1 hour ago
Salviati
224111
224111
1
They are just sums of cosines with periods $T_1 = frac{2pi}{21omega_0}$ and $T_2 = frac{2pi}{39omega_0}$ so it is definitely periodic of period at most $T$ such that $T = nT_1 = mT_2$ for some integers $n$ and $m$. Simplifying a bit, we have $39n = 21m implies 3 cdot 13n = 3 cdot 7m implies 13n = 7m$ so the optimal integers are $n = 7, m = 13$. So $T = frac{2pi}{3omega_0}$.
– Pratyush Sarkar
15 mins ago
Ohh, talking about making it more simple. Thank you!
– Salviati
13 mins ago
add a comment |
1
They are just sums of cosines with periods $T_1 = frac{2pi}{21omega_0}$ and $T_2 = frac{2pi}{39omega_0}$ so it is definitely periodic of period at most $T$ such that $T = nT_1 = mT_2$ for some integers $n$ and $m$. Simplifying a bit, we have $39n = 21m implies 3 cdot 13n = 3 cdot 7m implies 13n = 7m$ so the optimal integers are $n = 7, m = 13$. So $T = frac{2pi}{3omega_0}$.
– Pratyush Sarkar
15 mins ago
Ohh, talking about making it more simple. Thank you!
– Salviati
13 mins ago
1
1
They are just sums of cosines with periods $T_1 = frac{2pi}{21omega_0}$ and $T_2 = frac{2pi}{39omega_0}$ so it is definitely periodic of period at most $T$ such that $T = nT_1 = mT_2$ for some integers $n$ and $m$. Simplifying a bit, we have $39n = 21m implies 3 cdot 13n = 3 cdot 7m implies 13n = 7m$ so the optimal integers are $n = 7, m = 13$. So $T = frac{2pi}{3omega_0}$.
– Pratyush Sarkar
15 mins ago
They are just sums of cosines with periods $T_1 = frac{2pi}{21omega_0}$ and $T_2 = frac{2pi}{39omega_0}$ so it is definitely periodic of period at most $T$ such that $T = nT_1 = mT_2$ for some integers $n$ and $m$. Simplifying a bit, we have $39n = 21m implies 3 cdot 13n = 3 cdot 7m implies 13n = 7m$ so the optimal integers are $n = 7, m = 13$. So $T = frac{2pi}{3omega_0}$.
– Pratyush Sarkar
15 mins ago
Ohh, talking about making it more simple. Thank you!
– Salviati
13 mins ago
Ohh, talking about making it more simple. Thank you!
– Salviati
13 mins ago
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%2f3061378%2ffind-the-periodicity-with-the-help-of-laplace-transform%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.
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%2f3061378%2ffind-the-periodicity-with-the-help-of-laplace-transform%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
They are just sums of cosines with periods $T_1 = frac{2pi}{21omega_0}$ and $T_2 = frac{2pi}{39omega_0}$ so it is definitely periodic of period at most $T$ such that $T = nT_1 = mT_2$ for some integers $n$ and $m$. Simplifying a bit, we have $39n = 21m implies 3 cdot 13n = 3 cdot 7m implies 13n = 7m$ so the optimal integers are $n = 7, m = 13$. So $T = frac{2pi}{3omega_0}$.
– Pratyush Sarkar
15 mins ago
Ohh, talking about making it more simple. Thank you!
– Salviati
13 mins ago