Solver1D::solve

classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view
|

Solver1D::solve

Vadim Ogranovich-3
Hi,

I am wondering why the constraints in
Solver1D::solve(const ObjectiveFunction& f,
                           double xAccuracy,
                           double guess,
                           double xMin,
                           double xMax) const

are strict rather than inclusive, e.g. fxMin_*fxMax_ < 0.0 rather than <=
0.0, see below an exerpt from solver1d.cpp.

        QL_REQUIRE((fxMin_*fxMax_ < 0.0),  "root not bracketed: f[" +
...

        QL_REQUIRE(guess > xMin_, "Solver1D: guess (" +
...
        QL_REQUIRE(guess < xMax_, "Solver1D: guess (" +


I came across this when trying to use Newton method to find a root. There my
initial guess was xMin which was rejected by the second QL_REQUIRE. (And
strictly speaking neither xMin nor xMax are required for Newton's method)

Thanks, Vadim

--------------------------------------------------
DISCLAIMER
This e-mail, and any attachments thereto, is intended only for use by the
addressee(s) named herein and may contain legally privileged and/or
confidential information.  If you are not the intended recipient of this
e-mail, you are hereby notified that any dissemination, distribution or
copying of this e-mail, and any attachments thereto, is strictly prohibited.
If you have received this e-mail in error, please immediately notify me and
permanently delete the original and any copy of any e-mail and any printout
thereof.

E-mail transmission cannot be guaranteed to be secure or error-free.  The
sender therefore does not accept liability for any errors or omissions in
the contents of this message which arise as a result of e-mail transmission.

NOTICE REGARDING PRIVACY AND CONFIDENTIALITY

Knight Trading Group may, at its discretion, monitor and review the content
of all e-mail communications.