Estimate of the Degree of a Polynomial Approximation of log(x) Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)How do I use Weierstrass Approximation Theorem?Application of Weierstrass approximation theoremapproximation of rational functionsApproximation of continuous functionsContinuity of the Stone-Weierstrass approximation operatorAre there guarantees on the $ L^2$ error of the best polynomial approximation (or pessimistic theorems)?How well can continuous functions on $[0,1]$ be approximated by polynomials up to a given degree?Showing the existence of a polynomial $p$ to approximate $f : [2,7] rightarrow BbbR$Uniform-degree polynomial estimation of smooth functions with bounded derivativesQuestion Using Weierstrass Approximation Thm:How do I use Weierstrass Approximation Theorem?
Aligning an equation at multiple points, with both left and right alignment, as well as equals sign alignment
Hangman Game with C++
Put R under double integral
Do I really need to have a message in a novel to appeal to readers?
How to improve on this Stylesheet Manipulation for Message Styling
Sum letters are not two different
How do I decide if I need to go for Normalization and not Standardization or vice-versa?
How come Sam didn't become Lord of Horn Hill?
Significance of Cersei's obsession with elephants?
How do I find out the mythology and history of my Fortress?
Would it be possible to dictate a bech32 address as a list of English words?
MLE of the unknown radius
Why does it sometimes sound good to play a grace note as a lead in to a note in a melody?
When a candle burns, why does the top of wick glow if bottom of flame is hottest?
What is the difference between globalisation and imperialism?
Is there any word for a place full of confusion?
Find 108 by using 3,4,6
Can anything be seen from the center of the Boötes void? How dark would it be?
What is Adi Shankara referring to when he says "He has Vajra marks on his feet"?
Importance of からだ in this sentence
What is the meaning of 'breadth' in breadth first search?
Is there hard evidence that the grant peer review system performs significantly better than random?
How fail-safe is nr as stop bytes?
How does the math work when buying airline miles?
Estimate of the Degree of a Polynomial Approximation of log(x)
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)How do I use Weierstrass Approximation Theorem?Application of Weierstrass approximation theoremapproximation of rational functionsApproximation of continuous functionsContinuity of the Stone-Weierstrass approximation operatorAre there guarantees on the $ L^2$ error of the best polynomial approximation (or pessimistic theorems)?How well can continuous functions on $[0,1]$ be approximated by polynomials up to a given degree?Showing the existence of a polynomial $p$ to approximate $f : [2,7] rightarrow BbbR$Uniform-degree polynomial estimation of smooth functions with bounded derivativesQuestion Using Weierstrass Approximation Thm:How do I use Weierstrass Approximation Theorem?
$begingroup$
I have a homework question asking me to find an estimate for the degree $n$ of a polynomial $P(x)$ that approximates $f(x) = log(x)$ on $[1,2]$ such that $suplimits_x in [1,2] |P(x) - log(x)| leq epsilon$ for $epsilon in [0,1]$.
From the Weierstrass approximation theorem (WAT) I know such a polynomial exists, and I am trying to tease something out following a proof using Bernstein polynomials because a hint says I can solve this problem by "evaluating the proof of the WAT."
I get lost trying to set up an inequality like $|B_n(f)(x) - f(x)| leq $ to start with, and I'm not sure what other way(s) I can approach this using/building off a proof of WAT.
As I understand the problem, since smaller and smaller $epsilon$ imply closer approximations to $f(x)$ on the given interval, certain thresholds of error necessitate the use of higher degree approximations. So given $epsilon in [0,1]$, I am asked to find an estimate of $n(epsilon)$ (not necessarily the best one) such that there always exists an approximation of $f(x) = log(x)$ by $P(x)$ with degree $n(epsilon)$ where $suplimits_x in [1,2] |P(x) - log(x)| leq epsilon$.
Provided that interpretation is correct, I found this similar question, but the given answer is not clicking for me and I can't apply the explanation because of that.
If anyone can lead me the right way or help me put some tools in my toolbox, I would appreciate it.
real-analysis analysis
edited Mar 27 at 20:30
Bernard
124k742117
asked Mar 27 at 20:19
kh7kh7
61
$endgroup$
add a comment |
$begingroup$
I have a homework question asking me to find an estimate for the degree $n$ of a polynomial $P(x)$ that approximates $f(x) = log(x)$ on $[1,2]$ such that $suplimits_x in [1,2] |P(x) - log(x)| leq epsilon$ for $epsilon in [0,1]$.
From the Weierstrass approximation theorem (WAT) I know such a polynomial exists, and I am trying to tease something out following a proof using Bernstein polynomials because a hint says I can solve this problem by "evaluating the proof of the WAT."
I get lost trying to set up an inequality like $|B_n(f)(x) - f(x)| leq $ to start with, and I'm not sure what other way(s) I can approach this using/building off a proof of WAT.
As I understand the problem, since smaller and smaller $epsilon$ imply closer approximations to $f(x)$ on the given interval, certain thresholds of error necessitate the use of higher degree approximations. So given $epsilon in [0,1]$, I am asked to find an estimate of $n(epsilon)$ (not necessarily the best one) such that there always exists an approximation of $f(x) = log(x)$ by $P(x)$ with degree $n(epsilon)$ where $suplimits_x in [1,2] |P(x) - log(x)| leq epsilon$.
Provided that interpretation is correct, I found this similar question, but the given answer is not clicking for me and I can't apply the explanation because of that.
If anyone can lead me the right way or help me put some tools in my toolbox, I would appreciate it.
real-analysis analysis
edited Mar 27 at 20:30
Bernard
124k742117
asked Mar 27 at 20:19
kh7kh7
61
$endgroup$
$begingroup$
I think your efforts would be well spent in trying to understand that previous Question's Answer. A basic step will be to discover what function $g(t)$ will work with your problem (to approximate $log x$ with Bernstein polynomials). I think it would be expeditious to help you if we can narrow your Question to helping you understand steps in such a previous analysis (as they apply to your problem).
$endgroup$
– hardmath
Mar 27 at 20:37
$begingroup$
In that answer, I am actually confused about the initial expression of $B_n(f)(x)$, as I haven't encountered it expressed with $f(frac2k -nn)$, etc. but rather, I've seen it in the form provided in the wiki link. Following that, I don't quite understand the introduction of $g(2)$ (I guess idk why 2, specifically) or how to find what $g(t)$ works for $log x$. The rest seems straight forward; although with how the question was posed, I was hoping there would be a way to avoid using pmf's, variance, etc. as I don't remember those topics being involved in our studies.
$endgroup$
– kh7
Mar 27 at 21:05
$begingroup$
Okay, that additional context is helpful to preparing an answer for you.
$endgroup$
– hardmath
Mar 27 at 21:16
add a comment |
$begingroup$
I have a homework question asking me to find an estimate for the degree $n$ of a polynomial $P(x)$ that approximates $f(x) = log(x)$ on $[1,2]$ such that $suplimits_x in [1,2] |P(x) - log(x)| leq epsilon$ for $epsilon in [0,1]$.
From the Weierstrass approximation theorem (WAT) I know such a polynomial exists, and I am trying to tease something out following a proof using Bernstein polynomials because a hint says I can solve this problem by "evaluating the proof of the WAT."
I get lost trying to set up an inequality like $|B_n(f)(x) - f(x)| leq $ to start with, and I'm not sure what other way(s) I can approach this using/building off a proof of WAT.
As I understand the problem, since smaller and smaller $epsilon$ imply closer approximations to $f(x)$ on the given interval, certain thresholds of error necessitate the use of higher degree approximations. So given $epsilon in [0,1]$, I am asked to find an estimate of $n(epsilon)$ (not necessarily the best one) such that there always exists an approximation of $f(x) = log(x)$ by $P(x)$ with degree $n(epsilon)$ where $suplimits_x in [1,2] |P(x) - log(x)| leq epsilon$.
Provided that interpretation is correct, I found this similar question, but the given answer is not clicking for me and I can't apply the explanation because of that.
If anyone can lead me the right way or help me put some tools in my toolbox, I would appreciate it.
real-analysis analysis
edited Mar 27 at 20:30
Bernard
124k742117
asked Mar 27 at 20:19
kh7kh7
61
$endgroup$
I have a homework question asking me to find an estimate for the degree $n$ of a polynomial $P(x)$ that approximates $f(x) = log(x)$ on $[1,2]$ such that $suplimits_x in [1,2] |P(x) - log(x)| leq epsilon$ for $epsilon in [0,1]$.
From the Weierstrass approximation theorem (WAT) I know such a polynomial exists, and I am trying to tease something out following a proof using Bernstein polynomials because a hint says I can solve this problem by "evaluating the proof of the WAT."
I get lost trying to set up an inequality like $|B_n(f)(x) - f(x)| leq $ to start with, and I'm not sure what other way(s) I can approach this using/building off a proof of WAT.
As I understand the problem, since smaller and smaller $epsilon$ imply closer approximations to $f(x)$ on the given interval, certain thresholds of error necessitate the use of higher degree approximations. So given $epsilon in [0,1]$, I am asked to find an estimate of $n(epsilon)$ (not necessarily the best one) such that there always exists an approximation of $f(x) = log(x)$ by $P(x)$ with degree $n(epsilon)$ where $suplimits_x in [1,2] |P(x) - log(x)| leq epsilon$.
Provided that interpretation is correct, I found this similar question, but the given answer is not clicking for me and I can't apply the explanation because of that.
If anyone can lead me the right way or help me put some tools in my toolbox, I would appreciate it.
real-analysis analysis
real-analysis analysis
edited Mar 27 at 20:30
Bernard
124k742117
asked Mar 27 at 20:19
kh7kh7
61
edited Mar 27 at 20:30
Bernard
124k742117
asked Mar 27 at 20:19
kh7kh7
61
edited Mar 27 at 20:30
Bernard
124k742117
edited Mar 27 at 20:30
Bernard
124k742117
edited Mar 27 at 20:30
Bernard
124k742117
124k742117
asked Mar 27 at 20:19
kh7kh7
61
asked Mar 27 at 20:19
kh7kh7
61
asked Mar 27 at 20:19
kh7kh7
61
61
$begingroup$
I think your efforts would be well spent in trying to understand that previous Question's Answer. A basic step will be to discover what function $g(t)$ will work with your problem (to approximate $log x$ with Bernstein polynomials). I think it would be expeditious to help you if we can narrow your Question to helping you understand steps in such a previous analysis (as they apply to your problem).
$endgroup$
– hardmath
Mar 27 at 20:37
$begingroup$
In that answer, I am actually confused about the initial expression of $B_n(f)(x)$, as I haven't encountered it expressed with $f(frac2k -nn)$, etc. but rather, I've seen it in the form provided in the wiki link. Following that, I don't quite understand the introduction of $g(2)$ (I guess idk why 2, specifically) or how to find what $g(t)$ works for $log x$. The rest seems straight forward; although with how the question was posed, I was hoping there would be a way to avoid using pmf's, variance, etc. as I don't remember those topics being involved in our studies.
$endgroup$
– kh7
Mar 27 at 21:05
$begingroup$
Okay, that additional context is helpful to preparing an answer for you.
$endgroup$
– hardmath
Mar 27 at 21:16
add a comment |
$begingroup$
I think your efforts would be well spent in trying to understand that previous Question's Answer. A basic step will be to discover what function $g(t)$ will work with your problem (to approximate $log x$ with Bernstein polynomials). I think it would be expeditious to help you if we can narrow your Question to helping you understand steps in such a previous analysis (as they apply to your problem).
$endgroup$
– hardmath
Mar 27 at 20:37
$begingroup$
In that answer, I am actually confused about the initial expression of $B_n(f)(x)$, as I haven't encountered it expressed with $f(frac2k -nn)$, etc. but rather, I've seen it in the form provided in the wiki link. Following that, I don't quite understand the introduction of $g(2)$ (I guess idk why 2, specifically) or how to find what $g(t)$ works for $log x$. The rest seems straight forward; although with how the question was posed, I was hoping there would be a way to avoid using pmf's, variance, etc. as I don't remember those topics being involved in our studies.
$endgroup$
– kh7
Mar 27 at 21:05
$begingroup$
Okay, that additional context is helpful to preparing an answer for you.
$endgroup$
– hardmath
Mar 27 at 21:16
$begingroup$
I think your efforts would be well spent in trying to understand that previous Question's Answer. A basic step will be to discover what function $g(t)$ will work with your problem (to approximate $log x$ with Bernstein polynomials). I think it would be expeditious to help you if we can narrow your Question to helping you understand steps in such a previous analysis (as they apply to your problem).
$endgroup$
– hardmath
Mar 27 at 20:37
$begingroup$
I think your efforts would be well spent in trying to understand that previous Question's Answer. A basic step will be to discover what function $g(t)$ will work with your problem (to approximate $log x$ with Bernstein polynomials). I think it would be expeditious to help you if we can narrow your Question to helping you understand steps in such a previous analysis (as they apply to your problem).
$endgroup$
– hardmath
Mar 27 at 20:37
$begingroup$
In that answer, I am actually confused about the initial expression of $B_n(f)(x)$, as I haven't encountered it expressed with $f(frac2k -nn)$, etc. but rather, I've seen it in the form provided in the wiki link. Following that, I don't quite understand the introduction of $g(2)$ (I guess idk why 2, specifically) or how to find what $g(t)$ works for $log x$. The rest seems straight forward; although with how the question was posed, I was hoping there would be a way to avoid using pmf's, variance, etc. as I don't remember those topics being involved in our studies.
$endgroup$
– kh7
Mar 27 at 21:05
$begingroup$
In that answer, I am actually confused about the initial expression of $B_n(f)(x)$, as I haven't encountered it expressed with $f(frac2k -nn)$, etc. but rather, I've seen it in the form provided in the wiki link. Following that, I don't quite understand the introduction of $g(2)$ (I guess idk why 2, specifically) or how to find what $g(t)$ works for $log x$. The rest seems straight forward; although with how the question was posed, I was hoping there would be a way to avoid using pmf's, variance, etc. as I don't remember those topics being involved in our studies.
$endgroup$
– kh7
Mar 27 at 21:05
$begingroup$
Okay, that additional context is helpful to preparing an answer for you.
$endgroup$
– hardmath
Mar 27 at 21:16
$begingroup$
Okay, that additional context is helpful to preparing an answer for you.
$endgroup$
– hardmath
Mar 27 at 21:16
add a comment |
0
active
oldest
votes
Your Answer
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%2f3165077%2festimate-of-the-degree-of-a-polynomial-approximation-of-logx%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%2f3165077%2festimate-of-the-degree-of-a-polynomial-approximation-of-logx%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
$begingroup$
I think your efforts would be well spent in trying to understand that previous Question's Answer. A basic step will be to discover what function $g(t)$ will work with your problem (to approximate $log x$ with Bernstein polynomials). I think it would be expeditious to help you if we can narrow your Question to helping you understand steps in such a previous analysis (as they apply to your problem).
$endgroup$
– hardmath
Mar 27 at 20:37
$begingroup$
In that answer, I am actually confused about the initial expression of $B_n(f)(x)$, as I haven't encountered it expressed with $f(frac2k -nn)$, etc. but rather, I've seen it in the form provided in the wiki link. Following that, I don't quite understand the introduction of $g(2)$ (I guess idk why 2, specifically) or how to find what $g(t)$ works for $log x$. The rest seems straight forward; although with how the question was posed, I was hoping there would be a way to avoid using pmf's, variance, etc. as I don't remember those topics being involved in our studies.
$endgroup$
– kh7
Mar 27 at 21:05
$begingroup$
Okay, that additional context is helpful to preparing an answer for you.
$endgroup$
– hardmath
Mar 27 at 21:16