317 |
int |
int |
318 |
getTagNumber(int dpno); |
getTagNumber(int dpno); |
319 |
|
|
320 |
|
/** |
321 |
|
\brief |
322 |
|
solves the eigenvalue problem this*V=ev*V for the eigenvalues ev |
323 |
|
|
324 |
|
\param ev - Output - eigenvalues in increasing order at each data point |
325 |
|
|
326 |
|
*/ |
327 |
|
virtual void |
328 |
|
eigenvalues(DataAbstract* ev); |
329 |
|
|
330 |
|
/** |
331 |
|
\brief |
332 |
|
solves the eigenvalue problem this*V=ev*V for the eigenvalues ev and eigenvectors V |
333 |
|
|
334 |
|
\param ev - Output - eigenvalues in increasing order at each data point |
335 |
|
\param V - Output - corresponding eigenvectors. They are normalized such that their length is one |
336 |
|
and the first nonzero component is positive. |
337 |
|
\param tol - Input - eigenvalue with relative distance tol are treated as equal. |
338 |
|
|
339 |
|
*/ |
340 |
|
|
341 |
|
virtual void |
342 |
|
eigenvalues_and_eigenvectors(DataAbstract* ev,DataAbstract* V,const double tol=1.e-13); |
343 |
|
|
344 |
protected: |
protected: |
345 |
|
|
346 |
/** |
/** |
438 |
{ |
{ |
439 |
return *(m_pointDataView.get()); |
return *(m_pointDataView.get()); |
440 |
} |
} |
|
|
|
441 |
} // end of namespace |
} // end of namespace |
442 |
|
|
443 |
#endif |
#endif |