LINPACK: Users' Guide. Dongarra, J., Bunch, J., Moler, C., & Stewart, G. [publisher not identified]. ![LINPACK: Users' Guide [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex [Excerpt:Table of Contents] "R.T.F.M." - Anonymous [] [...] [Overview] LIMPACK is a collection of Fortran subroutines which analyze and solve various systems of simultaneous linear algebraic equations. The subroutines are designed to be completely machine independent, fully portable, and to run at near optimum efficiency in most operating environments. [] Many of the subroutines deal with square coefficient matrices, where there are as many equations as unknowns. Some of the subroutines process rectangular coefficient matrices, where the system may be over- or underdetermined. Such systems are frequently encountered in least squares problems and other statistical calculations. Different subroutines are intended to take advantage of different special properties of the matrices and thereby save computer time and storage. [] The entire coefficient matrix will usually be stored in the computer memory, although there are provisions for band matrices and for processing large rectangular matrices row by row. This means that on most contemporary computers, UNPACK will handle full matrices of order less than a few hundred and band matrices of order less than several thousand. There are no subroutines for general sparse matrices or for iterative methods for very large problems. [] Most linear equation problems will require the use of two LINPACK subroutines, one to process the coefficient matrix and one to process a particular right hand side. This divi-sion of labor results in significant savings of computer time when there is a sequence of problems involving the same matrix, but different right hand sides. This situation is so common and the savings so important that no provision has been made for solving a single system with just one subroutine. [] [...]
@book{dongarraLINPACKUsersGuide1979,
title = {{{LINPACK}}: Users' Guide},
author = {Dongarra, Jack and Bunch, Jim and Moler, Cleve and Stewart, Gilbert},
date = {1979},
publisher = {{[publisher not identified]}},
url = {http://mfkp.org/INRMM/article/14219102},
abstract = {[Excerpt:Table of Contents]
"R.T.F.M." - Anonymous
[] [...]
[Overview]
LIMPACK is a collection of Fortran subroutines which analyze and solve various systems of simultaneous linear algebraic equations. The subroutines are designed to be completely machine independent, fully portable, and to run at near optimum efficiency in most operating environments.
[] Many of the subroutines deal with square coefficient matrices, where there are as many equations as unknowns. Some of the subroutines process rectangular coefficient matrices, where the system may be over- or underdetermined. Such systems are frequently encountered in least squares problems and other statistical calculations. Different subroutines are intended to take advantage of different special properties of the matrices and thereby save computer time and storage.
[] The entire coefficient matrix will usually be stored in the computer memory, although there are provisions for band matrices and for processing large rectangular matrices row by row. This means that on most contemporary computers, UNPACK will handle full matrices of order less than a few hundred and band matrices of order less than several thousand. There are no subroutines for general sparse matrices or for iterative methods for very large problems.
[] Most linear equation problems will require the use of two LINPACK subroutines, one to process the coefficient matrix and one to process a particular right hand side. This divi-sion of labor results in significant savings of computer time when there is a sequence of problems involving the same matrix, but different right hand sides. This situation is so common and the savings so important that no provision has been made for solving a single system with just one subroutine.
[] [...]},
isbn = {089871172},
keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-14219102,array-programming,computational-science,high-impact-publication,precursor-research,reference-manual,rtfm,science-history,terminology}
}
Downloads: 0
{"_id":"EuDjDYsMpCHkHnQYb","bibbaseid":"dongarra-bunch-moler-stewart-linpackusersguide","authorIDs":[],"author_short":["Dongarra, J.","Bunch, J.","Moler, C.","Stewart, G."],"bibdata":{"bibtype":"book","type":"book","title":"LINPACK: Users' Guide","author":[{"propositions":[],"lastnames":["Dongarra"],"firstnames":["Jack"],"suffixes":[]},{"propositions":[],"lastnames":["Bunch"],"firstnames":["Jim"],"suffixes":[]},{"propositions":[],"lastnames":["Moler"],"firstnames":["Cleve"],"suffixes":[]},{"propositions":[],"lastnames":["Stewart"],"firstnames":["Gilbert"],"suffixes":[]}],"date":"1979","publisher":"[publisher not identified]","url":"http://mfkp.org/INRMM/article/14219102","abstract":"[Excerpt:Table of Contents] \"R.T.F.M.\" - Anonymous [] [...] [Overview] LIMPACK is a collection of Fortran subroutines which analyze and solve various systems of simultaneous linear algebraic equations. The subroutines are designed to be completely machine independent, fully portable, and to run at near optimum efficiency in most operating environments. [] Many of the subroutines deal with square coefficient matrices, where there are as many equations as unknowns. Some of the subroutines process rectangular coefficient matrices, where the system may be over- or underdetermined. Such systems are frequently encountered in least squares problems and other statistical calculations. Different subroutines are intended to take advantage of different special properties of the matrices and thereby save computer time and storage. [] The entire coefficient matrix will usually be stored in the computer memory, although there are provisions for band matrices and for processing large rectangular matrices row by row. This means that on most contemporary computers, UNPACK will handle full matrices of order less than a few hundred and band matrices of order less than several thousand. There are no subroutines for general sparse matrices or for iterative methods for very large problems. [] Most linear equation problems will require the use of two LINPACK subroutines, one to process the coefficient matrix and one to process a particular right hand side. This divi-sion of labor results in significant savings of computer time when there is a sequence of problems involving the same matrix, but different right hand sides. This situation is so common and the savings so important that no provision has been made for solving a single system with just one subroutine. [] [...]","isbn":"089871172","keywords":"*imported-from-citeulike-INRMM,~INRMM-MiD:c-14219102,array-programming,computational-science,high-impact-publication,precursor-research,reference-manual,rtfm,science-history,terminology","bibtex":"@book{dongarraLINPACKUsersGuide1979,\n title = {{{LINPACK}}: Users' Guide},\n author = {Dongarra, Jack and Bunch, Jim and Moler, Cleve and Stewart, Gilbert},\n date = {1979},\n publisher = {{[publisher not identified]}},\n url = {http://mfkp.org/INRMM/article/14219102},\n abstract = {[Excerpt:Table of Contents]\n\n\"R.T.F.M.\" - Anonymous\n\n[] [...]\n\n[Overview]\n\nLIMPACK is a collection of Fortran subroutines which analyze and solve various systems of simultaneous linear algebraic equations. The subroutines are designed to be completely machine independent, fully portable, and to run at near optimum efficiency in most operating environments. \n\n[] Many of the subroutines deal with square coefficient matrices, where there are as many equations as unknowns. Some of the subroutines process rectangular coefficient matrices, where the system may be over- or underdetermined. Such systems are frequently encountered in least squares problems and other statistical calculations. Different subroutines are intended to take advantage of different special properties of the matrices and thereby save computer time and storage.\n\n[] The entire coefficient matrix will usually be stored in the computer memory, although there are provisions for band matrices and for processing large rectangular matrices row by row. This means that on most contemporary computers, UNPACK will handle full matrices of order less than a few hundred and band matrices of order less than several thousand. There are no subroutines for general sparse matrices or for iterative methods for very large problems. \n\n[] Most linear equation problems will require the use of two LINPACK subroutines, one to process the coefficient matrix and one to process a particular right hand side. This divi-sion of labor results in significant savings of computer time when there is a sequence of problems involving the same matrix, but different right hand sides. This situation is so common and the savings so important that no provision has been made for solving a single system with just one subroutine. \n\n[] [...]},\n isbn = {089871172},\n keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-14219102,array-programming,computational-science,high-impact-publication,precursor-research,reference-manual,rtfm,science-history,terminology}\n}\n\n","author_short":["Dongarra, J.","Bunch, J.","Moler, C.","Stewart, G."],"key":"dongarraLINPACKUsersGuide1979","id":"dongarraLINPACKUsersGuide1979","bibbaseid":"dongarra-bunch-moler-stewart-linpackusersguide","role":"author","urls":{"Paper":"http://mfkp.org/INRMM/article/14219102"},"keyword":["*imported-from-citeulike-INRMM","~INRMM-MiD:c-14219102","array-programming","computational-science","high-impact-publication","precursor-research","reference-manual","rtfm","science-history","terminology"],"downloads":0},"bibtype":"book","biburl":"https://tmpfiles.org/dl/58794/INRMM.bib","creationDate":"2020-07-02T22:41:05.519Z","downloads":0,"keywords":["*imported-from-citeulike-inrmm","~inrmm-mid:c-14219102","array-programming","computational-science","high-impact-publication","precursor-research","reference-manual","rtfm","science-history","terminology"],"search_terms":["linpack","users","guide","dongarra","bunch","moler","stewart"],"title":"LINPACK: Users' Guide","year":null,"dataSources":["DXuKbcZTirdigFKPF"]}