00001 /* 00002 * Copyright (c) 2005, DoodleProject 00003 * All rights reserved. 00004 * 00005 * Redistribution and use in source and binary forms, with or without 00006 * modification, are permitted provided that the following conditions 00007 * are met: 00008 * 00009 * Redistributions of source code must retain the above copyright 00010 * notice, this list of conditions and the following disclaimer. 00011 * 00012 * Redistributions in binary form must reproduce the above copyright 00013 * notice, this list of conditions and the following disclaimer in 00014 * the documentation and/or other materials provided with the 00015 * distribution. 00016 * 00017 * Neither the name of DoodleProject nor the names of its contributors 00018 * may be used to endorse or promote products derived from this 00019 * software without specific prior written permission. 00020 * 00021 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 00022 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, 00023 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 00024 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 00025 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS 00026 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00027 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED 00028 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 00029 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON 00030 * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR 00031 * TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF 00032 * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00033 * SUCH DAMAGE. 00034 */ 00035 00036 #ifndef _NUMERICS4CPP_ROOT_SECANT_H_ 00037 #define _NUMERICS4CPP_ROOT_SECANT_H_ 00038 00039 #include <cmath> 00040 #include <limits> 00041 #include "../iterativemethod.h" 00042 #include "../math.h" 00043 00044 NUM_NAMESPACE_BEGIN 00045 00071 template<class Function> 00072 class secant_root_finder : public iterative_method { 00073 00074 public: 00081 secant_root_finder(Function& f, unsigned int iterations = 100, 00082 double relative_error = 1.0e-15) 00083 : iterative_method(iterations, relative_error), _function(f) 00084 { 00085 } 00086 00094 double find_root(double x0, double x1) { 00095 double f0 = _function(x0); 00096 double f1 = _function(x1); 00097 double f; 00098 unsigned int n = 0; 00099 double x; 00100 double delta; 00101 double error; 00102 00103 do { 00104 delta = f1 * (x1 - x0) / (f1 - f0); 00105 x = x1 - delta; 00106 f = _function(x); 00107 error = std::max(std::fabs(f), std::fabs(delta / x1)); 00108 00109 // update for next iteration 00110 ++n; 00111 x0 = x1; 00112 f0 = f1; 00113 x1 = x; 00114 f1 = f; 00115 } while (n < maximum_iterations() && error > maximum_relative_error()); 00116 00117 if (n >= maximum_iterations()) { 00118 throw convergence_exception("Secant method failed to converge."); 00119 } 00120 00121 return x; 00122 } 00123 00124 private: 00126 Function& _function; 00127 }; 00128 00129 NUM_NAMESPACE_END 00130 00131 #endif