// ch13_nonlinear_fit.cpp // Companion code for Chapter 13: Optimization and Data Fitting. // Standalone C++11; standard library only; console output without plotting. // Compile: c++ -std=c++11 -O2 -Wall -Wextra -pedantic ch13_nonlinear_fit.cpp -o ch13_nonlinear_fit // Edit the example settings in main(); routines above main() can be reused. // Fixed seeds reproduce runs with the same standard-library implementation. // Random distributions need not give identical sequences across compilers/languages. #include #include #include #include #include #include #include #include #include #include #include #include #include using Vec = std::vector; using Mat = std::vector; using Function = std::function; using ScalarFunction = std::function; const double pi = std::acos(-1.0); void require(bool condition, const std::string& message) { if (!condition) throw std::invalid_argument(message); } void finite_vector(const Vec& x) { require(!x.empty(), "A nonempty vector is required."); for (double v : x) require(std::isfinite(v), "Data must be finite."); } void check_bounds(const Vec& lo, const Vec& hi) { finite_vector(lo); finite_vector(hi); require(lo.size() == hi.size(), "Bounds must have matching dimensions."); for (std::size_t j=0; jlo[j] && std::isfinite(hi[j]-lo[j]), "Require finite upper > lower."); } double objective_value(double value) { require(std::isfinite(value), "Objective must return a finite real scalar."); return value; } double clip(double x, double lo, double hi) { return std::max(lo,std::min(hi,x)); } Vec linspace(double a, double b, int n) { require(n>=2, "Grid needs at least two points."); Vec x(n); for (int i=0; i uniform{0.0,1.0}; std::normal_distribution normal{0.0,1.0}; explicit Random(unsigned int seed) : engine(seed) {} double u() { return uniform(engine); } double z() { return normal(engine); } int index(int n) { return std::uniform_int_distribution(0,n-1)(engine); } }; struct Result { Vec point; double value=0.0; long long evaluations=0; int iterations=0; std::string status; }; void print_result(const Result& r) { std::cout << std::setprecision(12); for (std::size_t j=0; j0 && max_calls>=3 && std::isfinite(tol_x+tol_f) && tol_x>0 && tol_f>0, "Invalid simplex settings."); Mat x(3,start); Vec v(3); Result r; bool exhausted=false; auto evaluate=[&](const Vec& p) { if (r.evaluations>=max_calls) { exhausted=true; return std::numeric_limits::infinity(); } ++r.evaluations; return objective_value(f(p)); }; for (int j=0;j<2;++j) x[j+1][j]=(start[j]!=0 ? 1.05*start[j] : 0.00025); for (int i=0;i<3;++i) v[i]=evaluate(x[i]); auto sort_simplex=[&]() { for (int i=0;i<2;++i) for (int j=i+1;j<3;++j) if (v[j]=3 && std::isfinite(A0) && std::isfinite(tau0) && tau0>0 && *std::min_element(t.begin(),t.end())>=0 && *std::max_element(t.begin(),t.end())>*std::min_element(t.begin(),t.end()), "Invalid decay data or initial estimates."); Vec scale(t.size(),1.0); if (!sigma.empty()) { finite_vector(sigma); require(sigma.size()==t.size(), "One uncertainty per observation is required."); scale=sigma; for (double s:scale) require(s>0,"Uncertainties must be positive."); } auto cost=[&](const Vec& q) { if (!std::isfinite(q[0]+q[1]) || q[1]<-700 || q[1]>700) return 1e300; double tau=std::exp(q[1]), sum=0; for (std::size_t i=0;i(t.size())-2; for (std::size_t i=0;i