Zobrazeno 1 - 10
of 16
pro vyhledávání: '"T. J. Dekker"'
Publikováno v:
Computing, 58(3), 225-244. Springer Wien
This paper considers elimination methods to solve dense linear systems, in particular a variant of Gaussian elimination due to Huard [13]. This variant reduces the system to an equivalent diagonal system just like Gauss-Jordan elimination, but does n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::050fa2914432260bab748e6c48ec299a
https://doi.org/10.1007/bf02684391
https://doi.org/10.1007/bf02684391
Publikováno v:
Journal of Computational and Applied Mathematics, 50(1-3), 221-232. Elsevier
The solution of linear systems continues to play an important role in scientific computing. The problems to be solved often are of very large size, so that solving them requires large computer resources. To solve these problems, at least supercompute
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1d737b91ec21fb4117e1ba9304c252c
https://doi.org/10.1016/0377-0427(94)90302-6
https://doi.org/10.1016/0377-0427(94)90302-6
Autor:
L. M. Abriola, T. J. Dekker
Publikováno v:
Soil and Aquifer Pollution ISBN: 9783642082948
The widespread presence of entrapped dense nonaqueous phase liquids (DNAPLs) in the subsurface has been identified as one of the most intractible problems in the remediation of contaminated aquifers (National Research Council 1994). Over the past 40
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::082695589d2d0d563dee1de2eb32ee9f
https://doi.org/10.1007/978-3-662-03674-7_2
https://doi.org/10.1007/978-3-662-03674-7_2
Publikováno v:
ACS Symposium Series ISBN: 9780841232259
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d28e36a2e60e43efb29f29ad768390c3
https://doi.org/10.1021/bk-1995-0594.ch002
https://doi.org/10.1021/bk-1995-0594.ch002
Publikováno v:
Future Generation Computer Systems. 4:255-263
In this paper some numerical algorithms are considered in relation to computations on vector and parallel processors. Moreover, some results of experiments on a vector computer are reported. The algorithms considered are Gaussian elimination and Gaus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c15060c790af33d93b38e613639d7a55
https://doi.org/10.1016/0167-739x(89)90001-0
https://doi.org/10.1016/0167-739x(89)90001-0
Autor:
T. J. Dekker, J. C. P. Bus
Publikováno v:
ACM Transactions on Mathematical Software, 1(4), 330-345
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dddb260d812f5d9c4e21972e5a4c3bda
https://doi.org/10.1145/355656.355659
https://doi.org/10.1145/355656.355659
Autor:
W. Hoffmann, T. J. Dekker
Publikováno v:
Numerische Mathematik. 54:591-599
In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5397cfa056fee574b063f4a409af33c8
https://doi.org/10.1007/bf01396364
https://doi.org/10.1007/bf01396364
Autor:
T. J. Dekker, J. de Groot
Publikováno v:
Fundamenta Mathematicae. 43:185-194
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d3fad58b42b694e85c5e768bcfd0037
https://doi.org/10.4064/fm-43-2-185-194
https://doi.org/10.4064/fm-43-2-185-194
Autor:
Joseph F. Traub, T. J. Dekker
Publikováno v:
Linear Algebra and its Applications. 4(2):137-154
THE SHIFTED QR ALGORITHM FOR HERMITIAN MATRICES by T. J. Dekker Mathematical Centre, Amsterdam and J. F. Traub* University of Washington, Seattle Technical Report No. 70-11-07, Computer Science Group University of Washington Seattle, Washington 98105
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7fd145357509186354d549316e931fb5
Autor:
T. J. Dekker
Publikováno v:
Numerische Mathematik. 18:224-242
A technique is described for expressing multilength floating-point arithmetic in terms of singlelength floating point arithmetic, i.e. the arithmetic for an available (say: single or double precision) floating-point number system. The basic algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f752690fe54a1cb3cbefbb705152f68
https://doi.org/10.1007/bf01397083
https://doi.org/10.1007/bf01397083