A way to obtain Monte Carlo matrix inversion with minimal error (Q990422): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Behrouz Fathi-Vajargah / rank
Normal rank
 
Property / author
 
Property / author: Behrouz Fathi-Vajargah / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2007.02.082 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060669094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new iterative Monte Carlo approach for inverse matrix problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Monte Carlo computations for solving SLAE with minimum communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: New advantages to obtain accurate matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different stochastic algorithms to obtain matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3311717 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:01, 3 July 2024

scientific article
Language Label Description Also known as
English
A way to obtain Monte Carlo matrix inversion with minimal error
scientific article

    Statements

    A way to obtain Monte Carlo matrix inversion with minimal error (English)
    0 references
    1 September 2010
    0 references
    0 references
    Monte Carlo
    0 references
    Markov chain
    0 references
    matrix inversion
    0 references
    minimal error
    0 references
    0 references