slaswp (l) - Linux Manuals

slaswp: performs a series of row interchanges on the matrix A

NAME

SLASWP - performs a series of row interchanges on the matrix A

SYNOPSIS

SUBROUTINE SLASWP(
N, A, LDA, K1, K2, IPIV, INCX )

    
INTEGER INCX, K1, K2, LDA, N

    
INTEGER IPIV( * )

    
REAL A( LDA, * )

PURPOSE

SLASWP performs a series of row interchanges on the matrix A. One row interchange is initiated for each of rows K1 through K2 of A.

ARGUMENTS

N (input) INTEGER
The number of columns of the matrix A.
A (input/output) REAL array, dimension (LDA,N)
On entry, the matrix of column dimension N to which the row interchanges will be applied. On exit, the permuted matrix.
LDA (input) INTEGER
The leading dimension of the array A.
K1 (input) INTEGER
The first element of IPIV for which a row interchange will be done.
K2 (input) INTEGER
The last element of IPIV for which a row interchange will be done.
IPIV (input) INTEGER array, dimension (K2*abs(INCX))
The vector of pivot indices. Only the elements in positions K1 through K2 of IPIV are accessed. IPIV(K) = L implies rows K and L are to be interchanged.
INCX (input) INTEGER
The increment between successive values of IPIV. If IPIV is negative, the pivots are applied in reverse order.

FURTHER DETAILS

Modified by

 R. C. Whaley, Computer Science Dept., Univ. of Tenn., Knoxville, USA

Pages related to slaswp

  • slaswp (3)
  • slas2 (l) - computes the singular values of the 2-by-2 matrix [ F G ] [ 0 H ]
  • slascl (l) - multiplies the M by N real matrix A by the real scalar CTO/CFROM
  • slascl2 (l) - performs a diagonal scaling on a vector
  • slasd0 (l) - a divide and conquer approach, SLASD0 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
  • slasd1 (l) - computes the SVD of an upper bidiagonal N-by-M matrix B,
  • slasd2 (l) - merges the two sets of singular values together into a single sorted set
  • slasd3 (l) - finds all the square roots of the roots of the secular equation, as defined by the values in D and Z
  • slasd4 (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
  • slasd5 (l) - subroutine compute the square root of the I-th eigenvalue of a positive symmetric rank-one modification of a 2-by-2 diagonal matrix diag( D ) * diag( D ) + RHO The diagonal entries in the array D are assumed to satisfy 0 <= D(i) < D(j) for i < j