nmatrix-lapacke 0.2.0
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +7 -0
- data/ext/nmatrix/data/complex.h +364 -0
- data/ext/nmatrix/data/data.h +638 -0
- data/ext/nmatrix/data/meta.h +64 -0
- data/ext/nmatrix/data/ruby_object.h +389 -0
- data/ext/nmatrix/math/asum.h +120 -0
- data/ext/nmatrix/math/cblas_enums.h +36 -0
- data/ext/nmatrix/math/cblas_templates_core.h +507 -0
- data/ext/nmatrix/math/gemm.h +241 -0
- data/ext/nmatrix/math/gemv.h +178 -0
- data/ext/nmatrix/math/getrf.h +255 -0
- data/ext/nmatrix/math/getrs.h +121 -0
- data/ext/nmatrix/math/imax.h +79 -0
- data/ext/nmatrix/math/laswp.h +165 -0
- data/ext/nmatrix/math/long_dtype.h +49 -0
- data/ext/nmatrix/math/math.h +744 -0
- data/ext/nmatrix/math/nrm2.h +160 -0
- data/ext/nmatrix/math/rot.h +117 -0
- data/ext/nmatrix/math/rotg.h +106 -0
- data/ext/nmatrix/math/scal.h +71 -0
- data/ext/nmatrix/math/trsm.h +332 -0
- data/ext/nmatrix/math/util.h +148 -0
- data/ext/nmatrix/nm_memory.h +60 -0
- data/ext/nmatrix/nmatrix.h +408 -0
- data/ext/nmatrix/ruby_constants.h +106 -0
- data/ext/nmatrix/storage/common.h +176 -0
- data/ext/nmatrix/storage/dense/dense.h +128 -0
- data/ext/nmatrix/storage/list/list.h +137 -0
- data/ext/nmatrix/storage/storage.h +98 -0
- data/ext/nmatrix/storage/yale/class.h +1139 -0
- data/ext/nmatrix/storage/yale/iterators/base.h +142 -0
- data/ext/nmatrix/storage/yale/iterators/iterator.h +130 -0
- data/ext/nmatrix/storage/yale/iterators/row.h +449 -0
- data/ext/nmatrix/storage/yale/iterators/row_stored.h +139 -0
- data/ext/nmatrix/storage/yale/iterators/row_stored_nd.h +168 -0
- data/ext/nmatrix/storage/yale/iterators/stored_diagonal.h +123 -0
- data/ext/nmatrix/storage/yale/math/transpose.h +110 -0
- data/ext/nmatrix/storage/yale/yale.h +202 -0
- data/ext/nmatrix/types.h +54 -0
- data/ext/nmatrix/util/io.h +115 -0
- data/ext/nmatrix/util/sl_list.h +143 -0
- data/ext/nmatrix/util/util.h +78 -0
- data/ext/nmatrix_lapacke/extconf.rb +200 -0
- data/ext/nmatrix_lapacke/lapacke.cpp +100 -0
- data/ext/nmatrix_lapacke/lapacke/include/lapacke.h +16445 -0
- data/ext/nmatrix_lapacke/lapacke/include/lapacke_config.h +119 -0
- data/ext/nmatrix_lapacke/lapacke/include/lapacke_mangling.h +17 -0
- data/ext/nmatrix_lapacke/lapacke/include/lapacke_mangling_with_flags.h +17 -0
- data/ext/nmatrix_lapacke/lapacke/include/lapacke_utils.h +579 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgeev.c +89 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgeev_work.c +141 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgesdd.c +106 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgesdd_work.c +158 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgesvd.c +94 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgesvd_work.c +149 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgetrf.c +51 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgetrf_work.c +83 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgetri.c +77 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgetri_work.c +89 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgetrs.c +56 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cgetrs_work.c +102 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cpotrf.c +50 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cpotrf_work.c +82 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cpotri.c +50 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cpotri_work.c +82 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cpotrs.c +55 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_cpotrs_work.c +101 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgeev.c +78 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgeev_work.c +136 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgesdd.c +88 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgesdd_work.c +153 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgesvd.c +83 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgesvd_work.c +144 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgetrf.c +50 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgetrf_work.c +81 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgetri.c +75 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgetri_work.c +87 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgetrs.c +55 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dgetrs_work.c +99 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dpotrf.c +50 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dpotrf_work.c +81 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dpotri.c +50 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dpotri_work.c +81 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dpotrs.c +54 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_dpotrs_work.c +97 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgeev.c +78 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgeev_work.c +134 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgesdd.c +88 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgesdd_work.c +152 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgesvd.c +83 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgesvd_work.c +143 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgetrf.c +50 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgetrf_work.c +81 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgetri.c +75 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgetri_work.c +87 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgetrs.c +55 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_sgetrs_work.c +99 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_spotrf.c +50 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_spotrf_work.c +81 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_spotri.c +50 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_spotri_work.c +81 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_spotrs.c +54 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_spotrs_work.c +97 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgeev.c +89 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgeev_work.c +141 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgesdd.c +106 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgesdd_work.c +158 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgesvd.c +94 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgesvd_work.c +149 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgetrf.c +51 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgetrf_work.c +83 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgetri.c +77 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgetri_work.c +89 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgetrs.c +56 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zgetrs_work.c +102 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zpotrf.c +50 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zpotrf_work.c +82 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zpotri.c +50 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zpotri_work.c +82 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zpotrs.c +55 -0
- data/ext/nmatrix_lapacke/lapacke/src/lapacke_zpotrs_work.c +101 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_cge_nancheck.c +62 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_cge_trans.c +65 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_cpo_nancheck.c +43 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_cpo_trans.c +45 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_ctr_nancheck.c +85 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_ctr_trans.c +85 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_dge_nancheck.c +62 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_dge_trans.c +65 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_dpo_nancheck.c +43 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_dpo_trans.c +45 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_dtr_nancheck.c +85 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_dtr_trans.c +85 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_lsame.c +41 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_sge_nancheck.c +62 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_sge_trans.c +65 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_spo_nancheck.c +43 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_spo_trans.c +45 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_str_nancheck.c +85 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_str_trans.c +85 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_xerbla.c +46 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_zge_nancheck.c +62 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_zge_trans.c +65 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_zpo_nancheck.c +43 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_zpo_trans.c +45 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_ztr_nancheck.c +85 -0
- data/ext/nmatrix_lapacke/lapacke/utils/lapacke_ztr_trans.c +85 -0
- data/ext/nmatrix_lapacke/lapacke_nmatrix.h +16 -0
- data/ext/nmatrix_lapacke/make_lapacke_cpp.rb +9 -0
- data/ext/nmatrix_lapacke/math_lapacke.cpp +967 -0
- data/ext/nmatrix_lapacke/math_lapacke/cblas_local.h +576 -0
- data/ext/nmatrix_lapacke/math_lapacke/cblas_templates_lapacke.h +51 -0
- data/ext/nmatrix_lapacke/math_lapacke/lapacke_templates.h +356 -0
- data/ext/nmatrix_lapacke/nmatrix_lapacke.cpp +42 -0
- data/lib/nmatrix/lapack_ext_common.rb +69 -0
- data/lib/nmatrix/lapacke.rb +213 -0
- data/spec/00_nmatrix_spec.rb +730 -0
- data/spec/01_enum_spec.rb +190 -0
- data/spec/02_slice_spec.rb +389 -0
- data/spec/03_nmatrix_monkeys_spec.rb +78 -0
- data/spec/2x2_dense_double.mat +0 -0
- data/spec/4x4_sparse.mat +0 -0
- data/spec/4x5_dense.mat +0 -0
- data/spec/blas_spec.rb +193 -0
- data/spec/elementwise_spec.rb +303 -0
- data/spec/homogeneous_spec.rb +99 -0
- data/spec/io/fortran_format_spec.rb +88 -0
- data/spec/io/harwell_boeing_spec.rb +98 -0
- data/spec/io/test.rua +9 -0
- data/spec/io_spec.rb +149 -0
- data/spec/lapack_core_spec.rb +482 -0
- data/spec/leakcheck.rb +16 -0
- data/spec/math_spec.rb +730 -0
- data/spec/nmatrix_yale_resize_test_associations.yaml +2802 -0
- data/spec/nmatrix_yale_spec.rb +286 -0
- data/spec/plugins/lapacke/lapacke_spec.rb +303 -0
- data/spec/rspec_monkeys.rb +56 -0
- data/spec/rspec_spec.rb +34 -0
- data/spec/shortcuts_spec.rb +310 -0
- data/spec/slice_set_spec.rb +157 -0
- data/spec/spec_helper.rb +140 -0
- data/spec/stat_spec.rb +203 -0
- data/spec/test.pcd +20 -0
- data/spec/utm5940.mtx +83844 -0
- metadata +262 -0
@@ -0,0 +1,50 @@
|
|
1
|
+
/*****************************************************************************
|
2
|
+
Copyright (c) 2011, 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 dpotri
|
30
|
+
* Author: Intel Corporation
|
31
|
+
* Generated November, 2011
|
32
|
+
*****************************************************************************/
|
33
|
+
|
34
|
+
#include "lapacke_utils.h"
|
35
|
+
|
36
|
+
lapack_int LAPACKE_dpotri( int matrix_order, char uplo, lapack_int n, double* a,
|
37
|
+
lapack_int lda )
|
38
|
+
{
|
39
|
+
if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
|
40
|
+
LAPACKE_xerbla( "LAPACKE_dpotri", -1 );
|
41
|
+
return -1;
|
42
|
+
}
|
43
|
+
#ifndef LAPACK_DISABLE_NAN_CHECK
|
44
|
+
/* Optionally check input matrices for NaNs */
|
45
|
+
if( LAPACKE_dpo_nancheck( matrix_order, uplo, n, a, lda ) ) {
|
46
|
+
return -4;
|
47
|
+
}
|
48
|
+
#endif
|
49
|
+
return LAPACKE_dpotri_work( matrix_order, uplo, n, a, lda );
|
50
|
+
}
|
@@ -0,0 +1,81 @@
|
|
1
|
+
/*****************************************************************************
|
2
|
+
Copyright (c) 2011, 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 middle-level C interface to LAPACK function dpotri
|
30
|
+
* Author: Intel Corporation
|
31
|
+
* Generated November, 2011
|
32
|
+
*****************************************************************************/
|
33
|
+
|
34
|
+
#include "lapacke_utils.h"
|
35
|
+
|
36
|
+
lapack_int LAPACKE_dpotri_work( int matrix_order, char uplo, lapack_int n,
|
37
|
+
double* a, lapack_int lda )
|
38
|
+
{
|
39
|
+
lapack_int info = 0;
|
40
|
+
if( matrix_order == LAPACK_COL_MAJOR ) {
|
41
|
+
/* Call LAPACK function and adjust info */
|
42
|
+
LAPACK_dpotri( &uplo, &n, a, &lda, &info );
|
43
|
+
if( info < 0 ) {
|
44
|
+
info = info - 1;
|
45
|
+
}
|
46
|
+
} else if( matrix_order == LAPACK_ROW_MAJOR ) {
|
47
|
+
lapack_int lda_t = MAX(1,n);
|
48
|
+
double* a_t = NULL;
|
49
|
+
/* Check leading dimension(s) */
|
50
|
+
if( lda < n ) {
|
51
|
+
info = -5;
|
52
|
+
LAPACKE_xerbla( "LAPACKE_dpotri_work", info );
|
53
|
+
return info;
|
54
|
+
}
|
55
|
+
/* Allocate memory for temporary array(s) */
|
56
|
+
a_t = (double*)LAPACKE_malloc( sizeof(double) * lda_t * MAX(1,n) );
|
57
|
+
if( a_t == NULL ) {
|
58
|
+
info = LAPACK_TRANSPOSE_MEMORY_ERROR;
|
59
|
+
goto exit_level_0;
|
60
|
+
}
|
61
|
+
/* Transpose input matrices */
|
62
|
+
LAPACKE_dpo_trans( matrix_order, uplo, n, a, lda, a_t, lda_t );
|
63
|
+
/* Call LAPACK function and adjust info */
|
64
|
+
LAPACK_dpotri( &uplo, &n, a_t, &lda_t, &info );
|
65
|
+
if( info < 0 ) {
|
66
|
+
info = info - 1;
|
67
|
+
}
|
68
|
+
/* Transpose output matrices */
|
69
|
+
LAPACKE_dpo_trans( LAPACK_COL_MAJOR, uplo, n, a_t, lda_t, a, lda );
|
70
|
+
/* Release memory and exit */
|
71
|
+
LAPACKE_free( a_t );
|
72
|
+
exit_level_0:
|
73
|
+
if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
|
74
|
+
LAPACKE_xerbla( "LAPACKE_dpotri_work", info );
|
75
|
+
}
|
76
|
+
} else {
|
77
|
+
info = -1;
|
78
|
+
LAPACKE_xerbla( "LAPACKE_dpotri_work", info );
|
79
|
+
}
|
80
|
+
return info;
|
81
|
+
}
|
@@ -0,0 +1,54 @@
|
|
1
|
+
/*****************************************************************************
|
2
|
+
Copyright (c) 2011, 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 dpotrs
|
30
|
+
* Author: Intel Corporation
|
31
|
+
* Generated November, 2011
|
32
|
+
*****************************************************************************/
|
33
|
+
|
34
|
+
#include "lapacke_utils.h"
|
35
|
+
|
36
|
+
lapack_int LAPACKE_dpotrs( int matrix_order, char uplo, lapack_int n,
|
37
|
+
lapack_int nrhs, const double* a, lapack_int lda,
|
38
|
+
double* b, lapack_int ldb )
|
39
|
+
{
|
40
|
+
if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
|
41
|
+
LAPACKE_xerbla( "LAPACKE_dpotrs", -1 );
|
42
|
+
return -1;
|
43
|
+
}
|
44
|
+
#ifndef LAPACK_DISABLE_NAN_CHECK
|
45
|
+
/* Optionally check input matrices for NaNs */
|
46
|
+
if( LAPACKE_dpo_nancheck( matrix_order, uplo, n, a, lda ) ) {
|
47
|
+
return -5;
|
48
|
+
}
|
49
|
+
if( LAPACKE_dge_nancheck( matrix_order, n, nrhs, b, ldb ) ) {
|
50
|
+
return -7;
|
51
|
+
}
|
52
|
+
#endif
|
53
|
+
return LAPACKE_dpotrs_work( matrix_order, uplo, n, nrhs, a, lda, b, ldb );
|
54
|
+
}
|
@@ -0,0 +1,97 @@
|
|
1
|
+
/*****************************************************************************
|
2
|
+
Copyright (c) 2011, 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 middle-level C interface to LAPACK function dpotrs
|
30
|
+
* Author: Intel Corporation
|
31
|
+
* Generated November, 2011
|
32
|
+
*****************************************************************************/
|
33
|
+
|
34
|
+
#include "lapacke_utils.h"
|
35
|
+
|
36
|
+
lapack_int LAPACKE_dpotrs_work( int matrix_order, char uplo, lapack_int n,
|
37
|
+
lapack_int nrhs, const double* a,
|
38
|
+
lapack_int lda, double* b, lapack_int ldb )
|
39
|
+
{
|
40
|
+
lapack_int info = 0;
|
41
|
+
if( matrix_order == LAPACK_COL_MAJOR ) {
|
42
|
+
/* Call LAPACK function and adjust info */
|
43
|
+
LAPACK_dpotrs( &uplo, &n, &nrhs, a, &lda, b, &ldb, &info );
|
44
|
+
if( info < 0 ) {
|
45
|
+
info = info - 1;
|
46
|
+
}
|
47
|
+
} else if( matrix_order == LAPACK_ROW_MAJOR ) {
|
48
|
+
lapack_int lda_t = MAX(1,n);
|
49
|
+
lapack_int ldb_t = MAX(1,n);
|
50
|
+
double* a_t = NULL;
|
51
|
+
double* b_t = NULL;
|
52
|
+
/* Check leading dimension(s) */
|
53
|
+
if( lda < n ) {
|
54
|
+
info = -6;
|
55
|
+
LAPACKE_xerbla( "LAPACKE_dpotrs_work", info );
|
56
|
+
return info;
|
57
|
+
}
|
58
|
+
if( ldb < nrhs ) {
|
59
|
+
info = -8;
|
60
|
+
LAPACKE_xerbla( "LAPACKE_dpotrs_work", info );
|
61
|
+
return info;
|
62
|
+
}
|
63
|
+
/* Allocate memory for temporary array(s) */
|
64
|
+
a_t = (double*)LAPACKE_malloc( sizeof(double) * lda_t * MAX(1,n) );
|
65
|
+
if( a_t == NULL ) {
|
66
|
+
info = LAPACK_TRANSPOSE_MEMORY_ERROR;
|
67
|
+
goto exit_level_0;
|
68
|
+
}
|
69
|
+
b_t = (double*)LAPACKE_malloc( sizeof(double) * ldb_t * MAX(1,nrhs) );
|
70
|
+
if( b_t == NULL ) {
|
71
|
+
info = LAPACK_TRANSPOSE_MEMORY_ERROR;
|
72
|
+
goto exit_level_1;
|
73
|
+
}
|
74
|
+
/* Transpose input matrices */
|
75
|
+
LAPACKE_dpo_trans( matrix_order, uplo, n, a, lda, a_t, lda_t );
|
76
|
+
LAPACKE_dge_trans( matrix_order, n, nrhs, b, ldb, b_t, ldb_t );
|
77
|
+
/* Call LAPACK function and adjust info */
|
78
|
+
LAPACK_dpotrs( &uplo, &n, &nrhs, a_t, &lda_t, b_t, &ldb_t, &info );
|
79
|
+
if( info < 0 ) {
|
80
|
+
info = info - 1;
|
81
|
+
}
|
82
|
+
/* Transpose output matrices */
|
83
|
+
LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, nrhs, b_t, ldb_t, b, ldb );
|
84
|
+
/* Release memory and exit */
|
85
|
+
LAPACKE_free( b_t );
|
86
|
+
exit_level_1:
|
87
|
+
LAPACKE_free( a_t );
|
88
|
+
exit_level_0:
|
89
|
+
if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
|
90
|
+
LAPACKE_xerbla( "LAPACKE_dpotrs_work", info );
|
91
|
+
}
|
92
|
+
} else {
|
93
|
+
info = -1;
|
94
|
+
LAPACKE_xerbla( "LAPACKE_dpotrs_work", info );
|
95
|
+
}
|
96
|
+
return info;
|
97
|
+
}
|
@@ -0,0 +1,78 @@
|
|
1
|
+
/*****************************************************************************
|
2
|
+
Copyright (c) 2011, 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 sgeev
|
30
|
+
* Author: Intel Corporation
|
31
|
+
* Generated November, 2011
|
32
|
+
*****************************************************************************/
|
33
|
+
|
34
|
+
#include "lapacke_utils.h"
|
35
|
+
|
36
|
+
lapack_int LAPACKE_sgeev( int matrix_order, char jobvl, char jobvr,
|
37
|
+
lapack_int n, float* a, lapack_int lda, float* wr,
|
38
|
+
float* wi, float* vl, lapack_int ldvl, float* vr,
|
39
|
+
lapack_int ldvr )
|
40
|
+
{
|
41
|
+
lapack_int info = 0;
|
42
|
+
lapack_int lwork = -1;
|
43
|
+
float* work = NULL;
|
44
|
+
float work_query;
|
45
|
+
if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
|
46
|
+
LAPACKE_xerbla( "LAPACKE_sgeev", -1 );
|
47
|
+
return -1;
|
48
|
+
}
|
49
|
+
#ifndef LAPACK_DISABLE_NAN_CHECK
|
50
|
+
/* Optionally check input matrices for NaNs */
|
51
|
+
if( LAPACKE_sge_nancheck( matrix_order, n, n, a, lda ) ) {
|
52
|
+
return -5;
|
53
|
+
}
|
54
|
+
#endif
|
55
|
+
/* Query optimal working array(s) size */
|
56
|
+
info = LAPACKE_sgeev_work( matrix_order, jobvl, jobvr, n, a, lda, wr, wi,
|
57
|
+
vl, ldvl, vr, ldvr, &work_query, lwork );
|
58
|
+
if( info != 0 ) {
|
59
|
+
goto exit_level_0;
|
60
|
+
}
|
61
|
+
lwork = (lapack_int)work_query;
|
62
|
+
/* Allocate memory for work arrays */
|
63
|
+
work = (float*)LAPACKE_malloc( sizeof(float) * lwork );
|
64
|
+
if( work == NULL ) {
|
65
|
+
info = LAPACK_WORK_MEMORY_ERROR;
|
66
|
+
goto exit_level_0;
|
67
|
+
}
|
68
|
+
/* Call middle-level interface */
|
69
|
+
info = LAPACKE_sgeev_work( matrix_order, jobvl, jobvr, n, a, lda, wr, wi,
|
70
|
+
vl, ldvl, vr, ldvr, work, lwork );
|
71
|
+
/* Release memory and exit */
|
72
|
+
LAPACKE_free( work );
|
73
|
+
exit_level_0:
|
74
|
+
if( info == LAPACK_WORK_MEMORY_ERROR ) {
|
75
|
+
LAPACKE_xerbla( "LAPACKE_sgeev", info );
|
76
|
+
}
|
77
|
+
return info;
|
78
|
+
}
|
@@ -0,0 +1,134 @@
|
|
1
|
+
/*****************************************************************************
|
2
|
+
Copyright (c) 2011, 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 middle-level C interface to LAPACK function sgeev
|
30
|
+
* Author: Intel Corporation
|
31
|
+
* Generated November, 2011
|
32
|
+
*****************************************************************************/
|
33
|
+
|
34
|
+
#include "lapacke_utils.h"
|
35
|
+
|
36
|
+
lapack_int LAPACKE_sgeev_work( int matrix_order, char jobvl, char jobvr,
|
37
|
+
lapack_int n, float* a, lapack_int lda,
|
38
|
+
float* wr, float* wi, float* vl, lapack_int ldvl,
|
39
|
+
float* vr, lapack_int ldvr, float* work,
|
40
|
+
lapack_int lwork )
|
41
|
+
{
|
42
|
+
lapack_int info = 0;
|
43
|
+
if( matrix_order == LAPACK_COL_MAJOR ) {
|
44
|
+
/* Call LAPACK function and adjust info */
|
45
|
+
LAPACK_sgeev( &jobvl, &jobvr, &n, a, &lda, wr, wi, vl, &ldvl, vr, &ldvr,
|
46
|
+
work, &lwork, &info );
|
47
|
+
if( info < 0 ) {
|
48
|
+
info = info - 1;
|
49
|
+
}
|
50
|
+
} else if( matrix_order == LAPACK_ROW_MAJOR ) {
|
51
|
+
lapack_int lda_t = MAX(1,n);
|
52
|
+
lapack_int ldvl_t = MAX(1,n);
|
53
|
+
lapack_int ldvr_t = MAX(1,n);
|
54
|
+
float* a_t = NULL;
|
55
|
+
float* vl_t = NULL;
|
56
|
+
float* vr_t = NULL;
|
57
|
+
/* Check leading dimension(s) */
|
58
|
+
if( lda < n ) {
|
59
|
+
info = -6;
|
60
|
+
LAPACKE_xerbla( "LAPACKE_sgeev_work", info );
|
61
|
+
return info;
|
62
|
+
}
|
63
|
+
if( ldvl < n ) {
|
64
|
+
info = -10;
|
65
|
+
LAPACKE_xerbla( "LAPACKE_sgeev_work", info );
|
66
|
+
return info;
|
67
|
+
}
|
68
|
+
if( ldvr < n ) {
|
69
|
+
info = -12;
|
70
|
+
LAPACKE_xerbla( "LAPACKE_sgeev_work", info );
|
71
|
+
return info;
|
72
|
+
}
|
73
|
+
/* Query optimal working array(s) size if requested */
|
74
|
+
if( lwork == -1 ) {
|
75
|
+
LAPACK_sgeev( &jobvl, &jobvr, &n, a, &lda_t, wr, wi, vl, &ldvl_t,
|
76
|
+
vr, &ldvr_t, work, &lwork, &info );
|
77
|
+
return (info < 0) ? (info - 1) : info;
|
78
|
+
}
|
79
|
+
/* Allocate memory for temporary array(s) */
|
80
|
+
a_t = (float*)LAPACKE_malloc( sizeof(float) * lda_t * MAX(1,n) );
|
81
|
+
if( a_t == NULL ) {
|
82
|
+
info = LAPACK_TRANSPOSE_MEMORY_ERROR;
|
83
|
+
goto exit_level_0;
|
84
|
+
}
|
85
|
+
if( LAPACKE_lsame( jobvl, 'v' ) ) {
|
86
|
+
vl_t = (float*)LAPACKE_malloc( sizeof(float) * ldvl_t * MAX(1,n) );
|
87
|
+
if( vl_t == NULL ) {
|
88
|
+
info = LAPACK_TRANSPOSE_MEMORY_ERROR;
|
89
|
+
goto exit_level_1;
|
90
|
+
}
|
91
|
+
}
|
92
|
+
if( LAPACKE_lsame( jobvr, 'v' ) ) {
|
93
|
+
vr_t = (float*)LAPACKE_malloc( sizeof(float) * ldvr_t * MAX(1,n) );
|
94
|
+
if( vr_t == NULL ) {
|
95
|
+
info = LAPACK_TRANSPOSE_MEMORY_ERROR;
|
96
|
+
goto exit_level_2;
|
97
|
+
}
|
98
|
+
}
|
99
|
+
/* Transpose input matrices */
|
100
|
+
LAPACKE_sge_trans( matrix_order, n, n, a, lda, a_t, lda_t );
|
101
|
+
/* Call LAPACK function and adjust info */
|
102
|
+
LAPACK_sgeev( &jobvl, &jobvr, &n, a_t, &lda_t, wr, wi, vl_t, &ldvl_t,
|
103
|
+
vr_t, &ldvr_t, work, &lwork, &info );
|
104
|
+
if( info < 0 ) {
|
105
|
+
info = info - 1;
|
106
|
+
}
|
107
|
+
/* Transpose output matrices */
|
108
|
+
LAPACKE_sge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
|
109
|
+
if( LAPACKE_lsame( jobvl, 'v' ) ) {
|
110
|
+
LAPACKE_sge_trans( LAPACK_COL_MAJOR, n, n, vl_t, ldvl_t, vl, ldvl );
|
111
|
+
}
|
112
|
+
if( LAPACKE_lsame( jobvr, 'v' ) ) {
|
113
|
+
LAPACKE_sge_trans( LAPACK_COL_MAJOR, n, n, vr_t, ldvr_t, vr, ldvr );
|
114
|
+
}
|
115
|
+
/* Release memory and exit */
|
116
|
+
if( LAPACKE_lsame( jobvr, 'v' ) ) {
|
117
|
+
LAPACKE_free( vr_t );
|
118
|
+
}
|
119
|
+
exit_level_2:
|
120
|
+
if( LAPACKE_lsame( jobvl, 'v' ) ) {
|
121
|
+
LAPACKE_free( vl_t );
|
122
|
+
}
|
123
|
+
exit_level_1:
|
124
|
+
LAPACKE_free( a_t );
|
125
|
+
exit_level_0:
|
126
|
+
if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
|
127
|
+
LAPACKE_xerbla( "LAPACKE_sgeev_work", info );
|
128
|
+
}
|
129
|
+
} else {
|
130
|
+
info = -1;
|
131
|
+
LAPACKE_xerbla( "LAPACKE_sgeev_work", info );
|
132
|
+
}
|
133
|
+
return info;
|
134
|
+
}
|