代码搜索：DFP
找到约 465 项符合「DFP」的源代码
代码结果 465
www.eeworm.com/read/276269/10751798
dsw dfp.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/276269/10751801
dsp dfp.dsp
# Microsoft Developer Studio Project File - Name="DFP" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Conso
www.eeworm.com/read/276269/10751803
ncb dfp.ncb
www.eeworm.com/read/417673/10980727
m dfp.m
www.eeworm.com/read/467198/7019982
m dfp.m
www.eeworm.com/read/454849/7382280
h dfp.h
//DFP.H
#if !defined(_DFP_H)
#define _DFP_H
#include "matrix.h"
#include"differ.h"
#include
class CDfp
{
public:
CDfp(){}
CMatrix operator()(double(*p)(CMatrix&),
CMatr
www.eeworm.com/read/454849/7382282
cpp dfp.cpp
//dfp.cpp
#include"dfp.h"
CMatrix CDfp::operator()(double(*p)(CMatrix&),CMatrix& X0,double e)
{
pfun=p,n=X0.getrow();
X.set(n,1),S.set(n,1);
X=X0, error=e;
CMatrix B(n,n),
www.eeworm.com/read/433726/7912439
m dfp.m
%用DFP方法求解
% min{(1-x1)^2+2*(x2-x1^2)^2},
%初始点为x0=(0,0)',初始矩阵为单位矩阵，迭代三次。
clc;
clear;
syms x1 x2 times a b w;
fx=(1-x1)^2+2*(x2-x1^2)^2;
fab=subs(fx,{x1,x2},{a,b});
g=[diff(fx,x1
www.eeworm.com/read/296852/8074938
cpp dfp法.cpp
#include
#include
#include
int const n=2;//正定二次函数的自变量个数
double fun(double x[n],double f_xs[n+n+1+(n-1)*n/2]);//输入变量为函数自变量初值
void Q_fun(double f_xs[n+n+1+(n-1)*n/2],
www.eeworm.com/read/145309/12736261
m dfp.m
%变尺度法，多变量寻优
%允许迭代的最大次数M,变量数N，
x0=[-3;-1;-3;-1];
n=4; %变量数
I=eye(n);
H1=I; %初始近似矩阵
x1=x0; %代表k次迭代点
M=5000;
e=0.0001;
df1=dfm(x1);
tic
for i=1:M
df1=dfm(x1);