NAG CL Interface
f07fvc (zporfs)

Settings help

CL Name Style:


1 Purpose

f07fvc returns error bounds for the solution of a complex Hermitian positive definite system of linear equations with multiple right-hand sides, AX=B. It improves the solution by iterative refinement, in order to reduce the backward error as much as possible.

2 Specification

#include <nag.h>
void  f07fvc (Nag_OrderType order, Nag_UploType uplo, Integer n, Integer nrhs, const Complex a[], Integer pda, const Complex af[], Integer pdaf, const Complex b[], Integer pdb, Complex x[], Integer pdx, double ferr[], double berr[], NagError *fail)
The function may be called by the names: f07fvc, nag_lapacklin_zporfs or nag_zporfs.

3 Description

f07fvc returns the backward errors and estimated bounds on the forward errors for the solution of a complex Hermitian positive definite system of linear equations with multiple right-hand sides AX=B. The function handles each right-hand side vector (stored as a column of the matrix B) independently, so we describe the function of f07fvc in terms of a single right-hand side b and solution x.
Given a computed solution x, the function 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+δA)x=b+δb |δaij|β|aij|   and   |δbi|β|bi| .  
Then the function estimates a bound for the component-wise forward error in the computed solution, defined by:
maxi|xi-x^i|/maxi|xi|  
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: order Nag_OrderType Input
On entry: the order argument specifies the two-dimensional storage scheme being used, i.e., row-major ordering or column-major ordering. C language defined storage is specified by order=Nag_RowMajor. See Section 3.1.3 in the Introduction to the NAG Library CL Interface for a more detailed explanation of the use of this argument.
Constraint: order=Nag_RowMajor or Nag_ColMajor.
2: uplo Nag_UploType Input
On entry: specifies whether the upper or lower triangular part of A is stored and how A is to be factorized.
uplo=Nag_Upper
The upper triangular part of A is stored and A is factorized as UHU, where U is upper triangular.
uplo=Nag_Lower
The lower triangular part of A is stored and A is factorized as LLH, where L is lower triangular.
Constraint: uplo=Nag_Upper or Nag_Lower.
3: n Integer Input
On entry: n, the order of the matrix A.
Constraint: n0.
4: nrhs Integer Input
On entry: r, the number of right-hand sides.
Constraint: nrhs0.
5: a[dim] const Complex Input
Note: the dimension, dim, of the array a must be at least max(1,pda×n).
On entry: the n×n original Hermitian positive definite matrix A as supplied to f07frc.
6: pda Integer Input
On entry: the stride separating row or column elements (depending on the value of order) of the matrix in the array a.
Constraint: pdamax(1,n).
7: af[dim] const Complex Input
Note: the dimension, dim, of the array af must be at least max(1,pdaf×n).
On entry: the Cholesky factor of A, as returned by f07frc.
8: pdaf Integer Input
On entry: the stride separating row or column elements (depending on the value of order) of the matrix in the array af.
Constraint: pdafmax(1,n).
9: b[dim] const Complex Input
Note: the dimension, dim, of the array b must be at least
  • max(1,pdb×nrhs) when order=Nag_ColMajor;
  • max(1,n×pdb) when order=Nag_RowMajor.
The (i,j)th element of the matrix B is stored in
  • b[(j-1)×pdb+i-1] when order=Nag_ColMajor;
  • b[(i-1)×pdb+j-1] when order=Nag_RowMajor.
On entry: the n×r right-hand side matrix B.
10: pdb Integer Input
On entry: the stride separating row or column elements (depending on the value of order) in the array b.
Constraints:
  • if order=Nag_ColMajor, pdbmax(1,n);
  • if order=Nag_RowMajor, pdbmax(1,nrhs).
11: x[dim] Complex Input/Output
Note: the dimension, dim, of the array x must be at least
  • max(1,pdx×nrhs) when order=Nag_ColMajor;
  • max(1,n×pdx) when order=Nag_RowMajor.
The (i,j)th element of the matrix X is stored in
  • x[(j-1)×pdx+i-1] when order=Nag_ColMajor;
  • x[(i-1)×pdx+j-1] when order=Nag_RowMajor.
On entry: the n×r solution matrix X, as returned by f07fsc.
On exit: the improved solution matrix X.
12: pdx Integer Input
On entry: the stride separating row or column elements (depending on the value of order) in the array x.
Constraints:
  • if order=Nag_ColMajor, pdxmax(1,n);
  • if order=Nag_RowMajor, pdxmax(1,nrhs).
13: ferr[nrhs] double Output
On exit: ferr[j-1] contains an estimated error bound for the jth solution vector, that is, the jth column of X, for j=1,2,,r.
14: berr[nrhs] double Output
On exit: berr[j-1] contains the component-wise backward error bound β for the jth solution vector, that is, the jth column of X, for j=1,2,,r.
15: fail NagError * Input/Output
The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

6 Error Indicators and Warnings

NE_ALLOC_FAIL
Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
NE_BAD_PARAM
On entry, argument value had an illegal value.
NE_INT
On entry, n=value.
Constraint: n0.
On entry, nrhs=value.
Constraint: nrhs0.
On entry, pda=value.
Constraint: pda>0.
On entry, pdaf=value.
Constraint: pdaf>0.
On entry, pdb=value.
Constraint: pdb>0.
On entry, pdx=value.
Constraint: pdx>0.
NE_INT_2
On entry, pda=value and n=value.
Constraint: pdamax(1,n).
On entry, pdaf=value and n=value.
Constraint: pdafmax(1,n).
On entry, pdb=value and n=value.
Constraint: pdbmax(1,n).
On entry, pdb=value and nrhs=value.
Constraint: pdbmax(1,nrhs).
On entry, pdx=value and n=value.
Constraint: pdxmax(1,n).
On entry, pdx=value and nrhs=value.
Constraint: pdxmax(1,nrhs).
NE_INTERNAL_ERROR
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
NE_NO_LICENCE
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.

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

f07fvc is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f07fvc 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 function. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

For each right-hand side, computation of the backward error involves a minimum of 16n2 real floating-point operations. Each step of iterative refinement involves an additional 24n2 real operations. At most five steps of iterative refinement are performed, but usually only one or two steps are required.
Estimating the forward error involves solving a number of systems of linear equations of the form Ax=b; the number is usually 5 and never more than 11. Each solution involves approximately 8n2 real operations.
The real analogue of this function is f07fhc.

10 Example

This example solves the system of equations AX=B using iterative refinement and to compute the forward and backward error bounds, where
A= ( 3.23+0.00i 1.51-1.92i 1.90+0.84i 0.42+2.50i 1.51+1.92i 3.58+0.00i -0.23+1.11i -1.18+1.37i 1.90-0.84i -0.23-1.11i 4.09+0.00i 2.33-0.14i 0.42-2.50i -1.18-1.37i 2.33+0.14i 4.29+0.00i )  
and
B= ( 3.93-06.14i 1.48+06.58i 6.17+09.42i 4.65-04.75i -7.17-21.83i -4.91+02.29i 1.99-14.38i 7.64-10.79i ) .  
Here A is Hermitian positive definite and must first be factorized by f07frc.

10.1 Program Text

Program Text (f07fvce.c)

10.2 Program Data

Program Data (f07fvce.d)

10.3 Program Results

Program Results (f07fvce.r)