160 lines
5.0 KiB
C++
160 lines
5.0 KiB
C++
/*
|
|
LA: linear algebra C++ interface library
|
|
Copyright (C) 2021 Jiri Pittner <jiri.pittner@jh-inst.cas.cz> or <jiri@pittnerovi.com>
|
|
|
|
This program 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.
|
|
|
|
This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
|
|
#ifndef _POLYNOMIAL_H
|
|
#define _POLYNOMIAL_H
|
|
|
|
#include "la_traits.h"
|
|
#include "vec.h"
|
|
|
|
namespace LA {
|
|
|
|
template <typename T>
|
|
class Polynomial : public NRVec<T> {
|
|
public:
|
|
Polynomial(): NRVec<T>() {};
|
|
Polynomial(const NRVec<T> &v) : NRVec<T>(v) {}; //allow implicit conversion from NRVec
|
|
Polynomial(const int n) : NRVec<T>(n+1) {};
|
|
Polynomial(const T &a, const int n) : NRVec<T>(n+1) {NRVec<T>::clear(); (*this)[0]=a;};
|
|
|
|
int degree() const {return NRVec<T>::size()-1;};
|
|
void resize(const int n, const bool preserve=true) {NRVec<T>::resize(n+1,preserve);}
|
|
|
|
Polynomial& operator+=(const T &a) {NOT_GPU(*this); NRVec<T>::copyonwrite(); (*this)[0]+=a; return *this;}
|
|
Polynomial& operator-=(const T &a) {NOT_GPU(*this); NRVec<T>::copyonwrite(); (*this)[0]-=a; return *this;}
|
|
Polynomial operator+(const T &a) const {return Polynomial(*this) += a;};
|
|
Polynomial operator-(const T &a) const {return Polynomial(*this) -= a;};
|
|
Polynomial operator-() const {return NRVec<T>::operator-();}
|
|
Polynomial operator*(const T &a) const {return NRVec<T>::operator*(a);}
|
|
Polynomial operator/(const T &a) const {return NRVec<T>::operator/(a);}
|
|
Polynomial& operator*=(const T &a) {NRVec<T>::operator*=(a); return *this;}
|
|
Polynomial& operator/=(const T &a) {NRVec<T>::operator/=(a); return *this;}
|
|
|
|
Polynomial& operator+=(const Polynomial &rhs)
|
|
{
|
|
NOT_GPU(*this); NRVec<T>::copyonwrite();
|
|
if(rhs.degree()>degree()) resize(rhs.degree(),true);
|
|
for(int i=0; i<=rhs.degree(); ++i) (*this)[i] += rhs[i];
|
|
return *this;
|
|
}
|
|
|
|
Polynomial& operator-=(const Polynomial &rhs)
|
|
{
|
|
NOT_GPU(*this); NRVec<T>::copyonwrite();
|
|
if(rhs.degree()>degree()) resize(rhs.degree(),true);
|
|
for(int i=0; i<=rhs.degree(); ++i) (*this)[i] -= rhs[i];
|
|
return *this;
|
|
}
|
|
Polynomial operator+(const Polynomial &rhs) const {return Polynomial(*this) += rhs;};
|
|
Polynomial operator-(const Polynomial &rhs) const {return Polynomial(*this) -= rhs;};
|
|
Polynomial operator*(const Polynomial &rhs) const //for very long polynomials FFT should be used
|
|
{
|
|
NOT_GPU(*this);
|
|
Polynomial r(degree()+rhs.degree());
|
|
r.clear();
|
|
for(int i=0; i<=rhs.degree(); ++i) for(int j=0; j<=degree(); ++j) r[i+j] += rhs[i]*(*this)[j];
|
|
return r;
|
|
};
|
|
void simplify(const typename LA_traits<T>::normtype thr)
|
|
{
|
|
NOT_GPU(*this);
|
|
int n=degree();
|
|
while(n>0 && abs((*this)[n])<thr) --n;
|
|
resize(n,true);
|
|
};
|
|
Polynomial shifted(const int shift) const
|
|
{
|
|
if(shift==0) return *this;
|
|
if(shift>0)
|
|
{
|
|
Polynomial r(degree()+shift);
|
|
for(int i=0; i<shift; ++i) r[i]=0;
|
|
for(int i=0; i<=degree(); ++i) r[shift+i] = (*this)[i];
|
|
return r;
|
|
}
|
|
else
|
|
{
|
|
if(shift+degree()<0)
|
|
{
|
|
Polynomial r(0);
|
|
r[0]=0;
|
|
return r;
|
|
}
|
|
Polynomial r(shift+degree());
|
|
for(int i= -shift; i<=degree(); ++i) r[shift+i] = (*this)[i];
|
|
return r;
|
|
}
|
|
}
|
|
Polynomial derivative() const
|
|
{
|
|
NOT_GPU(*this);
|
|
int n=degree();
|
|
if(n==0)
|
|
{
|
|
Polynomial r(0);
|
|
r[0]=0;
|
|
return r;
|
|
}
|
|
Polynomial r(n-1);
|
|
for(int i=1; i<=n; ++i) r[i-1] = (*this)[i]* ((T)i);
|
|
return r;
|
|
};
|
|
Polynomial integral() const
|
|
{
|
|
NOT_GPU(*this);
|
|
int n=degree();
|
|
Polynomial r(n+1);
|
|
r[0]=0;
|
|
for(int i=0; i<=n; ++i) r[i+1] = (*this)[i]/((T)(i+1));
|
|
return r;
|
|
}
|
|
void polydiv(const Polynomial &rhs, Polynomial &q, Polynomial &r) const;
|
|
Polynomial operator/(const Polynomial &rhs) const {Polynomial q,r; polydiv(rhs,q,r); return q;};
|
|
Polynomial operator%(const Polynomial &rhs) const {Polynomial q,r; polydiv(rhs,q,r); return r;};
|
|
|
|
//gcd, lcm
|
|
//roots, interpolation ... special only for real->complex - declare only and implent only template specialization in .cc
|
|
|
|
};
|
|
|
|
//this is very general, can be used also for nesting polynomials
|
|
template <typename T, typename C>
|
|
C value(const Polynomial<T> &p, const C &x)
|
|
{
|
|
C sum(x);
|
|
sum=0; //get matrix dimension if C is a matrix
|
|
for(int i=p.degree(); i>0; --i)
|
|
{
|
|
sum+= p[i];
|
|
sum= sum*x; //not *= for matrices
|
|
}
|
|
sum += p[0];
|
|
return sum;
|
|
}
|
|
|
|
//scalar+-polynomial
|
|
template <typename T>
|
|
inline Polynomial<T> operator+(const T &a, const Polynomial<T> &rhs) {return Polynomial<T>(rhs)+=a;}
|
|
template <typename T>
|
|
inline Polynomial<T> operator-(const T &a, const Polynomial<T> &rhs) {return Polynomial<T>(rhs)-=a;}
|
|
|
|
|
|
}//namespace
|
|
#endif
|