csyrfs.f man page on DragonFly

Man page or keyword search:  
man Server   44335 pages
apropos Keyword Search (all sections)
Output format
DragonFly logo
[printable version]

csyrfs.f(3)			    LAPACK			   csyrfs.f(3)

NAME
       csyrfs.f -

SYNOPSIS
   Functions/Subroutines
       subroutine csyrfs (UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, X,
	   LDX, FERR, BERR, WORK, RWORK, INFO)
	   CSYRFS

Function/Subroutine Documentation
   subroutine csyrfs (characterUPLO, integerN, integerNRHS, complex,
       dimension( lda, * )A, integerLDA, complex, dimension( ldaf, * )AF,
       integerLDAF, integer, dimension( * )IPIV, complex, dimension( ldb, *
       )B, integerLDB, complex, dimension( ldx, * )X, integerLDX, real,
       dimension( * )FERR, real, dimension( * )BERR, complex, dimension( *
       )WORK, real, dimension( * )RWORK, integerINFO)
       CSYRFS

       Purpose:

	    CSYRFS 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.

       Parameters:
	   UPLO

		     UPLO is CHARACTER*1
		     = 'U':  Upper triangle of A is stored;
		     = 'L':  Lower triangle of A is stored.

	   N

		     N is INTEGER
		     The order of the matrix A.	 N >= 0.

	   NRHS

		     NRHS is INTEGER
		     The number of right hand sides, i.e., the number of columns
		     of the matrices B and X.  NRHS >= 0.

	   A

		     A is COMPLEX 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.

	   LDA

		     LDA is INTEGER
		     The leading dimension of the array A.  LDA >= max(1,N).

	   AF

		     AF is COMPLEX 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 CSYTRF.

	   LDAF

		     LDAF is INTEGER
		     The leading dimension of the array AF.  LDAF >= max(1,N).

	   IPIV

		     IPIV is INTEGER array, dimension (N)
		     Details of the interchanges and the block structure of D
		     as determined by CSYTRF.

	   B

		     B is COMPLEX array, dimension (LDB,NRHS)
		     The right hand side matrix B.

	   LDB

		     LDB is INTEGER
		     The leading dimension of the array B.  LDB >= max(1,N).

	   X

		     X is COMPLEX array, dimension (LDX,NRHS)
		     On entry, the solution matrix X, as computed by CSYTRS.
		     On exit, the improved solution matrix X.

	   LDX

		     LDX is INTEGER
		     The leading dimension of the array X.  LDX >= max(1,N).

	   FERR

		     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.

	   BERR

		     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).

	   WORK

		     WORK is COMPLEX array, dimension (2*N)

	   RWORK

		     RWORK is REAL array, dimension (N)

	   INFO

		     INFO is INTEGER
		     = 0:  successful exit
		     < 0:  if INFO = -i, the i-th argument had an illegal value

       Internal Parameters:

	     ITMAX is the maximum number of steps of iterative refinement.

       Author:
	   Univ. of Tennessee

	   Univ. of California Berkeley

	   Univ. of Colorado Denver

	   NAG Ltd.

       Date:
	   November 2011

       Definition at line 192 of file csyrfs.f.

Author
       Generated automatically by Doxygen for LAPACK from the source code.

Version 3.4.2			Sat Nov 16 2013			   csyrfs.f(3)
[top]

List of man pages available for DragonFly

Copyright (c) for man pages and the logo by the respective OS vendor.

For those who want to learn more, the polarhome community provides shell access and support.

[legal] [privacy] [GNU] [policy] [cookies] [netiquette] [sponsors] [FAQ]
Tweet
Polarhome, production since 1999.
Member of Polarhome portal.
Based on Fawad Halim's script.
....................................................................
Vote for polarhome
Free Shell Accounts :: the biggest list on the net