LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_zggsvp3.c
Go to the documentation of this file.
1/*****************************************************************************
2 Copyright (c) 2014, Intel Corp.
3 All rights reserved.
4
5 Redistribution and use in source and binary forms, with or without
6 modification, are permitted provided that the following conditions are met:
7
8 * Redistributions of source code must retain the above copyright notice,
9 this list of conditions and the following disclaimer.
10 * Redistributions in binary form must reproduce the above copyright
11 notice, this list of conditions and the following disclaimer in the
12 documentation and/or other materials provided with the distribution.
13 * Neither the name of Intel Corporation nor the names of its contributors
14 may be used to endorse or promote products derived from this software
15 without specific prior written permission.
16
17 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
27 THE POSSIBILITY OF SUCH DAMAGE.
28*****************************************************************************
29* Contents: Native high-level C interface to LAPACK function zggsvp3
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_zggsvp3( int matrix_layout, char jobu, char jobv, char jobq,
39 double tola, double tolb, lapack_int* k,
43 lapack_int ldq )
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
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)