.TH "SRC/ssyrfs.f" 3 "Version 3.12.0" "LAPACK" \" -*- nroff -*-
.ad l
.nh
.SH NAME
SRC/ssyrfs.f
.SH SYNOPSIS
.br
.PP
.SS "Functions/Subroutines"

.in +1c
.ti -1c
.RI "subroutine \fBssyrfs\fP (uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)"
.br
.RI "\fBSSYRFS\fP "
.in -1c
.SH "Function/Subroutine Documentation"
.PP 
.SS "subroutine ssyrfs (character uplo, integer n, integer nrhs, real, dimension( lda, * ) a, integer lda, real, dimension( ldaf, * ) af, integer ldaf, integer, dimension( * ) ipiv, real, dimension( ldb, * ) b, integer ldb, real, dimension( ldx, * ) x, integer ldx, real, dimension( * ) ferr, real, dimension( * ) berr, real, dimension( * ) work, integer, dimension( * ) iwork, integer info)"

.PP
\fBSSYRFS\fP  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
!>
!> SSYRFS improves the computed solution to a system of linear
!> equations when the coefficient matrix is symmetric indefinite, and
!> provides error bounds and backward error estimates for the solution\&.
!> 
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIUPLO\fP 
.PP
.nf
!>          UPLO is CHARACTER*1
!>          = 'U':  Upper triangle of A is stored;
!>          = 'L':  Lower triangle of A is stored\&.
!> 
.fi
.PP
.br
\fIN\fP 
.PP
.nf
!>          N is INTEGER
!>          The order of the matrix A\&.  N >= 0\&.
!> 
.fi
.PP
.br
\fINRHS\fP 
.PP
.nf
!>          NRHS is INTEGER
!>          The number of right hand sides, i\&.e\&., the number of columns
!>          of the matrices B and X\&.  NRHS >= 0\&.
!> 
.fi
.PP
.br
\fIA\fP 
.PP
.nf
!>          A is REAL array, dimension (LDA,N)
!>          The symmetric matrix A\&.  If UPLO = 'U', the leading N-by-N
!>          upper triangular part of A contains the upper triangular part
!>          of the matrix A, and the strictly lower triangular part of A
!>          is not referenced\&.  If UPLO = 'L', the leading N-by-N lower
!>          triangular part of A contains the lower triangular part of
!>          the matrix A, and the strictly upper triangular part of A is
!>          not referenced\&.
!> 
.fi
.PP
.br
\fILDA\fP 
.PP
.nf
!>          LDA is INTEGER
!>          The leading dimension of the array A\&.  LDA >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIAF\fP 
.PP
.nf
!>          AF is REAL array, dimension (LDAF,N)
!>          The factored form of the matrix A\&.  AF contains the block
!>          diagonal matrix D and the multipliers used to obtain the
!>          factor U or L from the factorization A = U*D*U**T or
!>          A = L*D*L**T as computed by SSYTRF\&.
!> 
.fi
.PP
.br
\fILDAF\fP 
.PP
.nf
!>          LDAF is INTEGER
!>          The leading dimension of the array AF\&.  LDAF >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIIPIV\fP 
.PP
.nf
!>          IPIV is INTEGER array, dimension (N)
!>          Details of the interchanges and the block structure of D
!>          as determined by SSYTRF\&.
!> 
.fi
.PP
.br
\fIB\fP 
.PP
.nf
!>          B is REAL array, dimension (LDB,NRHS)
!>          The right hand side matrix B\&.
!> 
.fi
.PP
.br
\fILDB\fP 
.PP
.nf
!>          LDB is INTEGER
!>          The leading dimension of the array B\&.  LDB >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIX\fP 
.PP
.nf
!>          X is REAL array, dimension (LDX,NRHS)
!>          On entry, the solution matrix X, as computed by SSYTRS\&.
!>          On exit, the improved solution matrix X\&.
!> 
.fi
.PP
.br
\fILDX\fP 
.PP
.nf
!>          LDX is INTEGER
!>          The leading dimension of the array X\&.  LDX >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIFERR\fP 
.PP
.nf
!>          FERR is REAL array, dimension (NRHS)
!>          The estimated forward error bound for each solution vector
!>          X(j) (the j-th column of the solution matrix X)\&.
!>          If XTRUE is the true solution corresponding to X(j), FERR(j)
!>          is an estimated upper bound for the magnitude of the largest
!>          element in (X(j) - XTRUE) divided by the magnitude of the
!>          largest element in X(j)\&.  The estimate is as reliable as
!>          the estimate for RCOND, and is almost always a slight
!>          overestimate of the true error\&.
!> 
.fi
.PP
.br
\fIBERR\fP 
.PP
.nf
!>          BERR is REAL array, dimension (NRHS)
!>          The componentwise relative backward error of each solution
!>          vector X(j) (i\&.e\&., the smallest relative change in
!>          any element of A or B that makes X(j) an exact solution)\&.
!> 
.fi
.PP
.br
\fIWORK\fP 
.PP
.nf
!>          WORK is REAL array, dimension (3*N)
!> 
.fi
.PP
.br
\fIIWORK\fP 
.PP
.nf
!>          IWORK is INTEGER array, dimension (N)
!> 
.fi
.PP
.br
\fIINFO\fP 
.PP
.nf
!>          INFO is INTEGER
!>          = 0:  successful exit
!>          < 0:  if INFO = -i, the i-th argument had an illegal value
!> 
.fi
.PP
 
.RE
.PP
\fBInternal Parameters:\fP
.RS 4

.PP
.nf
!>  ITMAX is the maximum number of steps of iterative refinement\&.
!> 
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 

.PP
Univ\&. of California Berkeley 

.PP
Univ\&. of Colorado Denver 

.PP
NAG Ltd\&. 
.RE
.PP

.PP
Definition at line \fB189\fP of file \fBssyrfs\&.f\fP\&.
.SH "Author"
.PP 
Generated automatically by Doxygen for LAPACK from the source code\&.