# Tag Info

### Fastest method forfinding a solution to x*log(x)

This equation is not polynomial. Assuming both $K$ and $C$ are positive (as in your linked problem), then the solution of $C x \ln_2(x) - K = 0$ can be found in terms of the Lambert $W$ function or ...

### Bracketing a discontinuity in a step function

No. Although the question is phrased in terms of floating-point arithmetic, this is at heart a question about binary search. Binary search is an optimal algorithm among algorithms that rely on a ...

### Bracketing a discontinuity in a step function

See @Kirill's answer, but depending on what sort of hardware you have available, you might be able to leverage parallelism to solve the problem more quickly. For example, say you had a way to evaluate ...
Accepted

### Roots of a function for eigensystem

I suspect the main problem is the magnitude of the values. If you divide through by $\cosh$ to make all the numbers smaller, then ApproxFun doesn't seem to have a problem finding all the roots. ...
Accepted

### Efficient root finding algorithm for monotonic function

It seems your main concern is bracketing the root in as few iterations as possible, since each iteration is costly. In some cases you have found the regula falsi method to be unreliable, suggesting ...

### What is an efficient way to calculate zeros of Bessel functions?

This is a classical problem in numerical methods research: evaluating the zeros of special functions. Many years of research have gone into devising efficient methods. The canonical starting point for ...

### Finding the roots of a function like $3+\cos(x)+0.005/(x-a)$?

I suggest you sample the function and fit a rational function to the samples. You can find $a$ among the poles of the rational function, and the root among the real zeros. There are many good methods ...

### Find the roots of a complicated polynomial

One technique is to use a library with arbitrary large integers and use fixed point arithmetic. Just scale up x by some integer factor, then compute your polynomial in fixed-point, keeping only the ...

### Finding the roots of a function like $3+\cos(x)+0.005/(x-a)$?

This is a standard problem in numerical analysis. The standard approach if you can't compute derivatives of the function is to use a "bisection search" or, if you want to be fancy, its ...

### ODE Event detection for calculating multiple roots of continuous sinusoidal equation

Assuming it is not too expensive to evaluate the function, I would recommend using the chebfun toolbox (matlab), as shown here: https://www.chebfun.org/docs/guide/guide03.html It builds an ...

### Iterative root finding of 2-dimensional system of non-linear equations with monotonicity properties

Because the functions are strictly increasing, this can be reduced to the one-dimensional case. In each one-dimensional problem there are more efficient standard methods available, more efficient than ...
Accepted

### Efficient and stable computation of inverse CDF

The assumptions you have are no more specific than what you need to assume to make something like Newton's method work. In fact, you don't even assume enough to make the problem unique: you only ...
Accepted

### Finding self-kissing points on a plane curve?

There exists a clever algorithm for doing this, based on ideas due to Cayley, using the Bézout matrix. I learned this from , which describes an algorithm for a generic version of this problem. If ...

### Difference between Brent's and Alefeld-Potra-Shi for root finding

The asymptotic order of convergence of Brent's method tends to be either 1.618 and 1.689, of which the Alefeld-Potra-Shi's methods lie directly in between. The main difference of the Alefeld-Potra-Shi'...

### ODE Event detection for calculating multiple roots of continuous sinusoidal equation

I don't know about a generalized approach, but satellite around Earth can not physically orbit around it in less than about 87 minutes; at an altitude of 100 km the period is about 5190 seconds, but ...

1 vote

### Test on a set of high degree polynomials whose coefficients in {-1,0,1}

You can use backtracking to generate your polynomials. This can be parallelized in pretty much any language you choose. You may also want to call the Sturm sequence finder in the FLINT library from ...
1 vote
Accepted

### Obtaining extra output argument(s) from the objective function used by fsolve in MATLAB

As I said in my comment, I don't think you can necessarily count on the value of x in the last call to your function being the value that is returned as the ...
1 vote

### Dekker's method and fixed further border

A full log of the Dekker method run as in  (but with function value equality relaxed based on the tolerances) reads ...
1 vote
Accepted

### Finding common roots of two multivariate equations

The derivatives $\partial_u f(u,v)$ and $\partial_v f(u,v)$ are two vectors tangent to yor surface that in general span the tangent space to the surface at the point $f(u,v)$. Then the normal vector ...
1 vote

### Solution of quartic equation

Numerical recipes in c provides closed form expression for real roots of quadratic and cubic which presumably have decent precision. Since the algebraic solution of the quartic involves solving a ...

Only top scored, non community-wiki answers of a minimum length are eligible