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

◆ LAPACKE_zggsvp()

lapack_int LAPACKE_zggsvp ( 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_zggsvp.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 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
51 LAPACKE_xerbla( "LAPACKE_zggsvp", -1 );
52 return -1;
53 }
54#ifndef LAPACK_DISABLE_NAN_CHECK
55 if( LAPACKE_get_nancheck() ) {
56 /* Optionally check input matrices for NaNs */
57 if( LAPACKE_zge_nancheck( matrix_layout, m, n, a, lda ) ) {
58 return -8;
59 }
60 if( LAPACKE_zge_nancheck( matrix_layout, p, n, b, ldb ) ) {
61 return -10;
62 }
63 if( LAPACKE_d_nancheck( 1, &tola, 1 ) ) {
64 return -12;
65 }
66 if( LAPACKE_d_nancheck( 1, &tolb, 1 ) ) {
67 return -13;
68 }
69 }
70#endif
71 /* Allocate memory for working array(s) */
72 iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,n) );
73 if( iwork == NULL ) {
75 goto exit_level_0;
76 }
77 rwork = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,2*n) );
78 if( rwork == NULL ) {
80 goto exit_level_1;
81 }
84 if( tau == NULL ) {
86 goto exit_level_2;
87 }
88 work = (lapack_complex_double*)
89 LAPACKE_malloc( sizeof(lapack_complex_double) * MAX(1,MAX3(3*n,m,p)) );
90 if( work == NULL ) {
92 goto exit_level_3;
93 }
94 /* Call middle-level interface */
95 info = LAPACKE_zggsvp_work( matrix_layout, jobu, jobv, jobq, m, p, n, a, lda,
96 b, ldb, tola, tolb, k, l, u, ldu, v, ldv, q,
97 ldq, iwork, rwork, tau, work );
98 /* Release memory and exit */
99 LAPACKE_free( work );
100exit_level_3:
101 LAPACKE_free( tau );
102exit_level_2:
103 LAPACKE_free( rwork );
104exit_level_1:
105 LAPACKE_free( iwork );
106exit_level_0:
107 if( info == LAPACK_WORK_MEMORY_ERROR ) {
108 LAPACKE_xerbla( "LAPACKE_zggsvp", info );
109 }
110 return info;
111}
#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
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
int LAPACKE_get_nancheck(void)
lapack_int LAPACKE_zggsvp_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)
#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 MAX3(x, y, z)
Definition: lapacke_utils.h:52
#define MAX(x, y)
Definition: lapacke_utils.h:46
Here is the call graph for this function: