The Eigenvalue (
) study and study step are used to compute the eigenvalues and eigenmodes of a linear or linearized model in a generic eigenvalue formulation where the eigenvalues are not necessarily frequencies. The Eigenvalue study gives you full control of the eigenvalue formulation, in contrast to the eigenfrequency study that is adapted for specific physics interfaces. The Eigenvalue study is typically used for equation-based modeling.
From the Eigenvalue solver list, choose
ARPACK (the default) or
FEAST.
From the Eigenvalue search method list, select a search method:
•
|
All (filled matrix) to find all eigenvalues for a filled matrix. This option is only applicable for small eigenvalue problems. You can then specify a Maximum matrix size (default: 2000).
|
Use the Eigenvalue search method around shift list to control how the eigenvalue solver searches for eigenvalues around the specified shift value:
•
|
Select Closest in absolute value (the default value) to search for eigenvalues that are closest to the shift value when measuring the distance as an absolute value.
|
•
|
Select Larger real part to search for eigenvalues with a larger real part than the shift value.
|
•
|
Select Smaller real part to search for eigenvalues with a smaller real part than the shift value.
|
•
|
Select Larger imaginary part to search for eigenvalues with a larger imaginary part than the shift value.
|
•
|
Select Smaller imaginary part to search for eigenvalues with a smaller imaginary part than the shift value.
|
Use the Approximate number of eigenvalues field to specify the approximate number of eigenvalues you want the solver to return (default: 20). The value of the
Approximate number of eigenvalues will affect the
Dimension of Krylov space used by the algorithm; see the
Advanced section of the
Eigenvalue Solver. It means that increasing the value of the
Approximate number of eigenvalues will increase the memory requirement and the computational time. If the solver indicates that the value of the
Approximate number of eigenvalues is smaller than the actual number of eigenvalues in the given region, it will perform a search for more eigenvalues, which increases the computational time; see
The Eigenvalue Region Algorithm. Within limits it is often more efficient to provide a too large value of
Approximate number of eigenvalues than a too small.
In the Maximum number of eigenvalues field, you can specify a maximum number of eigenvalues to limit the eigenvalue solver’s search for additional eigenvalues (default: 200).
The Perform consistency check check box is selected by default to increase confidence that the solver finds all eigenvalues in the search region. The work required for performing the consistency check constitutes a significant part of the total work of the eigenvalue computation.
Under Search region, you define a unit (defaults: rad/s) and the size of the search region for eigenvalues as a rectangle in the complex plane by specifying the
Smallest real part,
Largest real part,
Smallest imaginary part, and
Largest imaginary part in the respective text fields. The search region also works as an interval method if the
Smallest imaginary part and
Largest imaginary part are equal; the eigenvalue solver then only considers the real axis and vice versa.
Eigenvalue computations can be performed with a nonsymmetric solver or, if applicable, a real symmetric solver. From the Use real symmetric eigenvalue solver list, choose
Automatic (the default) or
Off. For the
Automatic option there is the option to select the
Real symmetric eigenvalue solver consistency check check box. This check increases the computational time and memory requirements but provides a rigorous check of the applicability of the real symmetric solver.
From the Eigenvalue search contour list, select a search contour:
•
|
Half contour (Hermitian problem), to define an eigenvalue search contour by half of the whole contour. See Half Search Contour Settings below.
|
You define the Whole contour by specifying the
Unit (default: deg/s),
Center of the ellipse contour,
Horizontal radius of the ellipse contour,
Vertical/horizontal axis ratio of ellipse contour (%) and
Rotation angle of the ellipse contour in the respective text fields. It is important that the horizontal radius that you specify in the
Horizontal radius of the ellipse contour field is large enough to enclose the eigenvalues of interest. In the
Vertical/horizontal axis ratio of ellipse contour (%) field, specify the ratio of the vertical radius of the ellipse over its horizontal radius, assuming that the horizontal radius is 100. In the
Rotation angle of the ellipse contour field, specify the rotation angle in degree from the vertical axis in the range of
−180 degrees to 180 degrees.
From the Number of eigenvalues list, select the method for evaluating the number of eigenvalues inside the eigenvalue search contour:
•
|
Stochastic estimation (the default) to use stochastic estimation to evaluate the number of eigenvalues. After the stochastic estimation finishes, the eigenvalue solver automatically calculates the eigenvalues inside the eigenvalue search contour, using the number of eigenvalues calculated from stochastic estimation as the Size of initial search subspace for estimation (default: 6).
|
•
|
Manual to specify the number of eigenvalues inside the eigenvalue search contour manually in the Approximate number of eigenvalues field (default: 6).
|
•
|
Stochastic estimation only to use only stochastic estimation to evaluate the number of eigenvalues.
|
In the Size of initial search subspace for estimation field (default: 6), specify the initial guess of the search subspace dimension, which can be interpreted as an initial guess for the number of eigenvalues inside the contour. This setting is only available when using a stochastic estimation.
From the Integration type for estimation list, select the type for integration:
•
|
Automatic (the default) to choose the integration type automatically depending on eigenvalue solver. It means the Gauss type for real symmetric or Hermitian eigenvalue solver and the Trapezoidal type for other types of solvers.
|
•
|
Gauss to use Gauss integration.
|
•
|
Trapezoidal to use trapezoidal integration.
|
From the Number of integration points for estimation list, select the number of points for integration:
•
|
Automatic (the default) to define the number of points for integration automatically. It is 3 for real symmetric or Hermitian eigenvalue solvers and 6 for other types of solvers.
|
•
|
Manual to specify the number of integration points for estimation manually in the Number of integration points field.
|
Eigenvalue computations can be performed with a nonsymmetric solver or, if applicable, a real symmetric solver. From the Use real symmetric or Hermitian eigenvalue solver list, choose
Automatic (the default) or
Off. For the
Automatic option there is the option to select the
Real symmetric or Hermitian eigenvalue solver consistency check check box. This check increases the computational time and memory requirements but provides a rigorous check of the applicability of the real symmetric solver.
There is also and option to select the Store linear system factorization check box. If selected, linear system factorizations are stored from the first FEAST iteration and reused in later iterations.
If the Study>Batch and Cluster check box is selected in the
Show More Options dialog box, select the
Distribute linear system solution check box to run the FEAST eigenvalue solver in parallel. See
Running FEAST in a Parallel MPI Mode for more information.
You define the Half contour (Hermitian problem) by specifying the
Unit,
Lower bound of search interval,
Upper bound of search interval, and
Vertical/horizontal axis ratio of ellipse contour (%) in the respective text fields.
From the Number of eigenvalues list, select the method for evaluating the number of eigenvalues inside the eigenvalue search contour:
•
|
Stochastic estimation (the default) to use stochastic estimation to evaluate the number of eigenvalues. After the stochastic estimation finishes, the eigenvalue solver automatically calculates the eigenvalues inside the eigenvalue search contour, using the number of eigenvalues calculated from stochastic estimation as the Size of initial search subspace for estimation (default: 6).
|
•
|
Manual to specify the number of eigenvalues inside the eigenvalue search contour manually in the Approximate number of eigenvalues field (default: 6).
|
•
|
Stochastic estimation only to use only stochastic estimation to evaluate the number of eigenvalues.
|
From the Integration type for estimation list, select the type for integration:
•
|
Automatic (the default) to choose the integration type automatically depending on eigenvalue solver. It means the Gauss type for real symmetric or Hermitian eigenvalue solver and the Trapezoidal type for other types of solvers.
|
•
|
Gauss to use Gauss integration.
|
•
|
Trapezoidal to use trapezoidal integration.
|
•
|
Zolotarev to use Zolotarev integration.
|
From the Number of integration points for estimation list, select the number of points for integration:
•
|
Automatic (the default) to define the number of points for integration automatically. It is 3 for real symmetric or Hermitian eigenvalues.
|
•
|
Manual to specify the number of integration points for estimation manually in the Number of integration points field.
|
In the Size of initial search subspace for estimation field (default: 6), specify the initial guess of the search subspace dimension, which can be interpreted as an initial guess for the number of eigenvalues inside the half contour. This setting is only available when using a stochastic estimation.
If required, there is an option to select the Real symmetric or Hermitian eigenvalue solver consistency check check box. There is also an option to select the
Store linear system factorization check box. If selected, linear system factorizations are stored from the first FEAST iteration and reused in later iterations.
If the Study>Batch and Cluster check box is selected in the
Show More Options dialog box, select the
Distribute linear system solution check box to run the FEAST eigenvalue solver in parallel. See
Running FEAST in a Parallel MPI Mode for more information.
If you are running an auxiliary sweep and want to distribute it by sending one parameter value to each compute node, select the Distribute parametric solver check box. To enable this option, click the
Show More Options button (
) and select
Batch and Cluster in the
Show More Options dialog box.