Searched defs:sdiag (Results 1 - 2 of 2) sorted by relevance
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
H A D | qrsolv.h | 14 Matrix< Scalar, Dynamic, 1 > &sdiag) 45 sdiag.tail(n-j).setZero(); 46 sdiag[j] = diag[l]; 55 givens.makeGivens(-s(k,k), sdiag[k]); 59 s(k,k) = givens.c() * s(k,k) + givens.s() * sdiag[k]; 66 temp = givens.c() * s(i,k) + givens.s() * sdiag[i]; 67 sdiag[i] = -givens.s() * s(i,k) + givens.c() * sdiag[i]; 76 for(nsing=0; nsing<n && sdiag[nsing]!=0; nsing++) {} 82 sdiag 7 qrsolv( Matrix< Scalar, Dynamic, Dynamic > &s, const VectorXi &ipvt, const Matrix< Scalar, Dynamic, 1 > &diag, const Matrix< Scalar, Dynamic, 1 > &qtb, Matrix< Scalar, Dynamic, 1 > &x, Matrix< Scalar, Dynamic, 1 > &sdiag) argument [all...] |
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
H A D | LMqrsolv.h | 29 Matrix<Scalar,Dynamic,1> &sdiag) 58 sdiag.tail(n-j).setZero(); 59 sdiag[j] = diag[l]; 68 givens.makeGivens(-s(k,k), sdiag[k]); 72 s(k,k) = givens.c() * s(k,k) + givens.s() * sdiag[k]; 79 temp = givens.c() * s(i,k) + givens.s() * sdiag[i]; 80 sdiag[i] = -givens.s() * s(i,k) + givens.c() * sdiag[i]; 89 for(nsing=0; nsing<n && sdiag[nsing]!=0; nsing++) {} 95 sdiag 23 lmqrsolv( Matrix<Scalar,Rows,Cols> &s, const PermutationMatrix<Dynamic,Dynamic,Index> &iPerm, const Matrix<Scalar,Dynamic,1> &diag, const Matrix<Scalar,Dynamic,1> &qtb, Matrix<Scalar,Dynamic,1> &x, Matrix<Scalar,Dynamic,1> &sdiag) argument 103 lmqrsolv( SparseMatrix<Scalar,_Options,Index> &s, const PermutationMatrix<Dynamic,Dynamic> &iPerm, const Matrix<Scalar,Dynamic,1> &diag, const Matrix<Scalar,Dynamic,1> &qtb, Matrix<Scalar,Dynamic,1> &x, Matrix<Scalar,Dynamic,1> &sdiag) argument [all...] |
Completed in 90 milliseconds