LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches

◆ LAPACKE_ztgsen()

lapack_int LAPACKE_ztgsen ( int  matrix_layout,
lapack_int  ijob,
lapack_logical  wantq,
lapack_logical  wantz,
const lapack_logical select,
lapack_int  n,
lapack_complex_double a,
lapack_int  lda,
lapack_complex_double b,
lapack_int  ldb,
lapack_complex_double alpha,
lapack_complex_double beta,
lapack_complex_double q,
lapack_int  ldq,
lapack_complex_double z,
lapack_int  ldz,
lapack_int m,
double *  pl,
double *  pr,
double *  dif 
)

Definition at line 35 of file lapacke_ztgsen.c.

45{
46 lapack_int info = 0;
47 lapack_int liwork = -1;
48 lapack_int lwork = -1;
49 lapack_int* iwork = NULL;
50 lapack_complex_double* work = NULL;
51 lapack_int iwork_query;
52 lapack_complex_double work_query;
53 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
54 LAPACKE_xerbla( "LAPACKE_ztgsen", -1 );
55 return -1;
56 }
57#ifndef LAPACK_DISABLE_NAN_CHECK
58 if( LAPACKE_get_nancheck() ) {
59 /* Optionally check input matrices for NaNs */
60 if( LAPACKE_zge_nancheck( matrix_layout, n, n, a, lda ) ) {
61 return -7;
62 }
63 if( LAPACKE_zge_nancheck( matrix_layout, n, n, b, ldb ) ) {
64 return -9;
65 }
66 if( wantq ) {
67 if( LAPACKE_zge_nancheck( matrix_layout, n, n, q, ldq ) ) {
68 return -13;
69 }
70 }
71 if( wantz ) {
72 if( LAPACKE_zge_nancheck( matrix_layout, n, n, z, ldz ) ) {
73 return -15;
74 }
75 }
76 }
77#endif
78 /* Query optimal working array(s) size */
79 info = LAPACKE_ztgsen_work( matrix_layout, ijob, wantq, wantz, select, n, a,
80 lda, b, ldb, alpha, beta, q, ldq, z, ldz, m, pl,
81 pr, dif, &work_query, lwork, &iwork_query,
82 liwork );
83 if( info != 0 ) {
84 goto exit_level_0;
85 }
86 liwork = iwork_query;
87 lwork = LAPACK_Z2INT( work_query );
88 /* Allocate memory for work arrays */
89 if( ijob != 0 ) {
90 iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
91 if( iwork == NULL ) {
93 goto exit_level_0;
94 }
95 }
96 work = (lapack_complex_double*)
97 LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
98 if( work == NULL ) {
100 goto exit_level_1;
101 }
102 /* Call middle-level interface */
103 info = LAPACKE_ztgsen_work( matrix_layout, ijob, wantq, wantz, select, n, a,
104 lda, b, ldb, alpha, beta, q, ldq, z, ldz, m, pl,
105 pr, dif, work, lwork, iwork, liwork );
106 /* Release memory and exit */
107 LAPACKE_free( work );
108exit_level_1:
109 if( ijob != 0 ) {
110 LAPACKE_free( iwork );
111 }
112exit_level_0:
113 if( info == LAPACK_WORK_MEMORY_ERROR ) {
114 LAPACKE_xerbla( "LAPACKE_ztgsen", info );
115 }
116 return info;
117}
#define lapack_int
Definition: lapack.h:87
#define lapack_complex_double
Definition: lapack.h:64
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
lapack_int LAPACKE_ztgsen_work(int matrix_layout, lapack_int ijob, lapack_logical wantq, lapack_logical wantz, const lapack_logical *select, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, lapack_complex_double *alpha, lapack_complex_double *beta, lapack_complex_double *q, lapack_int ldq, lapack_complex_double *z, lapack_int ldz, lapack_int *m, double *pl, double *pr, double *dif, lapack_complex_double *work, lapack_int lwork, lapack_int *iwork, lapack_int liwork)
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
int LAPACKE_get_nancheck(void)
#define LAPACK_Z2INT(x)
Definition: lapacke.h:50
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
void LAPACKE_xerbla(const char *name, lapack_int info)
lapack_logical LAPACKE_zge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *a, lapack_int lda)
Here is the call graph for this function: