A Recreating chebychev coefficient from an article

dan_smith
Messages
5
Reaction score
0
Hello i need to recreate these chebychev coefficents given the initial value of X_0=1.853 as shown in the photo bellow.
i have tried to follow the iterrative algorithm shown in the photo bellow.
please help me understand where did i go wrong?

thanks

25fpq2x.jpg


2qwexbc.jpg
 
Mathematics news on Phys.org
dan_smith said:
please help me understand where did i go wrong?
What exactly went wrong?
 
mfb said:
What exactly went wrong?
if x_0=1.853 then
T_0=1
T_1=1.853
T_2=2*1.853*1.853-1
its not the same numbers that they get in the article

Thanks
 
What you calculate are not coefficients of polynomials, these numbers are the values of the polynomial functions at this value of x.

I don't understand where their numbers come from, but I also don't understand where they are used afterwards. I found the context here, page 19 ("206").

I also don't understand the value of x they got - WolframAlpha disagrees (using 180 instead of pi doesn't work either, but I guess the 180 comes from working in degrees).
 
Hello, Yes this is the article from which the example came from.
you are correct regarding the wolfram alfa calculation.assuming that their numbers are wrong
i tried to use matlabs commands for
g=chebyshevT([1 ,2, 3 ,4] , x) %first kind
[ x, 2*x^2 - 1, 4*x^3 - 3*x, 8*x^4 - 8*x^2 + 1]

g=chebyshevU([1 ,2, 3 ,4],x) %second kind
[ 2*x, 4*x^2 - 1, 8*x^3 - 4*x, 16*x^4 - 12*x^2 + 1]

what coefficients should i take for this step?

Thanks
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top