Solution to Quartic Equation with small first coefficient

  • Thread starter Thread starter andert
  • Start date Start date
  • Tags Tags
    Coefficient
andert
Messages
12
Reaction score
0
I want to solve a depressed quartic:

ax^4 + bx^2 + cx + d = 0

Assume |a|\ll |b|,|c|,|d|.

I would like to find the solutions by expanding around the solution to the quadratic. If you try to solve in, say, Maple, and expand around a in a series you get something that blows up. That seems silly to me, why would the solution blow up as a\rightarrow 0. Only because the solution method assumed a was not zero. Clearly, if you plotted it on the complex plane, the quartic solutions must approach the quadratic. Anyway, so my idea was to solve the quadratic equation

bx^2+cx+d=0 to get

x_0 = \frac{-c\pm\sqrt{c^2-4bd}}{2b}

Then insert x_0 into the quartic part like so,

ax_0^4 + bx^2+cx+d = 0

Then solve this quadratic to get,

x_1 = \frac{-c\pm\sqrt{c^2-4b(d+ax_0^4)}}{2b}.

Does anyone see a problem with this approach (assuming I just want some sort of approximation)?

Secondly, this question just occurred to me: I see this generates 4 solutions, but will all solutions be closer to the exact solutions than the initial quadratic solutions are?
 
Mathematics news on Phys.org
Small a will lead to two large solutions, which you do not catch with that approach. The solutions you can get are close to the solutions for a=0. If a is small enough and the other coefficients are not special in some way, I would expect that the last recursion relation converges.
 
mfb said:
Small a will lead to two large solutions, which you do not catch with that approach. The solutions you can get are close to the solutions for a=0. If a is small enough and the other coefficients are not special in some way, I would expect that the last recursion relation converges.

Yes, I just thought of that too. The quartic solution x would be proportional to 1/a^(1/4) unfortunately, so that term would not be "small" after all.
 
Take this special case though: I'm only interested in the cases where a>0, b>0, c real, and d< 0. There should be (by Descartes rule of signs) two real solutions. When I plot the graph, the solutions of the quartic appear to converge to the quadratic solutions. So it appears that my recursion would be valid in that case. [No proof yet though.]
 
With a>0, b>0, d<0 and c not too large, the two "large" solutions are imaginary, as they lie in the region where bx^2+cx+d is positive.
 
Why not just use Newton's method with x0 as an initial guess? This is easy to set up, and should converge rapidly.
 
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