csptrs man page on OpenIndiana

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

csptrs(3P)		    Sun Performance Library		    csptrs(3P)

NAME
       csptrs - solve a system of linear equations A*X = B with a complex sym‐
       metric matrix A stored in packed format using  the  factorization  A  =
       U*D*U**T or A = L*D*L**T computed by CSPTRF

SYNOPSIS
       SUBROUTINE CSPTRS(UPLO, N, NRHS, AP, IPIVOT, B, LDB, INFO)

       CHARACTER * 1 UPLO
       COMPLEX AP(*), B(LDB,*)
       INTEGER N, NRHS, LDB, INFO
       INTEGER IPIVOT(*)

       SUBROUTINE CSPTRS_64(UPLO, N, NRHS, AP, IPIVOT, B, LDB, INFO)

       CHARACTER * 1 UPLO
       COMPLEX AP(*), B(LDB,*)
       INTEGER*8 N, NRHS, LDB, INFO
       INTEGER*8 IPIVOT(*)

   F95 INTERFACE
       SUBROUTINE SPTRS(UPLO, [N], [NRHS], AP, IPIVOT, B, [LDB], [INFO])

       CHARACTER(LEN=1) :: UPLO
       COMPLEX, DIMENSION(:) :: AP
       COMPLEX, DIMENSION(:,:) :: B
       INTEGER :: N, NRHS, LDB, INFO
       INTEGER, DIMENSION(:) :: IPIVOT

       SUBROUTINE SPTRS_64(UPLO, [N], [NRHS], AP, IPIVOT, B, [LDB], [INFO])

       CHARACTER(LEN=1) :: UPLO
       COMPLEX, DIMENSION(:) :: AP
       COMPLEX, DIMENSION(:,:) :: B
       INTEGER(8) :: N, NRHS, LDB, INFO
       INTEGER(8), DIMENSION(:) :: IPIVOT

   C INTERFACE
       #include <sunperf.h>

       void  csptrs(char uplo, int n, int nrhs, complex *ap, int *ipivot, com‐
		 plex *b, int ldb, int *info);

       void csptrs_64(char uplo, long n, long nrhs, complex *ap, long *ipivot,
		 complex *b, long ldb, long *info);

PURPOSE
       csptrs  solves a system of linear equations A*X = B with a complex sym‐
       metric matrix A stored in packed format using  the  factorization  A  =
       U*D*U**T or A = L*D*L**T computed by CSPTRF.

ARGUMENTS
       UPLO (input)
		 Specifies whether the details of the factorization are stored
		 as an upper or lower triangular matrix.  = 'U':  Upper trian‐
		 gular, form is A = U*D*U**T;
		 = 'L':	 Lower triangular, form is A = L*D*L**T.

       N (input) The order of the matrix A.  N >= 0.

       NRHS (input)
		 The  number  of right hand sides, i.e., the number of columns
		 of the matrix B.  NRHS >= 0.

       AP (input)
		 Complex  array,  dimension  (N*(N+1)/2)  The  block  diagonal
		 matrix D and the multipliers used to obtain the factor U or L
		 as computed by CSPTRF, stored as a packed triangular matrix.

       IPIVOT (input)
		 Integer array, dimension (N) Details of the interchanges  and
		 the block structure of D as determined by CSPTRF.

       B (input/output)
		 Complex  array, dimension (LDB,NRHS) On entry, the right hand
		 side matrix B.	 On exit, the solution matrix X.

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

       INFO (output)
		 = 0:  successful exit
		 < 0: if INFO = -i, the i-th argument had an illegal value

				  6 Mar 2009			    csptrs(3P)
[top]

List of man pages available for OpenIndiana

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