12 #ifndef ROOT_TDecompChol 13 #define ROOT_TDecompChol TVectorD NormalEqn(const TMatrixD &A, const TVectorD &b)
Solve min {(A .
virtual void Det(Double_t &d1, Double_t &d2)
Matrix determinant det = d1*TMath::Power(2.,d2) is square of diagProd of cholesky factor...
void Print(Option_t *opt="") const
Print class members .
virtual TVectorD Solve(const TVectorD &b, Bool_t &ok)
Decomposition Base class.
virtual const TMatrixDBase & GetDecompMatrix() const
const TMatrixDSym GetMatrix()
Reconstruct the original matrix using the decomposition parts.
virtual Int_t GetNcols() const
#define ClassDef(name, id)
virtual void SetMatrix(const TMatrixDSym &a)
Set the matrix to be decomposed, decomposition status is reset.
const TMatrixD & GetU() const
virtual Int_t GetNrows() const
Cholesky Decomposition class.
virtual Bool_t Solve(TVectorD &b)
Solve equations Ax=b assuming A has been factored by Cholesky.
void inv(rsa_NUMBER *, rsa_NUMBER *, rsa_NUMBER *)
virtual TVectorD TransSolve(const TVectorD &b, Bool_t &ok)
virtual Bool_t TransSolve(TMatrixDColumn &b)
virtual Bool_t Decompose()
Matrix A is decomposed in component U so that A = U^T * U If the decomposition succeeds, bit kDecomposed is set , otherwise kSingular.
TDecompChol & operator=(const TDecompChol &source)
Assignment operator.
you should not use this method at all Int_t Int_t Double_t Double_t Double_t Int_t Double_t Double_t Double_t Double_t b
virtual Bool_t TransSolve(TVectorD &b)