elem_math.cpp
Go to the documentation of this file.
#include <itpp/base/math/elem_math.h>
#include <itpp/base/itcompat.h>
namespace itpp
{
vec sqr(const cvec &data)
{
vec temp(data.length());
for (int i = 0; i < data.length(); i++)
temp(i) = sqr(data(i));
return temp;
}
mat sqr(const cmat &data)
{
mat temp(data.rows(), data.cols());
for (int i = 0; i < temp.rows(); i++) {
for (int j = 0; j < temp.cols(); j++) {
temp(i, j) = sqr(data(i, j));
}
}
return temp;
}
vec abs(const cvec &data)
{
vec temp(data.length());
for (int i = 0;i < data.length();i++)
temp[i] = std::abs(data[i]);
return temp;
}
mat abs(const cmat &data)
{
mat temp(data.rows(), data.cols());
for (int i = 0;i < temp.rows();i++) {
for (int j = 0;j < temp.cols();j++) {
temp(i, j) = std::abs(data(i, j));
}
}
return temp;
}
// Deprecated gamma function. Will be changed to tgamma().
double gamma(double x) { return tgamma(x); }
vec gamma(const vec &x) { return apply_function<double>(tgamma, x); }
mat gamma(const mat &x) { return apply_function<double>(tgamma, x); }
// Calculates factorial coefficient for index <= 170.
double fact(int index)
{
it_error_if(index > 170, "fact(int index): Function overflows if index > 170.");
it_error_if(index < 0, "fact(int index): index must be non-negative integer");
double prod = 1;
for (int i = 1; i <= index; i++)
prod *= static_cast<double>(i);
return prod;
}
// Calculates binomial coefficient "n over k".
double binom(int n, int k)
{
it_assert(k <= n, "binom(n, k): k can not be larger than n");
it_assert((n >= 0) && (k >= 0), "binom(n, k): n and k must be non-negative integers");
k = ((n - k) < k) ? n - k : k;
double out = 1.0;
for (int i = 1; i <= k; ++i) {
out *= (i + n - k);
out /= i;
}
return out;
}
// Calculates binomial coefficient "n over k".
int binom_i(int n, int k)
{
it_assert(k <= n, "binom_i(n, k): k can not be larger than n");
it_assert((n >= 0) && (k >= 0), "binom_i(n, k): n and k must be non-negative integers");
k = ((n - k) < k) ? n - k : k;
int out = 1;
for (int i = 1; i <= k; ++i) {
out *= (i + n - k);
out /= i;
}
return out;
}
// Calculates the base 10-logarithm of the binomial coefficient "n over k".
double log_binom(int n, int k)
{
it_assert(k <= n, "log_binom(n, k): k can not be larger than n");
it_assert((n >= 0) && (k >= 0), "log_binom(n, k): n and k must be non-negative integers");
k = ((n - k) < k) ? n - k : k;
double out = 0.0;
for (int i = 1; i <= k; i++)
out += log10(static_cast<double>(i + n - k))
- log10(static_cast<double>(i));
return out;
}
// Calculates the greatest common divisor
int gcd(int a, int b)
{
it_assert((a >= 0) && (b >= 0), "gcd(a, b): a and b must be non-negative integers");
int v, u, t, q;
u = a;
v = b;
while (v > 0) {
q = u / v;
t = u - v * q;
u = v;
v = t;
}
return u;
}
vec real(const cvec &data)
{
vec temp(data.length());
for (int i = 0;i < data.length();i++)
temp[i] = data[i].real();
return temp;
}
mat real(const cmat &data)
{
mat temp(data.rows(), data.cols());
for (int i = 0;i < temp.rows();i++) {
for (int j = 0;j < temp.cols();j++) {
temp(i, j) = data(i, j).real();
}
}
return temp;
}
vec imag(const cvec &data)
{
vec temp(data.length());
for (int i = 0;i < data.length();i++)
temp[i] = data[i].imag();
return temp;
}
mat imag(const cmat &data)
{
mat temp(data.rows(), data.cols());
for (int i = 0;i < temp.rows();i++) {
for (int j = 0;j < temp.cols();j++) {
temp(i, j) = data(i, j).imag();
}
}
return temp;
}
vec arg(const cvec &data)
{
vec temp(data.length());
for (int i = 0;i < data.length();i++)
temp[i] = std::arg(data[i]);
return temp;
}
mat arg(const cmat &data)
{
mat temp(data.rows(), data.cols());
for (int i = 0;i < temp.rows();i++) {
for (int j = 0;j < temp.cols();j++) {
temp(i, j) = std::arg(data(i, j));
}
}
return temp;
}
#ifdef _MSC_VER
cvec conj(const cvec &x)
{
cvec temp(x.size());
for (int i = 0; i < x.size(); i++) {
temp(i) = std::conj(x(i));
}
return temp;
}
cmat conj(const cmat &x)
{
cmat temp(x.rows(), x.cols());
for (int i = 0; i < x.rows(); i++) {
for (int j = 0; j < x.cols(); j++) {
temp(i, j) = std::conj(x(i, j));
}
}
return temp;
}
#endif
} // namespace itpp
itpp::Array
General array class.
Definition array.h:105
itpp::Array::length
int length() const
Returns the number of data elements in the array object.
Definition array.h:157
elem_math.h
Elementary mathematical functions - header file.
it_error_if
#define it_error_if(t, s)
Abort if t is true.
Definition itassert.h:117
it_assert
#define it_assert(t, s)
Abort if t is not true.
Definition itassert.h:94
itpp::log10
vec log10(const vec &x)
log-10 of the elements
Definition log_exp.h:271
itpp::prod
T prod(const Vec< T > &v)
The product of all elements in the vector.
Definition matfunc.h:195
itpp::gamma
double gamma(double x)
Deprecated gamma function - please use tgamma() instead.
Definition elem_math.cpp:79
itpp::binom
double binom(int n, int k)
Compute the binomial coefficient "n over k".
Definition elem_math.cpp:95
itpp::fact
double fact(int index)
Calculates factorial coefficient for index <= 170.
Definition elem_math.cpp:84
itpp::imag
vec imag(const cvec &data)
Imaginary part of complex values.
Definition elem_math.cpp:180
itpp::arg
vec arg(const cvec &data)
Argument (angle)
Definition elem_math.cpp:202
itpp::binom_i
int binom_i(int n, int k)
Compute the binomial coefficient "n over k".
Definition elem_math.cpp:110
itpp::real
vec real(const cvec &data)
Real part of complex values.
Definition elem_math.cpp:157
itpp::sqr
vec sqr(const cvec &data)
Absolute square of elements.
Definition elem_math.cpp:36
itpp::gcd
int gcd(int a, int b)
Compute the greatest common divisor (GCD) g of the elements a and b.
Definition elem_math.cpp:140
itpp::conj
cvec conj(const cvec &x)
Conjugate of complex value.
Definition elem_math.h:226
itpp::log_binom
double log_binom(int n, int k)
Compute the base 10 logarithm of the binomial coefficient "n over k".
Definition elem_math.cpp:125
itcompat.h
IT++ compatibility types and functions.
itpp
itpp namespace
Definition itmex.h:37
itpp::abs
bin abs(const bin &inbin)
absolute value of bin
Definition binary.h:174

Generated on Mon Jun 10 2024 11:49:18 for IT++ by Doxygen 1.9.8