ZPTSVX(3)
π ZPTSVX(3) π
okay so bestie, welcome to the LAPACK Library Functions Manual β this is the zptsvx.f(3) page, and itβs literally about solving a complex Hermitian positive definite tridiagonal system with error bounds and a condition estimate. Linear algebra main character energy, fr fr. π«Ά
β¨ NAME β¨
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zptsvx.f β thatβs the source path, bestie. Thatβs the name this page is filed under, no cap.
πΈ SYNOPSIS πΈ
Functions/Subroutines
subroutine ZPTSVX (fact, n, nrhs, d, e, df, ef, b, ldb, x, ldx, rcond,
ferr, berr, work, rwork, info)
ZPTSVX computes the solution to system of linear equations A * X = B for PT matrices.
π¦ Function/Subroutine Documentation π¦
subroutine ZPTSVX (character fact, integer n, integer nrhs, double
precision, dimension( * ) d, complex*16, dimension( * ) e, double
precision, dimension( * ) df, complex*16, dimension( * ) ef, complex*16,
dimension( ldb, * ) b, integer ldb, complex*16, dimension( ldx, * ) x,
integer ldx, double precision rcond, double precision, dimension( * )
ferr, double precision, dimension( * ) berr, complex*16, dimension( * )
work, double precision, dimension( * ) rwork, integer info)
ZPTSVX computes the solution to system of linear equations A * X = B for PT matrices.
π Purpose π
ZPTSVX uses the factorization A = L*D*L**H to compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix and X and B are N-by-NRHS matrices.
Error bounds on the solution and a condition estimate are also provided. Obsessed, honestly. β¨
π Description π
The following steps are performed:
- If
FACT = 'N', the matrixAis factored asA = L*D*L**H, whereLis a unit lower bidiagonal matrix andDis diagonal. The factorization can also be regarded as having the formA = U**H*D*U. - If the leading principal minor of order
iis not positive, then the routine returns withINFO = i. Otherwise, the factored form ofAis used to estimate the condition number of the matrixA. If the reciprocal of the condition number is less than machine precision,INFO = N+1is returned as a warning, but the routine still goes on to solve forXand compute error bounds as described below. - The system of equations is solved for
Xusing the factored form ofA. - Iterative refinement is applied to improve the computed solution matrix and calculate error bounds and backward error estimates for it.
π Parameters π
FACTβFACTisCHARACTER*1. It specifies whether or not the factored form of the matrixAis supplied on entry.= 'F': on entry,DFandEFcontain the factored form ofA.D,E,DF, andEFwill not be modified.= 'N': the matrixAwill be copied toDFandEFand factored.NβNisINTEGER. The order of the matrixA.N >= 0.NRHSβNRHSisINTEGER. The number of right hand sides, i.e., the number of columns of the matricesBandX.NRHS >= 0.DβDisDOUBLE PRECISION array, dimension (N). Thendiagonal elements of the tridiagonal matrixA.EβEisCOMPLEX*16 array, dimension (N-1). The(n-1)subdiagonal elements of the tridiagonal matrixA.DFβDFisDOUBLE PRECISION array, dimension (N). IfFACT = 'F', thenDFis an input argument and on entry contains thendiagonal elements of the diagonal matrixDfrom theL*D*L**Hfactorization ofA. IfFACT = 'N', thenDFis an output argument and on exit contains thendiagonal elements of the diagonal matrixDfrom theL*D*L**Hfactorization ofA.EFβEFisCOMPLEX*16 array, dimension (N-1). IfFACT = 'F', thenEFis an input argument and on entry contains the(n-1)subdiagonal elements of the unit bidiagonal factorLfrom theL*D*L**Hfactorization ofA. IfFACT = 'N', thenEFis an output argument and on exit contains the(n-1)subdiagonal elements of the unit bidiagonal factorLfrom theL*D*L**Hfactorization ofA.BβBisCOMPLEX*16 array, dimension (LDB,NRHS). TheN-by-NRHSright hand side matrixB.LDBβLDBisINTEGER. The leading dimension of the arrayB.LDB >= max(1,N).XβXisCOMPLEX*16 array, dimension (LDX,NRHS). IfINFO = 0orINFO = N+1, theN-by-NRHSsolution matrixX.LDXβLDXisINTEGER. The leading dimension of the arrayX.LDX >= max(1,N).RCONDβRCONDisDOUBLE PRECISION. The reciprocal condition number of the matrixA. IfRCONDis less than the machine precision (in particular, ifRCOND = 0), the matrix is singular to working precision. This condition is indicated by a return code ofINFO > 0.FERRβFERRisDOUBLE PRECISION array, dimension (NRHS). The forward error bound for each solution vectorX(j)(thej-th column of the solution matrixX). IfXTRUEis the true solution corresponding toX(j),FERR(j)is an estimated upper bound for the magnitude of the largest element in(X(j) - XTRUE)divided by the magnitude of the largest element inX(j).BERRβBERRisDOUBLE PRECISION array, dimension (NRHS). The componentwise relative backward error of each solution vectorX(j)(i.e., the smallest relative change in any element ofAorBthat makesX(j)an exact solution).WORKβWORKisCOMPLEX*16 array, dimension (N).RWORKβRWORKisDOUBLE PRECISION array, dimension (N).INFOβINFOisINTEGER.= 0: successful exit.< 0: ifINFO = -i, thei-th argument had an illegal value.> 0: ifINFO = i, andiis<= N: the leading principal minor of orderiofAis not positive, so the factorization could not be completed, and the solution has not been computed.RCOND = 0is returned.= N+1:Uis nonsingular, butRCONDis less than machine precision, meaning that the matrix is singular to working precision. Nevertheless, the solution and error bounds are computed because there are a number of situations where the computed solution can be more accurate than the value ofRCONDwould suggest.
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 232 of file zptsvx.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code. Itβs giving auto-generated but make it cute. π
thatβs the whole page, bestie π«Ά β signed off by LAPACK Version 3.12.0 and the page path /home/abui...RC/zptsvx.f(3). mwah π
π¦ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms