Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Vorst, H.A. van der"'
We consider the quadratic eigenvalue problem a²Ax + aBx + Cx = 0. Suppose that u is an approximation to an eigenvector x (for instance obtained by a subspace method), and that we want to determine an approximation to the corresponding eigenvalue a.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::41092769d4c6730268f53a6f3e131372
https://dspace.library.uu.nl/handle/1874/2479
https://dspace.library.uu.nl/handle/1874/2479
Autor:
Bomhof, W., Vorst, H.A. van der
Publikováno v:
proceedings of the SCEE-2000 Workshop
In this paper we propose a GMRES-type method for the solution of linear systems with a p-cyclic coecient matrix. These p-cyclic matrices arise in the periodic steady state simulation of circuits, assuming that the DAE is discretized in the time domai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3a7760ac6ba30520f3f1cbc604301b37
https://dspace.library.uu.nl/handle/1874/1619
https://dspace.library.uu.nl/handle/1874/1619
Publikováno v:
Lecture notes in computer science, 89
STARTPAGE=89;TITLE=Lecture notes in computer science
STARTPAGE=89;TITLE=Lecture notes in computer science
A class of parallel incomplete factorization preconditionings for the solution of large linear systems is investigated. The approach may be regarded as a generalized domain decomposition method. Adjacent subdomains have to communicate during the sett
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::26d9bf1aabba5fba9dfb8d2adccd2f67
https://dspace.library.uu.nl/handle/1874/1478
https://dspace.library.uu.nl/handle/1874/1478
We address the hard question of efficient use on parallel platforms, of incomplete factorization preconditioning techniques for solving large and sparse linear systems by Krylov subspace methods. A novel parallelization strategy based on pseudo ove
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::30e3fccbee598e04abd84bca0b2b14aa
https://dspace.library.uu.nl/handle/1874/2691
https://dspace.library.uu.nl/handle/1874/2691
Publikováno v:
Numerical linear algebra with applications, 2001(00), 1
Two general parallel incomplete factorization strategies are investigated. The techniques may be interpreted as generalized domain decomposition methods. In contrast to classical domain decomposition methods, adjacent subdomains exchange data during
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9982b21130d47db79106edf6b9f09411
https://dspace.library.uu.nl/handle/1874/1529
https://dspace.library.uu.nl/handle/1874/1529
The JacobiDavidson method is suitable for computing solutions of large ndimensional eigen value problems. It needs (approximate) solutions of specific ndimensional linear systems. Here we propose a strategy based on a nonoverlapping domain de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a83b56fe8960400f97d6cd18488f68ff
https://dspace.library.uu.nl/handle/1874/2688
https://dspace.library.uu.nl/handle/1874/2688
Autor:
Saad, Y., Vorst, H.A. van der
Publikováno v:
Journal of Computational and Applied Mathematics, 123(1-2), 1
This paper sketches the main research developments in the area of iterative methods for solving linear systems during the 20th century. Although iterative methods for solving linear systems find their origin in the early nineteenth century (work by G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1d1dc45142e26fd2c27c622b83e2ec18
https://dspace.library.uu.nl/handle/1874/1861
https://dspace.library.uu.nl/handle/1874/1861
Autor:
Golub, G.H., Vorst, H.A. van der
This paper sketches the main research developments in the area of computational meth ods for eigenvalue problems during the 20th century. The earliest of such methods dates back to work of Jacobi in the middle of the nineteenth century. Since compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a52dab5c26e844aa3981a31db9e651ac
https://dspace.library.uu.nl/handle/1874/2663
https://dspace.library.uu.nl/handle/1874/2663
Publikováno v:
SIAM Journal of Matrix Analysis and Applications, 22(3), 726
The threeterm Lanczos process for a symmetric matrix leads to bases for Krylov subspaces of increasing dimension. The Lanczos basis, together with the recurrence coe#cients, can be used for the solution of symmetric indefinite linear systems, by so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e5dc2310bdd4ff148140d13b74920300
https://dspace.library.uu.nl/handle/1874/2668
https://dspace.library.uu.nl/handle/1874/2668
Autor:
Bomhof, W., Vorst, H.A. van der
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=dedup_wf_001::5095280524b3f5b45f2dd9a9bff9aa36
https://dspace.library.uu.nl/handle/1874/2682
https://dspace.library.uu.nl/handle/1874/2682