LAPACK  3.4.2
LAPACK: Linear Algebra PACKage
 All Files Functions Groups
cpbt02.f
Go to the documentation of this file.
1 *> \brief \b CPBT02
2 *
3 * =========== DOCUMENTATION ===========
4 *
5 * Online html documentation available at
6 * http://www.netlib.org/lapack/explore-html/
7 *
8 * Definition:
9 * ===========
10 *
11 * SUBROUTINE CPBT02( UPLO, N, KD, NRHS, A, LDA, X, LDX, B, LDB,
12 * RWORK, RESID )
13 *
14 * .. Scalar Arguments ..
15 * CHARACTER UPLO
16 * INTEGER KD, LDA, LDB, LDX, N, NRHS
17 * REAL RESID
18 * ..
19 * .. Array Arguments ..
20 * REAL RWORK( * )
21 * COMPLEX A( LDA, * ), B( LDB, * ), X( LDX, * )
22 * ..
23 *
24 *
25 *> \par Purpose:
26 * =============
27 *>
28 *> \verbatim
29 *>
30 *> CPBT02 computes the residual for a solution of a Hermitian banded
31 *> system of equations A*x = b:
32 *> RESID = norm( B - A*X ) / ( norm(A) * norm(X) * EPS)
33 *> where EPS is the machine precision.
34 *> \endverbatim
35 *
36 * Arguments:
37 * ==========
38 *
39 *> \param[in] UPLO
40 *> \verbatim
41 *> UPLO is CHARACTER*1
42 *> Specifies whether the upper or lower triangular part of the
43 *> Hermitian matrix A is stored:
44 *> = 'U': Upper triangular
45 *> = 'L': Lower triangular
46 *> \endverbatim
47 *>
48 *> \param[in] N
49 *> \verbatim
50 *> N is INTEGER
51 *> The number of rows and columns of the matrix A. N >= 0.
52 *> \endverbatim
53 *>
54 *> \param[in] KD
55 *> \verbatim
56 *> KD is INTEGER
57 *> The number of super-diagonals of the matrix A if UPLO = 'U',
58 *> or the number of sub-diagonals if UPLO = 'L'. KD >= 0.
59 *> \endverbatim
60 *>
61 *> \param[in] NRHS
62 *> \verbatim
63 *> NRHS is INTEGER
64 *> The number of right hand sides. NRHS >= 0.
65 *> \endverbatim
66 *>
67 *> \param[in] A
68 *> \verbatim
69 *> A is COMPLEX array, dimension (LDA,N)
70 *> The original Hermitian band matrix A. If UPLO = 'U', the
71 *> upper triangular part of A is stored as a band matrix; if
72 *> UPLO = 'L', the lower triangular part of A is stored. The
73 *> columns of the appropriate triangle are stored in the columns
74 *> of A and the diagonals of the triangle are stored in the rows
75 *> of A. See CPBTRF for further details.
76 *> \endverbatim
77 *>
78 *> \param[in] LDA
79 *> \verbatim
80 *> LDA is INTEGER.
81 *> The leading dimension of the array A. LDA >= max(1,KD+1).
82 *> \endverbatim
83 *>
84 *> \param[in] X
85 *> \verbatim
86 *> X is COMPLEX array, dimension (LDX,NRHS)
87 *> The computed solution vectors for the system of linear
88 *> equations.
89 *> \endverbatim
90 *>
91 *> \param[in] LDX
92 *> \verbatim
93 *> LDX is INTEGER
94 *> The leading dimension of the array X. LDX >= max(1,N).
95 *> \endverbatim
96 *>
97 *> \param[in,out] B
98 *> \verbatim
99 *> B is COMPLEX array, dimension (LDB,NRHS)
100 *> On entry, the right hand side vectors for the system of
101 *> linear equations.
102 *> On exit, B is overwritten with the difference B - A*X.
103 *> \endverbatim
104 *>
105 *> \param[in] LDB
106 *> \verbatim
107 *> LDB is INTEGER
108 *> The leading dimension of the array B. LDB >= max(1,N).
109 *> \endverbatim
110 *>
111 *> \param[out] RWORK
112 *> \verbatim
113 *> RWORK is REAL array, dimension (N)
114 *> \endverbatim
115 *>
116 *> \param[out] RESID
117 *> \verbatim
118 *> RESID is REAL
119 *> The maximum over the number of right hand sides of
120 *> norm(B - A*X) / ( norm(A) * norm(X) * EPS ).
121 *> \endverbatim
122 *
123 * Authors:
124 * ========
125 *
126 *> \author Univ. of Tennessee
127 *> \author Univ. of California Berkeley
128 *> \author Univ. of Colorado Denver
129 *> \author NAG Ltd.
130 *
131 *> \date November 2011
132 *
133 *> \ingroup complex_lin
134 *
135 * =====================================================================
136  SUBROUTINE cpbt02( UPLO, N, KD, NRHS, A, LDA, X, LDX, B, LDB,
137  $ rwork, resid )
138 *
139 * -- LAPACK test routine (version 3.4.0) --
140 * -- LAPACK is a software package provided by Univ. of Tennessee, --
141 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
142 * November 2011
143 *
144 * .. Scalar Arguments ..
145  CHARACTER uplo
146  INTEGER kd, lda, ldb, ldx, n, nrhs
147  REAL resid
148 * ..
149 * .. Array Arguments ..
150  REAL rwork( * )
151  COMPLEX a( lda, * ), b( ldb, * ), x( ldx, * )
152 * ..
153 *
154 * =====================================================================
155 *
156 * .. Parameters ..
157  REAL zero, one
158  parameter( zero = 0.0e+0, one = 1.0e+0 )
159  COMPLEX cone
160  parameter( cone = ( 1.0e+0, 0.0e+0 ) )
161 * ..
162 * .. Local Scalars ..
163  INTEGER j
164  REAL anorm, bnorm, eps, xnorm
165 * ..
166 * .. External Functions ..
167  REAL clanhb, scasum, slamch
168  EXTERNAL clanhb, scasum, slamch
169 * ..
170 * .. External Subroutines ..
171  EXTERNAL chbmv
172 * ..
173 * .. Intrinsic Functions ..
174  INTRINSIC max
175 * ..
176 * .. Executable Statements ..
177 *
178 * Quick exit if N = 0 or NRHS = 0.
179 *
180  IF( n.LE.0 .OR. nrhs.LE.0 ) THEN
181  resid = zero
182  return
183  END IF
184 *
185 * Exit with RESID = 1/EPS if ANORM = 0.
186 *
187  eps = slamch( 'Epsilon' )
188  anorm = clanhb( '1', uplo, n, kd, a, lda, rwork )
189  IF( anorm.LE.zero ) THEN
190  resid = one / eps
191  return
192  END IF
193 *
194 * Compute B - A*X
195 *
196  DO 10 j = 1, nrhs
197  CALL chbmv( uplo, n, kd, -cone, a, lda, x( 1, j ), 1, cone,
198  $ b( 1, j ), 1 )
199  10 continue
200 *
201 * Compute the maximum over the number of right hand sides of
202 * norm( B - A*X ) / ( norm(A) * norm(X) * EPS )
203 *
204  resid = zero
205  DO 20 j = 1, nrhs
206  bnorm = scasum( n, b( 1, j ), 1 )
207  xnorm = scasum( n, x( 1, j ), 1 )
208  IF( xnorm.LE.zero ) THEN
209  resid = one / eps
210  ELSE
211  resid = max( resid, ( ( bnorm/anorm )/xnorm )/eps )
212  END IF
213  20 continue
214 *
215  return
216 *
217 * End of CPBT02
218 *
219  END