MOOCHO (Single Doxygen Collection) Version of the Day
DenseLinAlgPack_delete_row_col.cpp
Go to the documentation of this file.
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 #include <assert.h>
00043 
00044 #include "DenseLinAlgPack_delete_row_col.hpp"
00045 #include "DenseLinAlgPack_DMatrixClass.hpp"
00046 #include "DenseLinAlgPack_DMatrixAsTriSym.hpp"
00047 
00048 void DenseLinAlgPack::delete_row_col( size_type kd, DMatrixSliceTriEle* tri_M )
00049 {
00050   // Validate input
00051   TEUCHOS_TEST_FOR_EXCEPT( !(  tri_M  ) );
00052   TEUCHOS_TEST_FOR_EXCEPT( !(  tri_M->rows()  ) );
00053   TEUCHOS_TEST_FOR_EXCEPT( !(  1 <= kd && kd <= tri_M->rows()  ) );
00054 
00055   DMatrixSlice   M = tri_M->gms();
00056   const size_type  n = M.rows();
00057 
00058   if( tri_M->uplo() == BLAS_Cpp::lower ) {
00059     // Move M31 up one row at a time
00060     if( 1 < kd && kd < n ) {
00061       Range1D rng(1,kd-1);
00062       for( size_type i = kd; i < n; ++i )
00063         M.row(i)(rng) = M.row(i+1)(rng);
00064     }
00065     // Move M33 up and to the left one column at a time
00066     if( kd < n ) {
00067       for( size_type i = kd; i < n; ++i )
00068         M.col(i)(i,n-1) = M.col(i+1)(i+1,n);
00069     }
00070   }
00071   else if(  tri_M->uplo() == BLAS_Cpp::upper ) {
00072     // Move M13 left one column at a time.
00073     if( 1 < kd && kd < n ) {
00074       Range1D rng(1,kd-1);
00075       for( size_type j = kd; j < n; ++j )
00076         M.col(j)(rng) = M.col(j+1)(rng);
00077     }
00078     // Move the updated U33 up and left one column at a time.
00079     if( kd < n ) {
00080       for( size_type j = kd; j < n; ++j )
00081         M.col(j)(kd,j) = M.col(j+1)(kd+1,j+1);
00082     }
00083   }
00084   else {
00085     TEUCHOS_TEST_FOR_EXCEPT(true); // Invalid input
00086   }
00087 }
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines