/usr/include/gmm/gmm_tri_solve.h is in libgmm++-dev 4.2.1~beta1~svn4635~dfsg-3.
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 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 | /* -*- c++ -*- (enables emacs c++ mode) */
/*===========================================================================
Copyright (C) 2002-2012 Yves Renard
This file is a part of GETFEM++
Getfem++ 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 along with the GCC Runtime Library
Exception either version 3.1 or (at your option) any later version.
This program 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 and GCC Runtime Library Exception for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
As a special exception, you may use this file as it is a part of a free
software library without restriction. Specifically, if other files
instantiate templates or use macros or inline functions from this file,
or you compile this file and link it with other files to produce an
executable, this file does not by itself cause the resulting executable
to be covered by the GNU Lesser General Public License. This exception
does not however invalidate any other reasons why the executable file
might be covered by the GNU Lesser General Public License.
===========================================================================*/
/**@file gmm_tri_solve.h
@author Yves Renard
@date October 13, 2002.
@brief Solve triangular linear system for dense matrices.
*/
#ifndef GMM_TRI_SOLVE_H__
#define GMM_TRI_SOLVE_H__
#include "gmm_interface.h"
namespace gmm {
template <typename TriMatrix, typename VecX>
void upper_tri_solve__(const TriMatrix& T, VecX& x, size_t k,
col_major, abstract_sparse, bool is_unit) {
typename linalg_traits<TriMatrix>::value_type x_j;
for (int j = int(k) - 1; j >= 0; --j) {
typedef typename linalg_traits<TriMatrix>::const_sub_col_type COL;
COL c = mat_const_col(T, j);
typename linalg_traits<COL>::const_iterator
it = vect_const_begin(c), ite = vect_const_end(c);
if (!is_unit) x[j] /= c[j];
for (x_j = x[j]; it != ite ; ++it)
if (int(it.index()) < j) x[it.index()] -= x_j * (*it);
}
}
template <typename TriMatrix, typename VecX>
void upper_tri_solve__(const TriMatrix& T, VecX& x, size_t k,
col_major, abstract_dense, bool is_unit) {
typename linalg_traits<TriMatrix>::value_type x_j;
for (int j = int(k) - 1; j >= 0; --j) {
typedef typename linalg_traits<TriMatrix>::const_sub_col_type COL;
COL c = mat_const_col(T, j);
typename linalg_traits<COL>::const_iterator
it = vect_const_begin(c), ite = it + j;
typename linalg_traits<VecX>::iterator itx = vect_begin(x);
if (!is_unit) x[j] /= c[j];
for (x_j = x[j]; it != ite ; ++it, ++itx) *itx -= x_j * (*it);
}
}
template <typename TriMatrix, typename VecX>
void lower_tri_solve__(const TriMatrix& T, VecX& x, size_t k,
col_major, abstract_sparse, bool is_unit) {
typename linalg_traits<TriMatrix>::value_type x_j;
// cout << "(lower col)The Tri Matrix = " << T << endl;
// cout << "k = " << endl;
for (int j = 0; j < int(k); ++j) {
typedef typename linalg_traits<TriMatrix>::const_sub_col_type COL;
COL c = mat_const_col(T, j);
typename linalg_traits<COL>::const_iterator
it = vect_const_begin(c), ite = vect_const_end(c);
if (!is_unit) x[j] /= c[j];
for (x_j = x[j]; it != ite ; ++it)
if (int(it.index()) > j && it.index() < k) x[it.index()] -= x_j*(*it);
}
}
template <typename TriMatrix, typename VecX>
void lower_tri_solve__(const TriMatrix& T, VecX& x, size_t k,
col_major, abstract_dense, bool is_unit) {
typename linalg_traits<TriMatrix>::value_type x_j;
for (int j = 0; j < int(k); ++j) {
typedef typename linalg_traits<TriMatrix>::const_sub_col_type COL;
COL c = mat_const_col(T, j);
typename linalg_traits<COL>::const_iterator
it = vect_const_begin(c) + (j+1), ite = vect_const_begin(c) + k;
typename linalg_traits<VecX>::iterator itx = vect_begin(x) + (j+1);
if (!is_unit) x[j] /= c[j];
for (x_j = x[j]; it != ite ; ++it, ++itx) *itx -= x_j * (*it);
}
}
template <typename TriMatrix, typename VecX>
void upper_tri_solve__(const TriMatrix& T, VecX& x, size_t k,
row_major, abstract_sparse, bool is_unit) {
typedef typename linalg_traits<TriMatrix>::const_sub_row_type ROW;
typename linalg_traits<TriMatrix>::value_type t;
typename linalg_traits<TriMatrix>::const_row_iterator
itr = mat_row_const_end(T);
for (int i = int(k) - 1; i >= 0; --i) {
--itr;
ROW c = linalg_traits<TriMatrix>::row(itr);
typename linalg_traits<ROW>::const_iterator
it = vect_const_begin(c), ite = vect_const_end(c);
for (t = x[i]; it != ite; ++it)
if (int(it.index()) > i && it.index() < k) t -= (*it) * x[it.index()];
if (!is_unit) x[i] = t / c[i]; else x[i] = t;
}
}
template <typename TriMatrix, typename VecX>
void upper_tri_solve__(const TriMatrix& T, VecX& x, size_t k,
row_major, abstract_dense, bool is_unit) {
typename linalg_traits<TriMatrix>::value_type t;
for (int i = int(k) - 1; i >= 0; --i) {
typedef typename linalg_traits<TriMatrix>::const_sub_row_type ROW;
ROW c = mat_const_row(T, i);
typename linalg_traits<ROW>::const_iterator
it = vect_const_begin(c) + (i + 1), ite = vect_const_begin(c) + k;
typename linalg_traits<VecX>::iterator itx = vect_begin(x) + (i+1);
for (t = x[i]; it != ite; ++it, ++itx) t -= (*it) * (*itx);
if (!is_unit) x[i] = t / c[i]; else x[i] = t;
}
}
template <typename TriMatrix, typename VecX>
void lower_tri_solve__(const TriMatrix& T, VecX& x, size_t k,
row_major, abstract_sparse, bool is_unit) {
typename linalg_traits<TriMatrix>::value_type t;
for (int i = 0; i < int(k); ++i) {
typedef typename linalg_traits<TriMatrix>::const_sub_row_type ROW;
ROW c = mat_const_row(T, i);
typename linalg_traits<ROW>::const_iterator
it = vect_const_begin(c), ite = vect_const_end(c);
for (t = x[i]; it != ite; ++it)
if (int(it.index()) < i) t -= (*it) * x[it.index()];
if (!is_unit) x[i] = t / c[i]; else x[i] = t;
}
}
template <typename TriMatrix, typename VecX>
void lower_tri_solve__(const TriMatrix& T, VecX& x, size_t k,
row_major, abstract_dense, bool is_unit) {
typename linalg_traits<TriMatrix>::value_type t;
for (int i = 0; i < int(k); ++i) {
typedef typename linalg_traits<TriMatrix>::const_sub_row_type ROW;
ROW c = mat_const_row(T, i);
typename linalg_traits<ROW>::const_iterator
it = vect_const_begin(c), ite = it + i;
typename linalg_traits<VecX>::iterator itx = vect_begin(x);
for (t = x[i]; it != ite; ++it, ++itx) t -= (*it) * (*itx);
if (!is_unit) x[i] = t / c[i]; else x[i] = t;
}
}
// Triangular Solve: x <-- T^{-1} * x
template <typename TriMatrix, typename VecX> inline
void upper_tri_solve(const TriMatrix& T, VecX &x_, bool is_unit = false)
{ upper_tri_solve(T, x_, mat_nrows(T), is_unit); }
template <typename TriMatrix, typename VecX> inline
void lower_tri_solve(const TriMatrix& T, VecX &x_, bool is_unit = false)
{ lower_tri_solve(T, x_, mat_nrows(T), is_unit); }
template <typename TriMatrix, typename VecX> inline
void upper_tri_solve(const TriMatrix& T, VecX &x_, size_t k,
bool is_unit) {
VecX& x = const_cast<VecX&>(x_);
GMM_ASSERT2(mat_nrows(T) >= k && vect_size(x) >= k
&& mat_ncols(T) >= k && !is_sparse(x_), "dimensions mismatch");
upper_tri_solve__(T, x, k,
typename principal_orientation_type<typename
linalg_traits<TriMatrix>::sub_orientation>::potype(),
typename linalg_traits<TriMatrix>::storage_type(),
is_unit);
}
template <typename TriMatrix, typename VecX> inline
void lower_tri_solve(const TriMatrix& T, VecX &x_, size_t k,
bool is_unit) {
VecX& x = const_cast<VecX&>(x_);
GMM_ASSERT2(mat_nrows(T) >= k && vect_size(x) >= k
&& mat_ncols(T) >= k && !is_sparse(x_), "dimensions mismatch");
lower_tri_solve__(T, x, k,
typename principal_orientation_type<typename
linalg_traits<TriMatrix>::sub_orientation>::potype(),
typename linalg_traits<TriMatrix>::storage_type(),
is_unit);
}
}
#endif // GMM_TRI_SOLVE_H__
|