|
DenseLinAlgPack: Concreate C++ Classes for Dense Blas-Compatible Linear Algebra
Version of the Day
|
00001 // @HEADER 00002 // *********************************************************************** 00003 // 00004 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization 00005 // Copyright (2003) Sandia Corporation 00006 // 00007 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive 00008 // license for use of this work by or on behalf of the U.S. Government. 00009 // 00010 // Redistribution and use in source and binary forms, with or without 00011 // modification, are permitted provided that the following conditions are 00012 // met: 00013 // 00014 // 1. Redistributions of source code must retain the above copyright 00015 // notice, this list of conditions and the following disclaimer. 00016 // 00017 // 2. Redistributions in binary form must reproduce the above copyright 00018 // notice, this list of conditions and the following disclaimer in the 00019 // documentation and/or other materials provided with the distribution. 00020 // 00021 // 3. Neither the name of the Corporation nor the names of the 00022 // contributors may be used to endorse or promote products derived from 00023 // this software without specific prior written permission. 00024 // 00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY 00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE 00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00036 // 00037 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov) 00038 // 00039 // *********************************************************************** 00040 // @HEADER 00041 00042 #ifndef DELETE_ROW_COL_H 00043 #define DELETE_ROW_COL_H 00044 00045 #include "DenseLinAlgPack_Types.hpp" 00046 00047 namespace DenseLinAlgPack { 00048 00050 /* * Delete a symmetric row and a column form a triangular matrix. 00051 * 00052 * If #M# is a lower triangular matrix then we partition it 00053 * as: 00054 \verbatim 00055 00056 1 |\ 00057 | \ 00058 | \ 00059 | M11 \ 00060 |________\ _ 00061 kd |_________|_| 00062 | | |\ 00063 | | | \ 00064 | | | \ 00065 | M31 | | M33 \ 00066 n | | | \ 00067 ---------------------- 00068 1 kd n 00069 00070 \endverbatim 00071 * In order to delete row #kd# and column #kd# the rectangular 00072 * matrix #M31# is moved up one row and the triangular matrix 00073 * #M33# is moved up one row and to the left one column. 00074 * 00075 * If #M# is an upper triangular matrix then we partition it 00076 * as: 00077 \verbatim 00078 00079 1 kd n 00080 -------------------- 1 00081 \ | | | 00082 \ M11 | | M13 | 00083 \ | | | 00084 \ | | | 00085 \|_|_______| 00086 |_|_______| kd 00087 \ | 00088 \ M33 | 00089 \ | 00090 \ | n 00091 00092 \endverbatim 00093 * 00094 * In order to delete row #kd# and column #kd# the matrix 00095 * #M13# is moved one column to the left and the upper 00096 * triangular matrix #M33# is moved one row up and 00097 * on column to the left. 00098 * 00099 * Preconditions:<ul> 00100 * <li> #M != NULL# 00101 * <li> #M->rows() >= 1# 00102 * <li> #1 <= kd <= M->rows()# 00103 * </ul> 00104 */ 00105 void delete_row_col( size_type kd, DMatrixSliceTriEle* M ); 00106 00107 } // end namespace DenseLinAlgPack 00108 00109 #endif // DELETE_ROW_COL_H
1.7.6.1