Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:inversion (Results 1 - 5 of 5) sorted by null

/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/dvb/
frontend.h	227 fe_spectral_inversion_t inversion; member in struct:dvb_frontend_parameters
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/dvb/
frontend.h	227 fe_spectral_inversion_t inversion; member in struct:dvb_frontend_parameters
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/dvb/
frontend.h	227 fe_spectral_inversion_t inversion; member in struct:dvb_frontend_parameters
/external/ceres-solver/docs/
solving.tex	299 Thus, the solution of what was an $n\times n$, $n=pc+qs$ linear system is reduced to the inversion of the block diagonal matrix $C$, a few matrix-matrix and matrix-vector multiplies, and the solution of block sparse $pc\times pc$ linear system~\eqref{eq:schur}. For almost all problems, the number of cameras is much smaller than the number of points, $p \ll q$, thus solving~\eqref{eq:schur} is significantly cheaper than solving~\eqref{eq:linear2}. This is the {\em Schur complement trick}~\cite{brown-58}.     [all...]
/external/dropbear/libtomcrypt/
crypt.tex	[all...]

Completed in 85 milliseconds