NAG Library Routine Document

f07brf  (zgbtrf)

 Contents

    1  Purpose
    7  Accuracy

1
Purpose

f07brf (zgbtrf) computes the LU factorization of a complex m by n band matrix.

2
Specification

Fortran Interface
Subroutine f07brf ( m, n, kl, ku, ab, ldab, ipiv, info)
Integer, Intent (In):: m, n, kl, ku, ldab
Integer, Intent (Out):: ipiv(min(m,n)), info
Complex (Kind=nag_wp), Intent (Inout):: ab(ldab,*)
C Header Interface
#include nagmk26.h
void  f07brf_ ( const Integer *m, const Integer *n, const Integer *kl, const Integer *ku, Complex ab[], const Integer *ldab, Integer ipiv[], Integer *info)
The routine may be called by its LAPACK name zgbtrf.

3
Description

f07brf (zgbtrf) forms the LU factorization of a complex m by n band matrix A using partial pivoting, with row interchanges. Usually m=n, and then, if A has kl nonzero subdiagonals and ku nonzero superdiagonals, the factorization has the form A=PLU, where P is a permutation matrix, L is a lower triangular matrix with unit diagonal elements and at most kl nonzero elements in each column, and U is an upper triangular band matrix with kl+ku superdiagonals.
Note that L is not a band matrix, but the nonzero elements of L can be stored in the same space as the subdiagonal elements of A. U is a band matrix but with kl additional superdiagonals compared with A. These additional superdiagonals are created by the row interchanges.

4
References

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

5
Arguments

1:     m – IntegerInput
On entry: m, the number of rows of the matrix A.
Constraint: m0.
2:     n – IntegerInput
On entry: n, the number of columns of the matrix A.
Constraint: n0.
3:     kl – IntegerInput
On entry: kl, the number of subdiagonals within the band of the matrix A.
Constraint: kl0.
4:     ku – IntegerInput
On entry: ku, the number of superdiagonals within the band of the matrix A.
Constraint: ku0.
5:     abldab* – Complex (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array ab must be at least max1,n.
On entry: the m by n matrix A.
The matrix is stored in rows kl+1 to 2kl+ku+1; the first kl rows need not be set, more precisely, the element Aij must be stored in
abkl+ku+1+i-jj=Aij  for ​max1,j-kuiminm,j+kl. 
See Section 9 in f07bnf (zgbsv) for further details.
On exit: if info0, ab is overwritten by details of the factorization.
The upper triangular band matrix U, with kl+ku superdiagonals, is stored in rows 1 to kl+ku+1 of the array, and the multipliers used to form the matrix L are stored in rows kl+ku+2 to 2kl+ku+1.
6:     ldab – IntegerInput
On entry: the first dimension of the array ab as declared in the (sub)program from which f07brf (zgbtrf) is called.
Constraint: ldab2×kl+ku+1.
7:     ipivminm,n – Integer arrayOutput
On exit: the pivot indices that define the permutation matrix. At the ith step, if ipivi>i then row i of the matrix A was interchanged with row ipivi, for i=1,2,,minm,n. ipivii indicates that, at the ith step, a row interchange was not required.
8:     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.
If info=-999, dynamic memory allocation failed. See Section 3.7 in How to Use the NAG Library and its Documentation for further information. An explanatory message is output, and execution of the program is terminated.
info>0
Element value of the diagonal is exactly zero. The factorization has been completed, but the factor U is exactly singular, and division by zero will occur if it is used to solve a system of equations.

7
Accuracy

The computed factors L and U are the exact factors of a perturbed matrix A+E, where
EckεPLU ,  
ck is a modest linear function of k=kl+ku+1, and ε is the machine precision. This assumes k minm,n .

8
Parallelism and Performance

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

The total number of real floating-point operations varies between approximately 8nklku+1 and 8nklkl+ku+1, depending on the interchanges, assuming m=nkl and nku.
A call to f07brf (zgbtrf) may be followed by calls to the routines:
The real analogue of this routine is f07bdf (dgbtrf).

10
Example

This example computes the LU factorization of the matrix A, where
A= -1.65+2.26i -2.05-0.85i 0.97-2.84i 0.00+0.00i 0.00+6.30i -1.48-1.75i -3.99+4.01i 0.59-0.48i 0.00+0.00i -0.77+2.83i -1.06+1.94i 3.33-1.04i 0.00+0.00i 0.00+0.00i 4.48-1.09i -0.46-1.72i .  
Here A is treated as a band matrix with one subdiagonal and two superdiagonals.

10.1
Program Text

Program Text (f07brfe.f90)

10.2
Program Data

Program Data (f07brfe.d)

10.3
Program Results

Program Results (f07brfe.r)

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