?dttrfb

Developer Reference for Intel® oneAPI Math Kernel Library for Fortran

Download PDF

ID 766686

Date 4/28/2026

Version

Public

?dttrfb

Computes the factorization of a diagonally dominant tridiagonal matrix.

Syntax

call sdttrfb ( n , dl , d , du , info )

call ddttrfb ( n , dl , d , du , info )

call cdttrfb ( n , dl , d , du , info )

call zdttrfb ( n , dl , d , du , info )

call dttrfb ( dl , d , du [ , info ] )

Include Files

mkl.fi , mkl_lapack.f90

Description

sdttrfb ddttrfb cdttrfb zdttrfb

The ?dttrfb routine computes the factorization of a real or complex tridiagonal matrix A with the BABE (Burning At Both Ends) algorithm without pivoting. The factorization has the form

\(A = L_1 U L_2\)

where

\(L_1\) and \(L_2\) are unit lower bidiagonal with k and n - k - 1 subdiagonal elements, respectively, where k = n /2, and
\(U\) is an upper bidiagonal matrix with nonzeroes in only the main diagonal and first superdiagonal.

Input Parameters

n

INTEGER . The order of the matrix A ; n ≥ 0.

dl , d , du

REAL for sdttrfb

DOUBLE PRECISION for ddttrfb

COMPLEX for cdttrfb

DOUBLE COMPLEX for zdttrfb .

Arrays containing elements of A .

The array dl of dimension (n - 1) contains the subdiagonal elements of A .

The array d of dimension n contains the diagonal elements of A .

The array du of dimension (n - 1) contains the superdiagonal elements of A .

Output Parameters

dl

Overwritten by the (n -1) multipliers that define the matrix L from the LU factorization of A .

d

Overwritten by the n diagonal element reciprocals of the upper triangular matrix U from the factorization of A .

du

Overwritten by the (n-1) elements of the superdiagonal of U .

info

INTEGER .

If info = 0 , the execution is successful.
If info = -i , the i -th parameter had an illegal value.
If info = i , \(U_{ii}\) is 0. The factorization has been completed, but U is exactly singular. Division by zero will occur if you use the factor U for solving a system of linear equations.

Application Notes

A diagonally dominant tridiagonal system is defined such that \(|d_{i}| > |dl_{i-1}| + |du_{i}|\) for any i :

1 < i < n , and \(|d_{1}| > |du_{1}|, |d_{n}| > |dl_{n-1}|\)

The underlying BABE algorithm is designed for diagonally dominant systems. Such systems are free from the numerical stability issue unlike the canonical systems that use elimination with partial pivoting (see ?gttrf (Computes the LU factorization of a tridiagonal matrix.) ). The diagonally dominant systems are much faster than the canonical systems.

NOTE:

The current implementation of BABE has a potential accuracy issue on very small or large data close to the underflow or overflow threshold respectively. Scale the matrix before applying the solver in the case of such input data. Applying the ?dttrfb factorization to non-diagonally dominant systems may lead to an accuracy loss, or false singularity detected due to no pivoting.

Select Your Language

Using Intel.com Search

Quick Links

Recent Searches

Advanced Search

Only search in

Developer Reference for Intel® oneAPI Math Kernel Library for Fortran

?dttrfb

Syntax

Include Files

Description

Input Parameters

Output Parameters

Application Notes