1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95
|
#include "rb_lapack.h"
extern VOID chegs2_(integer* itype, char* uplo, integer* n, complex* a, integer* lda, complex* b, integer* ldb, integer* info);
static VALUE
rblapack_chegs2(int argc, VALUE *argv, VALUE self){
VALUE rblapack_itype;
integer itype;
VALUE rblapack_uplo;
char uplo;
VALUE rblapack_a;
complex *a;
VALUE rblapack_b;
complex *b;
VALUE rblapack_info;
integer info;
VALUE rblapack_a_out__;
complex *a_out__;
integer lda;
integer n;
integer ldb;
VALUE rblapack_options;
if (argc > 0 && TYPE(argv[argc-1]) == T_HASH) {
argc--;
rblapack_options = argv[argc];
if (rb_hash_aref(rblapack_options, sHelp) == Qtrue) {
printf("%s\n", "USAGE:\n info, a = NumRu::Lapack.chegs2( itype, uplo, a, b, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE CHEGS2( ITYPE, UPLO, N, A, LDA, B, LDB, INFO )\n\n* Purpose\n* =======\n*\n* CHEGS2 reduces a complex Hermitian-definite generalized\n* eigenproblem to standard form.\n*\n* If ITYPE = 1, the problem is A*x = lambda*B*x,\n* and A is overwritten by inv(U')*A*inv(U) or inv(L)*A*inv(L')\n*\n* If ITYPE = 2 or 3, the problem is A*B*x = lambda*x or\n* B*A*x = lambda*x, and A is overwritten by U*A*U` or L'*A*L.\n*\n* B must have been previously factorized as U'*U or L*L' by CPOTRF.\n*\n\n* Arguments\n* =========\n*\n* ITYPE (input) INTEGER\n* = 1: compute inv(U')*A*inv(U) or inv(L)*A*inv(L');\n* = 2 or 3: compute U*A*U' or L'*A*L.\n*\n* UPLO (input) CHARACTER*1\n* Specifies whether the upper or lower triangular part of the\n* Hermitian matrix A is stored, and how B has been factorized.\n* = 'U': Upper triangular\n* = 'L': Lower triangular\n*\n* N (input) INTEGER\n* The order of the matrices A and B. N >= 0.\n*\n* A (input/output) COMPLEX array, dimension (LDA,N)\n* On entry, the Hermitian matrix A. If UPLO = 'U', the leading\n* n by n upper triangular part of A contains the upper\n* triangular part of the matrix A, and the strictly lower\n* triangular part of A is not referenced. If UPLO = 'L', the\n* leading n by n lower triangular part of A contains the lower\n* triangular part of the matrix A, and the strictly upper\n* triangular part of A is not referenced.\n*\n* On exit, if INFO = 0, the transformed matrix, stored in the\n* same format as A.\n*\n* LDA (input) INTEGER\n* The leading dimension of the array A. LDA >= max(1,N).\n*\n* B (input) COMPLEX array, dimension (LDB,N)\n* The triangular factor from the Cholesky factorization of B,\n* as returned by CPOTRF.\n*\n* LDB (input) INTEGER\n* The leading dimension of the array B. LDB >= max(1,N).\n*\n* INFO (output) INTEGER\n* = 0: successful exit.\n* < 0: if INFO = -i, the i-th argument had an illegal value.\n*\n\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n info, a = NumRu::Lapack.chegs2( itype, uplo, a, b, [:usage => usage, :help => help])\n");
return Qnil;
}
} else
rblapack_options = Qnil;
if (argc != 4 && argc != 4)
rb_raise(rb_eArgError,"wrong number of arguments (%d for 4)", argc);
rblapack_itype = argv[0];
rblapack_uplo = argv[1];
rblapack_a = argv[2];
rblapack_b = argv[3];
if (argc == 4) {
} else if (rblapack_options != Qnil) {
} else {
}
itype = NUM2INT(rblapack_itype);
if (!NA_IsNArray(rblapack_a))
rb_raise(rb_eArgError, "a (3th argument) must be NArray");
if (NA_RANK(rblapack_a) != 2)
rb_raise(rb_eArgError, "rank of a (3th argument) must be %d", 2);
lda = NA_SHAPE0(rblapack_a);
n = NA_SHAPE1(rblapack_a);
if (NA_TYPE(rblapack_a) != NA_SCOMPLEX)
rblapack_a = na_change_type(rblapack_a, NA_SCOMPLEX);
a = NA_PTR_TYPE(rblapack_a, complex*);
uplo = StringValueCStr(rblapack_uplo)[0];
if (!NA_IsNArray(rblapack_b))
rb_raise(rb_eArgError, "b (4th argument) must be NArray");
if (NA_RANK(rblapack_b) != 2)
rb_raise(rb_eArgError, "rank of b (4th argument) must be %d", 2);
ldb = NA_SHAPE0(rblapack_b);
if (NA_SHAPE1(rblapack_b) != n)
rb_raise(rb_eRuntimeError, "shape 1 of b must be the same as shape 1 of a");
if (NA_TYPE(rblapack_b) != NA_SCOMPLEX)
rblapack_b = na_change_type(rblapack_b, NA_SCOMPLEX);
b = NA_PTR_TYPE(rblapack_b, complex*);
{
na_shape_t shape[2];
shape[0] = lda;
shape[1] = n;
rblapack_a_out__ = na_make_object(NA_SCOMPLEX, 2, shape, cNArray);
}
a_out__ = NA_PTR_TYPE(rblapack_a_out__, complex*);
MEMCPY(a_out__, a, complex, NA_TOTAL(rblapack_a));
rblapack_a = rblapack_a_out__;
a = a_out__;
chegs2_(&itype, &uplo, &n, a, &lda, b, &ldb, &info);
rblapack_info = INT2NUM(info);
return rb_ary_new3(2, rblapack_info, rblapack_a);
}
void
init_lapack_chegs2(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "chegs2", rblapack_chegs2, -1);
}
|