NAG Library Routine Document
F07JSF (ZPTTRS)
1 Purpose
F07JSF (ZPTTRS) computes the solution to a complex system of linear equations
, where
is an
by
Hermitian positive definite tridiagonal matrix and
and
are
by
matrices, using the
factorization returned by
F07JRF (ZPTTRF).
2 Specification
INTEGER |
N, NRHS, LDB, INFO |
REAL (KIND=nag_wp) |
D(*) |
COMPLEX (KIND=nag_wp) |
E(*), B(LDB,*) |
CHARACTER(1) |
UPLO |
|
The routine may be called by its
LAPACK
name zpttrs.
3 Description
F07JSF (ZPTTRS) should be preceded by a call to
F07JRF (ZPTTRF), which computes a modified Cholesky factorization of the matrix
as
where
is a unit lower bidiagonal matrix and
is a diagonal matrix, with positive diagonal elements. F07JSF (ZPTTRS) then utilizes the factorization to solve the required equations. Note that the factorization may also be regarded as having the form
, where
is a unit upper bidiagonal matrix.
4 References
Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999)
LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia
http://www.netlib.org/lapack/lug
5 Parameters
- 1: – CHARACTER(1)Input
-
On entry: specifies the form of the factorization as follows:
- .
- .
Constraint:
or .
- 2: – INTEGERInput
-
On entry: , the order of the matrix .
Constraint:
.
- 3: – INTEGERInput
-
On entry: , the number of right-hand sides, i.e., the number of columns of the matrix .
Constraint:
.
- 4: – REAL (KIND=nag_wp) arrayInput
-
Note: the dimension of the array
D
must be at least
.
On entry: must contain the diagonal elements of the diagonal matrix from the or factorization of .
- 5: – COMPLEX (KIND=nag_wp) arrayInput
-
Note: the dimension of the array
E
must be at least
.
On entry: if
,
E must contain the
superdiagonal elements of the unit upper bidiagonal matrix
from the
factorization of
.
If
,
E must contain the
subdiagonal elements of the unit lower bidiagonal matrix
from the
factorization of
.
- 6: – COMPLEX (KIND=nag_wp) arrayInput/Output
-
Note: the second dimension of the array
B
must be at least
.
On entry: the by matrix of right-hand sides .
On exit: the by solution matrix .
- 7: – INTEGERInput
-
On entry: the first dimension of the array
B as declared in the (sub)program from which F07JSF (ZPTTRS) is called.
Constraint:
.
- 8: – INTEGEROutput
On exit:
unless the routine detects an error (see
Section 6).
6 Error Indicators and Warnings
If , argument had an illegal value. An explanatory message is output, and execution of the program is terminated.
7 Accuracy
The computed solution for a single right-hand side,
, satisfies an equation of the form
where
and
is the
machine precision. An approximate error bound for the computed solution is given by
where
, the condition number of
with respect to the solution of the linear equations. See Section 4.4 of
Anderson et al. (1999) for further details.
Following the use of this routine
F07JUF (ZPTCON) can be used to estimate the condition number of
and
F07JVF (ZPTRFS) can be used to obtain approximate error bounds.
8 Parallelism and Performance
F07JSF (ZPTTRS) is not threaded by NAG in any implementation.
F07JSF (ZPTTRS) makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.
Please consult the
X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the
Users' Note for your implementation for any additional implementation-specific information.
The total number of floating-point operations required to solve the equations is proportional to .
The real analogue of this routine is
F07JEF (DPTTRS).
10 Example
This example solves the equations
where
is the Hermitian positive definite tridiagonal matrix
and
10.1 Program Text
Program Text (f07jsfe.f90)
10.2 Program Data
Program Data (f07jsfe.d)
10.3 Program Results
Program Results (f07jsfe.r)