LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_ztgsja()

lapack_int LAPACKE_ztgsja ( int  matrix_layout,
char  jobu,
char  jobv,
char  jobq,
lapack_int  m,
lapack_int  p,
lapack_int  n,
lapack_int  k,
lapack_int  l,
lapack_complex_double a,
lapack_int  lda,
lapack_complex_double b,
lapack_int  ldb,
double  tola,
double  tolb,
double *  alpha,
double *  beta,
lapack_complex_double u,
lapack_int  ldu,
lapack_complex_double v,
lapack_int  ldv,
lapack_complex_double q,
lapack_int  ldq,
lapack_int ncycle 
)

Definition at line 36 of file lapacke_ztgsja.c.

46 {
47  lapack_int info = 0;
48  lapack_complex_double* work = NULL;
49  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
50  LAPACKE_xerbla( "LAPACKE_ztgsja", -1 );
51  return -1;
52  }
53 #ifndef LAPACK_DISABLE_NAN_CHECK
54  /* Optionally check input matrices for NaNs */
55  if( LAPACKE_zge_nancheck( matrix_layout, m, n, a, lda ) ) {
56  return -10;
57  }
58  if( LAPACKE_zge_nancheck( matrix_layout, p, n, b, ldb ) ) {
59  return -12;
60  }
61  if( LAPACKE_lsame( jobq, 'i' ) || LAPACKE_lsame( jobq, 'q' ) ) {
62  if( LAPACKE_zge_nancheck( matrix_layout, n, n, q, ldq ) ) {
63  return -22;
64  }
65  }
66  if( LAPACKE_d_nancheck( 1, &tola, 1 ) ) {
67  return -14;
68  }
69  if( LAPACKE_d_nancheck( 1, &tolb, 1 ) ) {
70  return -15;
71  }
72  if( LAPACKE_lsame( jobu, 'i' ) || LAPACKE_lsame( jobu, 'u' ) ) {
73  if( LAPACKE_zge_nancheck( matrix_layout, m, m, u, ldu ) ) {
74  return -18;
75  }
76  }
77  if( LAPACKE_lsame( jobv, 'i' ) || LAPACKE_lsame( jobv, 'v' ) ) {
78  if( LAPACKE_zge_nancheck( matrix_layout, p, p, v, ldv ) ) {
79  return -20;
80  }
81  }
82 #endif
83  /* Allocate memory for working array(s) */
84  work = (lapack_complex_double*)
85  LAPACKE_malloc( sizeof(lapack_complex_double) * MAX(1,2*n) );
86  if( work == NULL ) {
88  goto exit_level_0;
89  }
90  /* Call middle-level interface */
91  info = LAPACKE_ztgsja_work( matrix_layout, jobu, jobv, jobq, m, p, n, k, l,
92  a, lda, b, ldb, tola, tolb, alpha, beta, u, ldu,
93  v, ldv, q, ldq, work, ncycle );
94  /* Release memory and exit */
95  LAPACKE_free( work );
96 exit_level_0:
97  if( info == LAPACK_WORK_MEMORY_ERROR ) {
98  LAPACKE_xerbla( "LAPACKE_ztgsja", info );
99  }
100  return info;
101 }
lapack_int LAPACKE_ztgsja_work(int matrix_layout, char jobu, char jobv, char jobq, lapack_int m, lapack_int p, lapack_int n, lapack_int k, lapack_int l, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, double tola, double tolb, double *alpha, double *beta, lapack_complex_double *u, lapack_int ldu, lapack_complex_double *v, lapack_int ldv, lapack_complex_double *q, lapack_int ldq, lapack_complex_double *work, lapack_int *ncycle)
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:122
#define LAPACKE_free(p)
Definition: lapacke.h:113
#define lapack_complex_double
Definition: lapacke.h:90
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
lapack_logical LAPACKE_d_nancheck(lapack_int n, const double *x, lapack_int incx)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:36
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
void LAPACKE_xerbla(const char *name, lapack_int info)
#define lapack_int
Definition: lapacke.h:47
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: