/usr/include/root/TDecompLU.h is in libroot-math-matrix-dev 5.34.30-0ubuntu8.
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 | // @(#)root/matrix:$Id$
// Authors: Fons Rademakers, Eddy Offermann Dec 2003
/*************************************************************************
* Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *
* All rights reserved. *
* *
* For the licensing terms see $ROOTSYS/LICENSE. *
* For the list of contributors see $ROOTSYS/README/CREDITS. *
*************************************************************************/
#ifndef ROOT_TDecompLU
#define ROOT_TDecompLU
///////////////////////////////////////////////////////////////////////////
// //
// LU Decomposition class //
// //
///////////////////////////////////////////////////////////////////////////
#ifndef ROOT_TDecompBase
#include "TDecompBase.h"
#endif
class TDecompLU : public TDecompBase
{
protected :
Int_t fImplicitPivot; // control to determine implicit row scale before
// deciding on the pivot (Crout method)
Int_t fNIndex; // size of row permutation index
Int_t *fIndex; //[fNIndex] row permutation index
Double_t fSign; // = +/- 1 reflecting even/odd row permutations, resp.
TMatrixD fLU; // decomposed matrix so that a = l u where
// l is stored lower left and u upper right side
static Bool_t DecomposeLUCrout(TMatrixD &lu,Int_t *index,Double_t &sign,Double_t tol,Int_t &nrZeros);
static Bool_t DecomposeLUGauss(TMatrixD &lu,Int_t *index,Double_t &sign,Double_t tol,Int_t &nrZeros);
virtual const TMatrixDBase &GetDecompMatrix() const { return fLU; }
public :
TDecompLU();
explicit TDecompLU(Int_t nrows);
TDecompLU(Int_t row_lwb,Int_t row_upb);
TDecompLU(const TMatrixD &m,Double_t tol = 0.0,Int_t implicit = 1);
TDecompLU(const TDecompLU &another);
virtual ~TDecompLU() {if (fIndex) delete [] fIndex; fIndex = 0; }
const TMatrixD GetMatrix ();
virtual Int_t GetNrows () const { return fLU.GetNrows(); }
virtual Int_t GetNcols () const { return fLU.GetNcols(); }
const TMatrixD &GetLU () { if ( !TestBit(kDecomposed) ) Decompose();
return fLU; }
virtual void SetMatrix (const TMatrixD &a);
virtual Bool_t Decompose ();
virtual Bool_t Solve ( TVectorD &b);
virtual TVectorD Solve (const TVectorD& b,Bool_t &ok) { TVectorD x = b; ok = Solve(x); return x; }
virtual Bool_t Solve ( TMatrixDColumn &b);
virtual Bool_t TransSolve ( TVectorD &b);
virtual TVectorD TransSolve (const TVectorD& b,Bool_t &ok) { TVectorD x = b; ok = TransSolve(x); return x; }
virtual Bool_t TransSolve ( TMatrixDColumn &b);
virtual void Det (Double_t &d1,Double_t &d2);
static Bool_t InvertLU (TMatrixD &a,Double_t tol,Double_t *det=0);
Bool_t Invert (TMatrixD &inv);
TMatrixD Invert (Bool_t &status);
TMatrixD Invert () { Bool_t status; return Invert(status); }
void Print(Option_t *opt ="") const; // *MENU*
TDecompLU &operator= (const TDecompLU &source);
ClassDef(TDecompLU,1) // Matrix Decompositition LU
};
#endif
|