Category N. Data handling (search also class L2)

N1. Input, output N6. Sorting N8. Permuting N1. Input, output SBHIN-S Read a Sparse Linear System in the Boeing/Harwell Format. DBHIN-D The matrix is read in and if the right hand side is also present in the input file then it too is read in. The matrix is then modified to be in the SLAP Column format. SCPPLT-S Printer Plot of SLAP Column Format Matrix. DCPPLT-D Routine to print out a SLAP Column format matrix in a "printer plot" graphical representation. STIN-S Read in SLAP Triad Format Linear System. DTIN-D Routine to read in a SLAP Triad format matrix and right hand side and solution to the system, if known. STOUT-S Write out SLAP Triad Format Linear System. DTOUT-D Routine to write out a SLAP Triad format matrix and right hand side and solution to the system, if known. N6. Sorting N6A. Internal N6A1. Passive (i.e. construct pointer array, rank) N6A1A. Integer IPSORT-I Return the permutation vector generated by sorting a given SPSORT-S array and, optionally, rearrange the elements of the array. DPSORT-D The array may be sorted in increasing or decreasing order. HPSORT-H A slightly modified quicksort algorithm is used. N6A1B. Real SPSORT-S Return the permutation vector generated by sorting a given DPSORT-D array and, optionally, rearrange the elements of the array. IPSORT-I The array may be sorted in increasing or decreasing order. HPSORT-H A slightly modified quicksort algorithm is used. N6A1C. Character HPSORT-H Return the permutation vector generated by sorting a SPSORT-S substring within a character array and, optionally, DPSORT-D rearrange the elements of the array. The array may be IPSORT-I sorted in forward or reverse lexicographical order. A slightly modified quicksort algorithm is used. N6A2. Active N6A2A. Integer IPSORT-I Return the permutation vector generated by sorting a given SPSORT-S array and, optionally, rearrange the elements of the array. DPSORT-D The array may be sorted in increasing or decreasing order. HPSORT-H A slightly modified quicksort algorithm is used. ISORT-I Sort an array and optionally make the same interchanges in SSORT-S an auxiliary array. The array may be sorted in increasing DSORT-D or decreasing order. A slightly modified QUICKSORT algorithm is used. N6A2B. Real SPSORT-S Return the permutation vector generated by sorting a given DPSORT-D array and, optionally, rearrange the elements of the array. IPSORT-I The array may be sorted in increasing or decreasing order. HPSORT-H A slightly modified quicksort algorithm is used. SSORT-S Sort an array and optionally make the same interchanges in DSORT-D an auxiliary array. The array may be sorted in increasing ISORT-I or decreasing order. A slightly modified QUICKSORT algorithm is used. N6A2C. Character HPSORT-H Return the permutation vector generated by sorting a SPSORT-S substring within a character array and, optionally, DPSORT-D rearrange the elements of the array. The array may be IPSORT-I sorted in forward or reverse lexicographical order. A slightly modified quicksort algorithm is used. N8. Permuting SPPERM-S Rearrange a given array according to a prescribed DPPERM-D permutation vector. IPPERM-I HPPERM-H