Searched refs:factorization (Results 1 – 21 of 21) sorted by relevance
/external/eigen/Eigen/ |
D | CholmodSupport | 23 * It provides the two following main factorization classes: 24 * - class CholmodSupernodalLLT: a supernodal LLT Cholesky factorization. 25 …ton: a general L(D)LT Cholesky factorization with automatic or explicit runtime selection of the u… 31 * SimplicialLLT and SimplicialLDLT factorization classes.
|
D | PaStiXSupport | 29 * It provides the two following main factorization classes: 30 * - class PastixLLT : a supernodal, parallel LLt Cholesky factorization. 31 * - class PastixLDLT: a supernodal, parallel LDLt Cholesky factorization. 32 * - class PastixLU : a supernodal, parallel LU factorization (optimized for a symmetric pattern).
|
D | SuperLUSupport | 42 * It provides the following factorization class: 43 * - class SuperLU: a supernodal sequential LU factorization. 44 …* - class SuperILU: a supernodal sequential incomplete LU factorization (to be used as a precondit…
|
D | UmfPackSupport | 23 * It provides the following factorization class: 24 * - class UmfPackLU: a multifrontal sequential LU factorization.
|
D | SparseLU | 18 * This module defines a supernodal factorization of general sparse matrices.
|
D | IterativeLinearSolvers | 28 * - IncompleteLUT - incomplete LU factorization with dual thresholding
|
/external/oss-fuzz/projects/pffft/ |
D | generate_seed_corpus.py | 18 factorization = [0, 0, 0] 22 factorization[i] += 1 23 return factorization[0] >= 5 and n == 1
|
D | pffft_fuzzer.cc | 43 std::array<int, kFactors.size()> factorization{}; in IsValidSize() 48 factorization[i]++; in IsValidSize() 51 return factorization[0] >= 5 && n == 1; in IsValidSize()
|
/external/webrtc/modules/audio_processing/utility/ |
D | pffft_wrapper.cc | 70 int factorization[] = {0, 0, 0}; in IsValidFftSize() local 75 factorization[i]++; in IsValidFftSize() 79 return factorization[0] >= a_min && n == 1; in IsValidFftSize()
|
/external/eigen/doc/ |
D | SparseLinearSystems.dox | 18 …SparseCholesky_Module SparseCholesky\endlink></tt></td><td>Direct LLt factorization</td><td>SPD</t… 22 …parseCholesky_Module SparseCholesky\endlink></tt></td><td>Direct LDLt factorization</td><td>SPD</t… 26 …\n <tt>\#include<Eigen/\link SparseLU_Module SparseLU\endlink></tt></td> <td>LU factorization </td> 31 …\n <tt>\#include<Eigen/\link SparseQR_Module SparseQR\endlink></tt></td> <td> QR factorization</td> 67 …link CholmodSupport_Module CholmodSupport \endlink</td><td>Direct LLt factorization</td><td>SPD</t… 70 …\link UmfPackSupport_Module UmfPackSupport \endlink</td><td>Direct LU factorization</td><td>Square… 73 …\link SuperLUSupport_Module SuperLUSupport \endlink</td><td>Direct LU factorization</td><td>Square… 76 <tr><td>SPQR</td><td>\link SPQRSupport_Module SPQRSupport \endlink </td> <td> QR factorization </t… 147 …ern() is to reorder the nonzero elements of the matrix, such that the factorization step creates l…
|
D | InplaceDecomposition.dox | 34 The coefficients of \c A have thus been destroyed during the factorization, and replaced by the L a… 71 If one wants to update the factorization with the modified A, one has to call the compute method as…
|
D | CustomizingEigen_CustomScalar.dox | 62 …particular how to change the way Eigen picks the best pivot during LU factorization. It selects th…
|
D | TutorialSparse.dox | 12 …n/SparseCholesky>\endcode</td><td>Direct sparse LLT and LDLT Cholesky factorization to solve spars… 14 <td>%Sparse LU factorization to solve general square sparse systems</td></tr> 15 …nk</td><td>\code #include<Eigen/SparseQR>\endcode </td><td>%Sparse QR factorization for solving sp… 104 …x \c A is symmetric by construction, we can perform a direct Cholesky factorization via the Simpli…
|
D | QuickReference.dox | 19 …>\code#include <Eigen/Cholesky>\endcode</td><td>LLT and LDLT Cholesky factorization with solver</t… 717 // via a standard Cholesky factorization 719 // via a Cholesky factorization with pivoting
|
/external/llvm-project/llvm/test/Transforms/InstCombine/ |
D | fadd-fsub-factor.ll | 6 ; Test FP factorization with patterns:
|
/external/llvm/test/Transforms/InstCombine/ |
D | fast-math.ll | 447 ; Testing-cases about factorization
|
/external/one-true-awk/testdir/ |
D | funstack.ok | 2135 M. Hatzopoulos A note on the LU factorization of a
|
D | funstack.in | 8809 …generators; normal random vectors; random number generation; simulation; triangular factorization", 13336 …n routine is also described which can be used to determine the unique factorization of large integ… 13342 …assembly; design; doubly linked list structures; doubly linked lists; factorization; integers; mac… 14343 …keywords = "approximation; computation; computers; factorization method; FORTRAN subroutines; … 15737 …vities; sparse; sparse matrices; sparse matrix; stability; triangular factorization; tridiagonal m… 16140 title = "A note on the {LU} factorization of a symmetric matrix", 16156 …keywords = "factorization; matrix inversion; separable systems; symmetric matrices; test matri… 24615 …impler and more elegant. It is also easily extended to find the prime factorization of all integer… 24621 …keywords = "computer programming; linear sieve algorithm; number theory; prime factorization; …
|
/external/tensorflow/ |
D | RELEASE.md | 4465 * Added k-Means clustering and WALS matrix factorization
|
/external/jline/src/src/test/resources/jline/example/ |
D | english.gz |
|
/external/libabigail/ |
D | ChangeLog | 22849 factorization of the function_decl_diff type. 32601 new canonicalize_and_add_type_to_ir which is a factorization of
|