LOCA::EigenvalueSort::SmallestImaginary Class Reference

Smallest-imaginary sorting strategy. More...

#include <LOCA_EigenvalueSort_Strategies.H>

Inheritance diagram for LOCA::EigenvalueSort::SmallestImaginary:

Collaboration diagram for LOCA::EigenvalueSort::SmallestImaginary:

List of all members.

Public Member Functions
	SmallestImaginary (const Teuchos::RCP< LOCA::GlobalData > &global_data, const Teuchos::RCP< Teuchos::ParameterList > &eigenParams)
	Constructor.
	~SmallestImaginary ()
	Destructor.
virtual NOX::Abstract::Group::ReturnType	sort (int n, double *evals, std::vector< int > *perm=NULL) const
	Sort real eigenvalues.
virtual NOX::Abstract::Group::ReturnType	sort (int n, double *r_evals, double *i_evals, std::vector< int > *perm=NULL) const
	Sort complex eigenvalues.

---

Detailed Description

Smallest-imaginary sorting strategy.

Sorts eigenvalues in increasing order according to their imaginary part. This method requires no parameters in the eigenParams argument to the constructor

---

Constructor & Destructor Documentation

LOCA::EigenvalueSort::SmallestImaginary::SmallestImaginary	(	const Teuchos::RCP< LOCA::GlobalData > &	global_data,
		const Teuchos::RCP< Teuchos::ParameterList > &	eigenParams
	)		[inline]

Constructor.

Parameters:

global_data	[in] Global data object
eigenParams	[in] Eigensolver parameters.

---

The documentation for this class was generated from the following files:

• LOCA_EigenvalueSort_Strategies.H
• LOCA_EigenvalueSort_Strategies.C