LAPACK  3.5.0
LAPACK: Linear Algebra PACKage
 All Classes Files Functions Variables Typedefs Macros
lapacke_dtgsja.c File Reference
#include "lapacke_utils.h"
Include dependency graph for lapacke_dtgsja.c:

Go to the source code of this file.

Functions

lapack_int LAPACKE_dtgsja (int matrix_order, char jobu, char jobv, char jobq, lapack_int m, lapack_int p, lapack_int n, lapack_int k, lapack_int l, double *a, lapack_int lda, double *b, lapack_int ldb, double tola, double tolb, double *alpha, double *beta, double *u, lapack_int ldu, double *v, lapack_int ldv, double *q, lapack_int ldq, lapack_int *ncycle)
 

Function Documentation

lapack_int LAPACKE_dtgsja ( int  matrix_order,
char  jobu,
char  jobv,
char  jobq,
lapack_int  m,
lapack_int  p,
lapack_int  n,
lapack_int  k,
lapack_int  l,
double *  a,
lapack_int  lda,
double *  b,
lapack_int  ldb,
double  tola,
double  tolb,
double *  alpha,
double *  beta,
double *  u,
lapack_int  ldu,
double *  v,
lapack_int  ldv,
double *  q,
lapack_int  ldq,
lapack_int ncycle 
)

Definition at line 36 of file lapacke_dtgsja.c.

44 {
45  lapack_int info = 0;
46  double* work = NULL;
47  if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
48  LAPACKE_xerbla( "LAPACKE_dtgsja", -1 );
49  return -1;
50  }
51 #ifndef LAPACK_DISABLE_NAN_CHECK
52  /* Optionally check input matrices for NaNs */
53  if( LAPACKE_dge_nancheck( matrix_order, m, n, a, lda ) ) {
54  return -10;
55  }
56  if( LAPACKE_dge_nancheck( matrix_order, p, n, b, ldb ) ) {
57  return -12;
58  }
59  if( LAPACKE_lsame( jobq, 'i' ) || LAPACKE_lsame( jobq, 'q' ) ) {
60  if( LAPACKE_dge_nancheck( matrix_order, n, n, q, ldq ) ) {
61  return -22;
62  }
63  }
64  if( LAPACKE_d_nancheck( 1, &tola, 1 ) ) {
65  return -14;
66  }
67  if( LAPACKE_d_nancheck( 1, &tolb, 1 ) ) {
68  return -15;
69  }
70  if( LAPACKE_lsame( jobu, 'i' ) || LAPACKE_lsame( jobu, 'u' ) ) {
71  if( LAPACKE_dge_nancheck( matrix_order, m, m, u, ldu ) ) {
72  return -18;
73  }
74  }
75  if( LAPACKE_lsame( jobv, 'i' ) || LAPACKE_lsame( jobv, 'v' ) ) {
76  if( LAPACKE_dge_nancheck( matrix_order, p, p, v, ldv ) ) {
77  return -20;
78  }
79  }
80 #endif
81  /* Allocate memory for working array(s) */
82  work = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,2*n) );
83  if( work == NULL ) {
85  goto exit_level_0;
86  }
87  /* Call middle-level interface */
88  info = LAPACKE_dtgsja_work( matrix_order, jobu, jobv, jobq, m, p, n, k, l,
89  a, lda, b, ldb, tola, tolb, alpha, beta, u, ldu,
90  v, ldv, q, ldq, work, ncycle );
91  /* Release memory and exit */
92  LAPACKE_free( work );
93 exit_level_0:
94  if( info == LAPACK_WORK_MEMORY_ERROR ) {
95  LAPACKE_xerbla( "LAPACKE_dtgsja", info );
96  }
97  return info;
98 }
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
set ue cd $ADTTMP cat<< EOF > tmp f Program LinearEquations Implicit none Real b(3) integer i
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_free(p)
Definition: lapacke.h:113
lapack_int LAPACKE_dtgsja_work(int matrix_order, char jobu, char jobv, char jobq, lapack_int m, lapack_int p, lapack_int n, lapack_int k, lapack_int l, double *a, lapack_int lda, double *b, lapack_int ldb, double tola, double tolb, double *alpha, double *beta, double *u, lapack_int ldu, double *v, lapack_int ldv, double *q, lapack_int ldq, double *work, lapack_int *ncycle)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:36
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:122
lapack_logical LAPACKE_d_nancheck(lapack_int n, const double *x, lapack_int incx)
set ue cd $ADTTMP cat<< EOF > tmp c void LAPACKE_xerbla(const char *name, lapack_int info)
Definition: xerbla-c:8
lapack_logical LAPACKE_dge_nancheck(int matrix_order, lapack_int m, lapack_int n, const double *a, lapack_int lda)
#define lapack_int
Definition: lapacke.h:47

Here is the call graph for this function: