| /external/eigen/bench/btl/libs/gmm/ |
| D | gmm_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) in LU_factor() argument
90 ASSERT( LU.rows()==LU.cols() ) ; in LU_factor()
100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ; in LU_factor()
111 theSum = LU( i, j ) ; in LU_factor()
112 theSum -= matrix_matrix_product_sliced(LU, i, 0, i-1, LU, 0, j) ; in LU_factor()
114 LU( i, j ) = theSum ; in LU_factor()
120 theSum = LU( i, j ) ; in LU_factor()
121 theSum -= matrix_matrix_product_sliced(LU, i, 0, j-1, LU, 0, j) ; in LU_factor()
123 LU( i, j ) = theSum ; in LU_factor()
133 dum = LU( index_max, k ) ; in LU_factor()
[all …]
|
| /external/eigen/bench/btl/libs/blitz/ |
| D | blitz_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) in LU_factor() argument
90 ASSERT( LU.rows()==LU.cols() ) ; in LU_factor()
100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ; in LU_factor()
111 theSum = LU( i, j ) ; in LU_factor()
112 theSum -= matrix_matrix_product_sliced(LU, i, 0, i-1, LU, 0, j) ; in LU_factor()
114 LU( i, j ) = theSum ; in LU_factor()
120 theSum = LU( i, j ) ; in LU_factor()
121 theSum -= matrix_matrix_product_sliced(LU, i, 0, j-1, LU, 0, j) ; in LU_factor()
123 LU( i, j ) = theSum ; in LU_factor()
133 dum = LU( index_max, k ) ; in LU_factor()
[all …]
|
| /external/eigen/bench/btl/libs/mtl4/ |
| D | mtl4_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) in LU_factor() argument
90 ASSERT( LU.rows()==LU.cols() ) ; in LU_factor()
100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ; in LU_factor()
111 theSum = LU( i, j ) ; in LU_factor()
112 theSum -= matrix_matrix_product_sliced(LU, i, 0, i-1, LU, 0, j) ; in LU_factor()
114 LU( i, j ) = theSum ; in LU_factor()
120 theSum = LU( i, j ) ; in LU_factor()
121 theSum -= matrix_matrix_product_sliced(LU, i, 0, j-1, LU, 0, j) ; in LU_factor()
123 LU( i, j ) = theSum ; in LU_factor()
133 dum = LU( index_max, k ) ; in LU_factor()
[all …]
|
| /external/eigen/Eigen/ |
| D | LU | 8 /** \defgroup LU_Module LU module
9 …* This module includes %LU decomposition and related notions such as matrix inversion and determin…
15 * #include <Eigen/LU>
22 #include "src/LU/FullPivLU.h"
23 #include "src/LU/PartialPivLU.h"
25 #include "src/LU/PartialPivLU_MKL.h"
27 #include "src/LU/Determinant.h"
28 #include "src/LU/Inverse.h"
31 #include "src/LU/arch/Inverse_SSE.h"
35 #include "src/Eigen2Support/LU.h"
|
| D | SuperLUSupport | 36 * - class SuperLU: a supernodal sequential LU factorization.
37 …* - class SuperILU: a supernodal sequential incomplete LU factorization (to be used as a precondit…
|
| D | Dense | 2 #include "LU"
|
| D | Eigenvalues | 11 #include "LU"
|
| D | UmfPackSupport | 17 * - class UmfPackLU: a multifrontal sequential LU factorization.
|
| D | IterativeLinearSolvers | 20 * - IncompleteILUT - incomplete LU factorization with dual thresholding
|
| D | Geometry | 9 #include "LU"
|
| D | PaStiXSupport | 26 * - class PastixLU : a supernodal, parallel LU factorization (optimized for a symmetric pattern).
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopStrengthReduce.cpp | 854 const LSRUse &LU, const Formula &F);
857 const LSRUse &LU, const Formula &F);
904 const LSRUse &LU,
996 const LSRUse &LU, in RateFormula() argument
1025 NumBaseParts - (1 + (F.Scale && isAMCompletelyFolded(TTI, LU, F))); in RateFormula()
1029 ScaleCost += getScalingFactorCost(TTI, LU, F); in RateFormula()
1484 const LSRUse &LU, const Formula &F) { in isAMCompletelyFolded() argument
1485 return isAMCompletelyFolded(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, in isAMCompletelyFolded()
1486 LU.AccessTy, F.BaseGV, F.BaseOffset, F.HasBaseReg, in isAMCompletelyFolded()
1491 const LSRUse &LU, const Formula &F) { in getScalingFactorCost() argument
[all …]
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| D | LU.h | 16 class LU : public FullPivLU<MatrixType>
49 explicit LU(const T& t) : Base(t), m_originalMatrix(t) {} in LU() function
94 inline const LU<typename MatrixBase<Derived>::PlainObject>
97 return LU<PlainObject>(eval()); in lu()
111 inline const LU<typename MatrixBase<Derived>::PlainObject>
114 return LU<PlainObject>(eval()); in eigen2_lu()
|
| /external/eigen/bench/btl/actions/ |
| D | action_lu_solve.hh | 65 typename Interface::gene_matrix LU; in calculate() local
70 Interface::matrix_from_stl(LU,A_stl); in calculate()
88 Interface::copy_matrix(A,LU,size); in calculate()
89 Interface::LU_factor(LU,pivot,size); in calculate()
93 Interface::LU_solve(LU,pivot,B,X,size); in calculate()
|
| /external/eigen/test/eigen2/ |
| D | eigen2_lu.cpp | 52 LU<MatrixType> lu(m1); in lu_non_invertible()
53 typename LU<MatrixType>::KernelResultType m1kernel = lu.kernel(); in lu_non_invertible()
54 typename LU<MatrixType>::ImageResultType m1image = lu.image(); in lu_non_invertible()
95 LU<MatrixType> lu(m1); in lu_invertible()
|
| /external/eigen/bench/btl/data/ |
| D | action_settings.txt | 12 complete_lu_decomp ; "{/*1.5 Complete LU decomposition}" ; "matrix size" ; 4:3000
13 partial_lu_decomp ; "{/*1.5 Partial LU decomposition}" ; "matrix size" ; 4:3000
|
| /external/llvm/tools/verify-uselistorder/ |
| D | verify-uselistorder.cpp | 310 auto LU = L->use_begin(), LE = L->use_end(); in matches() local
312 skipUnmappedUsers(LU, LE, LM); in matches()
315 while (LU != LE) { in matches()
320 if (LM.lookup(LU->getUser()) != RM.lookup(RU->getUser())) { in matches()
324 if (LU->getOperandNo() != RU->getOperandNo()) { in matches()
328 skipUnmappedUsers(++LU, LE, LM); in matches()
|
| /external/vulkan-validation-layers/demos/ |
| D | lunarg.ppm | 17 …ep!do cm am `k _j ^i^h\gZeZdYcXbWaU`T_T^S]R\Q[PZOYNWMWLVLUKTKTJSIRHQGPFN…
27 …gq#ep dn bm al ak _i ^i]g[fZdYdYbWaVaT_T^S]S]R\PZOYNWMWLVLUKTKTJSIRHQGPGO…
39 …gq$fq"eo!co bm al `j _i ]h\f[eYdYcXaVaU`T^S]S]R\PZOYOXMWLVLUKTKTJSIRHQGPGO…
50 …is%fq#fp"do!bn bl `k `j ^h \g\eZeYcXaWaU`U_S]S]R\Q[OYOXNXLVLUKTKTJSIRHQGPGO…
61 …is&hs%gq#ep"cn!bm ak `k _i ]g\f[eZdXbWaV`U_S]S]R\Q[PZOXNXLVLUKTKTJSIRHQGPGO…
72 …jt'hs&hr%fq#do"cm!bl ak _j ^h\f[e[dYcWbVaU_T^T^R\Q[PZOXNXMWLUKTKTJSIRHQGPGO…
106 …lw*ku(is'gr&fp%dn#cm"al _i ^h ]g \fZdYcWbWaU_U_S]R\PZPYOYMWMVLUKTJSIRHQGPGOFO…
117 …w,lv*ju(hs&fp&eo$dn#bl"`k _h ]h ]f [eYdXbWaU_U_T^R\PZPYOYNXMVLULUJSIRHQGPGOFO…
128 …y-mw+ku*it(hr&ep&eo$cm#ak `i ^h ]g \e ZeXbWaU_U_T^R\Q[PYPYNXNWLULUJSIRHQGPGOFO…
139 …z/nx-lw+jt)hr(gq&ep%cm$bl!`j _i ^g \f ZeYcXaV`V`T^S]Q[QZPYNXNWLULUKTIRHQGPGOFO…
[all …]
|
| /external/eigen/Eigen/src/LU/arch/ |
| D | CMakeLists.txt | 5 DESTINATION ${INCLUDE_INSTALL_DIR}/Eigen/src/LU/arch COMPONENT Devel
|
| /external/eigen/Eigen/src/LU/ |
| D | CMakeLists.txt | 5 DESTINATION ${INCLUDE_INSTALL_DIR}/Eigen/src/LU COMPONENT Devel
|
| /external/llvm/lib/Bitcode/Writer/ |
| D | ValueEnumerator.cpp | 152 const Use *LU = L.first; in predictValueUseListOrderImpl() local
154 if (LU == RU) in predictValueUseListOrderImpl()
157 auto LID = OM.lookup(LU->getUser()).first; in predictValueUseListOrderImpl()
187 return LU->getOperandNo() < RU->getOperandNo(); in predictValueUseListOrderImpl()
188 return LU->getOperandNo() > RU->getOperandNo(); in predictValueUseListOrderImpl()
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/de-DE/ |
| D | de-DE_klex.pkb | 207 #!AD8F,4U<LU dergleichen /!AD8"FL>-* derjenigenC
323 …eidungsfähigkeit)+.NU!4>A51T"E/0-K>Uentscheidungsgewalt)+.NU!4>A51TF,"Z<LUentscheidungsgremien…
375 festzuhalten~!E.TUWX"G<LU* festzulegen4festzuschreiben4��������������������������������������…
833 …LUsodass&^O!A<Tsoeben #^O!+D@*sofern &^O!E.8Nsofort #^O!E28U soforthilfe)^P!E28UG0LE, softwa…
834 5!^2LU,TUsolltet 5!^2LU,Usomit#^O!M0Usondern %!^2NA&Nsong)!T21songs)!T21T sonntags
1072 …L-*welcher|!Z.L-&welches |!Z.L-,Twelcome )!5.L#"K'Mweltanschauung)!Z.LU"+<N4?51 weltweiter"…
|
| /external/eigen/doc/ |
| D | SparseLinearSystems.dox | 27 <tr><td>SparseLU</td> <td>\link SparseLU_Module SparseLU \endlink </td> <td>LU factorization </td>
34 …link PaStiXSupport_Module PaStiXSupport \endlink</td><td>Direct LLt, LDLt, LU factorizations</td><…
40 <tr><td>UmfPackLU</td><td>\link UmfPackSupport_Module UmfPackSupport \endlink</td><td>Direct LU fac…
43 <tr><td>SuperLU</td><td>\link SuperLUSupport_Module SuperLUSupport \endlink</td><td>Direct LU facto…
108 …rized: LLT for self-adjoint matrices, LDLT for general hermitian matrices, LU for non hermitian ma…
147 …<TR><TH>Matrix <TH> N <TH> NNZ <TH> <TH > UMFPACK <TH > SUPERLU <TH > PASTIX LU <TH >BiCGSTAB <TH…
|
| /external/eigen/bench/spbench/ |
| D | spbench.dtd | 4 <!ELEMENT TYPE (#PCDATA)> <!-- One of LU, LLT, LDLT, ITER -->
|
| /external/icu/icu4c/source/data/region/ |
| D | chr.txt | 143 LU{"ᎸᎧᏎᏋᎩ"}
|