| /external/eigen/test/eigen2/ |
| H A D | eigen2_qr.cpp | 13 template<typename MatrixType> void qr(const MatrixType& m) function
50 CALL_SUBTEST_1( qr(Matrix2f()) );
51 CALL_SUBTEST_2( qr(Matrix4d()) );
52 CALL_SUBTEST_3( qr(MatrixXf(12,8)) );
53 CALL_SUBTEST_4( qr(MatrixXcd(5,5)) );
54 CALL_SUBTEST_4( qr(MatrixXcd(7,3)) );
62 VERIFY(mat.qr().isFullRank());
65 //VERIFY(!mat.qr().isFullRank());
|
| /external/chromium_org/third_party/jemalloc/chromium/ |
| H A D | qr.h | 33 #define qr(a_type) \ macro
|
| /external/chromium_org/third_party/jemalloc/vendor/ |
| H A D | qr.h | 33 #define qr(a_type) \ macro
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| H A D | QR.h | 60 MatrixBase<Derived>::qr() const function in class:Eigen::MatrixBase
|
| /external/eigen/test/ |
| H A D | qr.cpp | 13 template<typename MatrixType> void qr(const MatrixType& m) function
39 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
41 Matrix<Scalar,Rows,Cols> r = qr.matrixQR();
45 VERIFY_IS_APPROX(m1, qr.householderQ() * r);
50 m2 = qr.solve(m3);
71 HouseholderQR<MatrixType> qr(m1);
73 m2 = qr.solve(m3);
80 m3 = qr.householderQ(); // get a unitary
82 qr.compute(m1);
83 VERIFY_IS_APPROX(absdet, qr
91 HouseholderQR<MatrixType> qr; local
[all...] |
| H A D | qr_colpivoting.cpp | 14 template<typename MatrixType> void qr() function
27 ColPivHouseholderQR<MatrixType> qr(m1);
28 VERIFY(rank == qr.rank());
29 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
30 VERIFY(!qr.isInjective());
31 VERIFY(!qr.isInvertible());
32 VERIFY(!qr.isSurjective());
34 MatrixQType q = qr.householderQ();
37 MatrixType r = qr
110 ColPivHouseholderQR<MatrixType> qr; local
[all...] |
| H A D | qr_fullpivoting.cpp | 14 template<typename MatrixType> void qr() function
26 FullPivHouseholderQR<MatrixType> qr(m1);
27 VERIFY(rank == qr.rank());
28 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
29 VERIFY(!qr.isInjective());
30 VERIFY(!qr.isInvertible());
31 VERIFY(!qr.isSurjective());
33 MatrixType r = qr.matrixQR();
35 MatrixQType q = qr
93 FullPivHouseholderQR<MatrixType> qr; local
[all...] |
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| H A D | lmpar.h | 163 const ColPivHouseholderQR<Matrix< Scalar, Dynamic, Dynamic> > &qr,
185 const Index n = qr.matrixQR().cols();
194 // const Index rank = qr.nonzeroPivots(); // exactly double(0.)
195 const Index rank = qr.rank(); // use a threshold
198 qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(rank));
200 x = qr.colsPermutation()*wa1;
219 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2)/dxnorm;
220 qr.matrixQR().topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1);
227 wa1[j] = qr.matrixQR().col(j).head(j+1).dot(qtb.head(j+1)) / diag[qr
162 lmpar2( const ColPivHouseholderQR<Matrix< Scalar, Dynamic, Dynamic> > &qr, const Matrix< Scalar, Dynamic, 1 > &diag, const Matrix< Scalar, Dynamic, 1 > &qtb, Scalar delta, Scalar &par, Matrix< Scalar, Dynamic, 1 > &x) argument
[all...] |
| /external/chromium_org/third_party/libjingle/source/talk/examples/peerconnection/server/ |
| H A D | peer_channel.cc | 150 QueuedResponse qr; local
151 qr.status = status;
152 qr.content_type = content_type;
153 qr.extra_headers = extra_headers;
154 qr.data = data;
155 queue_.push(qr);
|
| /external/eigen/Eigen/src/QR/ |
| H A D | FullPivHouseholderQR.h | 307 * \code qr.setThreshold(Eigen::Default); \endcode
528 FullPivHouseholderQRMatrixQReturnType(const MatrixType& qr, argument
531 : m_qr(qr),
|
| /external/libppp/src/ |
| H A D | ip.c | 88 unsigned qr : 1; member in struct:dns_header
519 if (header.opcode == OPCODE_QUERY && header.qr == 0) {
|
| /external/dnsmasq/src/ |
| H A D | nameser.h | 287 unsigned qr: 1; /* response flag */ member in struct:__anon17687
305 unsigned qr :1; /* response flag */ member in struct:__anon17687
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| H A D | org.eclipse.equinox.p2.director_2.0.3.R36x_v20101117-1018.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |