LAPACK  3.10.0
LAPACK: Linear Algebra PACKage
lapacke_zuncsd2by1.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 zuncsd2by1
30 * Author: Intel Corporation
31 *****************************************************************************/
32 
33 #include "lapacke_utils.h"
34 
35 lapack_int LAPACKE_zuncsd2by1( int matrix_layout, char jobu1, char jobu2,
36  char jobv1t, lapack_int m, lapack_int p, lapack_int q,
39  double* theta, lapack_complex_double* u1,
41  lapack_int ldu2, lapack_complex_double* v1t, lapack_int ldv1t )
42 {
43  lapack_int info = 0;
44  lapack_int lrwork = -1;
45  lapack_int lwork = -1;
46  lapack_int* iwork = NULL;
47  double* rwork = NULL;
48  lapack_complex_double* work = NULL;
49  double rwork_query;
50  lapack_complex_double work_query;
51  lapack_int nrows_x11, nrows_x21;
52  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
53  LAPACKE_xerbla( "LAPACKE_zuncsd2by1", -1 );
54  return -1;
55  }
56 #ifndef LAPACK_DISABLE_NAN_CHECK
57  if( LAPACKE_get_nancheck() ) {
58  /* Optionally check input matrices for NaNs */
59  nrows_x11 = p;
60  nrows_x21 = m-p;
61  if( LAPACKE_zge_nancheck( matrix_layout, nrows_x11, q, x11, ldx11 ) ) {
62  return -8;
63  }
64 
65  if( LAPACKE_zge_nancheck( matrix_layout, nrows_x21, q, x21, ldx21 ) ) {
66  return -9;
67  }
68  }
69 #endif
70  /* Allocate memory for working array(s) */
71  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,m-MIN(MIN(p,m-p),MIN(q,m-q))) );
72  if( iwork == NULL ) {
74  goto exit_level_0;
75  }
76  /* Query optimal working array(s) size */
77  info = LAPACKE_zuncsd2by1_work( matrix_layout, jobu1, jobu2, jobv1t, m, p, q,
78  x11, ldx11, x21, ldx21, theta, u1, ldu1, u2,
79  ldu2, v1t, ldv1t, &work_query,
80  lwork, &rwork_query, lrwork, iwork );
81  if( info != 0 ) {
82  goto exit_level_2;
83  }
84  lrwork = (lapack_int)rwork_query;
85  lwork = LAPACK_Z2INT( work_query );
86  /* Allocate memory for work arrays */
87  rwork = (double*)LAPACKE_malloc( sizeof(double) * lrwork );
88  if( rwork == NULL ) {
90  goto exit_level_1;
91  }
93  if( work == NULL ) {
95  goto exit_level_2;
96  }
97  /* Call middle-level interface */
98  info = LAPACKE_zuncsd2by1_work( matrix_layout, jobu1, jobu2, jobv1t, m, p, q,
99  x11, ldx11, x21, ldx21, theta, u1, ldu1, u2,
100  ldu2, v1t, ldv1t, work, lwork, rwork, lrwork, iwork );
101  /* Release memory and exit */
102  LAPACKE_free( work );
103 exit_level_2:
104  LAPACKE_free( rwork );
105 exit_level_1:
106  LAPACKE_free( iwork );
107 exit_level_0:
108  if( info == LAPACK_WORK_MEMORY_ERROR ) {
109  LAPACKE_xerbla( "LAPACKE_zuncsd2by1", info );
110  }
111  return info;
112 }
#define lapack_int
Definition: lapack.h:83
#define lapack_complex_double
Definition: lapack.h:63
#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
lapack_int LAPACKE_zuncsd2by1_work(int matrix_layout, char jobu1, char jobu2, char jobv1t, lapack_int m, lapack_int p, lapack_int q, lapack_complex_double *x11, lapack_int ldx11, lapack_complex_double *x21, lapack_int ldx21, double *theta, lapack_complex_double *u1, lapack_int ldu1, lapack_complex_double *u2, lapack_int ldu2, lapack_complex_double *v1t, lapack_int ldv1t, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_int lrwork, lapack_int *iwork)
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)
#define MIN(x, y)
Definition: lapacke_utils.h:49
#define MAX(x, y)
Definition: lapacke_utils.h:46
lapack_int LAPACKE_zuncsd2by1(int matrix_layout, char jobu1, char jobu2, char jobv1t, lapack_int m, lapack_int p, lapack_int q, lapack_complex_double *x11, lapack_int ldx11, lapack_complex_double *x21, lapack_int ldx21, double *theta, lapack_complex_double *u1, lapack_int ldu1, lapack_complex_double *u2, lapack_int ldu2, lapack_complex_double *v1t, lapack_int ldv1t)