Revision 1042 trunk/src/linad99/newfmin.cpp
newfmin.cpp (revision 1042)  

444  444 
pfmintime>get_elapsed_time_and_reset(); 
445  445 
for (i=2; i<=n; i++) 
446  446 
{ 
447 
i1=i1; 

448 
z=g.elem(i);


449 
double * pd=&(h.elem(i,1));


450 
double * pw=&(w.elem(1));


451 
for (j=1; j<=i1; j++)


452 
{


453 
z=*pd++ * *pw++;


454 
}


455 
w.elem(i)=z;


447 
i1=i1;


448 
z=g.elem(i); 

449 
double * pd=&(h.elem(i,1)); 

450 
double * pw=&(w.elem(1)); 

451 
for (j=1; j<=i1; j++) 

452 
{ 

453 
z=*pd++ * *pw++; 

454 
} 

455 
w.elem(i)=z; 

456  456 
} 
457  457 
w.elem(is+n)=w.elem(n)/h.elem(n,n); 
458  458 
{ 
...  ...  
488  488 
if (ialph) { goto label92; } 
489  489 
if( ifn >= maxfn) 
490  490 
{ 
491 
maxfn_flag=1;


492 
goto label92;


491 
maxfn_flag=1; 

492 
goto label92; 

493  493 
} 
494  494 
else 
495  495 
{ 
496 
maxfn_flag=0;


497 
iexit=1;


496 
maxfn_flag=0; 

497 
iexit=1; 

498  498 
} 
499  499 
if(quit_flag) goto label92; 
500  500 
for (i=1; i<=n; i++) 
501 
{


502 
z=alpha*w.elem(is+i);


503 
xx.elem(i)+=z;


504 
}


501 
{ 

502 
z=alpha*w.elem(is+i); 

503 
xx.elem(i)+=z; 

504 
} 

505  505 
for (i=1; i<=n; i++) 
506  506 
{ 
507  507 
xsave.elem(i)=x.elem(i); 
...  ...  
871  871 
} 
872  872  
873  873 
/** 
874 
* Description not yet available. 

875 
* \param 

874 
* dafsqrt robust square root (returns zero of argument is negative) 

875 
* \param x double 

876 
* \return square root of x (for x>0) 

876  877 
*/ 
877  878 
double dafsqrt( double x ) 
878  879 
{ 
Also available in: Unified diff