NAG Library Routine Document

f07uhf  (dtprfs)

 Contents

    1  Purpose
    7  Accuracy

1
Purpose

f07uhf (dtprfs) returns error bounds for the solution of a real triangular system of linear equations with multiple right-hand sides, AX=B or ATX=B, using packed storage.

2
Specification

Fortran Interface
Subroutine f07uhf ( uplo, trans, diag, n, nrhs, ap, b, ldb, x, ldx, ferr, berr, work, iwork, info)
Integer, Intent (In):: n, nrhs, ldb, ldx
Integer, Intent (Out):: iwork(n), info
Real (Kind=nag_wp), Intent (In):: ap(*), b(ldb,*), x(ldx,*)
Real (Kind=nag_wp), Intent (Out):: ferr(nrhs), berr(nrhs), work(3*n)
Character (1), Intent (In):: uplo, trans, diag
C Header Interface
#include nagmk26.h
void  f07uhf_ ( const char *uplo, const char *trans, const char *diag, const Integer *n, const Integer *nrhs, const double ap[], const double b[], const Integer *ldb, const double x[], const Integer *ldx, double ferr[], double berr[], double work[], Integer iwork[], Integer *info, const Charlen length_uplo, const Charlen length_trans, const Charlen length_diag)
The routine may be called by its LAPACK name dtprfs.

3
Description

f07uhf (dtprfs) returns the backward errors and estimated bounds on the forward errors for the solution of a real triangular system of linear equations with multiple right-hand sides AX=B or ATX=B, using packed storage. The routine handles each right-hand side vector (stored as a column of the matrix B) independently, so we describe the function of f07uhf (dtprfs) in terms of a single right-hand side b and solution x.
Given a computed solution x, the routine computes the component-wise backward error β. This is the size of the smallest relative perturbation in each element of A and b such that x is the exact solution of a perturbed system
A+δAx=b+δb δaijβaij   and   δbiβbi .  
Then the routine estimates a bound for the component-wise forward error in the computed solution, defined by:
maxixi-x^i/maxixi  
where x^ is the true solution.
For details of the method, see the F07 Chapter Introduction.

4
References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

5
Arguments

1:     uplo – Character(1)Input
On entry: specifies whether A is upper or lower triangular.
uplo='U'
A is upper triangular.
uplo='L'
A is lower triangular.
Constraint: uplo='U' or 'L'.
2:     trans – Character(1)Input
On entry: indicates the form of the equations.
trans='N'
The equations are of the form AX=B.
trans='T' or 'C'
The equations are of the form ATX=B.
Constraint: trans='N', 'T' or 'C'.
3:     diag – Character(1)Input
On entry: indicates whether A is a nonunit or unit triangular matrix.
diag='N'
A is a nonunit triangular matrix.
diag='U'
A is a unit triangular matrix; the diagonal elements are not referenced and are assumed to be 1.
Constraint: diag='N' or 'U'.
4:     n – IntegerInput
On entry: n, the order of the matrix A.
Constraint: n0.
5:     nrhs – IntegerInput
On entry: r, the number of right-hand sides.
Constraint: nrhs0.
6:     ap* – Real (Kind=nag_wp) arrayInput
Note: the dimension of the array ap must be at least max1,n×n+1/2.
On entry: the n by n triangular matrix A, packed by columns.
More precisely,
  • if uplo='U', the upper triangle of A must be stored with element Aij in api+jj-1/2 for ij;
  • if uplo='L', the lower triangle of A must be stored with element Aij in api+2n-jj-1/2 for ij.
If diag='U', the diagonal elements of A are assumed to be 1, and are not referenced; the same storage scheme is used whether diag='N' or ‘U’.
7:     bldb* – Real (Kind=nag_wp) arrayInput
Note: the second dimension of the array b must be at least max1,nrhs.
On entry: the n by r right-hand side matrix B.
8:     ldb – IntegerInput
On entry: the first dimension of the array b as declared in the (sub)program from which f07uhf (dtprfs) is called.
Constraint: ldbmax1,n.
9:     xldx* – Real (Kind=nag_wp) arrayInput
Note: the second dimension of the array x must be at least max1,nrhs.
On entry: the n by r solution matrix X, as returned by f07uef (dtptrs).
10:   ldx – IntegerInput
On entry: the first dimension of the array x as declared in the (sub)program from which f07uhf (dtprfs) is called.
Constraint: ldxmax1,n.
11:   ferrnrhs – Real (Kind=nag_wp) arrayOutput
On exit: ferrj contains an estimated error bound for the jth solution vector, that is, the jth column of X, for j=1,2,,r.
12:   berrnrhs – Real (Kind=nag_wp) arrayOutput
On exit: berrj contains the component-wise backward error bound β for the jth solution vector, that is, the jth column of X, for j=1,2,,r.
13:   work3×n – Real (Kind=nag_wp) arrayWorkspace
14:   iworkn – Integer arrayWorkspace
15:   info – IntegerOutput
On exit: info=0 unless the routine detects an error (see Section 6).

6
Error Indicators and Warnings

info<0
If info=-i, argument i had an illegal value. An explanatory message is output, and execution of the program is terminated.

7
Accuracy

The bounds returned in ferr are not rigorous, because they are estimated, not computed exactly; but in practice they almost always overestimate the actual error.

8
Parallelism and Performance

f07uhf (dtprfs) is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f07uhf (dtprfs) 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.

9
Further Comments

A call to f07uhf (dtprfs), for each right-hand side, involves solving a number of systems of linear equations of the form Ax=b or ATx=b; the number is usually 4 or 5 and never more than 11. Each solution involves approximately n2 floating-point operations.
The complex analogue of this routine is f07uvf (ztprfs).

10
Example

This example solves the system of equations AX=B and to compute forward and backward error bounds, where
A= 4.30 0.00 0.00 0.00 -3.96 -4.87 0.00 0.00 0.40 0.31 -8.02 0.00 -0.27 0.07 -5.95 0.12   and   B= -12.90 -21.50 16.75 14.93 -17.55 6.33 -11.04 8.09 ,  
using packed storage for A.

10.1
Program Text

Program Text (f07uhfe.f90)

10.2
Program Data

Program Data (f07uhfe.d)

10.3
Program Results

Program Results (f07uhfe.r)

© The Numerical Algorithms Group Ltd, Oxford, UK. 2017