Skip site navigation (1)Skip section navigation (2)

FreeBSD Manual Pages

  
 
  

home | help
PZDTTRF(l)			       )			    PZDTTRF(l)

NAME
       PZDTTRF	-  compute a LU	factorization of an N-by-N complex tridiagonal
       diagonally dominant-like	distributed matrix A(1:N, JA:JA+N-1)

SYNOPSIS
       SUBROUTINE PZDTTRF( N, DL, D, DU, JA, DESCA, AF,	LAF, WORK, LWORK, INFO
			   )

	   INTEGER	   INFO, JA, LAF, LWORK, N

	   INTEGER	   DESCA( * )

	   COMPLEX*16	   AF( * ), D( * ), DL(	* ), DU( * ), WORK( * )

PURPOSE
       PZDTTRF	computes  a  LU	factorization of an N-by-N complex tridiagonal
       diagonally dominant-like	distributed matrix A(1:N, JA:JA+N-1). Reorder-
       ing  is	used  to  increase parallelism in the factorization.  This re-
       ordering	results	in factors that	are DIFFERENT from those  produced  by
       equivalent  sequential  codes. These factors cannot be used directly by
       users; however, they can	be used	in
       subsequent calls	to PZDTTRS to solve linear systems.

       The factorization has the form

	       P A(1:N,	JA:JA+N-1) P^T = L U

       where U is a tridiagonal	upper triangular matrix	and L  is  tridiagonal
       lower triangular, and P is a permutation	matrix.

ScaLAPACK version 1.7		13 August 2001			    PZDTTRF(l)

NAME | SYNOPSIS | PURPOSE

Want to link to this manual page? Use this URL:
<https://www.freebsd.org/cgi/man.cgi?query=pzdttrf&manpath=FreeBSD+12.0-RELEASE+and+Ports>

home | help