⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 ex_1.c

📁 柯西方法解方程
💻 C
字号:
#include <stdio.h>#include <stdlib.h>#include <math.h>#include <time.h>#include "math_util.h"int n_fun, n_grad;main(){    clock_t time_1, time_0;    long double tol, *x, dtime;    int n;    long double ex1_fun( long double * );    void ex1_dfun( long double *, long double * );    long double line_search( long double(*)(), long double, long double *,                             long double *, int, long double );    void cauchy( long double(*)(), void(*)(), long double *, int,                  long double );    	n_fun = 0;	n_grad = 0;	n = 2;	x = a1d_allo_dbl( n );	x[0] = -2.9;	x[1] = 2.0;	tol = 1.0e-4;		time_0 = clock();    cauchy( ex1_fun, ex1_dfun, x, n, tol );    time_1 = clock();    dtime = (long double)(time_1-time_0)/((long double)CLOCKS_PER_SEC);            printf("\nSolution x: ");    print_vec_dbl( x, n );    printf("\n");    printf(" # of function evaluations: %d\n",n_fun);    printf(" # of gradient evaluations: %d\n",n_grad);    printf(" Solution time: %Le",dtime);}/*	Rosenbrock's function*/long double ex1_fun( x )long double *x;{   long double f;      n_fun++;      f = 100*(x[1]-x[0]*x[0])*(x[1]-x[0]*x[0]) + (1.0-x[0])*(1.0-x[0]);      return( f );}void ex1_dfun( df, x )long double *df, *x;{   n_grad++;      df[0] = -400.0*x[0]*(x[1]-x[0]*x[0])-2.0*(1.0-x[0]);   df[1] = 200.0*(x[1]-x[0]*x[0]);}/****  Norm(grad f) <= epsSolution x:  1.000024e+00  1.000048e+00 # of function evaluations: 4208 # of gradient evaluations: 579 Solution time: 7.166667e+00*/

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -