LINPACK

This article may be expanded with text translated from the corresponding article in German. (October 2019) Click [show] for important translation instructions. Machine translation like DeepL or Google Translate is a useful starting point for translations, but translators must revise errors as necessary and confirm that the translation is accurate, rather than simply copy-pasting machine-translated text into the English Wikipedia. Consider adding a topic to this template: there are already 7,694 articles in the main category, and specifying|topic= will aid in categorization. Do not translate text that appears unreliable or low-quality. If possible, verify the text with references provided in the foreign-language article. You must provide copyright attribution in the edit summary accompanying your translation by providing an interlanguage link to the source of your translation. A model attribution edit summary is Content in this edit is translated from the existing German Wikipedia article at [[:de:]]; see its history for attribution. You should also add the template {{Translated page}} to the talk page. For more guidance, see Wikipedia:Translation.

LINPACK is a software library for performing numerical linear algebra on digital computers. It was written in Fortran by Jack Dongarra, Jim Bunch, Cleve Moler, and Gilbert Stewart, and was intended for use on supercomputers in the 1970s and early 1980s.^[1][2] It has been largely superseded by LAPACK, which runs more efficiently on modern architectures.

LINPACK makes use of the BLAS (Basic Linear Algebra Subprograms) libraries for performing basic vector and matrix operations.

The LINPACK benchmarks appeared initially as part of the LINPACK user's manual. The parallel LINPACK benchmark implementation called HPL (High Performance Linpack) is used to benchmark and rank supercomputers for the TOP500 list.

References[]

External links[]

• http://www.netlib.org/linpack/
• http://www.netlib.org/blas/

This computer-engineering-related article is a stub. You can help Wikipedia by .

• v
• t