dlasrt (l) - Linux Manuals

dlasrt: the number in D in increasing order (if ID = aqIaq) or in decreasing order (if ID = aqDaq )

NAME

DLASRT - the number in D in increasing order (if ID = aqIaq) or in decreasing order (if ID = aqDaq )

SYNOPSIS

SUBROUTINE DLASRT(
ID, N, D, INFO )

    
CHARACTER ID

    
INTEGER INFO, N

    
DOUBLE PRECISION D( * )

PURPOSE

Sort the numbers in D in increasing order (if ID = aqIaq) or in decreasing order (if ID = aqDaq ). Use Quick Sort, reverting to Insertion sort on arrays of
size <= 20. Dimension of STACK limits N to about 2**32.

ARGUMENTS

ID (input) CHARACTER*1
= aqIaq: sort D in increasing order;
= aqDaq: sort D in decreasing order.
N (input) INTEGER
The length of the array D.
D (input/output) DOUBLE PRECISION array, dimension (N)
On entry, the array to be sorted. On exit, D has been sorted into increasing order (D(1) <= ... <= D(N) ) or into decreasing order (D(1) >= ... >= D(N) ), depending on ID.
INFO (output) INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value

Pages related to dlasrt

  • dlasrt (3)
  • dlasr (l) - applies a sequence of plane rotations to a real matrix A,
  • dlas2 (l) - computes the singular values of the 2-by-2 matrix [ F G ] [ 0 H ]
  • dlascl (l) - multiplies the M by N real matrix A by the real scalar CTO/CFROM
  • dlascl2 (l) - performs a diagonal scaling on a vector
  • dlasd0 (l) - a divide and conquer approach, DLASD0 computes the singular value decomposition (SVD) of a real upper bidiagonal N-by-M matrix B with diagonal D and offdiagonal E, where M = N + SQRE
  • dlasd1 (l) - computes the SVD of an upper bidiagonal N-by-M matrix B,
  • dlasd2 (l) - merges the two sets of singular values together into a single sorted set
  • dlasd3 (l) - finds all the square roots of the roots of the secular equation, as defined by the values in D and Z
  • dlasd4 (l) - subroutine compute the square root of the I-th updated eigenvalue of a positive symmetric rank-one modification to a positive diagonal matrix whose entries are given as the squares of the corresponding entries in the array d, and that 0 <= D(i) < D(j) for i < j and that RHO > 0