00001 /* 00002 * This file is part of ACADO Toolkit. 00003 * 00004 * ACADO Toolkit -- A Toolkit for Automatic Control and Dynamic Optimization. 00005 * Copyright (C) 2008-2014 by Boris Houska, Hans Joachim Ferreau, 00006 * Milan Vukov, Rien Quirynen, KU Leuven. 00007 * Developed within the Optimization in Engineering Center (OPTEC) 00008 * under supervision of Moritz Diehl. All rights reserved. 00009 * 00010 * ACADO Toolkit is free software; you can redistribute it and/or 00011 * modify it under the terms of the GNU Lesser General Public 00012 * License as published by the Free Software Foundation; either 00013 * version 3 of the License, or (at your option) any later version. 00014 * 00015 * ACADO Toolkit is distributed in the hope that it will be useful, 00016 * but WITHOUT ANY WARRANTY; without even the implied warranty of 00017 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00018 * Lesser General Public License for more details. 00019 * 00020 * You should have received a copy of the GNU Lesser General Public 00021 * License along with ACADO Toolkit; if not, write to the Free Software 00022 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 00023 * 00024 */ 00025 00026 00027 00038 #include <acado/matrix_vector/matrix_vector.hpp> 00039 00040 using namespace std; 00041 00042 USING_NAMESPACE_ACADO 00043 00044 /* >>> start tutorial code >>> */ 00045 int main( ) 00046 { 00047 // DEFINE A MATRIX: 00048 // ---------------- 00049 DMatrix A(2, 2); 00050 00051 A(0,0) = 3.0; A(0,1) = 0.5; 00052 A(1,0) = 1.0; A(1,1) = 3.0; 00053 00054 cout << "A = " << endl << A << endl << endl; 00055 00056 // COMPUTE THE CHOLESKY FACTORISATION OF A: 00057 // ---------------------------------------- 00058 00059 DMatrix L = A.llt().matrixL(); 00060 00061 cout << "L = " << endl << L << endl << endl; 00062 00063 // COMPUTE THE INVERSE OF A: 00064 // ------------------------- 00065 00066 DMatrix A_ = A.inverse(); 00067 00068 cout << "inv( A ) = " << endl << A_ << endl; 00069 00070 return 0; 00071 } 00072 /* <<< end tutorial code <<< */ 00073 00074