gb_whullm_i(3PI) Sun Interval Performance Library gb_whullm_i(3PI)NAMEgb_whullm_i - Convex hull of two interval matrices.
DESCRIPTION
C = convex hull which contains UNION of A and B
The routine GB_WHULLM_I finds the convex set which contains both gen‐
eral band interval matrices A and B, and stores the result in an inter‐
val matrix C. Matrices A, B and C have the same storage format. The
routine returns immediately if M or N is equal to zero or KL is less
than zero.
SYNOPSIS
SUBROUTINE GB_WHULLM_I( A, M, KL, B, C )
INTERVAL, INTENT(IN) :: A(:,:), B(:,:)
INTERVAL, INTENT(OUT) :: C(:,:)
INTEGER, INTENT(IN) :: M, KL
where
A, B and C have shape (L,N) where (L > KL)).
ARGUMENTS
A (input)
Array of DIMENSION (L,N) where (L > KL).
Unchanged on exit.
B (input)
Array of DIMENSION (L,N) where (L > KL).
Unchanged on exit.
C (output)
Array of DIMENSION (L,N) where (L > KL).
On exit, contains elementwise intersection
of A and B.
M (input)
Number of rows in the source general matrix.
Unchanged on exit.
KL (input)
The number of the subdiagonal bands.
Unchanged on exit.
ERRORS
blas_error_alloc
A, B or C is unallocated array
blas_error_shape
shape(A) /= shape(B) /= shape(C)
6 Mar 2009 gb_whullm_i(3PI)