Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem (Q541172): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58654952, #quickstatements; #temporary_batch_1705508227706 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:57, 30 January 2024
scientific article
| 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 |
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
