๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Honest iteration schemes of randomizing algorithms

โœ Scribed by Jie Wang; Jay Belanger


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
342 KB
Volume
45
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Convergence of general iteration schemes
โœ Ioannis K Argyros; Ferenc Szidarovszky ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 952 KB
Optimal schemes of algorithms
โœ V.A. Tuzov ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› Elsevier Science โš– 648 KB
Iterative Algorithms for Nonlinear Rando
โœ R.U. Verma ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 157 KB

We extend a result of Nashed and Engl (1979) on fixed points of nonlinear random operators by using iterative methods to the case of nonlinear random operators on product spaces. The obtained result in a way is a probabilistic (stochastic) version of the deterministic fixed point theorems in product

Proposal of new iterative scheme in GMRE
โœ Shuji Sato; Tooru Yonekawa; Hiroshi Murase ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 284 KB ๐Ÿ‘ 2 views

In the paper, GMRES is applied to various large matrices appearing in 3D field analyses. By changing the condition of the matrices, effective preconditioning of the matrix is sought. Also studied is a relationship between the residual norm and the precision evaluated during GMRES. The paper shows th