1CPOSV(1)              LAPACK driver routine (version 3.1)             CPOSV(1)
2
3
4

NAME

6       CPOSV  -  the solution to a complex system of linear equations  A * X =
7       B,
8

SYNOPSIS

10       SUBROUTINE CPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO )
11
12           CHARACTER     UPLO
13
14           INTEGER       INFO, LDA, LDB, N, NRHS
15
16           COMPLEX       A( LDA, * ), B( LDB, * )
17

PURPOSE

19       CPOSV computes the solution to a complex system of linear equations
20          A * X = B, where A is an N-by-N Hermitian positive  definite  matrix
21       and X and B are N-by-NRHS matrices.
22
23       The Cholesky decomposition is used to factor A as
24          A = U**H* U,  if UPLO = 'U', or
25          A = L * L**H,  if UPLO = 'L',
26       where  U  is  an  upper  triangular matrix and  L is a lower triangular
27       matrix.  The factored form of A is then used to  solve  the  system  of
28       equations A * X = B.
29
30

ARGUMENTS

32       UPLO    (input) CHARACTER*1
33               = 'U':  Upper triangle of A is stored;
34               = 'L':  Lower triangle of A is stored.
35
36       N       (input) INTEGER
37               The  number  of linear equations, i.e., the order of the matrix
38               A.  N >= 0.
39
40       NRHS    (input) INTEGER
41               The number of right hand sides, i.e., the number of columns  of
42               the matrix B.  NRHS >= 0.
43
44       A       (input/output) COMPLEX array, dimension (LDA,N)
45               On  entry,  the Hermitian matrix A.  If UPLO = 'U', the leading
46               N-by-N upper triangular part of A contains the upper triangular
47               part of the matrix A, and the strictly lower triangular part of
48               A is not referenced.  If UPLO = 'L', the leading  N-by-N  lower
49               triangular  part of A contains the lower triangular part of the
50               matrix A, and the strictly upper triangular part of  A  is  not
51               referenced.
52
53               On  exit, if INFO = 0, the factor U or L from the Cholesky fac‐
54               torization A = U**H*U or A = L*L**H.
55
56       LDA     (input) INTEGER
57               The leading dimension of the array A.  LDA >= max(1,N).
58
59       B       (input/output) COMPLEX array, dimension (LDB,NRHS)
60               On entry, the N-by-NRHS right hand side matrix B.  On exit,  if
61               INFO = 0, the N-by-NRHS solution matrix X.
62
63       LDB     (input) INTEGER
64               The leading dimension of the array B.  LDB >= max(1,N).
65
66       INFO    (output) INTEGER
67               = 0:  successful exit
68               < 0:  if INFO = -i, the i-th argument had an illegal value
69               >  0:   if  INFO  = i, the leading minor of order i of A is not
70               positive definite, so the factorization could not be completed,
71               and the solution has not been computed.
72
73
74
75 LAPACK driver routine (version 3.N1o)vember 2006                        CPOSV(1)
Impressum