| /external/eigen/Eigen/src/Eigen2Support/ |
| LU.h | 16 class LU : public FullPivLU<MatrixType>
49 explicit LU(const T& t) : Base(t), m_originalMatrix(t) {}
89 * \return the partial-pivoting LU decomposition of \c *this.
94 inline const LU<typename MatrixBase<Derived>::PlainObject>
95 MatrixBase<Derived>::lu() const function in class:Eigen::MatrixBase
97 return LU<PlainObject>(eval());
106 * \return the partial-pivoting LU decomposition of \c *this.
111 inline const LU<typename MatrixBase<Derived>::PlainObject>
114 return LU<PlainObject>(eval());
|
| /external/eigen/test/ |
| lu.cpp | 11 #include <Eigen/LU>
20 LU.h
61 FullPivLU<MatrixType> lu; local
66 lu.setThreshold(RealScalar(0.01));
67 lu.compute(m1);
70 u = lu.matrixLU().template triangularView<Upper>();
73 = lu.matrixLU().block(0,0,rows,(std::min)(rows,cols));
75 VERIFY_IS_APPROX(lu.permutationP() * m1 * lu.permutationQ(), l*u);
77 KernelMatrixType m1kernel = lu.kernel()
108 FullPivLU<MatrixType> lu; local
151 FullPivLU<MatrixType> lu; local
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/x509/ |
| x509_lu.c | 236 X509_LOOKUP *lu; local
244 lu=sk_X509_LOOKUP_value(sk,i);
245 X509_LOOKUP_shutdown(lu);
246 X509_LOOKUP_free(lu);
261 X509_LOOKUP *lu; local
266 lu=sk_X509_LOOKUP_value(sk,i);
267 if (m == lu->method)
269 return lu;
273 lu=X509_LOOKUP_new(m);
274 if (lu == NULL
293 X509_LOOKUP *lu; local
[all...] |
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 20 * \brief LU decomposition of a matrix with partial pivoting, and related features
22 * \param MatrixType the type of the matrix of which we are computing the LU decomposition
24 * This class represents a LU decomposition of a \b square \b invertible matrix, with partial pivoting: the matrix A
28 * Typically, partial pivoting LU decomposition is only considered numerically stable for square invertible
33 * The guaranteed safe alternative, working for all matrices, is the full pivoting LU decomposition, provided
36 * This is \b not a rank-revealing LU decomposition. Many features are intentionally absent from this class,
39 * This LU decomposition is suitable to invert invertible matrices. It is what MatrixBase::inverse() uses
43 * The data of the LU decomposition can be directly accessed through the methods matrixLU(), permutationP().
85 * \param matrix the matrix of which to compute the LU decomposition.
94 /** \returns the LU decomposition matrix: the upper-triangular part is U, th
490 MatrixBase<Derived>::lu() const function in class:Eigen::MatrixBase
[all...] |
| /external/openssl/crypto/x509/ |
| x509_lu.c | 236 X509_LOOKUP *lu; local
244 lu=sk_X509_LOOKUP_value(sk,i);
245 X509_LOOKUP_shutdown(lu);
246 X509_LOOKUP_free(lu);
261 X509_LOOKUP *lu; local
266 lu=sk_X509_LOOKUP_value(sk,i);
267 if (m == lu->method)
269 return lu;
273 lu=X509_LOOKUP_new(m);
274 if (lu == NULL
293 X509_LOOKUP *lu; local
[all...] |
| /external/chromium_org/third_party/icu/source/tools/toolutil/ |
| ucm.c | 92 const UChar32 *lu, *ru; local
101 lu=UCM_GET_CODE_POINTS(lTable, l);
113 result=lu[i]-ru[i];
[all...] |
| /external/icu4c/tools/toolutil/ |
| ucm.c | 92 const UChar32 *lu, *ru; local
101 lu=UCM_GET_CODE_POINTS(lTable, l);
113 result=lu[i]-ru[i];
[all...] |
| /external/iproute2/ip/ |
| iplink.c | 472 struct link_util *lu = NULL; local
562 lu = get_link_kind(type);
563 if (lu && argc) {
567 if (lu->parse_opt &&
568 lu->parse_opt(lu, argc, argv, &req.n))
|
| ipaddress.c | 188 struct link_util *lu; local
200 lu = get_link_kind(kind);
201 if (!lu || !lu->print_opt)
205 struct rtattr *attr[lu->maxattr+1], **data = NULL;
208 parse_rtattr_nested(attr, lu->maxattr,
212 lu->print_opt(lu, fp, data);
215 lu->print_xstats)
216 lu->print_xstats(lu, fp, linkinfo[IFLA_INFO_XSTATS])
[all...] |
| /external/srec/srec/EventLog/src/ |
| EventLogImpl.c | 67 LARGE_INTEGER lk, lu; local
79 lu.LowPart = u.dwLowDateTime;
80 lu.HighPart = u.dwHighDateTime;
81 *userTime = (long)(lu.QuadPart / 10000);
236 sprintf(timeStr, "%lu", (unsigned long) dir_stamp.tv_sec );
655 psprintf(impl->waveformFilename, L("%s-%04lu.wav"), impl->waveformFilename, (unsigned long) ++impl->waveformCounter);
|
| /external/aac/libSBRenc/src/ |
| mh_det.cpp | 154 UCHAR i, ll, lu, k; local
160 lu = pFreqBandTable[i+1];
165 for(k=ll;k<lu;k++){
218 INT lu = pFreqBandTable[i+1]; local
222 if(lu - ll > 1){
224 invBands = GetInvInt(lu-ll);
230 for(j= ll; j<lu; j++) {
687 INT i,j,ll, lu; local
724 lu = pFreqBandTable[i+1];
730 for(j= ll;j<lu;j++)
958 INT scfBand,est,l,ll,lu,maxPosF,maxPosT; local
[all...] |
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| usettest.cpp | 281 const char* pat = " [:Lu:] "; // Whitespace ok outside [:..:]
292 // Make sure generation of L doesn't pollute cached Lu set
293 // First generate L, then Lu
305 set.applyPattern("[:Lu:]", status);
308 UBool lu = (u_charType((UChar)i) == U_UPPERCASE_LETTER); local
309 if (lu != set.contains(i)) {
310 errln((UnicodeString)"FAIL: Lu contains " + (unsigned short)i + " = " +
[all...] |
| /external/icu4c/test/intltest/ |
| usettest.cpp | 281 const char* pat = " [:Lu:] "; // Whitespace ok outside [:..:]
292 // Make sure generation of L doesn't pollute cached Lu set
293 // First generate L, then Lu
305 set.applyPattern("[:Lu:]", status);
308 UBool lu = (u_charType((UChar)i) == U_UPPERCASE_LETTER); local
309 if (lu != set.contains(i)) {
310 errln((UnicodeString)"FAIL: Lu contains " + (unsigned short)i + " = " +
[all...] |
