Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
type: Item
instance of: scholarly article
title: Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
zbMATH Open document ID: 1443.65036
author: V. N. Alexandrov
author: O. Esquivel-Flores
publication date: 2020-10-11T00:00:00Z
Mathematics Subject Classification ID: 65F08
Mathematics Subject Classification ID: 65C05
zbMATH DE Number: 7258709
zbMATH Keywords: Monte Carlo algorithms for linear algebra problems
zbMATH Keywords: Monte Carlo preconditioners
zbMATH Keywords: parallel algorithms
describes a project that uses: SparseMatrix
describes a project that uses: MatrixMarket
describes a project that uses: MSPAI
MaRDI profile type: Publication
full work available at URL: j.camwa.2015.08.035
OpenAlex ID: W2102225506
cites work: Q5689624
cites work: Q4814504
cites work: Sparse approximate inverse preconditioning for dense linear systems arising in computational electromagnetics
cites work: Computational Science – ICCS 2005
cites work: Q4737787
cites work: A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
cites work: An efficient parallel implementation of the MSPAI preconditioner
cites work: Factorized sparse approximate inverses for preconditioning
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
cites work: Q4091368
cites work: Variants of BICGSTAB for Matrices with Complex Spectrum
cites work: The university of Florida sparse matrix collection
DOI: 10.1016/J.CAMWA.2015.08.035
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 7258709