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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/*!
* \file
* \brief Implementation of Cholesky factorisation functions
* \author Tony Ottosson
*
* -------------------------------------------------------------------------
*
* Copyright (C) 1995-2010 (see AUTHORS file for a list of contributors)
*
* This file is part of IT++ - a C++ library of mathematical, signal
* processing, speech processing, and communications classes and functions.
*
* IT++ is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any
* later version.
*
* IT++ is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License along
* with IT++. If not, see <http://www.gnu.org/licenses/>.
*
* -------------------------------------------------------------------------
*/
#ifndef _MSC_VER
# include <itpp/config.h>
#else
# include <itpp/config_msvc.h>
#endif
#if defined(HAVE_LAPACK)
# include <itpp/base/algebra/lapack.h>
#endif
#include <itpp/base/algebra/cholesky.h>
namespace itpp
{
#if defined(HAVE_LAPACK)
bool chol(const mat &X, mat &F)
{
char uplo = 'U';
int n, lda, info;
n = lda = X.rows();
F = X; // input matrix is overwritten
dpotrf_(&uplo, &n, F._data(), &lda, &info);
// Set lower part to zero
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
F(j, i) = 0;
return (info == 0);
}
bool chol(const cmat &X, cmat &F)
{
char uplo = 'U';
int n, lda, info;
n = lda = X.rows();
F = X; // input matrix is overwritten
zpotrf_(&uplo, &n, F._data(), &lda, &info);
// Set lower part to zero
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
F(j, i) = 0;
return (info == 0);
}
#else // HAVE_LAPACK
bool chol(const mat &X, mat &F)
{
it_error("LAPACK library is needed to use chol() function");
return false;
}
bool chol(const cmat &X, cmat &F)
{
it_error("LAPACK library is needed to use chol() function");
return false;
}
#endif // HAVE_LAPACK
cmat chol(const cmat &X)
{
cmat F;
if (!chol(X, F)) {
it_warning("cholesky factorization didn't succeed");
}
return F;
}
mat chol(const mat &X)
{
mat F;
if (!chol(X, F)) {
it_warning("cholesky factorization didn't succeed");
}
return F;
}
} // namespace itpp
|
