sladiv(3S)

NAME
     SLADIV - perform complex division in real arithmetic  a + i*b p + i*q =
     --------- c + i*d  The algorithm is due to Robert L

SYNOPSIS
     SUBROUTINE SLADIV( A, B, C, D, P, Q )

         REAL           A, B, C, D, P, Q

IMPLEMENTATION
     These routines are part of the SCSL Scientific Library and can be loaded
     using either the -lscs or the -lscs_mp option.  The -lscs_mp option
     directs the linker to use the multi-processor version of the library.

     When linking to SCSL with -lscs or -lscs_mp, the default integer size is
     4 bytes (32 bits). Another version of SCSL is available in which integers
     are 8 bytes (64 bits).  This version allows the user access to larger
     memory sizes and helps when porting legacy Cray codes.  It can be loaded
     by using the -lscs_i8 option or the -lscs_i8_mp option. A program may use
     only one of the two versions; 4-byte integer and 8-byte integer library
     calls cannot be mixed.

PURPOSE
     SLADIV performs complex division in real arithmetic a + i*b p + i*q =
     --------- c + i*d The algorithm is due to Robert L. Smith and can be
     found in D. Knuth, The art of Computer Programming, Vol.2, p.195


ARGUMENTS
     A       (input) REAL
             B       (input) REAL C       (input) REAL D       (input) REAL
             The scalars a, b, c, and d in the above expression.

     P       (output) REAL
             Q       (output) REAL The scalars p and q in the above
             expression.

SEE ALSO
     INTRO_LAPACK(3S), INTRO_SCSL(3S)

     This man page is available only online.