NAG FL Interface
f04baf (real_square_solve)
1
Purpose
f04baf computes the solution to a real system of linear equations , where is an by matrix and and are by matrices. An estimate of the condition number of and an error bound for the computed solution are also returned.
2
Specification
Fortran Interface
Integer, Intent (In) |
:: |
n, nrhs, lda, ldb |
Integer, Intent (Inout) |
:: |
ifail |
Integer, Intent (Out) |
:: |
ipiv(n) |
Real (Kind=nag_wp), Intent (Inout) |
:: |
a(lda,*), b(ldb,*) |
Real (Kind=nag_wp), Intent (Out) |
:: |
rcond, errbnd |
|
C Header Interface
#include <nag.h>
void |
f04baf_ (const Integer *n, const Integer *nrhs, double a[], const Integer *lda, Integer ipiv[], double b[], const Integer *ldb, double *rcond, double *errbnd, Integer *ifail) |
|
C++ Header Interface
#include <nag.h> extern "C" {
void |
f04baf_ (const Integer &n, const Integer &nrhs, double a[], const Integer &lda, Integer ipiv[], double b[], const Integer &ldb, double &rcond, double &errbnd, Integer &ifail) |
}
|
The routine may be called by the names f04baf or nagf_linsys_real_square_solve.
3
Description
The decomposition with partial pivoting and row interchanges is used to factor as , where is a permutation matrix, is unit lower triangular, and is upper triangular. The factored form of is then used to solve the system of equations .
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
https://www.netlib.org/lapack/lug
Higham N J (2002) Accuracy and Stability of Numerical Algorithms (2nd Edition) SIAM, Philadelphia
5
Arguments
-
1:
– Integer
Input
-
On entry: the number of linear equations , i.e., the order of the matrix .
Constraint:
.
-
2:
– Integer
Input
-
On entry: the number of right-hand sides , i.e., the number of columns of the matrix .
Constraint:
.
-
3:
– Real (Kind=nag_wp) array
Input/Output
-
Note: the second dimension of the array
a
must be at least
.
On entry: the by coefficient matrix .
On exit: if , the factors and from the factorization . The unit diagonal elements of are not stored.
-
4:
– Integer
Input
-
On entry: the first dimension of the array
a as declared in the (sub)program from which
f04baf is called.
Constraint:
.
-
5:
– Integer array
Output
-
On exit: if , the pivot indices that define the permutation matrix ; at the th step row of the matrix was interchanged with row . indicates a row interchange was not required.
-
6:
– Real (Kind=nag_wp) array
Input/Output
-
Note: the second dimension of the array
b
must be at least
.
On entry: the by matrix of right-hand sides .
On exit: if or , the by solution matrix .
-
7:
– Integer
Input
-
On entry: the first dimension of the array
b as declared in the (sub)program from which
f04baf is called.
Constraint:
.
-
8:
– Real (Kind=nag_wp)
Output
-
On exit: if no constraints are violated, an estimate of the reciprocal of the condition number of the matrix , computed as .
-
9:
– Real (Kind=nag_wp)
Output
-
On exit: if
or
, an estimate of the forward error bound for a computed solution
, such that
, where
is a column of the computed solution returned in the array
b and
is the corresponding column of the exact solution
. If
rcond is less than
machine precision,
errbnd is returned as unity.
-
10:
– Integer
Input/Output
-
On entry:
ifail must be set to
,
. If you are unfamiliar with this argument you should refer to
Section 4 in the Introduction to the NAG Library FL Interface for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value
is recommended. If the output of error messages is undesirable, then the value
is recommended. Otherwise, if you are not familiar with this argument, the recommended value is
.
When the value is used it is essential to test the value of ifail on exit.
On exit:
unless the routine detects an error or a warning has been flagged (see
Section 6).
6
Error Indicators and Warnings
If on entry
or
, explanatory error messages are output on the current error message unit (as defined by
x04aaf).
Errors or warnings detected by the routine:
-
Diagonal element of the upper triangular factor is zero. The factorization has been completed, but the solution could not be computed.
-
A solution has been computed, but
rcond is less than
machine precision so that the matrix
is numerically singular.
-
On entry, .
Constraint: .
-
On entry, .
Constraint: .
-
On entry, and .
Constraint: .
-
On entry, and .
Constraint: .
An unexpected error has been triggered by this routine. Please
contact
NAG.
See
Section 7 in the Introduction to the NAG Library FL Interface for further information.
Your licence key may have expired or may not have been installed correctly.
See
Section 8 in the Introduction to the NAG Library FL Interface for further information.
Dynamic memory allocation failed.
The integer allocatable memory required is
n, and the real allocatable memory required is
. In this case the factorization and the solution
have been computed, but
rcond and
errbnd have not been computed.
See
Section 9 in the Introduction to the NAG Library FL Interface for further information.
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.
f04baf uses the approximation
to estimate
errbnd. See Section 4.4 of
Anderson et al. (1999) for further details.
8
Parallelism and Performance
f04baf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f04baf 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 condition number estimation typically requires between four and five solves and never more than eleven solves, following the factorization.
In practice the condition number estimator is very reliable, but it can underestimate the true condition number; see Section 15.3 of
Higham (2002) for further details.
The complex analogue of
f04baf is
f04caf.
10
Example
This example solves the equations
where
An estimate of the condition number of and an approximate error bound for the computed solutions are also printed.
10.1
Program Text
10.2
Program Data
10.3
Program Results