Minima for a polynomial
I was looking for an answer to the following problem:
Let f=x^n+u_0*x^(n-1)+u_1*x^(n-2)+......+u_(n-1)
x is a positive real and x>1. n is a positive (usually large in my
problem) integer.
u_i=+1 or -1.
The question is how to find the sequence {u_i} that minimizes |f| ( the
absolute value of f) for a given x.
Is there some other way than trying all combinations on a computer.
It would be of real help if someone could help. Even some pointer to
which type of books may have a solution to this will be greatly
appreciated.
Thanks,
Deb.
.
Relevant Pages
- Re: Minima for a polynomial
... It would be of real help if someone could help. ... Even some pointer to ... which type of books may have a solution to this will be greatly ... Hint is a very vague hint, but I'm guessing that you're not under ...
(sci.math) - Minima for a polynomial
... absolute value of f) for a given x. ... It would be of real help if someone could help. ... Even some pointer to ... which type of books may have a solution to this will be greatly ...
(sci.math.research) - Minima for a polynomial
... absolute value of f) for a given x. ... It would be of real help if someone could help. ... Even some pointer to ... which type of books may have a solution to this will be greatly ...
(sci.math) - Re: Minima for a polynomial
... It would be of real help if someone could help. ... which type of books may have a solution to this will be greatly ... this can be done more efficiently than by brute force testing of ... using an optimization method called "dynamic ...
(sci.math) - Re: Minima for a polynomial
... It would be of real help if someone could help. ... which type of books may have a solution to this will be greatly ... Have you got a reference for it being NP-hard? ... the sort for your problem by building the first array with 2 ...
(sci.math) |
|
