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

◆ 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 35 of file lapacke_zggsvp3.c.

44{
45 lapack_int info = 0;
46 lapack_int* iwork = NULL;
47 double* rwork = NULL;
48 lapack_complex_double* tau = NULL;
49 lapack_complex_double* work = NULL;
50 lapack_int lwork = -1;
51 lapack_complex_double work_query;
52 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
53 LAPACKE_xerbla( "LAPACKE_zggsvp3", -1 );
54 return -1;
55 }
56#ifndef LAPACK_DISABLE_NAN_CHECK
57 if( LAPACKE_get_nancheck() ) {
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 }
72#endif
73 /* Query optimal size for working array */
74 info = LAPACKE_zggsvp3_work( matrix_layout, jobu, jobv, jobq, m, p, n, a, lda,
75 b, ldb, tola, tolb, k, l, u, ldu, v, ldv, q,
76 ldq, iwork, rwork, tau, &work_query, lwork );
77 if( info != 0 )
78 goto exit_level_0;
79 lwork = LAPACK_Z2INT( work_query );
80 /* Allocate memory for working array(s) */
81 iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,n) );
82 if( iwork == NULL ) {
84 goto exit_level_0;
85 }
86 rwork = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,2*n) );
87 if( rwork == NULL ) {
89 goto exit_level_1;
90 }
93 if( tau == NULL ) {
95 goto exit_level_2;
96 }
97 work = (lapack_complex_double*)
98 LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
99 if( work == NULL ) {
101 goto exit_level_3;
102 }
103 /* Call middle-level interface */
104 info = LAPACKE_zggsvp3_work( matrix_layout, jobu, jobv, jobq, m, p, n, a, lda,
105 b, ldb, tola, tolb, k, l, u, ldu, v, ldv, q,
106 ldq, iwork, rwork, tau, work, lwork );
107 /* Release memory and exit */
108 LAPACKE_free( work );
109exit_level_3:
110 LAPACKE_free( tau );
111exit_level_2:
112 LAPACKE_free( rwork );
113exit_level_1:
114 LAPACKE_free( iwork );
115exit_level_0:
116 if( info == LAPACK_WORK_MEMORY_ERROR ) {
117 LAPACKE_xerbla( "LAPACKE_zggsvp3", info );
118 }
119 return info;
120}
#define lapack_int
Definition: lapack.h:87
#define lapack_complex_double
Definition: lapack.h:64
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
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 LAPACK_COL_MAJOR
Definition: lapacke.h:53
#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)
lapack_logical LAPACKE_d_nancheck(lapack_int n, const double *x, lapack_int incx)
#define MAX(x, y)
Definition: lapacke_utils.h:46
Here is the call graph for this function: