Roots of sparse “quadratic-like” polynomial.












0












$begingroup$


So I know about this question and I've seen papers like this and this. But the former isn't exactly what I want and the latter two papers are too deep and I'm lazy and I wanna quick-and-easy answer and I'm sure you legitimate mathematicians are happy to supply this lazy electrical engineer with a quick-and-easy answer, right?



So, in general, an $N$th-order polynomial with real coefficients is:



$$ f(z) = sumlimits_{n=0}^{N} a_n , z^n qquad qquad text{where }Ninmathbb{Z}ge0, a_ninmathbb{R}, zinmathbb{C}$$



Now, consider this simple quadratic:



$$begin{align}
w^2 + bw + c &= w^2 (1 + bw^{-1} + cw^{-2})\
&= (w-r_1)(w-r_2) \
end{align}$$



again $b,cinmathbb{R}$ and $w,r_1,r_2inmathbb{C}$ . We know that



$$begin{align}
r_1 &= -tfrac{b}{2} + sqrt{left(tfrac{b}{2}right)^2 - c} \
r_2 &= -tfrac{b}{2} - sqrt{left(tfrac{b}{2}right)^2 - c} \
end{align}$$



if $b^2 ge 4c$ and



$$begin{align}
r_1 &= -tfrac{b}{2} + isqrt{c - left(tfrac{b}{2}right)^2} \
r_2 &= -tfrac{b}{2} - isqrt{c - left(tfrac{b}{2}right)^2} \
end{align}$$



if $b^2 < 4c$



In the latter complex-conjugate case, we know that



$$ |r_1| = |r_2| = c $$



which is both simple and handy.



Now, whether the roots are real or complex-conjugate, suppose we have chosen $b$ and $c$ so that both



$$begin{align}
|r_1| &< 1 \
|r_2| &< 1 \
end{align}$$



Fine, now let's return to the sparse polynomial $f(z)$. Suppose $N$ is even and all coefficients $a_n$ are zero except:



$$begin{align}
a_0 &= 1 \
a_{N/2} &= b \
a_N &= c \
end{align}$$



What are the roots of $f(z)$? Suppose $N$ is pretty big (and even), say $Napprox 1000$. If I can guarantee that $b$ and $c$ are chosen to insure that $|r_1|$ and $|r_2|$ are less than $1$, can I rely on all $N$ roots of $f(z)$ also being less than $1$?



I think that I can. I've been fiddling with the substitution of



$$ w = z^{N/2} $$



and I know about the Nth-roots-of-unity, but am I guaranteed that all of the roots of the $N$th-order polynomial have magnitude less than $1$?










share|cite|improve this question











$endgroup$












  • $begingroup$
    I guess if $|w|<1$, we know that $big| z^{N/2} big| < 1$ and $|z|<1^{2/N}$ and $|z|<1$. So, although I dunno all $N$ roots of $f(z)$, I think I can say they are all inside the unit circle and that is the most important thing. (But I would like to know what the values of the roots are, anyway.)
    $endgroup$
    – robert bristow-johnson
    Dec 14 '18 at 1:55
















0












$begingroup$


So I know about this question and I've seen papers like this and this. But the former isn't exactly what I want and the latter two papers are too deep and I'm lazy and I wanna quick-and-easy answer and I'm sure you legitimate mathematicians are happy to supply this lazy electrical engineer with a quick-and-easy answer, right?



So, in general, an $N$th-order polynomial with real coefficients is:



$$ f(z) = sumlimits_{n=0}^{N} a_n , z^n qquad qquad text{where }Ninmathbb{Z}ge0, a_ninmathbb{R}, zinmathbb{C}$$



Now, consider this simple quadratic:



$$begin{align}
w^2 + bw + c &= w^2 (1 + bw^{-1} + cw^{-2})\
&= (w-r_1)(w-r_2) \
end{align}$$



again $b,cinmathbb{R}$ and $w,r_1,r_2inmathbb{C}$ . We know that



$$begin{align}
r_1 &= -tfrac{b}{2} + sqrt{left(tfrac{b}{2}right)^2 - c} \
r_2 &= -tfrac{b}{2} - sqrt{left(tfrac{b}{2}right)^2 - c} \
end{align}$$



if $b^2 ge 4c$ and



$$begin{align}
r_1 &= -tfrac{b}{2} + isqrt{c - left(tfrac{b}{2}right)^2} \
r_2 &= -tfrac{b}{2} - isqrt{c - left(tfrac{b}{2}right)^2} \
end{align}$$



if $b^2 < 4c$



In the latter complex-conjugate case, we know that



$$ |r_1| = |r_2| = c $$



which is both simple and handy.



Now, whether the roots are real or complex-conjugate, suppose we have chosen $b$ and $c$ so that both



$$begin{align}
|r_1| &< 1 \
|r_2| &< 1 \
end{align}$$



Fine, now let's return to the sparse polynomial $f(z)$. Suppose $N$ is even and all coefficients $a_n$ are zero except:



$$begin{align}
a_0 &= 1 \
a_{N/2} &= b \
a_N &= c \
end{align}$$



What are the roots of $f(z)$? Suppose $N$ is pretty big (and even), say $Napprox 1000$. If I can guarantee that $b$ and $c$ are chosen to insure that $|r_1|$ and $|r_2|$ are less than $1$, can I rely on all $N$ roots of $f(z)$ also being less than $1$?



I think that I can. I've been fiddling with the substitution of



$$ w = z^{N/2} $$



and I know about the Nth-roots-of-unity, but am I guaranteed that all of the roots of the $N$th-order polynomial have magnitude less than $1$?










share|cite|improve this question











$endgroup$












  • $begingroup$
    I guess if $|w|<1$, we know that $big| z^{N/2} big| < 1$ and $|z|<1^{2/N}$ and $|z|<1$. So, although I dunno all $N$ roots of $f(z)$, I think I can say they are all inside the unit circle and that is the most important thing. (But I would like to know what the values of the roots are, anyway.)
    $endgroup$
    – robert bristow-johnson
    Dec 14 '18 at 1:55














0












0








0





$begingroup$


So I know about this question and I've seen papers like this and this. But the former isn't exactly what I want and the latter two papers are too deep and I'm lazy and I wanna quick-and-easy answer and I'm sure you legitimate mathematicians are happy to supply this lazy electrical engineer with a quick-and-easy answer, right?



So, in general, an $N$th-order polynomial with real coefficients is:



$$ f(z) = sumlimits_{n=0}^{N} a_n , z^n qquad qquad text{where }Ninmathbb{Z}ge0, a_ninmathbb{R}, zinmathbb{C}$$



Now, consider this simple quadratic:



$$begin{align}
w^2 + bw + c &= w^2 (1 + bw^{-1} + cw^{-2})\
&= (w-r_1)(w-r_2) \
end{align}$$



again $b,cinmathbb{R}$ and $w,r_1,r_2inmathbb{C}$ . We know that



$$begin{align}
r_1 &= -tfrac{b}{2} + sqrt{left(tfrac{b}{2}right)^2 - c} \
r_2 &= -tfrac{b}{2} - sqrt{left(tfrac{b}{2}right)^2 - c} \
end{align}$$



if $b^2 ge 4c$ and



$$begin{align}
r_1 &= -tfrac{b}{2} + isqrt{c - left(tfrac{b}{2}right)^2} \
r_2 &= -tfrac{b}{2} - isqrt{c - left(tfrac{b}{2}right)^2} \
end{align}$$



if $b^2 < 4c$



In the latter complex-conjugate case, we know that



$$ |r_1| = |r_2| = c $$



which is both simple and handy.



Now, whether the roots are real or complex-conjugate, suppose we have chosen $b$ and $c$ so that both



$$begin{align}
|r_1| &< 1 \
|r_2| &< 1 \
end{align}$$



Fine, now let's return to the sparse polynomial $f(z)$. Suppose $N$ is even and all coefficients $a_n$ are zero except:



$$begin{align}
a_0 &= 1 \
a_{N/2} &= b \
a_N &= c \
end{align}$$



What are the roots of $f(z)$? Suppose $N$ is pretty big (and even), say $Napprox 1000$. If I can guarantee that $b$ and $c$ are chosen to insure that $|r_1|$ and $|r_2|$ are less than $1$, can I rely on all $N$ roots of $f(z)$ also being less than $1$?



I think that I can. I've been fiddling with the substitution of



$$ w = z^{N/2} $$



and I know about the Nth-roots-of-unity, but am I guaranteed that all of the roots of the $N$th-order polynomial have magnitude less than $1$?










share|cite|improve this question











$endgroup$




So I know about this question and I've seen papers like this and this. But the former isn't exactly what I want and the latter two papers are too deep and I'm lazy and I wanna quick-and-easy answer and I'm sure you legitimate mathematicians are happy to supply this lazy electrical engineer with a quick-and-easy answer, right?



So, in general, an $N$th-order polynomial with real coefficients is:



$$ f(z) = sumlimits_{n=0}^{N} a_n , z^n qquad qquad text{where }Ninmathbb{Z}ge0, a_ninmathbb{R}, zinmathbb{C}$$



Now, consider this simple quadratic:



$$begin{align}
w^2 + bw + c &= w^2 (1 + bw^{-1} + cw^{-2})\
&= (w-r_1)(w-r_2) \
end{align}$$



again $b,cinmathbb{R}$ and $w,r_1,r_2inmathbb{C}$ . We know that



$$begin{align}
r_1 &= -tfrac{b}{2} + sqrt{left(tfrac{b}{2}right)^2 - c} \
r_2 &= -tfrac{b}{2} - sqrt{left(tfrac{b}{2}right)^2 - c} \
end{align}$$



if $b^2 ge 4c$ and



$$begin{align}
r_1 &= -tfrac{b}{2} + isqrt{c - left(tfrac{b}{2}right)^2} \
r_2 &= -tfrac{b}{2} - isqrt{c - left(tfrac{b}{2}right)^2} \
end{align}$$



if $b^2 < 4c$



In the latter complex-conjugate case, we know that



$$ |r_1| = |r_2| = c $$



which is both simple and handy.



Now, whether the roots are real or complex-conjugate, suppose we have chosen $b$ and $c$ so that both



$$begin{align}
|r_1| &< 1 \
|r_2| &< 1 \
end{align}$$



Fine, now let's return to the sparse polynomial $f(z)$. Suppose $N$ is even and all coefficients $a_n$ are zero except:



$$begin{align}
a_0 &= 1 \
a_{N/2} &= b \
a_N &= c \
end{align}$$



What are the roots of $f(z)$? Suppose $N$ is pretty big (and even), say $Napprox 1000$. If I can guarantee that $b$ and $c$ are chosen to insure that $|r_1|$ and $|r_2|$ are less than $1$, can I rely on all $N$ roots of $f(z)$ also being less than $1$?



I think that I can. I've been fiddling with the substitution of



$$ w = z^{N/2} $$



and I know about the Nth-roots-of-unity, but am I guaranteed that all of the roots of the $N$th-order polynomial have magnitude less than $1$?







polynomials factoring roots-of-unity






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 15 '18 at 0:38







robert bristow-johnson

















asked Dec 14 '18 at 1:17









robert bristow-johnsonrobert bristow-johnson

216117




216117












  • $begingroup$
    I guess if $|w|<1$, we know that $big| z^{N/2} big| < 1$ and $|z|<1^{2/N}$ and $|z|<1$. So, although I dunno all $N$ roots of $f(z)$, I think I can say they are all inside the unit circle and that is the most important thing. (But I would like to know what the values of the roots are, anyway.)
    $endgroup$
    – robert bristow-johnson
    Dec 14 '18 at 1:55


















  • $begingroup$
    I guess if $|w|<1$, we know that $big| z^{N/2} big| < 1$ and $|z|<1^{2/N}$ and $|z|<1$. So, although I dunno all $N$ roots of $f(z)$, I think I can say they are all inside the unit circle and that is the most important thing. (But I would like to know what the values of the roots are, anyway.)
    $endgroup$
    – robert bristow-johnson
    Dec 14 '18 at 1:55
















$begingroup$
I guess if $|w|<1$, we know that $big| z^{N/2} big| < 1$ and $|z|<1^{2/N}$ and $|z|<1$. So, although I dunno all $N$ roots of $f(z)$, I think I can say they are all inside the unit circle and that is the most important thing. (But I would like to know what the values of the roots are, anyway.)
$endgroup$
– robert bristow-johnson
Dec 14 '18 at 1:55




$begingroup$
I guess if $|w|<1$, we know that $big| z^{N/2} big| < 1$ and $|z|<1^{2/N}$ and $|z|<1$. So, although I dunno all $N$ roots of $f(z)$, I think I can say they are all inside the unit circle and that is the most important thing. (But I would like to know what the values of the roots are, anyway.)
$endgroup$
– robert bristow-johnson
Dec 14 '18 at 1:55










1 Answer
1






active

oldest

votes


















1












$begingroup$

So you have the equation:
$$cz^{2n}+bz^n+1 = 0$$,
where it's guaranteed that $z^n_{1,2}$ have modulus less than $1?$
If this is the case, then your intuition is correct because if:
$$|z^n| = |z|^n = |omega| <1,$$
it must necessarily follow that:
$$|z|<1$$
since $|z|$ is a positive real number.






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    or, at least a non-negative real number.
    $endgroup$
    – robert bristow-johnson
    Dec 15 '18 at 1:56











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3038805%2froots-of-sparse-quadratic-like-polynomial%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









1












$begingroup$

So you have the equation:
$$cz^{2n}+bz^n+1 = 0$$,
where it's guaranteed that $z^n_{1,2}$ have modulus less than $1?$
If this is the case, then your intuition is correct because if:
$$|z^n| = |z|^n = |omega| <1,$$
it must necessarily follow that:
$$|z|<1$$
since $|z|$ is a positive real number.






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    or, at least a non-negative real number.
    $endgroup$
    – robert bristow-johnson
    Dec 15 '18 at 1:56
















1












$begingroup$

So you have the equation:
$$cz^{2n}+bz^n+1 = 0$$,
where it's guaranteed that $z^n_{1,2}$ have modulus less than $1?$
If this is the case, then your intuition is correct because if:
$$|z^n| = |z|^n = |omega| <1,$$
it must necessarily follow that:
$$|z|<1$$
since $|z|$ is a positive real number.






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    or, at least a non-negative real number.
    $endgroup$
    – robert bristow-johnson
    Dec 15 '18 at 1:56














1












1








1





$begingroup$

So you have the equation:
$$cz^{2n}+bz^n+1 = 0$$,
where it's guaranteed that $z^n_{1,2}$ have modulus less than $1?$
If this is the case, then your intuition is correct because if:
$$|z^n| = |z|^n = |omega| <1,$$
it must necessarily follow that:
$$|z|<1$$
since $|z|$ is a positive real number.






share|cite|improve this answer









$endgroup$



So you have the equation:
$$cz^{2n}+bz^n+1 = 0$$,
where it's guaranteed that $z^n_{1,2}$ have modulus less than $1?$
If this is the case, then your intuition is correct because if:
$$|z^n| = |z|^n = |omega| <1,$$
it must necessarily follow that:
$$|z|<1$$
since $|z|$ is a positive real number.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 15 '18 at 1:53









dezdichadodezdichado

6,3711929




6,3711929








  • 1




    $begingroup$
    or, at least a non-negative real number.
    $endgroup$
    – robert bristow-johnson
    Dec 15 '18 at 1:56














  • 1




    $begingroup$
    or, at least a non-negative real number.
    $endgroup$
    – robert bristow-johnson
    Dec 15 '18 at 1:56








1




1




$begingroup$
or, at least a non-negative real number.
$endgroup$
– robert bristow-johnson
Dec 15 '18 at 1:56




$begingroup$
or, at least a non-negative real number.
$endgroup$
– robert bristow-johnson
Dec 15 '18 at 1:56


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3038805%2froots-of-sparse-quadratic-like-polynomial%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Wiesbaden

To store a contact into the json file from server.js file using a class in NodeJS

Marschland