搜索资源列表
portlet-1_0-fr-spec
- portal门户开发,jetspeed的应用及理论讲解
optimization.rar
- 最优化方法的一些基本算法的实现:1,0.618法;2,牛顿法;3,改进牛顿法;4,FR法;5,DFP法,Ways to optimize some of the basic algorithm implementation: 1,0.618 method 2, Newton' s method 3, improved Newton method 4, FR Act 5, DFP method
fr.rar
- FR共轭梯度算法求极小值。y为给定函数,x为函数变量,x0为搜索起始点 返回值fm为极小值,xm为极小值点,FR conjugate gradient algorithm for the minimum. y for a given function, x as a function of variables, x0 the starting point for the search to return to the value of fm for the minimum, xm for th
ica
- 可以分离语音的独立分量分析程序 可以实现瞬时和卷积混合的分离 相当好用-ica_f.m bsepf2 is the main program and it needs correlation.m decorrelation.m permutation.m sepfilter.m. You also need to visit ftp://sig.enst.fr/pub/jfc/Algo/Joint_Diag/ and get a matlab
FR_2
- 用共轭梯度算法——FR算法求解无约束最优化问题-Conjugate gradient algorithm- FR algorithm for solving unconstrained optimization problems
Fast-K-means-clustering
- Fast mex K-means clustering algorithm with possibility of K-mean++ initialization (mex-interface modified from the original yael package https://gforge.inria.fr/projects/yael) - Accept single/double precision input - Support of BLAS/OpenMP
FFT
- // 入口参数: // l: l = 0, 傅立叶变换 l = 1, 逆傅立叶变换 // il: il = 0,不计算傅立叶变换或逆变换模和幅角;il = 1,计算模和幅角 // n: 输入的点数,为偶数,一般为32,64,128,...,1024等 // k: 满足n=2^k(k>0),实质上k是n个采样数据可以分解为偶次幂和奇次幂的次数 // pr[]: l=0时,存放N点采样数据的实部 // l=1时, 存放傅立叶变换的N个实部 // pi
FFTReal
- FFT源码,快速傅里叶变换和逆变换,Portable ISO C++开发的完整类-FFTReal Version 1.03, 2001/06/15 Class of Fourier transformation of real data (FFT and IFFT) Portable ISO C++ (c) Laurent de Soras <ldesoras@club-internet.fr>
publidownload.fr
- MIMO ofdm in matlab anal-MIMO ofdm in matlab analysys
fr
- Write a Matlab program which solves the initial value problem y = (xy − y2)/x2, y(1) = 2, by the order four Runge-Kutta method, over the interval [1, 3] using steps of h = 1/128. The exact solution to this problem is given by y(x) = x/
SIAkuntansi
- For financial application, it s about accountant, open source fr-For financial application, it s about accountant, open source free
MonteCarlo
- 使用直接模拟蒙特卡罗法的Matlab编程,里面三个算例,如湖面积、资产路径等的概率求解法~-Vincent Leclercq, The MathWorks, 2007 vincent.leclercq@mathworks.fr Ths is the set of files (with the powerpoint presentation, in french or in english) used for the Webinar "Simulation de Monte Car
servlet-2_4-fr-spec-doc
- servlet-2_4-fr-spec-doc.zip servlet的帮助文档
FR
- 无约束优化FR算法的MATLAB实现源代码(不精确一维搜索)-FR algorithm for unconstrained optimization MATLAB implementation source code (inexact one-dimensional search)
FR
- 工程优化中用FR共轭梯度法求最值,采用的是教科书上的经典算法步骤,简单易懂,可以进行参考。-The most value engineering optimization using FR conjugate gradient method, using the classic steps of the algorithm in the textbook, easy to understand, you can reference.
FR-HS
- 提供了FR和HS共轭梯度法的算法,编程是用matlab实现的-FR and HS provides a conjugate gradient method algorithm, programming is achieved using matlab
FR共轭梯度法
- 共轭梯度法也就是共轭方向法的一种特殊形式,即初始搜索方向为梯度方向。其中根据β的不同又可细分为FR、PRP等方法,主要参考了文件夹中的四本书的内容对其进行总结。最优化算法本质上都是进行最小值的寻优,FR共轭梯度法也不例外。寻优的问题包括两个重要的方面,一个是方向,一个是步长。(Conjugate gradient method is a special form of conjugate direction method, that is, the initial search directio
(FR共轭梯度法程序)
- 在共轭梯度法的实际使用中, 通常在迭代 ?? 步或 ?? + 1 步之后, 重新取负梯 度方向作为搜索方向, 我们称之为再开始共轭梯度法. 这是因为对于一般非二次 函数而言, ?? 步迭代后共轭梯度法产生的搜索方向往往不再具有共轭性. 而对于 大规模问题, 常常每 ??(?? < ?? 或 ?? ? ??) 步就进行再开始. 此外, 当搜索方向不 是下降方向时, 也插入负梯度方向作为搜索方向.(In the practical use of conjugate gradient m
algorithm
- 本次数值实验通过对部分 cuter 扩展优化问题的解决,在实验中应用多种梯度型算法,具体包括 FR 、PRP 、PRP Plus、 BB 以及CG 两种混合 方法(The realization of FR PRP PRP Plus BB and two kinds of CG commixture algorithm.)
Matlab optimization programming example
- 分别用最速下降法、FR共轭梯度法、DFP法和BFGS法求解一个典型数学优化问题。(A typical mathematical optimization problem is solved by steepest descent method, FR conjugate gradient method, DFP method and BFGS method respectively.)