Snapgram: Matrix Multiplications Made Fun
Abstract
References
Index Terms
- Snapgram: Matrix Multiplications Made Fun
Recommendations
"Wide or tall" and "sparse matrix dense matrix" multiplications
HPC '11: Proceedings of the 19th High Performance Computing SymposiaSparse matrix dense matrix (SMDM) multiplications are useful in block Krylov or block Lanczos methods. SMDM computations are AU, and VA, multiplication of a large sparse m x n matrix A by a matrix V of k rows of length m or a matrix U of k columns of ...
A Block FSAI-ILU Parallel Preconditioner for Symmetric Positive Definite Linear Systems
A novel parallel preconditioner for symmetric positive definite matrices is developed coupling a generalized factored sparse approximate inverse (FSAI) with an incomplete LU (ILU) factorization. The generalized FSAI, called block FSAI, is derived by ...
An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
Pan and Reif have shown that Newton iteration may be used to compute the inverse of an $n \times n$, well-conditioned matrix in parallel time $O(\log ^2 n)$ and that this computation is processor efficient. Since the algorithm essentially amounts to a ...
Comments
Information & Contributors
Information
Published In

- General Chairs:
- Jeffrey A. Stone,
- Timothy Yuen,
- Program Chairs:
- Libby Shoop,
- Samuel A. Rebelsky,
- James Prather
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Poster
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 143Total Downloads
- Downloads (Last 12 months)143
- Downloads (Last 6 weeks)143
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in