LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zggsvp3()

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

Definition at line 36 of file lapacke_zggsvp3.c.

45 {
46  lapack_int info = 0;
47  lapack_int* iwork = NULL;
48  double* rwork = NULL;
49  lapack_complex_double* tau = NULL;
50  lapack_complex_double* work = NULL;
51  lapack_int lwork = -1;
52  lapack_complex_double work_query;
53  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
54  LAPACKE_xerbla( "LAPACKE_zggsvp3", -1 );
55  return -1;
56  }
57 #ifndef LAPACK_DISABLE_NAN_CHECK
58  /* Optionally check input matrices for NaNs */
59  if( LAPACKE_zge_nancheck( matrix_layout, m, n, a, lda ) ) {
60  return -8;
61  }
62  if( LAPACKE_zge_nancheck( matrix_layout, p, n, b, ldb ) ) {
63  return -10;
64  }
65  if( LAPACKE_d_nancheck( 1, &tola, 1 ) ) {
66  return -12;
67  }
68  if( LAPACKE_d_nancheck( 1, &tolb, 1 ) ) {
69  return -13;
70  }
71 #endif
72  /* Query optimal size for working array */
73  info = LAPACKE_zggsvp3_work( matrix_layout, jobu, jobv, jobq, m, p, n, a, lda,
74  b, ldb, tola, tolb, k, l, u, ldu, v, ldv, q,
75  ldq, iwork, rwork, tau, &work_query, lwork );
76  if( info != 0 )
77  goto exit_level_0;
78  lwork = LAPACK_Z2INT( work_query );
79  /* Allocate memory for working array(s) */
80  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,n) );
81  if( iwork == NULL ) {
83  goto exit_level_0;
84  }
85  rwork = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,2*n) );
86  if( rwork == NULL ) {
88  goto exit_level_1;
89  }
90  tau = (lapack_complex_double*)
91  LAPACKE_malloc( sizeof(lapack_complex_double) * MAX(1,n) );
92  if( tau == NULL ) {
94  goto exit_level_2;
95  }
96  work = (lapack_complex_double*)
97  LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
98  if( work == NULL ) {
100  goto exit_level_3;
101  }
102  /* Call middle-level interface */
103  info = LAPACKE_zggsvp3_work( matrix_layout, jobu, jobv, jobq, m, p, n, a, lda,
104  b, ldb, tola, tolb, k, l, u, ldu, v, ldv, q,
105  ldq, iwork, rwork, tau, work, lwork );
106  /* Release memory and exit */
107  LAPACKE_free( work );
108 exit_level_3:
109  LAPACKE_free( tau );
110 exit_level_2:
111  LAPACKE_free( rwork );
112 exit_level_1:
113  LAPACKE_free( iwork );
114 exit_level_0:
115  if( info == LAPACK_WORK_MEMORY_ERROR ) {
116  LAPACKE_xerbla( "LAPACKE_zggsvp3", info );
117  }
118  return info;
119 }
#define LAPACK_Z2INT(x)
Definition: lapacke.h:117
#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
lapack_int LAPACKE_zggsvp3_work(int matrix_layout, char jobu, char jobv, char jobq, lapack_int m, lapack_int p, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, double tola, double tolb, lapack_int *k, lapack_int *l, lapack_complex_double *u, lapack_int ldu, lapack_complex_double *v, lapack_int ldv, lapack_complex_double *q, lapack_int ldq, lapack_int *iwork, double *rwork, lapack_complex_double *tau, lapack_complex_double *work, lapack_int lwork)
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
lapack_logical LAPACKE_d_nancheck(lapack_int n, const double *x, lapack_int incx)
#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: