Home
last modified time | relevance | path

Searched refs:sdiag (Results 1 – 4 of 4) sorted by relevance

/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
DLMqrsolv.h29 Matrix<Scalar,Dynamic,1> &sdiag) in lmqrsolv() argument
57 sdiag.tail(n-j).setZero(); in lmqrsolv()
58 sdiag[j] = diag[l]; in lmqrsolv()
67 givens.makeGivens(-s(k,k), sdiag[k]); in lmqrsolv()
71 s(k,k) = givens.c() * s(k,k) + givens.s() * sdiag[k]; in lmqrsolv()
78 temp = givens.c() * s(i,k) + givens.s() * sdiag[i]; in lmqrsolv()
79 sdiag[i] = -givens.s() * s(i,k) + givens.c() * sdiag[i]; in lmqrsolv()
88 for(nsing=0; nsing<n && sdiag[nsing]!=0; nsing++) {} in lmqrsolv()
94 sdiag = s.diagonal(); in lmqrsolv()
108 Matrix<Scalar,Dynamic,1> &sdiag) in lmqrsolv() argument
[all …]
DLMpar.h117 VectorType sdiag(n); in lmpar2()
118 lmqrsolv(s, qr.colsPermutation(), wa1, qtb, x, sdiag); in lmpar2()
135 wa1[j] /= sdiag[j]; in lmpar2()
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/
Dqrsolv.h14 Matrix< Scalar, Dynamic, 1 > &sdiag) in qrsolv()
45 sdiag.tail(n-j).setZero(); in qrsolv()
46 sdiag[j] = diag[l]; in qrsolv()
55 givens.makeGivens(-s(k,k), sdiag[k]); in qrsolv()
59 s(k,k) = givens.c() * s(k,k) + givens.s() * sdiag[k]; in qrsolv()
66 temp = givens.c() * s(i,k) + givens.s() * sdiag[i]; in qrsolv()
67 sdiag[i] = -givens.s() * s(i,k) + givens.c() * sdiag[i]; in qrsolv()
76 for(nsing=0; nsing<n && sdiag[nsing]!=0; nsing++) {} in qrsolv()
82 sdiag = s.diagonal(); in qrsolv()
Dlmpar.h116 Matrix< Scalar, Dynamic, 1 > sdiag(n); in lmpar()
117 qrsolv<Scalar>(r, ipvt, wa1, qtb, x, sdiag); in lmpar()
136 wa1[j] /= sdiag[j]; in lmpar()
255 Matrix< Scalar, Dynamic, 1 > sdiag(n); in lmpar2()
256 qrsolv<Scalar>(s, qr.colsPermutation().indices(), wa1, qtb, x, sdiag); in lmpar2()
274 wa1[j] /= sdiag[j]; in lmpar2()