/usr/include/Bpp/Numeric/Matrix/LUDecomposition.h is in libbpp-core-dev 2.0.3-1.
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 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 | //
// File: LU.h
// Created by: Julien Dutheil
// Created on: Tue Apr 7 16:24 2004
//
/*
Copyright or © or Copr. CNRS, (November 17, 2004)
This software is a computer program whose purpose is to provide classes
for numerical calculus.
This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited
liability.
In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or
data to be ensured and, more generally, to use and operate it in the
same conditions as regards security.
The fact that you are presently reading this means that you have had
knowledge of the CeCILL license and that you accept its terms.
*/
#ifndef _LU_H_
#define _LU_H_
#include "Matrix.h"
#include "../NumTools.h"
//From the STL:
#include <algorithm>
#include <vector>
//for min(), max() below
namespace bpp
{
/**
* @brief LU Decomposition.
*
* [This class and its documentation is adpated from the C++ port of the JAMA library.]
*
* For an m-by-n matrix A with m >= n, the LU decomposition is an m-by-n
* unit lower triangular matrix L, an n-by-n upper triangular matrix U,
* and a permutation vector piv of length m so that A(piv,:) = L*U.
* If m < n, then L is m-by-m and U is m-by-n.
*
* The LU decompostion with pivoting always exists, even if the matrix is
* singular, so the constructor will never fail. The primary use of the
* LU decomposition is in the solution of square systems of simultaneous
* linear equations. This will fail if isNonsingular() returns false.
*/
template <class Real>
class LUDecomposition
{
private:
/* Array for internal storage of decomposition. */
RowMatrix<Real> LU;
RowMatrix<Real> L_;
RowMatrix<Real> U_;
unsigned int m, n;
int pivsign;
std::vector<unsigned int> piv;
private:
static RowMatrix<Real> permuteCopy(const Matrix<Real>& A, const std::vector<unsigned int>& piv, unsigned int j0, unsigned int j1)
{
unsigned int piv_length = piv.size();
RowMatrix<Real> X(piv_length, j1-j0+1);
for (unsigned int i = 0; i < piv_length; i++)
for (unsigned int j = j0; j <= j1; j++)
X(i,j-j0) = A(piv[i],j);
return X;
}
static std::vector<Real> permuteCopy(const std::vector<Real>& A, const std::vector<unsigned int>& piv)
{
unsigned int piv_length = piv.size();
if (piv_length != A.size())
return std::vector<Real>();
std::vector<Real> x(piv_length);
for (unsigned int i = 0; i < piv_length; i++)
x[i] = A[piv[i]];
return x;
}
public :
/**
* @brief LU Decomposition
*
* @param A Rectangular matrix
* @return LU Decomposition object to access L, U and piv.
*/
// This is the constructor in JAMA C++ port. However, it seems to have some bug...
// We use the original JAMA's 'experimental' port, which gives good results instead.
/* LUDecomposition (const Matrix<Real> &A) : LU(A), m(A.getNumberOfRows()), n(A.getNumberOfColumns()), piv(A.getNumberOfRows())
{
// Use a "left-looking", dot-product, Crout/Doolittle algorithm.
for (unsigned int i = 0; i < m; i++) {
piv[i] = i;
}
pivsign = 1;
//Real *LUrowi = 0;;
vector<Real> LUrowi;
vector<Real> LUcolj;
// Outer loop.
for (unsigned int j = 0; j < n; j++) {
// Make a copy of the j-th column to localize references.
LUcolj = LU.col(j);
//for (int i = 0; i < m; i++) {
// LUcolj[i] = LU(i,j);
//}
// Apply previous transformations.
for (unsigned int i = 0; i < m; i++) {
//LUrowi = LU[i];
LUrowi = LU.row(i);
// Most of the time is spent in the following dot product.
unsigned int kmax = NumTools::min<unsigned int>(i,j);
double s = 0.0;
for (unsigned int k = 0; k < kmax; k++) {
s += LUrowi[k] * LUcolj[k];
}
LUrowi[j] = LUcolj[i] -= s;
}
// Find pivot and exchange if necessary.
unsigned int p = j;
for (unsigned int i = j+1; i < m; i++) {
if (NumTools::abs<Real>(LUcolj[i]) > NumTools::abs<Real>(LUcolj[p])) {
p = i;
}
}
if (p != j) {
unsigned int k=0;
for (k = 0; k < n; k++) {
double t = LU(p,k);
LU(p,k) = LU(j,k);
LU(j,k) = t;
}
k = piv[p];
piv[p] = piv[j];
piv[j] = k;
pivsign = -pivsign;
}
// Compute multipliers.
if ((j < m) && (LU(j,j) != 0.0)) {
for (unsigned int i = j+1; i < m; i++) {
LU(i,j) /= LU(j,j);
}
}
}
}
*/
LUDecomposition (const Matrix<Real>& A) :
LU(A),
L_(A.getNumberOfRows(), A.getNumberOfColumns()), U_(A.getNumberOfColumns(), A.getNumberOfColumns()),
m(A.getNumberOfRows()), n(A.getNumberOfColumns()),
pivsign(1), piv(A.getNumberOfRows())
{
for (unsigned int i = 0; i < m; i++)
{
piv[i] = i;
}
// Main loop.
for (unsigned int k = 0; k < n; k++)
{
// Find pivot.
unsigned int p = k;
for (unsigned int i = k+1; i < m; i++)
{
if (NumTools::abs<Real>(LU(i,k)) > NumTools::abs<Real>(LU(p,k)))
{
p = i;
}
}
// Exchange if necessary.
if (p != k)
{
for (unsigned int j = 0; j < n; j++)
{
double t = LU(p,j); LU(p,j) = LU(k,j); LU(k,j) = t;
}
unsigned int t = piv[p]; piv[p] = piv[k]; piv[k] = t;
pivsign = -pivsign;
}
// Compute multipliers and eliminate k-th column.
if (LU(k,k) != 0.0)
{
for (unsigned int i = k+1; i < m; i++)
{
LU(i,k) /= LU(k,k);
for (unsigned int j = k+1; j < n; j++)
{
LU(i,j) -= LU(i,k)*LU(k,j);
}
}
}
}
}
/**
* @brief Is the matrix nonsingular?
*
* @return True if upper triangular factor U (and hence A) is nonsingular, 0 otherwise.
*/
bool isNonsingular () const
{
for (unsigned int j = 0; j < n; j++) {
if (LU(j,j) == 0)
return false;
}
return true;
}
/**
* @brief Return lower triangular factor
*
* @return L
*/
const RowMatrix<Real>& getL() const
{
for (unsigned int i = 0; i < m; i++)
{
for (unsigned int j = 0; j < n; j++)
{
if (i > j)
{
L_(i,j) = LU(i,j);
}
else if (i == j)
{
L_(i,j) = 1.0;
}
else
{
L_(i,j) = 0.0;
}
}
}
return L_;
}
/**
* @brief Return upper triangular factor
*
* @return U portion of LU factorization.
*/
const RowMatrix<Real>& getU () const
{
for (unsigned int i = 0; i < n; i++)
{
for (unsigned int j = 0; j < n; j++)
{
if (i <= j)
{
U_(i,j) = LU(i,j);
}
else
{
U_(i,j) = 0.0;
}
}
}
return U_;
}
/**
* @brief Return pivot permutation vector
*
* @return piv
*/
std::vector<unsigned int> getPivot () const
{
return piv;
}
/**
* @brief Compute determinant using LU factors.
*
* @return determinant of A, or 0 if A is not square.
*/
Real det() const
{
if (m != n)
{
return Real(0);
}
Real d = Real(pivsign);
for (unsigned int j = 0; j < n; j++)
{
d *= LU(j,j);
}
return d;
}
/**
* @brief Solve A*X = B
*
* @param B A Matrix with as many rows as A and any number of columns.
* @return X so that L*U*X = B(piv,:), if B is nonconformant, returns 0x0 (null) array.
*/
RowMatrix<Real> solve (const Matrix<Real>& B) const
{
/* Dimensions: A is mxn, X is nxk, B is mxk */
if (B.getNumberOfRows() != m) {
return RowMatrix<Real>(0,0);
}
if (!isNonsingular()) {
return RowMatrix<Real>(0,0);
}
// Copy right hand side with pivoting
//int nx = B.dim2();
unsigned int nx = B.getNumberOfColumns();
RowMatrix<Real> X = permuteCopy(B, piv, 0, nx-1);
// Solve L*Y = B(piv,:)
for (unsigned int k = 0; k < n; k++) {
for (unsigned int i = k+1; i < n; i++) {
for (unsigned int j = 0; j < nx; j++) {
X(i,j) -= X(k,j) * LU(i,k);
}
}
}
// Solve U*X = Y;
// !!! Do not use unsigned int with -- loop!!!
//for (int k = n-1; k >= 0; k--) {
unsigned int k = n;
do {
k--;
for (unsigned int j = 0; j < nx; j++) {
X(k,j) /= LU(k,k);
}
for (unsigned int i = 0; i < k; i++) {
for (unsigned int j = 0; j < nx; j++) {
X(i,j) -= X(k,j) * LU(i,k);
}
}
} while(k > 0);
return X;
}
/**
* @brief Solve A*x = b, where x and b are vectors of length equal to the number of rows in A.
*
* @param b a vector (Array1D> of length equal to the first dimension of A.
* @return x a vector (Array1D> so that L*U*x = b(piv), if B is nonconformant, returns 0x0 (null) array.
*/
std::vector<Real> solve (const std::vector<Real> &b) const
{
/* Dimensions: A is mxn, X is nxk, B is mxk */
if (b.dim1() != m) {
return std::vector<Real>();
}
if (!isNonsingular()) {
return std::vector<Real>();
}
std::vector<Real> x = permuteCopy(b, piv);
// Solve L*Y = B(piv)
for (unsigned int k = 0; k < n; k++) {
for (unsigned int i = k+1; i < n; i++) {
x[i] -= x[k] * LU(i,k);
}
}
// Solve U*X = Y;
//for (unsigned int k = n-1; k >= 0; k--) {
unsigned int k = n;
do {
k--;
x[k] /= LU(k,k);
for (unsigned int i = 0; i < k; i++) {
x[i] -= x[k] * LU(i,k);
}
} while(k > 0);
return x;
}
}; /* class LU */
} //end of namespace bpp.
#endif //_LU_H_
|