代码搜索:Problems

找到约 3,996 项符合「Problems」的源代码

代码结果 3,996
www.eeworm.com/read/286526/8761915

m rastrigin.m

% Rastrigin.m % Rastrigin function % % used to test optimization/global minimization problems % % f(x) = sum([x.^2-10*cos(2*pi*x) + 10], 2); % % x = N element row vector containing [x0, x1, .
www.eeworm.com/read/381005/9116533

m rastrigin.m

% Rastrigin.m % Rastrigin function % % used to test optimization/global minimization problems % % f(x) = sum([x.^2-10*cos(2*pi*x) + 10], 2); % % x = N element row vector containing [x0, x1, .
www.eeworm.com/read/183326/9168198

to-do

-- $Id: TO-DO,v 1.45 2005/08/20 20:53:04 tom Exp $ SHORT-TERM TO-DO ITEMS: Known Problems: + libtool does not work with GNAT. + The screen optimization has been tested only in an ad hoc manner. W
www.eeworm.com/read/363287/9962946

m rastrigin.m

% Rastrigin.m % Rastrigin function % % used to test optimization/global minimization problems % % f(x) = sum([x.^2-10*cos(2*pi*x) + 10], 2); % % x = N element row vector containing [x0, x1, .
www.eeworm.com/read/363287/9962976

m rastrigin.m

% Rastrigin.m % Rastrigin function % % used to test optimization/global minimization problems % % f(x) = sum([x.^2-10*cos(2*pi*x) + 10], 2); % % x = N element row vector containing [x0, x1, .
www.eeworm.com/read/355157/10290162

m rastrigin.m

% Rastrigin.m % Rastrigin function % % used to test optimization/global minimization problems % % f(x) = sum([x.^2-10*cos(2*pi*x) + 10], 2); % % x = N element row vector containing [x0, x1, .
www.eeworm.com/read/280561/10313717

c main.c

/*bisect.c:Givens-Householder mothed for eigen-problems of symmetric*/ #include #include #include #include #include #define EPSILON 1.0e-10
www.eeworm.com/read/353723/10425740

m rastrigin.m

% Rastrigin.m % Rastrigin function % % used to test optimization/global minimization problems % % f(x) = sum([x.^2-10*cos(2*pi*x) + 10], 2); % % x = N element row vector containing [x0, x1, .
www.eeworm.com/read/161189/10439641

m lsqr_b.m

function [X,rho,eta,F] = lsqr_b(A,b,k,reorth,s) %LSQR_B Solution of least squares problems by Lanczos bidiagonalization. % % [X,rho,eta,F] = lsqr_b(A,b,k,reorth,s) % % Performs k steps of the LSQ
www.eeworm.com/read/424281/10467530

c test_main.c

for (I = problems ; I->f != 0; I++) { size_t i; double res, err; gsl_rng * r; if (I->dim > 3) { continue ; } r = gsl_rng_alloc (gsl_rng_default); for (i = 0; i < TRIA