max@0: // Copyright (C) 2008-2011 NICTA (www.nicta.com.au) max@0: // Copyright (C) 2008-2011 Conrad Sanderson max@0: // max@0: // This file is part of the Armadillo C++ library. max@0: // It is provided without any warranty of fitness max@0: // for any purpose. You can redistribute this file max@0: // and/or modify it under the terms of the GNU max@0: // Lesser General Public License (LGPL) as published max@0: // by the Free Software Foundation, either version 3 max@0: // of the License or (at your option) any later version. max@0: // (see http://www.opensource.org/licenses for more info) max@0: max@0: max@0: //! \addtogroup fn_lu max@0: //! @{ max@0: max@0: max@0: max@0: //! immediate lower upper decomposition, permutation info is embedded into L (similar to Matlab/Octave) max@0: template max@0: inline max@0: bool max@0: lu max@0: ( max@0: Mat& L, max@0: Mat& U, max@0: const Base& X, max@0: const typename arma_blas_type_only::result* junk = 0 max@0: ) max@0: { max@0: arma_extra_debug_sigprint(); max@0: arma_ignore(junk); max@0: max@0: arma_debug_check( (&L == &U), "lu(): L and U are the same object"); max@0: max@0: const bool status = auxlib::lu(L, U, X); max@0: max@0: if(status == false) max@0: { max@0: L.reset(); max@0: U.reset(); max@0: arma_bad("lu(): failed to converge", false); max@0: } max@0: max@0: return status; max@0: } max@0: max@0: max@0: max@0: //! immediate lower upper decomposition, also providing the permutation matrix max@0: template max@0: inline max@0: bool max@0: lu max@0: ( max@0: Mat& L, max@0: Mat& U, max@0: Mat& P, max@0: const Base& X, max@0: const typename arma_blas_type_only::result* junk = 0 max@0: ) max@0: { max@0: arma_extra_debug_sigprint(); max@0: arma_ignore(junk); max@0: max@0: arma_debug_check( ( (&L == &U) || (&L == &P) || (&U == &P) ), "lu(): two or more output objects are the same object"); max@0: max@0: const bool status = auxlib::lu(L, U, P, X); max@0: max@0: if(status == false) max@0: { max@0: L.reset(); max@0: U.reset(); max@0: P.reset(); max@0: arma_bad("lu(): failed to converge", false); max@0: } max@0: max@0: return status; max@0: } max@0: max@0: max@0: max@0: //! @}