/usr/include/shark/LinAlg/Tools.h is in libshark-dev 3.0.1+ds1-2ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 | /*!
*
*
* \brief Helper functions for linear algebra component.
*
*
*
* \author O.Krause M.Thuma
* \date 20102011
*
*
* \par Copyright 1995-2015 Shark Development Team
*
* <BR><HR>
* This file is part of Shark.
* <http://image.diku.dk/shark/>
*
* Shark is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Shark is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Shark. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifndef SHARK_LINALG_TOOLS_H
#define SHARK_LINALG_TOOLS_H
namespace shark {
namespace blas{
/**
* \ingroup shark_globals
*
* @{
*/
///\brief partitions the matrix in 4 blocks defined by one splitting point (i,j).
///
/// the blocks are defined using the intervals [0,...,i), [i,...,mat.size1()]
/// and [0,...,j), [j,...,mat.size2()]
template<class Matrix>
class Blocking{
public:
Blocking(Matrix& matrix,std::size_t i, std::size_t j)
: m_upperLeft(subrange(matrix,0,i,0,j))
, m_upperRight(subrange(matrix,0,i,j,matrix.size2()))
, m_lowerLeft(subrange(matrix,i,matrix.size1(),0,j))
, m_lowerRight(subrange(matrix,i,matrix.size1(),j,matrix.size2()))
{}
/// \brief Returns the lower left block of the matrix.
matrix_range<Matrix> const& upperLeft()const{
return m_upperLeft;
}
/// \brief Returns the upper right block of the matrix.
matrix_range<Matrix> const& upperRight()const{
return m_upperRight;
}
/// \brief Returns the lower left block of the matrix.
matrix_range<Matrix> const& lowerLeft()const{
return m_lowerLeft;
}
/// \brief Returns the lower right block of the matrix.
matrix_range<Matrix> const& lowerRight()const{
return m_lowerRight;
}
/// \brief Returns the lower left block of the matrix.
matrix_range<Matrix>& upperLeft(){
return m_upperLeft;
}
/// \brief Returns the upper right block of the matrix.
matrix_range<Matrix>& upperRight(){
return m_upperRight;
}
/// \brief Returns the lower left block of the matrix.
matrix_range<Matrix>& lowerLeft(){
return m_lowerLeft;
}
/// \brief Returns the lower right block of the matrix.
matrix_range<Matrix>& lowerRight(){
return m_lowerRight;
}
private:
matrix_range<Matrix> m_upperLeft;
matrix_range<Matrix> m_upperRight;
matrix_range<Matrix> m_lowerLeft;
matrix_range<Matrix> m_lowerRight;
};
//////////////////////////////////////MATRIX BLOCKS////////////////////////////////////////
/// \brief Returns the ith row of an upper triangular matrix excluding the elements right of the diagonal
template<class Matrix>
vector_range<matrix_row<Matrix const> >triangularRow(
matrix_expression<Matrix> const& mat,
std::size_t i
){
matrix_row<Matrix const> matRow = row(mat(),i);
return subrange(matRow,0,i);
}
/// \brief Returns the ith row of an upper triangular matrix excluding the elements right of the diagonal
template<class Matrix>
temporary_proxy< vector_range<matrix_row<Matrix> > >
triangularRow(
matrix_expression<Matrix>& mat,
std::size_t i
){
matrix_row<Matrix> matRow = row(mat(),i);
return subrange(matRow,0,i);
}
/// \brief Returns the elements in the ith row of a lower triangular matrix left of the diagonal
template<class Matrix>
vector_range<matrix_row<Matrix const> > unitTriangularRow(
matrix_expression<Matrix> const& mat,
std::size_t i
){
matrix_row<Matrix const> matRow = row(mat(),i);
return subrange(matRow,0,i+1);
}
/// \brief Returns the elements in the ith row of a lower triangular matrix left of the diagonal
template<class Matrix>
temporary_proxy< vector_range<matrix_row<Matrix> > >
unitTriangularRow(
matrix_expression<Matrix>& mat,
std::size_t i
){
matrix_row<Matrix> matRow = row(mat(),i);
return subrange(matRow,0,i+1);
}
/// \brief Returns the elements in the i-th column of the matrix below the diagonal
template<class Matrix>
vector_range<matrix_column<Matrix const> > unitTriangularColumn(
matrix_expression<Matrix> const& mat,
std::size_t i
){
matrix_column<Matrix const> col = column(mat(),i);
return subrange(col,i+1,mat().size2());
}
/// \brief Returns the elements in the i-th column of the matrix below the diagonal
template<class Matrix>
temporary_proxy< vector_range<matrix_column<Matrix> > >
unitTriangularColumn(
matrix_expression<Matrix>& mat,
std::size_t i
){
matrix_column<Matrix> col = column(mat(),i);
return subrange(col,i+1,mat().size2());
}
/// \brief Returns the elements in the i-th column of the matrix excluding the zero elements
template<class Matrix>
vector_range<matrix_column<Matrix const> > triangularColumn(
matrix_expression<Matrix> const& mat,
std::size_t i
){
matrix_column<Matrix const> col = column(mat(),i);
return subrange(col,i,mat().size2());
}
/// \brief Returns the elements in the i-th column of the matrix excluding the zero elements
template<class Matrix>
vector_range<matrix_column<Matrix> > triangularColumn(
matrix_expression<Matrix>& mat,
std::size_t i
){
matrix_column<Matrix> col = column(mat(),i);
return subrange(col,i,mat().size2());
}
/** @}*/
}}
#endif
|