Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Roger G. Grimes"'
Autor:
Francois-Henry Rouet, Cleve Ashcraft, James Ong, Erman Guleryuz, Todd A. Simons, Ting-Ting Zhu, Seid Koric, Robert F. Lucas, Jef Dawson, Roger G. Grimes
Publikováno v:
IPDPS
LS-DYNA is a well-known multiphysics code with both explicit and implicit time stepping capabilities. Implicit simulations rely heavily on sparse matrix computations, in particular direct solvers, and are notoriously much harder to scale than explici
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2275322336c640271024fe4f838b2a8b
https://doi.org/10.1109/ipdps47924.2020.00059
https://doi.org/10.1109/ipdps47924.2020.00059
Autor:
Seid Koric, James Ong, Ting-Ting Zhu, Erman Gulyeruz, Francois-Henry Rouet, Robert F. Lucas, Jef Dawson, Roger G. Grimes, Todd A. Simons
Publikováno v:
AIAA Propulsion and Energy 2019 Forum.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::741f18e9b49e6214196908ad9ab3aa1c
https://doi.org/10.2514/6.2019-4456
https://doi.org/10.2514/6.2019-4456
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 20:513-561
The Bunch-Kaufman factorization is widely accepted as the algorithm of choice for the direct solution of symmetric indefinite linear equations; it is the algorithm employed in both LINPACK and LAPACK. It has also been adapted to sparse symmetric inde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e70d964bdc359501b80fdec7876c8da
https://doi.org/10.1137/s0895479896296921
https://doi.org/10.1137/s0895479896296921
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 15:228-272
An "industrial strength" algorithm for solving sparse symmetric generalized eigenproblems is described. The algorithm has its foundations in known techniques in solving sparse symmetric eigenproblems, notably the spectral transformation of Ericsson a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e7c3c4a62105c51b3fc32d2f702e17a
https://doi.org/10.1137/s0895479888151111
https://doi.org/10.1137/s0895479888151111
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642193279
VECPAR
VECPAR
The use of GPUs to accelerate the factoring of large sparse symmetric matrices shows the potential of yielding important benefits to a large group of widely used applications. This paper examines how a multifrontal sparse solver performs when exploit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3f94961f777a0b0b4855c04d7409baf
https://doi.org/10.1007/978-3-642-19328-6_9
https://doi.org/10.1007/978-3-642-19328-6_9
Algorithm 692: Model implementation and test package for the Sparse Basic Linear Algebra Subprograms
Publikováno v:
ACM Transactions on Mathematical Software. 17:264-272
This paper desribes a model implementation and test software for the Sparse Basic Linear Algebra Subprograms (Sparse BLAS). The Sparse BLAS perform vector operations common in sparse linear algebra, with the goal of providing efficient, but portable,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b203773d18924b8f374133368af280e
https://doi.org/10.1145/108556.108582
https://doi.org/10.1145/108556.108582
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 11:323-334
A new algorithm for the computation of a pseudoperipheral node of a graph is presented, and the application of this algorithm to reordering algorithms for the solution of sparse linear systems is discussed. Numerical tests on large sparse matrix prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f2f6bd91a5468a5269a4fb236a28135
https://doi.org/10.1137/0611022
https://doi.org/10.1137/0611022
Autor:
Roger G. Grimes
This final report describes the status of work performed during the months of Sept 1995 through Jan 1999 on the Algorithmic Research And Software Development For An Industrial Strength Sparse Matrix Library For Parallel Computers. The objective of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d0d9bca900216d8c18c826231b11282
https://doi.org/10.21236/ada360441
https://doi.org/10.21236/ada360441
Autor:
Roger G. Grimes
Publikováno v:
The Journal of Supercomputing. 1:291-299
Many mathematical models of physical phenomena lead to solving dense systems of linear equations. As the models are refined, the order of these problems increases, usually beyond the capacity of the computer to contain the problem in central memory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f22708f1d885f16382cecc31130712d
https://doi.org/10.1007/bf00154340
https://doi.org/10.1007/bf00154340
Autor:
Horst D. Simon, Roger G. Grimes
Publikováno v:
ACM Transactions on Mathematical Software. 14:241-256
This paper describes a new implementation of algorithms for solving large, dense symmetric eigen-problems AX = BX Λ, where the matrices A and B are too large to fit in the central memory of the computer. Here A is assumed to be symmetric, and B symm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::303748d18689cae1f2242d572bf94bf6
https://doi.org/10.1145/44128.44130
https://doi.org/10.1145/44128.44130