LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_ztgsen.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 ztgsen
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_ztgsen( int matrix_layout, lapack_int ijob,
36 lapack_logical wantq, lapack_logical wantz,
37 const lapack_logical* select, lapack_int n,
44 lapack_int* m, double* pl, double* pr, double* dif )
45{
46 lapack_int info = 0;
47 lapack_int liwork = -1;
48 lapack_int lwork = -1;
49 lapack_int* iwork = NULL;
50 lapack_complex_double* work = NULL;
51 lapack_int iwork_query;
52 lapack_complex_double work_query;
53 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
54 LAPACKE_xerbla( "LAPACKE_ztgsen", -1 );
55 return -1;
56 }
57#ifndef LAPACK_DISABLE_NAN_CHECK
58 if( LAPACKE_get_nancheck() ) {
59 /* Optionally check input matrices for NaNs */
60 if( LAPACKE_zge_nancheck( matrix_layout, n, n, a, lda ) ) {
61 return -7;
62 }
63 if( LAPACKE_zge_nancheck( matrix_layout, n, n, b, ldb ) ) {
64 return -9;
65 }
66 if( wantq ) {
67 if( LAPACKE_zge_nancheck( matrix_layout, n, n, q, ldq ) ) {
68 return -13;
69 }
70 }
71 if( wantz ) {
72 if( LAPACKE_zge_nancheck( matrix_layout, n, n, z, ldz ) ) {
73 return -15;
74 }
75 }
76 }
77#endif
78 /* Query optimal working array(s) size */
79 info = LAPACKE_ztgsen_work( matrix_layout, ijob, wantq, wantz, select, n, a,
80 lda, b, ldb, alpha, beta, q, ldq, z, ldz, m, pl,
81 pr, dif, &work_query, lwork, &iwork_query,
82 liwork );
83 if( info != 0 ) {
84 goto exit_level_0;
85 }
86 liwork = iwork_query;
87 lwork = LAPACK_Z2INT( work_query );
88 /* Allocate memory for work arrays */
89 if( ijob != 0 ) {
90 iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
91 if( iwork == NULL ) {
93 goto exit_level_0;
94 }
95 }
96 work = (lapack_complex_double*)
97 LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
98 if( work == NULL ) {
100 goto exit_level_1;
101 }
102 /* Call middle-level interface */
103 info = LAPACKE_ztgsen_work( matrix_layout, ijob, wantq, wantz, select, n, a,
104 lda, b, ldb, alpha, beta, q, ldq, z, ldz, m, pl,
105 pr, dif, work, lwork, iwork, liwork );
106 /* Release memory and exit */
107 LAPACKE_free( work );
108exit_level_1:
109 if( ijob != 0 ) {
110 LAPACKE_free( iwork );
111 }
112exit_level_0:
113 if( info == LAPACK_WORK_MEMORY_ERROR ) {
114 LAPACKE_xerbla( "LAPACKE_ztgsen", info );
115 }
116 return info;
117}
#define lapack_int
Definition: lapack.h:87
#define lapack_complex_double
Definition: lapack.h:64
#define lapack_logical
Definition: lapack.h:103
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
lapack_int LAPACKE_ztgsen_work(int matrix_layout, lapack_int ijob, lapack_logical wantq, lapack_logical wantz, const lapack_logical *select, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, lapack_complex_double *alpha, lapack_complex_double *beta, lapack_complex_double *q, lapack_int ldq, lapack_complex_double *z, lapack_int ldz, lapack_int *m, double *pl, double *pr, double *dif, lapack_complex_double *work, lapack_int lwork, lapack_int *iwork, lapack_int liwork)
#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_int LAPACKE_ztgsen(int matrix_layout, lapack_int ijob, lapack_logical wantq, lapack_logical wantz, const lapack_logical *select, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, lapack_complex_double *alpha, lapack_complex_double *beta, lapack_complex_double *q, lapack_int ldq, lapack_complex_double *z, lapack_int ldz, lapack_int *m, double *pl, double *pr, double *dif)