Zobrazeno 1 - 10
of 113
pro vyhledávání: '"H.A. van der Vorst"'
Autor:
H.A. van der Vorst
Publikováno v:
ZAMM. 84:444-451
We give an overview of computational methods for the eigenproblem Ax = λx and related eigenproblems, in particular those for large matrices. Subspace methods, including the Lanczos and Arnoldi methods, have become increasingly popular. We will highl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d24ff1e350003aa13805b1a4059ae5e
https://doi.org/10.1002/zamm.200310126
https://doi.org/10.1002/zamm.200310126
Publikováno v:
Future Generation Computer Systems. 17:925-932
Incomplete LU (ILU) factorizations are popular preconditioning techniques for solving large linear systems that arise in scientific computations. We propose a (generalized) domain decomposition-based approach that leads to almost perfect speed-up wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64079df94bf330fa2b9325fdc3c8e6f0
https://doi.org/10.1016/s0167-739x(01)00034-6
https://doi.org/10.1016/s0167-739x(01)00034-6
Autor:
H.A. van der Vorst
Publikováno v:
Computing in Science & Engineering. 2:32-37
This survey article reviews the history and current importance of Krylov subspace iteration algorithms.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eccdcef0b7f893f8a84cf7da44755c19
https://doi.org/10.1109/5992.814655
https://doi.org/10.1109/5992.814655
Autor:
C. W. Bomhof, H.A. van der Vorst
Publikováno v:
Numerical Linear Algebra with Applications. 7:649-665
This paper presents a parallel mixed direct/iterative method for solving linear systems Ax = b arising from circuit simulation. The systems are solved by a block LU factorization with an iterative method for the Schur complement. The Schur complement
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bab0007643abe3050abb8809d51ad0f
https://doi.org/10.1002/1099-1506(200010/12)7:7/8<649::aid-nla217>3.0.co
https://doi.org/10.1002/1099-1506(200010/12)7:7/8<649::aid-nla217>3.0.co
Publikováno v:
Computing. 56:141-163
Many iterative methods for solving linear equationsAx=b aim for accurate approximations tox, and they do so by updating residuals iteratively. In finite precision arithmetic, these computed residuals may be inaccurate, that is, they may differ signif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::503f2376b78a8aff9e6d847c770a96ff
https://doi.org/10.1007/bf02309342
https://doi.org/10.1007/bf02309342
Publikováno v:
Journal of Computational Chemistry. 17:267-272
Davidson’s method is widely used for finding the lowest eigenvalues of large matrices. Recently, mathematicians have shown that Davidson’s derivation could be improved. They have corrected the derivation yielding a new iteration method. In this a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3672990fc1f001580b4e349fe2dc10e
https://doi.org/10.1002/(sici)1096-987x(199602)17:3<267::aid-jcc1>3.0.co
https://doi.org/10.1002/(sici)1096-987x(199602)17:3<267::aid-jcc1>3.0.co
Autor:
H.A. van der Vorst, E. de Sturler
Publikováno v:
Applied Numerical Mathematics. 18:441-459
In this paper we study possibilities for the reduction of communication overhead introduced by inner products in the iterative solution methods CG and GMRES( m ). The performance of these methods on massively parallel distributed memory machines is o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62e36b5831c9642b103f235b3151d4cf
https://doi.org/10.1016/0168-9274(95)00079-a
https://doi.org/10.1016/0168-9274(95)00079-a
Autor:
Cornelis Vuik, H.A. van der Vorst
Publikováno v:
Numerical Linear Algebra with Applications. 1:369-386
Recently Eirola and Nevanlinna have proposed an iterativ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::132b83978ecf3bfdf43b12996e6d7513
https://doi.org/10.1002/nla.1680010404
https://doi.org/10.1002/nla.1680010404
Publikováno v:
Numerical Algorithms. 7:75-109
It is well-known that Bi-CG can be adapted so that the operations withAT can be avoided, and hybrid methods can be constructed in which it is attempted to further improve the convergence behaviour. Examples of this are CGS, Bi-CGSTAB, and the more ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee15449f084a2b6485331e1d15781bc7
https://doi.org/10.1007/bf02141261
https://doi.org/10.1007/bf02141261
Publikováno v:
Nuclear Physics B - Proceedings Supplements. :1070-1072
Improvements of various methods to compute the sign function of the hermitian Wilson-Dirac matrix within the overlap operator are presented. An optimal partial fraction expansion (PFE) based on a theorem of Zolotarev is given. Benchmarks show that th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::227b9d5e77dd433a65a43e6bfe1c7f7a
https://doi.org/10.1016/s0920-5632(01)01931-4
https://doi.org/10.1016/s0920-5632(01)01931-4