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

The effect of non-optimal bases on the convergence of Krylov subspace methods

โœ Scribed by Valeria Simoncini; Daniel B. Szyld

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
295 KB
Volume
100
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Comparison of Krylov subspace methods on
Comparison of Krylov subspace methods on the PageRank problem
โœ Gianna M. Del Corso; Antonio Gullรญ; Francesco Romani ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 289 KB

PageRank algorithm plays a very important role in search engine technology and consists in the computation of the eigenvector corresponding to the eigenvalue one of a matrix whose size is now in the billions. The problem incorporates a parameter that determines the difficulty of the problem. In this

The convergence of subspace trust region
The convergence of subspace trust region methods
โœ Zhen-Jun Shi; Zhiwei Xu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 664 KB

## a b s t r a c t The trust region method is an effective approach for solving optimization problems due to its robustness and strong convergence. However, the subproblem in the trust region method is difficult or time-consuming to solve in practical computation, especially in largescale problems.

Preconditioned Krylov subspace methods f
Preconditioned Krylov subspace methods for boundary element solution of the Helmholtz equation
โœ S. Amini; N. D. Maines ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 186 KB ๐Ÿ‘ 2 views

Discretization of boundary integral equations leads, in general, to fully populated complex valued non-Hermitian systems of equations. In this paper we consider the e cient solution of these boundary element systems by preconditioned iterative methods of Krylov subspace type. We devise preconditione