OpenRadioss 2025.1.11
OpenRadioss project
Loading...
Searching...
No Matches
lapacke_zhgeqz.c File Reference
#include "lapacke_utils.h"

Go to the source code of this file.

Functions

lapack_int LAPACKE_zhgeqz (int matrix_layout, char job, char compq, char compz, lapack_int n, lapack_int ilo, lapack_int ihi, lapack_complex_double *h, lapack_int ldh, lapack_complex_double *t, lapack_int ldt, lapack_complex_double *alpha, lapack_complex_double *beta, lapack_complex_double *q, lapack_int ldq, lapack_complex_double *z, lapack_int ldz)

Function Documentation

◆ LAPACKE_zhgeqz()

lapack_int LAPACKE_zhgeqz ( int matrix_layout,
char job,
char compq,
char compz,
lapack_int n,
lapack_int ilo,
lapack_int ihi,
lapack_complex_double * h,
lapack_int ldh,
lapack_complex_double * t,
lapack_int ldt,
lapack_complex_double * alpha,
lapack_complex_double * beta,
lapack_complex_double * q,
lapack_int ldq,
lapack_complex_double * z,
lapack_int ldz )

Definition at line 35 of file lapacke_zhgeqz.c.

43{
44 lapack_int info = 0;
45 lapack_int lwork = -1;
46 double* rwork = NULL;
47 lapack_complex_double* work = NULL;
48 lapack_complex_double work_query;
49 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
50 LAPACKE_xerbla( "LAPACKE_zhgeqz", -1 );
51 return -1;
52 }
53#ifndef LAPACK_DISABLE_NAN_CHECK
54 if( LAPACKE_get_nancheck() ) {
55 /* Optionally check input matrices for NaNs */
56 if( LAPACKE_zge_nancheck( matrix_layout, n, n, h, ldh ) ) {
57 return -8;
58 }
59 if( LAPACKE_lsame( compq, 'i' ) || LAPACKE_lsame( compq, 'v' ) ) {
60 if( LAPACKE_zge_nancheck( matrix_layout, n, n, q, ldq ) ) {
61 return -14;
62 }
63 }
64 if( LAPACKE_zge_nancheck( matrix_layout, n, n, t, ldt ) ) {
65 return -10;
66 }
67 if( LAPACKE_lsame( compz, 'i' ) || LAPACKE_lsame( compz, 'v' ) ) {
68 if( LAPACKE_zge_nancheck( matrix_layout, n, n, z, ldz ) ) {
69 return -16;
70 }
71 }
72 }
73#endif
74 /* Allocate memory for working array(s) */
75 rwork = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,n) );
76 if( rwork == NULL ) {
78 goto exit_level_0;
79 }
80 /* Query optimal working array(s) size */
81 info = LAPACKE_zhgeqz_work( matrix_layout, job, compq, compz, n, ilo, ihi, h,
82 ldh, t, ldt, alpha, beta, q, ldq, z, ldz,
83 &work_query, lwork, rwork );
84 if( info != 0 ) {
85 goto exit_level_1;
86 }
87 lwork = LAPACK_Z2INT( work_query );
88 /* Allocate memory for work arrays */
89 work = (lapack_complex_double*)
90 LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
91 if( work == NULL ) {
93 goto exit_level_1;
94 }
95 /* Call middle-level interface */
96 info = LAPACKE_zhgeqz_work( matrix_layout, job, compq, compz, n, ilo, ihi, h,
97 ldh, t, ldt, alpha, beta, q, ldq, z, ldz, work,
98 lwork, rwork );
99 /* Release memory and exit */
100 LAPACKE_free( work );
101exit_level_1:
102 LAPACKE_free( rwork );
103exit_level_0:
104 if( info == LAPACK_WORK_MEMORY_ERROR ) {
105 LAPACKE_xerbla( "LAPACKE_zhgeqz", info );
106 }
107 return info;
108}
#define alpha
Definition eval.h:35
#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
int LAPACKE_get_nancheck(void)
#define LAPACK_Z2INT(x)
Definition lapacke.h:50
#define LAPACKE_malloc(size)
Definition lapacke.h:43
lapack_int LAPACKE_zhgeqz_work(int matrix_layout, char job, char compq, char compz, lapack_int n, lapack_int ilo, lapack_int ihi, lapack_complex_double *h, lapack_int ldh, lapack_complex_double *t, lapack_int ldt, lapack_complex_double *alpha, lapack_complex_double *beta, lapack_complex_double *q, lapack_int ldq, lapack_complex_double *z, lapack_int ldz, lapack_complex_double *work, lapack_int lwork, double *rwork)
lapack_logical LAPACKE_lsame(char ca, char cb)
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 MAX(x, y)
n