NAME

sppequ - compute row and column scalings intended to equilibrate a symmetric positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm)


SYNOPSIS

  SUBROUTINE SPPEQU( UPLO, N, A, SCALE, SCOND, AMAX, INFO)
  CHARACTER * 1 UPLO
  INTEGER N, INFO
  REAL SCOND, AMAX
  REAL A(*), SCALE(*)
  SUBROUTINE SPPEQU_64( UPLO, N, A, SCALE, SCOND, AMAX, INFO)
  CHARACTER * 1 UPLO
  INTEGER*8 N, INFO
  REAL SCOND, AMAX
  REAL A(*), SCALE(*)

F95 INTERFACE

  SUBROUTINE PPEQU( UPLO, [N], A, SCALE, SCOND, AMAX, [INFO])
  CHARACTER(LEN=1) :: UPLO
  INTEGER :: N, INFO
  REAL :: SCOND, AMAX
  REAL, DIMENSION(:) :: A, SCALE
  SUBROUTINE PPEQU_64( UPLO, [N], A, SCALE, SCOND, AMAX, [INFO])
  CHARACTER(LEN=1) :: UPLO
  INTEGER(8) :: N, INFO
  REAL :: SCOND, AMAX
  REAL, DIMENSION(:) :: A, SCALE

C INTERFACE

#include <sunperf.h>

void sppequ(char uplo, int n, float *a, float *scale, float *scond, float *amax, int *info);

void sppequ_64(char uplo, long n, float *a, float *scale, float *scond, float *amax, long *info);


PURPOSE

sppequ computes row and column scalings intended to equilibrate a symmetric positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm). S contains the scale factors, S(i)=1/sqrt(A(i,i)), chosen so that the scaled matrix B with elements B(i,j)=S(i)*A(i,j)*S(j) has ones on the diagonal. This choice of S puts the condition number of B within a factor N of the smallest possible condition number over all possible diagonal scalings.


ARGUMENTS