Anasazi::LOCASort Class Reference

An implementation of the Anasazi::SortManager that performs a collection of common sorting techniques. More...

#include <Anasazi_LOCA_Sort.H>

Collaboration diagram for Anasazi::LOCASort:

[legend]
List of all members.

Public Member Functions

 LOCASort (const Teuchos::RefCountPtr< LOCA::EigenvalueSort::AbstractStrategy > &strategy_)
 Constructor.
virtual ~LOCASort ()
 Destructor.
Anasazi::ReturnType sort (Anasazi::Eigensolver< double, MV, OP > *solver, int n, double *evals, std::vector< int > *perm=0) const
 Sort the vector of eigenvalues with respect to the chosen sorting type, optionally returning the permutation vector.
Anasazi::ReturnType sort (Anasazi::Eigensolver< double, MV, OP > *solver, int n, double *r_evals, double *i_evals, std::vector< int > *perm=0) const
 Sort the vectors of eigenpairs with respect to the chosen sorting type, optionally returning the permutation vector.

Protected Attributes

Teuchos::RefCountPtr< LOCA::EigenvalueSort::AbstractStrategystrategy
 EigenvalueSort strategy.

Detailed Description

An implementation of the Anasazi::SortManager that performs a collection of common sorting techniques.


Constructor & Destructor Documentation

Anasazi::LOCASort::LOCASort const Teuchos::RefCountPtr< LOCA::EigenvalueSort::AbstractStrategy > &  strategy_  ) 
 

Constructor.

Parameters:
strategy_ [in] Ref-count ptr to LOCA sorting strategy


Member Function Documentation

Anasazi::ReturnType Anasazi::LOCASort::sort Anasazi::Eigensolver< double, MV, OP > *  solver,
int  n,
double *  r_evals,
double *  i_evals,
std::vector< int > *  perm = 0
const
 

Sort the vectors of eigenpairs with respect to the chosen sorting type, optionally returning the permutation vector.

Parameters:
solver [in] Eigensolver that is calling the sorting routine
n [in] Size of the array
r_evals [in/out] Array of length n containing the real part of the eigenvalues to be sorted
i_evals [in/out] Array of length n containing the imaginary part of the eigenvalues to be sorted
perm [out] Vector of length n to store the permutation (optional)
Returns:
Returns the status of the sorting routine

Anasazi::ReturnType Anasazi::LOCASort::sort Anasazi::Eigensolver< double, MV, OP > *  solver,
int  n,
double *  evals,
std::vector< int > *  perm = 0
const
 

Sort the vector of eigenvalues with respect to the chosen sorting type, optionally returning the permutation vector.

Parameters:
solver [in] Eigensolver that is calling the sorting routine
n [in] Size of the array
evals [in/out] Array of length n containing the eigenvalues to be sorted
perm [out] Vector of length n to store the permutation (optional)
Returns:
Returns the status of the sorting routine


The documentation for this class was generated from the following files:
Generated on Thu Sep 18 12:40:41 2008 for NOX by doxygen 1.3.9.1