NAME

dppequ - 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 DPPEQU( UPLO, N, A, SCALE, SCOND, AMAX, INFO)
  CHARACTER * 1 UPLO
  INTEGER N, INFO
  DOUBLE PRECISION SCOND, AMAX
  DOUBLE PRECISION A(*), SCALE(*)
  SUBROUTINE DPPEQU_64( UPLO, N, A, SCALE, SCOND, AMAX, INFO)
  CHARACTER * 1 UPLO
  INTEGER*8 N, INFO
  DOUBLE PRECISION SCOND, AMAX
  DOUBLE PRECISION A(*), SCALE(*)

F95 INTERFACE

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

C INTERFACE

#include <sunperf.h>

void dppequ(char uplo, int n, double *a, double *scale, double *scond, double *amax, int *info);

void dppequ_64(char uplo, long n, double *a, double *scale, double *scond, double *amax, long *info);


PURPOSE

dppequ 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