Home
last modified time | relevance | path

Searched refs:squares (Results 1 – 18 of 18) sorted by relevance

/external/eigen/doc/
DLeastSquares.dox3 /** \eigenManualPage LeastSquares Solving linear least squares systems
5 This page describes how to solve linear least squares systems using %Eigen. An overdetermined system
20 solve linear squares systems. It is not enough to compute only the singular values (the default for
22 computing least squares solutions:
37 The solve() method in QR decomposition classes also computes the least squares solution. There are
53 Finding the least squares solution of \a Ax = \a b is equivalent to solving the normal equation
DTutorialLinearAlgebra.dox184 \section TutorialLinAlgLeastsquares Least squares solving
186 The most accurate method to do least squares solving is with a SVD decomposition. Eigen provides one
187 as the JacobiSVD class, and its solve() is doing least-squares solving.
199 normal matrix or a QR decomposition. Our page on \link LeastSquares least squares solving \endlink
DTopicLinearAlgebraDecompositions.dox122 <td>Singular values/vectors, least squares</td>
123 <td>Yes (and does least squares)</td>
DSparseLinearSystems.dox78 …m">SuiteSparse</a> package, \b GPL </td><td>recommended for linear least-squares problems, has a r…
DTutorialSparse.dox15 …ndcode </td><td>%Sparse QR factorization for solving sparse linear least-squares problems</td></tr>
DQuickReference.dox21 …>\code#include <Eigen/SVD>\endcode</td><td>SVD decompositions with least-squares solver (JacobiSVD…
/external/skia/gm/
Dthinrects.cpp100 constexpr SkRect squares[] = { in DrawSquares() local
110 for (size_t j = 0; j < SK_ARRAY_COUNT(squares); ++j) { in DrawSquares()
111 canvas->drawRect(squares[j], p); in DrawSquares()
/external/ImageMagick/MagickCore/
Dsegment.c280 *squares; in Classify() local
507 squares=(double *) AcquireQuantumMemory(513UL,sizeof(*squares)); in Classify()
508 if (squares == (double *) NULL) in Classify()
511 squares+=255; in Classify()
513 squares[i]=(double) i*(double) i; in Classify()
607 distance_squared=squares[(ssize_t) ScaleQuantumToChar( in Classify()
609 ScaleQuantumToChar(ClampToQuantum(p->red))]+squares[(ssize_t) in Classify()
611 ScaleQuantumToChar(ClampToQuantum(p->green))]+squares[(ssize_t) in Classify()
618 distance_squared=squares[(ssize_t) ScaleQuantumToChar( in Classify()
620 ScaleQuantumToChar(ClampToQuantum(p->red))]+squares[ in Classify()
[all …]
/external/fec/
Dsumsq_mmx_assist.s7 # Evaluate sum of squares of signed 16-bit input samples
49 # Evaluate sum of squares of signed 16-bit input samples
Dsumsq_sse2_assist.s6 # Evaluate sum of squares of signed 16-bit input samples
DREADME31 4. Compute sum of squares of a buffer of 16-bit signed integers. This is
/external/opencv/cvaux/src/
Dcvlmeds.cpp197 icvCubic( double a2, double a1, double a0, double *squares ) in icvCubic() argument
203 if( !squares ) in icvCubic()
245 squares[i] = x[i][i % 2]; in icvCubic()
305 squares[t++] = x[i][0]; in icvCubic()
306 squares[t++] = x[i][1]; in icvCubic()
1700 double squares[6]; in icvPoint7() local
1729 icvCubic( a2, a1, a0, squares ); in icvPoint7()
1734 if( REAL_ZERO( squares[i * 2 + 1] )) in icvPoint7()
1740 F[*amount + j] = (float) (squares[i] * solutions[j] + in icvPoint7()
1741 (1 - squares[i]) * solutions[j + 9]); in icvPoint7()
D_cvvm.h130 double a0, double* squares );
/external/libvpx/libvpx/vp9/encoder/x86/
Dvp9_error_sse2.asm36 ; individual errors are max. 15bit+sign, so squares are 30bit, and
92 ; individual errors are max. 15bit+sign, so squares are 30bit, and
/external/mesa3d/docs/OLD/
DMESA_sprite_point.spec73 squares. One could define rotated texture images if desired. A 3D
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/
DREADME.md868 containing the squares of the original tensor values.
/external/jline/src/src/test/resources/jline/example/
Denglish.gz
/external/icu/icu4c/source/data/unidata/
Dppucd.txt14375 # Circled numbers on black squares from ARIB STD B24
34404 # Black squares
34407 # White squares
34414 # White squares containing another black square