✦ LIBER ✦

Fast Matrix-Vector Multiplication in the Sparse-Grid Galerkin Method

✍ Scribed by Andreas Zeiser

Book ID: 106421513
Publisher: Springer US
Year: 2010
Tongue: English
Weight: 726 KB
Volume: 47
Category: Article
ISSN: 0885-7474
DOI: 10.1007/s10915-010-9438-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast matrix–vector multiplication meth

A fast matrix–vector multiplication method for solving the radiosity equation

✍ Kendall Atkinson; David Da‐Kwun Chien 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 180 KB

Performance comparison of data-reorderin

Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured grid computations

✍ Alvaro L. G. A. Coutinho; Marcos A. D. Martins; Rubens M. Sydenstricker; Renato 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 802 KB

Improved Bounds in the Multiple-Recursiv

Improved Bounds in the Multiple-Recursive Matrix Method for Pseudorandom Number and Vector Generation

✍ Harold Niederreiter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 275 KB

The multiple-recursive matrix method is a general linear method for the generation of uniform pseudorandom numbers and vectors which was introduced and studied in earlier papers of the author. In this paper we improve on various bounds in this method by using information on -splitting subspaces of f