The DOI matches its Crossref record.
LINPACK User's Guide.
Abstract
We provide further discussion of the use of least-squares techniques for this and G. W. Stewart, LINPACK Users' Guide (Society of Industrial and Applied. User's Guide for Intel® Math Kernel Library 11.3 for Linux* OS. Revision: Benchmark your cluster with Intel® Optimized MP LINPACK Benchmark for Clusters. Running Linpack on Linux High performance computer. No problem. I need a working guide for hpl if someone can do help me at this. The errors are.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Program MARK: survival estimation from populations of marked animals
White, G. C., & Burnham, K. P. (1999) · Bird Study · doi:10.1080/00063659909477239 · Cited by 7,499
Stamnes, K., Tsay, S.-C., Wiscombe, W., & Jayaweera, K. (1988) · Applied Optics · doi:10.1364/ao.27.002502 · Cited by 3,350
Program system for analysing positron lifetime spectra and angular correlation curves
Kirkegaard, P., Eldrup, M., Mogensen, O. E., & Pedersen, N. J. (1981) · Computer Physics Communications · doi:10.1016/0010-4655(81)90006-0 · Cited by 1,033
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
The LINPACK Benchmark: past, present and future
Dongarra, J. J., Luszczek, P., & Petitet, A. (2003) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.728 · Cited by 813
Self-citationMultiresolution analysis for surfaces of arbitrary topological type
Lounsbery, M., DeRose, T. D., & Warren, J. (1997) · ACM Transactions on Graphics · doi:10.1145/237748.237750 · Cited by 760
Performance of various computers using standard linear equations software
Dongarra, J. J. (1992) · ACM SIGARCH Computer Architecture News · doi:10.1145/141868.141871 · Cited by 708
Self-citationA Statistical Perspective on Ill-Posed Inverse Problems
O'Sullivan, F. (1986) · Statistical Science · doi:10.1214/ss/1177013525 · Cited by 670
The cost of doing science on the cloud: the Montage example
Deelman, E., Singh, G., Livny, M., Berriman, G. B., & Good, J. (2008) · doi:10.5555/1413370.1413421 · Cited by 580
Description and use of LSODE, the Livemore Solver for Ordinary Differential Equations
Radhakrishnan, K., & Hindmarsh, A. C. (1993) · doi:10.2172/15013302 · Cited by 502
Maximum Likelihood Computations with Repeated Measures: Application of the EM Algorithm
Laird, N., Lange, N., & Stram, D. (1987) · Journal of the American Statistical Association · doi:10.1080/01621459.1987.10478395 · Cited by 406
On the robust estimation of power spectra, coherences, and transfer functions
Chave, A. D., Thomson, D. J., & Ander, M. E. (1987) · Journal of Geophysical Research: Solid Earth · doi:10.1029/jb092ib01p00633 · Cited by 349
Exciting Trajectories for the Identification of Base Inertial Parameters of Robots
Gautier, M., & Khalil, W. (1992) · The International Journal of Robotics Research · doi:10.1177/027836499201100408 · Cited by 308
Smoothing noisy data with spline functions
Hutchinson, M. F., & de Hoog, F. R. (1985) · Numerische Mathematik · doi:10.1007/bf01389878 · Cited by 296
Schlattmann, P. (2009) · Statistics for Biology and Health · doi:10.1007/978-3-540-68651-4_4 · Cited by 283
Neighborhood based Levenberg-Marquardt algorithm for neural network training
Lera, G., & Pinzolas, M. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2002.1031951 · Cited by 281
Automatic Smoothing of Regression Functions in Generalized Linear Models
O'sullivan, F., Yandell, B. S., & Raynor, W. J. (1986) · Journal of the American Statistical Association · doi:10.1080/01621459.1986.10478243 · Cited by 277
Bayesian Inference and Optimal Design for the Sparse Linear Model
Seeger, M. (2008) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5555/1390681.1390707 · Cited by 277
A survey of matrix inverse eigenvalue problems
Boley, D., & Golub, G. H. (1987) · Inverse Problems · doi:10.1088/0266-5611/3/4/010 · Cited by 223
Metadata
- Authors
- Klema, V., Dongarra, J. J., Bunch, J. R., Moler, C. B., & Stewart, G. W.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1980-07
- Volume
- 35
- Issue
- 151
- Pages
- 1033
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W2010634113
- Cited by
- 646
- References
- 0
- FWCI
- 28.69
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.