DenseLinAlgPack: Concreate C++ Classes for Dense Blas-Compatible Linear Algebra  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
DenseLinAlgPack_delete_row_col.cpp
1 // @HEADER
2 // ***********************************************************************
3 //
4 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
5 // Copyright (2003) Sandia Corporation
6 //
7 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8 // license for use of this work by or on behalf of the U.S. Government.
9 //
10 // Redistribution and use in source and binary forms, with or without
11 // modification, are permitted provided that the following conditions are
12 // met:
13 //
14 // 1. Redistributions of source code must retain the above copyright
15 // notice, this list of conditions and the following disclaimer.
16 //
17 // 2. Redistributions in binary form must reproduce the above copyright
18 // notice, this list of conditions and the following disclaimer in the
19 // documentation and/or other materials provided with the distribution.
20 //
21 // 3. Neither the name of the Corporation nor the names of the
22 // contributors may be used to endorse or promote products derived from
23 // this software without specific prior written permission.
24 //
25 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 //
37 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
38 //
39 // ***********************************************************************
40 // @HEADER
41 
42 #include <assert.h>
43 
44 #include "DenseLinAlgPack_delete_row_col.hpp"
45 #include "DenseLinAlgPack_DMatrixClass.hpp"
46 #include "DenseLinAlgPack_DMatrixAsTriSym.hpp"
47 
48 void DenseLinAlgPack::delete_row_col( size_type kd, DMatrixSliceTriEle* tri_M )
49 {
50  // Validate input
51  TEUCHOS_TEST_FOR_EXCEPT( !( tri_M ) );
52  TEUCHOS_TEST_FOR_EXCEPT( !( tri_M->rows() ) );
53  TEUCHOS_TEST_FOR_EXCEPT( !( 1 <= kd && kd <= tri_M->rows() ) );
54 
55  DMatrixSlice M = tri_M->gms();
56  const size_type n = M.rows();
57 
58  if( tri_M->uplo() == BLAS_Cpp::lower ) {
59  // Move M31 up one row at a time
60  if( 1 < kd && kd < n ) {
61  Range1D rng(1,kd-1);
62  for( size_type i = kd; i < n; ++i )
63  M.row(i)(rng) = M.row(i+1)(rng);
64  }
65  // Move M33 up and to the left one column at a time
66  if( kd < n ) {
67  for( size_type i = kd; i < n; ++i )
68  M.col(i)(i,n-1) = M.col(i+1)(i+1,n);
69  }
70  }
71  else if( tri_M->uplo() == BLAS_Cpp::upper ) {
72  // Move M13 left one column at a time.
73  if( 1 < kd && kd < n ) {
74  Range1D rng(1,kd-1);
75  for( size_type j = kd; j < n; ++j )
76  M.col(j)(rng) = M.col(j+1)(rng);
77  }
78  // Move the updated U33 up and left one column at a time.
79  if( kd < n ) {
80  for( size_type j = kd; j < n; ++j )
81  M.col(j)(kd,j) = M.col(j+1)(kd+1,j+1);
82  }
83  }
84  else {
85  TEUCHOS_TEST_FOR_EXCEPT(true); // Invalid input
86  }
87 }
size_type rows(size_type rows, size_type cols, BLAS_Cpp::Transp _trans)
size_t size_type
#define TEUCHOS_TEST_FOR_EXCEPT(throw_exception_test)