Computing Petaflops over Terabytes of Data
DOI10.1145/2560421zbMath1371.65037arXiv1210.7683OpenAlexW2026940984WikidataQ113310307 ScholiaQ113310307MaRDI QIDQ5270698
Paolo Bientinesi, Diego Fabregat-Traver
Publication date: 30 June 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.7683
algorithmcomputational complexitynumerical linear algebraleast squares problemscomputational biologyout-of-coreshared-memoryGenome-Wide Association Studiesmultiple instances of problems
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Genetics and epigenetics (92D10) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Correlations in sequences of generalized eigenproblems arising in density functional theory
- Solving sequences of generalized least-squares problems on multi-threaded architectures
- Solving systems of large dense linear equations
- Sparse direct factorizations through unassembled hyper-matrices
- Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods
- LAPACK Users' Guide
- Fast Numerically Stable Computations for Generalized Linear Least Squares Problems
- ScaLAPACK Users' Guide
- A set of level 3 basic linear algebra subprograms
This page was built for publication: Computing Petaflops over Terabytes of Data