File: poly_test.cpp

package info (click to toggle)
libitpp 4.3.1-14
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 9,952 kB
  • sloc: cpp: 73,628; makefile: 661; python: 548; sh: 261
file content (98 lines) | stat: -rw-r--r-- 2,813 bytes parent folder | download | duplicates (7)
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
/*!
 * \file
 * \brief Polynomial routines test program
 * \author Tony Ottosson, Adam Piatyszek and Kumar Appaiah
 *
 * -------------------------------------------------------------------------
 *
 * 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/>.
 *
 * -------------------------------------------------------------------------
 */

#include <itpp/itsignal.h>
#include <iomanip>

using namespace itpp;
using namespace std;


int main()
{
  cout << "===================================" << endl;
  cout << "    Test of polynomial routines    " << endl;
  cout << "===================================" << endl;

  cout.setf(ios::fixed);
  cout.precision(6);

  {
    cout << "Real polynomials" << endl;
    vec r = randn(3);
    vec p = poly(r);
    cvec r2 = roots(p);
    cout << "Roots, r = " << r << endl;
    cout << "Polynomial, p = " << p << endl;
    cout << "r = roots(p) = " << r2 << endl;

    r = randn(7);
    p = poly(r);
    r2 = roots(p);
    cout << "Roots, r = " << r << endl;
    cout << "Polynomial, p = " << p << endl;
    cout << "r = roots(p) = " << r2 << endl;

    vec x = randn(9);
    vec y = polyval(p, x);
    cout << "x = " << x << endl;
    cout << "polyval(p, x) = " << y << endl;
  }

  {
    cout << "Complex polynomials" << endl;
    cvec r = randn_c(3);
    cvec p = poly(r);
    cvec r2 = roots(p);
    cout << "Roots, r = " << r << endl;
    cout << "Polynomial, p = " << p << endl;
    cout << "r = roots(p) = " << r2 << endl;

    r = randn_c(7);
    p = poly(r);
    r2 = roots(p);
    cout << "Roots, r = " << r << endl;
    cout << "Polynomial, p = " << p << endl;
    cout << "r = roots(p) = " << r2 << endl;

    cvec x = randn_c(9);
    cvec y = polyval(p, x);
    cout << "x = " << x << endl;
    cout << "polyval(p, x) = " << y << endl;
  }

  {
    cout << "Chebyshev polynomial" << endl;
    vec x = randn(8);
    cout << "x = " << x << endl;
    cout << "cheb(10, x) = " << cheb(10, x) << endl;
    cout << "cheb(15, x) = " << cheb(15, x) << endl;
  }

  return 0;
}