| /external/eigen/Eigen/ |
| D | QR | 19 /** \defgroup QR_Module QR module
23 * This module provides various QR decompositions
30 * #include <Eigen/QR>
34 #include "src/QR/HouseholderQR.h"
35 #include "src/QR/FullPivHouseholderQR.h"
36 #include "src/QR/ColPivHouseholderQR.h"
37 #include "src/QR/CompleteOrthogonalDecomposition.h"
40 #include "src/QR/HouseholderQR_LAPACKE.h"
41 #include "src/QR/ColPivHouseholderQR_LAPACKE.h"
|
| D | SparseQR | 16 * \brief Provides QR decomposition for sparse matrices
18 * This module provides a simplicial version of the left-looking Sparse QR decomposition.
|
| D | Dense | 4 #include "QR"
|
| D | SVD | 11 #include "QR"
|
| D | OrderingMethods | 22 * the sparse matrix decomposition (LLT, LU, QR).
|
| /external/zxing/qr_scanner/ |
| D | README.google | 7 Android library that exposes an activity to capture QR codes. It is basically
9 non-QR code scanning and the products, books and all other product recognition
13 Removed all code that is not directly related to scanning a QR code, such as product search, book
|
| /external/eigen/unsupported/Eigen/ |
| D | Polynomials | 29 * \brief This module provides a QR based polynomial solver.
44 and a QR based polynomial solver.
48 polynomials, computing estimates about polynomials and next the QR based polynomial
98 \section QR polynomial solver class
99 …a polynomial by computing the eigenvalues of the associated companion matrix with the QR algorithm.
112 …However, the QR algorithm is not guaranteed to converge when there are several eigenvalues with sa…
127 …-# the accuracy problem with the QR algorithm is presented: a polynomial with almost conjugate roo…
128 Those roots have almost same module therefore the QR algorithm failed to converge: the accuracy
|
| D | LevenbergMarquardt | 17 #include <Eigen/QR>
|
| /external/eigen/doc/ |
| D | LeastSquares.dox | 10 The three methods discussed on this page are the SVD decomposition, the QR decomposition and normal
12 equations is the fastest but least accurate, and the QR decomposition is in between.
35 \section LeastSquaresQR Using the QR decomposition
37 The solve() method in QR decomposition classes also computes the least squares solution. There are
38 three QR decomposition classes: HouseholderQR (no pivoting, so fast but unstable),
|
| D | TutorialLinearAlgebra.dox | 6 QR, %SVD, eigendecompositions... After reading this page, don't miss our
35 Here, ColPivHouseholderQR is a QR decomposition with column pivoting. It's a good compromise for th…
199 normal matrix or a QR decomposition. Our page on \link LeastSquares least squares solving \endlink
|
| D | B01_Experimental.dox | 24 \li QR
|
| D | InplaceDecomposition.dox | 5 Starting from %Eigen 3.3, the LU, Cholesky, and QR decompositions can operate \em inplace, that is,…
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_Qr.pbtxt | 32 summary: "Computes the QR decompositions of one or more matrices."
34 Computes the QR decomposition of each inner matrix in `tensor` such that
37 Currently, the gradient for the QR decomposition is well-defined only when
|
| /external/wpa_supplicant_8/wpa_supplicant/ |
| D | README-DPP | 14 methods like QR code based authentication (detailed below), PKEX based
102 Generate QR code for the device. Store the QR code id returned by the
112 Get URI for the QR Code of device using the bootstrap info id.
123 Enter the QR Code in the Configurator.
124 > dpp_qr_code "<URI-from-QR-Code-read-from-enrollee>"
126 On successfully adding QR Code, a bootstrapping info id is returned.
|
| /external/zxing/core/ |
| D | README.google | 12 QR Codes, Data Matrix, and the UPC family of 1D barcodes. It will provide
|
| /external/tensorflow/third_party/eigen3/ |
| D | BUILD | 22 "Eigen/QR",
|
| D | LICENSE | 325 ./Eigen/src/Eigen2Support/QR.h
387 ./Eigen/src/QR/HouseholderQR.h
388 ./Eigen/src/QR/ColPivHouseholderQR.h
389 ./Eigen/src/QR/FullPivHouseholderQR.h
951 ./Eigen/src/QR/HouseholderQR_MKL.h
952 ./Eigen/src/QR/HouseholderQR_MKL.h
953 ./Eigen/src/QR/ColPivHouseholderQR_MKL.h
954 ./Eigen/src/QR/ColPivHouseholderQR_MKL.h
|
| /external/libvpx/libvpx/third_party/libyuv/source/ |
| D | row_neon.cc | 1311 #define RGBTOUV(QB, QG, QR) \ argument
1314 "vmls.s16 q8, " #QR ", q12 \n" /* R */ \
1316 "vmul.s16 q9, " #QR ", q10 \n" /* R */ \
|
| D | row_neon64.cc | 1377 #define RGBTOUV(QB, QG, QR) \ argument
1379 "mul v4.8h, " #QR ",v20.8h \n" /* R */ \
1382 "mls v3.8h, " #QR ",v22.8h \n" /* R */ \
|
| /external/libyuv/files/source/ |
| D | row_neon.cc | 1311 #define RGBTOUV(QB, QG, QR) \ argument
1314 "vmls.s16 q8, " #QR ", q12 \n" /* R */ \
1316 "vmul.s16 q9, " #QR ", q10 \n" /* R */ \
|
| D | row_neon64.cc | 1377 #define RGBTOUV(QB, QG, QR) \ argument
1379 "mul v4.8h, " #QR ",v20.8h \n" /* R */ \
1382 "mls v3.8h, " #QR ",v22.8h \n" /* R */ \
|
| /external/libaom/libaom/third_party/libyuv/source/ |
| D | row_neon.cc | 1624 #define RGBTOUV(QB, QG, QR) \ argument
1627 "vmls.s16 q8, " #QR ", q12 \n" /* R */ \
1629 "vmul.s16 q9, " #QR ", q10 \n" /* R */ \
|
| D | row_neon64.cc | 1628 #define RGBTOUV(QB, QG, QR) \ argument
1630 "mul v4.8h, " #QR ",v20.8h \n" /* R */ \
1633 "mls v3.8h, " #QR ",v22.8h \n" /* R */ \
|
| /external/llvm/lib/Target/Hexagon/ |
| D | RDFGraph.cpp | 1503 RegisterRef QR = I->Addr->getRegRef(); in linkRefUp() local
1504 auto AliasQR = [QR,this] (RegisterRef RR) -> bool { in linkRefUp()
1505 return RAI.alias(QR, RR); in linkRefUp()
1507 bool PrecUp = RAI.covers(QR, RR); in linkRefUp()
1532 Defs.insert(QR); in linkRefUp()
|
| /external/ImageMagick/PerlMagick/t/reference/filter/ |
| D | Negate.miff | 23 … ���m����� <;�������#!��������Ŵ�˹�κ�ȳ�ʬ�ѩ��|tB\[ [[�[R�[RQR _P^T E�r!������5�…
|