122     FVectorType wa1, wa2, wa3, wa4;  variable
176     wa1.resize(n); wa2.resize(n); wa3.resize(n);  in minimizeInit()
231     wa2 = fjac.colwise().blueNorm();  in minimizeOneStep()
241                 diag[j] = (wa2[j]==0.)? 1. : wa2[j];  in minimizeOneStep()
261             if (wa2[permutation.indices()[j]] != 0.)  in minimizeOneStep()
262 …gnorm = (std::max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.in…  in minimizeOneStep()
270         diag = diag.cwiseMax(wa2);  in minimizeOneStep()
279         wa2 = x + wa1;  in minimizeOneStep()
287         if ( functor(wa2, wa4) < 0)  in minimizeOneStep()
330             x = wa2;  in minimizeOneStep()
331             wa2 = diag.cwiseProduct(x);  in minimizeOneStep()
333             xnorm = wa2.stableNorm();  in minimizeOneStep()
390     wa1.resize(n); wa2.resize(n); wa3.resize(n);  in minimizeOptimumStorageInit()
464         wa2[j] = fjac.col(j).head(j).stableNorm();  in minimizeOptimumStorageOneStep()
468         wa2 = fjac.colwise().blueNorm();  in minimizeOptimumStorageOneStep()
497                 diag[j] = (wa2[j]==0.)? 1. : wa2[j];  in minimizeOptimumStorageOneStep()
511             if (wa2[permutation.indices()[j]] != 0.)  in minimizeOptimumStorageOneStep()
512 …gnorm = (std::max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.in…  in minimizeOptimumStorageOneStep()
520         diag = diag.cwiseMax(wa2);  in minimizeOptimumStorageOneStep()
529         wa2 = x + wa1;  in minimizeOptimumStorageOneStep()
537         if ( functor(wa2, wa4) < 0)  in minimizeOptimumStorageOneStep()
580             x = wa2;  in minimizeOptimumStorageOneStep()
581             wa2 = diag.cwiseProduct(x);  in minimizeOptimumStorageOneStep()
583             xnorm = wa2.stableNorm();  in minimizeOptimumStorageOneStep()