| /external/eigen/doc/examples/ |
| TutorialLinAlgSetThreshold.cpp | 12 FullPivLU<Matrix2d> lu(A);
13 cout << "By default, the rank of A is found to be " << lu.rank() << endl;
14 lu.setThreshold(1e-5);
15 cout << "With threshold 1e-5, the rank of A is found to be " << lu.rank() << endl;
|
| Tutorial_PartialLU_solve.cpp | 2 #include <Eigen/LU>
16 Vector3f x = A.lu().solve(b);
|
| /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/eigen/doc/snippets/ |
| class_FullPivLU.cpp | 5 Eigen::FullPivLU<Matrix5x3> lu(m);
6 cout << "Here is, up to permutations, its LU decomposition matrix:"
7 << endl << lu.matrixLU() << endl;
10 l.block<5,3>(0,0).triangularView<StrictlyLower>() = lu.matrixLU();
13 Matrix5x3 u = lu.matrixLU().triangularView<Upper>();
16 cout << lu.permutationP().inverse() * l * u * lu.permutationQ().inverse() << endl;
|
| Tutorial_solve_singular.cpp | 8 x = A.lu().solve(b);
|
| PartialPivLU_solve.cpp | 5 MatrixXd X = A.lu().solve(B);
|
| /external/eigen/test/eigen2/ |
| eigen2_lu.cpp | 11 #include <Eigen/LU>
38 LU.h
52 LU<MatrixType> lu(m1);
53 typename LU<MatrixType>::KernelResultType m1kernel = lu.kernel();
54 typename LU<MatrixType>::ImageResultType m1image = lu.image();
56 VERIFY(rank == lu.rank());
57 VERIFY(cols - lu.rank() == lu.dimensionOfKernel())
[all...] |
| /external/eigen/lapack/ |
| lu.cpp | 11 #include <Eigen/LU>
13 // computes an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges
45 // with a general N-by-N matrix A using the LU factorization computed by GETRF
62 MatrixType lu(a,*n,*n,*lda);
70 lu.triangularView<UnitLower>().solveInPlace(B);
71 lu.triangularView<Upper>().solveInPlace(B);
75 lu.triangularView<Upper>().transpose().solveInPlace(B);
76 lu.triangularView<UnitLower>().transpose().solveInPlace(B);
81 lu.triangularView<Upper>().adjoint().solveInPlace(B);
82 lu.triangularView<UnitLower>().adjoint().solveInPlace(B)
[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...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_ilogbl.c | 35 m = 1lu << (LDBL_MANL_SIZE - 1);
39 m = 1lu << (LDBL_MANH_SIZE - 1);
|
| s_logbl.c | 38 m = 1lu << (LDBL_MANL_SIZE - 1);
42 m = 1lu << (LDBL_MANH_SIZE - 1);
|
| /external/eigen/bench/ |
| sparse_lu.cpp | 43 #include <Eigen/LU>
50 SparseLU<EigenSparseMatrix,Backend> lu(sm1, flags);
52 if (lu.succeeded())
62 ok = lu.solve(b,&x);
101 FullPivLU<DenseMatrix> lu(m1);
107 lu.solve(b,&x);
|
| /external/bison/data/ |
| glr.c | [all...] |
| /external/openssl/crypto/bn/asm/ |
| ia64.S | 330 (p21) xmpy.lu f48=f37,f8
373 (p18) xma.lu f35=f34,f8,f39
435 (p20) xma.lu f42=f36,f8,f50 // low
501 (p25) xmpy.lu f42=f41,f41
659 { .mfi; xma.lu f40=f32,f120,f0 };; // (*)
661 { .mfi; xma.lu f50=f32,f121,f0 };;
663 { .mfi; xma.lu f60=f32,f122,f0 };;
665 { .mfi; xma.lu f70=f32,f123,f0 };;
667 { .mfi; xma.lu f80=f32,f124,f0 };;
669 { .mfi; xma.lu f90=f32,f125,f0 };
[all...] |
| ia64-mont.pl | 145 xmpy.lu alo[4]=alo[4],bi
152 xma.lu alo[3]=alo[3],bi,ahi[2]
158 xmpy.lu m0=alo[4],n0 // (ap[0]*bp[0])*n0
171 (p18) xma.lu alo[2]=alo[2],bi,ahi[1]
177 (p20) xma.lu nlo[2]=nlo[2],m0,nhi[1]
216 xma.lu alo[4]=alo[4],bi,ahi[3]
222 xma.lu alo[3]=alo[3],bi,ahi[2]
229 xmpy.lu m0=alo[4],n0 // (ap[0]*bp[i]+tp[0])*n0
249 (p18) xma.lu alo[2]=alo[2],bi,ahi[1]
261 (p20) xma.lu nlo[2]=nlo[2],m0,nhi[1
[all...] |
| /external/iproute2/ip/ |
| iplink_macvlan.c | 37 static int macvlan_parse_opt(struct link_util *lu, int argc, char **argv,
69 static void macvlan_print_opt(struct link_util *lu, FILE *f, struct rtattr *tb[])
|
| link_veth.c | 27 static int veth_parse_opt(struct link_util *lu, int argc, char **argv,
|
| iplink_vlan.c | 76 static int vlan_parse_opt(struct link_util *lu, int argc, char **argv,
176 static void vlan_print_opt(struct link_util *lu, FILE *f, struct rtattr *tb[])
|
| iplink_can.c | 97 static int can_parse_opt(struct link_util *lu, int argc, char **argv,
196 static void can_print_opt(struct link_util *lu, FILE *f, struct rtattr *tb[])
260 static void can_print_xstats(struct link_util *lu,
|
| ipaddress.c | 158 struct link_util *lu; local
170 lu = get_link_kind(kind);
171 if (!lu || !lu->print_opt)
175 struct rtattr *attr[lu->maxattr+1], **data = NULL;
178 parse_rtattr_nested(attr, lu->maxattr,
182 lu->print_opt(lu, fp, data);
185 lu->print_xstats)
186 lu->print_xstats(lu, fp, linkinfo[IFLA_INFO_XSTATS])
[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...] |
| by_dir.c | 100 static int new_dir(X509_LOOKUP *lu);
101 static void free_dir(X509_LOOKUP *lu);
156 static int new_dir(X509_LOOKUP *lu)
168 lu->method_data=(char *)a;
196 static void free_dir(X509_LOOKUP *lu)
200 a=(BY_DIR *)lu->method_data;
|
| /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/eigen/unsupported/test/ |
| mpreal_support.cpp | 3 #include <Eigen/LU>
42 // partial LU
43 X = A.lu().solve(B);
|
| /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());
|
