Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem (Q541172)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem |
scientific article; zbMATH DE number 5904354
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem |
scientific article; zbMATH DE number 5904354 |
Statements
Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem (English)
0 references
6 June 2011
0 references
Summary: A new Monte Carlo approach for evaluating the generalized eigenpair of real symmetric matrices is proposed. An algorithm for the three smallest eigenpairs based on the partitioning of the inverse Monte Carlo iterative method is considered.
0 references
inverse Monte Carlo iterative algorithm
0 references
real symmetric matrices
0 references
smallest eigenpairs
0 references
0 references
0 references
0.8700201
0 references
0.85892844
0 references
0.8443567
0 references
