0
votes
0answers
52 views

Real roots of a quintic polynomial with constraints

This is a question on the edge of math and programming. I pondered about the best way to state the problem: should I provide context, or get straight to the point of the question? Given various ...
1
vote
2answers
90 views

Most Efficient Method to Find Roots of Polynomial [duplicate]

I am designing a software that has to find the roots of polynomials. I have to write this software from scratch as opposed to using an already existing library due to company instructions. I currently ...
1
vote
1answer
53 views

Laguerre's method and zero division

I'm trying to understand Laguerre's method for root finding and I have hit one road block. Suppose I have a polynomial $p(x) = x^4 + 1$ and an initial guess $x_0 = 0$. This results in division by ...
1
vote
0answers
44 views

Approximating the smallest positive root of a function

Suppose we have a smooth function $f:\mathbb{R}\rightarrow\mathbb{R}$. Let $S$ denote the set of all positive roots of $f$ and let $x^*$ denote the minimum of $S$ (assuming such a thing exists). What ...
2
votes
3answers
132 views

How bad, really, is the bisection method?

We know that the bisection method for root finding is slow (linear convergence), but has the advantage of always working for a continuous function, if we start with a interval which brackets the root. ...
2
votes
0answers
45 views

Is there a known algorithm for approximating all the real and imaginary zeros of any well behaved equation of a single variable?

Does there currently exist a general algorithm (or set of algorithms used together) that will approximate all the zeros of any well behaved non-differential equation of a single variable which has a ...
2
votes
3answers
114 views

If I know that a polynomial (of order $k \gt 2$) has at most $1$ positive real root - can I find that easily?

[update 2] Urgghh - the time-consumption really stems only from the construction of the h-order polynomial. The time for finding the roots (only 10 to 20 times Newton-iteration because of my nice ...
4
votes
8answers
5k views

Fastest Square Root Algorithm

What is the fastest algorithm for finding the square root of a number? I created one that can find the square root of "987654321" to 16 decimal places in just 20 iterations (I'm not ready to release ...
1
vote
2answers
88 views

Find $y=\sqrt{x}$ where $x$ and $y$ positive integers in polynomial time?

Let $x$ be a positive integer and let $y$ be a real number such that $$y=\sqrt{x}$$ Objectives: If $y$ is an integer, find it in polynomial time. If $y$ is not an integer, prove that there is no ...
5
votes
1answer
492 views

Finding all roots of polynomial system (numerically)

I want to numerically find all the roots of a system of polynomials (n equations in n variables). Since I can compute the Jacobian for the system (analytically or otherwise), I can use the Newton ...
1
vote
1answer
40 views

Formula to scale a series that is being bent with a root / power.

I have a reference number, Rx, and a series of numbers, Sx[], to compare to it. Let's call the output Ox[]. I am using a simple square root to accelerate the apparent difference between the reference ...
1
vote
1answer
126 views

Algorithm to approximate roots using blackbox root counting function

I am looking for an algorithm to do the following. Given: An interval $[a,b]$. A black box function $n(x)$ which returns the number of roots (zeros) of a function that lie to the left of $x$. That ...
4
votes
3answers
304 views

Is there an algorithm to find the roots of high-order polynomials?

It is not generally possible to determine the roots of a polynomial whose grade is bigger than 4 in terms of roots and basic operations. But I heard, that it is possible to give a criteria whether a ...