代码搜索：minimum
找到约 5,594 项符合「minimum」的源代码
代码结果 5,594
www.eeworm.com/read/255742/12060868
h eorealbounds.h
// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
//-----------------------------------------------------------------------------
// eoRealBounds.h
// (c) Marc S
www.eeworm.com/read/152083/12142333
cpp d11r6.cpp
#include "iostream.h"
#include "math.h"
double func2(double x[], int n)
{
return 0.5 - bessj0(pow((x[1] - 1.0) , 2) +
pow((x[2] - 2.0), 2) + pow((x[3] - 3.0) , 2));
}
double func(d
www.eeworm.com/read/253867/12180318
cpp template.cpp
// Section 10.1
// $ CC template.cpp
/*
minimum of 10 and 20 is: 10
minimum of 10.3 and 20.6 is: 10.3
*/
#include
using std::cout;
using std::endl;
template
www.eeworm.com/read/339382/12239437
cpp d11r6.cpp
#include "iostream.h"
#include "math.h"
double func2(double x[], int n)
{
return 0.5 - bessj0(pow((x[1] - 1.0) , 2) +
pow((x[2] - 2.0), 2) + pow((x[3] - 3.0) , 2));
}
double func(d
www.eeworm.com/read/338523/12297028
m ch1_3.m
% ch1_3.m
% Plot the diagram shown as Figure 1.2-3 on P.1-7
x=1:0.01:5; y=sin(x);
figure(1); plot(x,y); grid
title('Find minimum of y=sin(x) near x=3');
xlabel('x span. You can see the minimun(
www.eeworm.com/read/338243/12316451
man brentlinesearch.3.man
BRENTLINESEARCH(derived)OPTIMIZATION ALGORITHM BRENTLINESEARCH(derived)
Jun 1 15:16
NAME
BrentLineSearch class
SYNOPSIS
#include
www.eeworm.com/read/338243/12316681
hh brentls.hh
//============================================================
// COOOL version 1.1 --- Nov, 1995
// Center for Wave Phenomena, Colorado School of Mines
//==================
www.eeworm.com/read/150072/12317198
cpp d11r6.cpp
#include "iostream.h"
#include "math.h"
double func2(double x[], int n)
{
return 0.5 - bessj0(pow((x[1] - 1.0) , 2) +
pow((x[2] - 2.0), 2) + pow((x[3] - 3.0) , 2));
}
double func(d