#include <TDSPSolver.h>
Inheritance diagram for TDSPSolver:

Definition at line 28 of file TDSPSolver.h.
Public Member Functions | |
| TDSPSolver () | |
| virtual | ~TDSPSolver () |
| virtual Int_t | GetNumInputs ()=0 |
| virtual Int_t | GetNumOutputs ()=0 |
| virtual Double_t | Redundancy () |
| virtual Bool_t | Solve ()=0 |
| Solve - Return kTRUE if there are solutions. | |
| void | SetY (TDSPVector *y) |
| void | SetY (TDSPVector &y) |
| void | SetX (TDSPVector *x) |
| void | SetX (TDSPVector &x) |
| void | SetXAlphabet (TDSPVector *a) |
| void | SetXAlphabet (TComplex *a, Int_t l) |
| Set the possible complex values for each X_i. | |
| void | SetXMinDist (Double_t) |
| Set the minimal distance for breaking the ML-Algorithm. | |
| TDSPVector * | Y () const |
| TDSPVector * | GetY () const |
| TDSPVector * | X () const |
| TDSPVector * | GetX () const |
| virtual void | Print ()=0 |
Protected Attributes | |
| Bool_t | fHaveSolution |
| Is there a solution ? | |
| TDSPVector * | fY |
| TDSPVector * | fX |
| Vector y in the equation y=A(x)+b. | |
| Int_t | fNumXAlphabet |
| Solution Vector x in the equation y=A(x)+b. | |
| TComplex * | fXAlphabet |
| Double_t | fMinDist |
| Minimal Distances for break the ML-Searching. | |
|
|
|
|
|
|
|
|
Implemented in TDSPLinearSolver. Referenced by Redundancy(). |
|
|
Implemented in TDSPLinearSolver. Referenced by TDSPBlockSolve::GetBlockLen(), and Redundancy(). |
|
|
Definition at line 61 of file TDSPSolver.h. References fX.
00061 { return fX; };
|
|
|
Definition at line 59 of file TDSPSolver.h. References fY.
00059 { return fY; };
|
|
|
Implemented in TDSPLinearSolver. |
|
|
Definition at line 46 of file TDSPSolver.h. References GetNumInputs(), and GetNumOutputs().
00046 { return Double_t(GetNumOutputs())/Double_t(GetNumInputs());};
|
|
|
Definition at line 53 of file TDSPSolver.h. References SetX().
00053 { SetX(&x);};
|
|
|
Definition at line 52 of file TDSPSolver.h. References fX. Referenced by SetX().
00052 { fX = x;};
|
|
||||||||||||
|
Set the possible complex values for each X_i.
|
|
|
Definition at line 54 of file TDSPSolver.h. References TDSPVector::GetLen(), and TDSPVector::GetVec().
00054 { SetXAlphabet(a->GetVec(),a->GetLen());};
|
|
|
Set the minimal distance for breaking the ML-Algorithm.
|
|
|
Definition at line 51 of file TDSPSolver.h. References SetY().
00051 { SetY(&y);};
|
|
|
Definition at line 50 of file TDSPSolver.h. References fY. Referenced by TDSPLinearSolver::Set(), and SetY().
00050 { fY = y;};
|
|
|
Solve - Return kTRUE if there are solutions.
Implemented in TDSPLinearSolver. |
|
|
Definition at line 60 of file TDSPSolver.h. References fX.
00060 { return fX; };
|
|
|
Definition at line 58 of file TDSPSolver.h. References fY.
00058 { return fY; };
|
|
|
Is there a solution ?
Definition at line 32 of file TDSPSolver.h. |
|
|
Minimal Distances for break the ML-Searching.
Definition at line 38 of file TDSPSolver.h. |
|
|
Solution Vector x in the equation y=A(x)+b.
Definition at line 36 of file TDSPSolver.h. |
|
|
Vector y in the equation y=A(x)+b.
Definition at line 35 of file TDSPSolver.h. |
|
|
Definition at line 37 of file TDSPSolver.h. |
|
|
Definition at line 34 of file TDSPSolver.h. |
1.3.2