Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem (Q541172): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072419230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MONTE CARLO ALGORITHMS FOR ELLIPTIC DIFFERENTIAL EQUATIONS. DATA PARALLEL FUNCTIONAL APPROACH∗ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo Methods for Applied Scientists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A way to obtain Monte Carlo matrix inversion with minimal error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3311717 / rank
 
Normal rank

Latest revision as of 03:52, 4 July 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
    0 references
    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

    Identifiers