acos acosh adaptsimp asin asinh atan atan2 atanh betafn BFGS cbind cbrt ceil chol_solve chol_solve cholesky copy copy_recycle copysign cos cosh crossprod dbeta dbinom dchisq det dexp df dgamma diag dlnorm dlogis dnbinom dnorm dpois dt dt1 dunif dweibull eigen epsilon erf erfc exp expm1 eye fabs factorial floor fmod for_each_ij_set gammafn gaxpy gradfdif gradfdifls hesscdif hypot intsimp inv inv invpd invpd j0 j1 jacfdif jn kronecker kurtosis kurtosisc ldexp lgamma linesearch1 linesearch2 lnbetafn lndbeta1 lndmvn lndnorm lndt1 lnfactorial lngammafn log log10 log1p logb lu_decomp lu_solve lu_solve matrix_order matrix_style max maxc maxind maxindc mean meanc median medianc min minc minind minindc mode modec nls_broyden ones operator! operator!= operator% operator& operator* operator* operator+ operator- operator- operator/ operator< operator<< operator<= operator== operator> operator>= operator>> operator^ operator| order pbeta pbinom pchisq pexp pf pgamma plnorm plogis pnbinom pnorm pow ppois prod prodc pt punif pweibull qnorm1 qr_decomp qr_solve qr_solve rbind rint row_interchange sd sd sdc selif seqa sgn sin sinh skew skewc sort sortc sqrt sum sumc svd t tan tanh unique var var varc vech xpnd y0 y1 yn zoom

template<matrix_order PO1, matrix_style PS1, typename T , matrix_order PO2, matrix_order PO3, matrix_order PO4> void scythe::lu_decomp ( Matrix< T, PO1, PS1 >  A, Matrix< T, PO2, Concrete > &  L, Matrix< T, PO3, Concrete > &  U, Matrix< unsigned int, PO4, Concrete > &  perm_vec  ) LU decomposition of a square matrix. This function performs LU decomposition. That is, given a non-singular square matrix A and three matrix references, L, U, and perm_vec, lu_decomp fills the latter three matrices such that . This method does not actually calculate the LU decomposition of A, but of a row-wise permutation of A. This permutation is recorded in perm_vec. Note: Note that L, U, and perm_vec must be concrete. A is passed by value because the function modifies it during the decomposition. Users should generally avoid passing Matrix views as the first argument to this function because this results in modification to the Matrix being viewed. Parameters: A Non-singular square matrix to decompose. L Lower triangular portion of LU decomposition of A. U Upper triangular portion of LU decomposition of A. perm_vec Permutation vector recording the row-wise permutation of A actually decomposed by the algorithm. See also: cholesky (const Matrix<T, PO, PS>&) lu_solve (const Matrix<T,PO1,PS1>&, const Matrix<T,PO2,PS2>&, const Matrix<T,PO3,PS3>&, const Matrix<T,PO4,PS4>&, const Matrix<unsigned int, PO5, PS5>&) lu_solve (Matrix<T,PO1,PS1>, const Matrix<T,PO2,PS2>&) Exceptions: scythe_null_error (Level 1) scythe_dimension_error (Level 1) scythe_type_error (Level 2) References scythe::Matrix_base< ORDER, STYLE >::isNull(), scythe::Matrix_base< ORDER, STYLE >::isSquare(), and SCYTHE_CHECK_10.