BLAS/SRC/ctpsv.f(3)

πŸ’– NAME πŸ’–

BLAS/SRC/ctpsv.f β€” bestie, this is from the LAPACK manual (section 3, so it's the file-path-style page), and it's literally the home of ctpsv, your girl for solving triangular systems with complex numbers in packed form ✨


πŸŽ€ SYNOPSIS πŸŽ€

Functions/Subroutines

subroutine ctpsv (uplo, trans, diag, n, ap, x, incx)
    CTPSV

🌸 Function/Subroutine Documentation 🌸

subroutine ctpsv

subroutine ctpsv (character uplo, character trans, character diag, integer
    n, complex, dimension(*) ap, complex, dimension(*) x, integer incx)

CTPSV 🫢


✨ Purpose ✨

Okay so listen: CTPSV solves one of these systems of equations, no cap:

   A*x = b,   or   A**T*x = b,   or   A**H*x = b,

where b and x are n element vectors and A is an n by n unit, or non-unit, upper or lower triangular matrix, supplied in packed form πŸ’…

⚠️ Big important heads-up: there is no test for singularity or near-singularity included in this routine. Such tests must be performed before calling this routine. She will not warn you, she will just go. Periodt. 😭

🌈 Parameters 🌈

  • UPLO β€” CHARACTER*1. On entry, UPLO specifies whether the matrix is an upper or lower triangular matrix as follows:
    • UPLO = 'U' or 'u' β†’ A is an upper triangular matrix.
    • UPLO = 'L' or 'l' β†’ A is a lower triangular matrix.
  • TRANS β€” CHARACTER*1. On entry, TRANS specifies the equations to be solved as follows:
    • TRANS = 'N' or 'n' β†’ A*x = b.
    • TRANS = 'T' or 't' β†’ A**T*x = b.
    • TRANS = 'C' or 'c' β†’ A**H*x = b.
  • DIAG β€” CHARACTER*1. On entry, DIAG specifies whether or not A is unit triangular as follows:
    • DIAG = 'U' or 'u' β†’ A is assumed to be unit triangular.
    • DIAG = 'N' or 'n' β†’ A is not assumed to be unit triangular.
  • N β€” INTEGER. On entry, N specifies the order of the matrix A. N must be at least zero.
  • AP β€” COMPLEX array, dimension at least ( ( n*( n + 1 ) )/2 ). Before entry with UPLO = 'U' or 'u', the array AP must contain the upper triangular matrix packed sequentially, column by column, so that AP( 1 ) contains a( 1, 1 ), AP( 2 ) and AP( 3 ) contain a( 1, 2 ) and a( 2, 2 ) respectively, and so on. πŸ¦‹ Before entry with UPLO = 'L' or 'l', the array AP must contain the lower triangular matrix packed sequentially, column by column, so that AP( 1 ) contains a( 1, 1 ), AP( 2 ) and AP( 3 ) contain a( 2, 1 ) and a( 3, 1 ) respectively, and so on. πŸ¦‹ Note that when DIAG = 'U' or 'u', the diagonal elements of A are not referenced, but are assumed to be unity.
  • X β€” COMPLEX array, dimension at least ( 1 + ( n - 1 )*abs( INCX ) ). Before entry, the incremented array X must contain the n element right-hand side vector b. On exit, X is overwritten with the solution vector x. she gets replaced, that's the whole gig πŸ’…
  • INCX β€” INTEGER. On entry, INCX specifies the increment for the elements of X. INCX must not be zero.

πŸ‘‘ Author πŸ‘‘

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

πŸ’œ Further Details πŸ’œ

Level 2 Blas routine. ✨

-- Written on 22-October-1986.
   Jack Dongarra, Argonne National Lab.
   Jeremy Du Croz, Nag Central Office.
   Sven Hammarling, Nag Central Office.
   Richard Hanson, Sandia National Labs.

Definition at line 143 of file ctpsv.f.


🧚 Author 🧚

Generated automatically by Doxygen for LAPACK from the source code.


okay that's the whole page, you ate it, go solve some triangular systems bestie 🫢✨

Version 3.12.0 β€” Tue Nov 28 2023 12:08:41 β€” BLAS/SRC/ctpsv.f(3) πŸ’–πŸŽ€πŸŒΈ