tests/geometry/test-linalg.cpp
author Dmitriy Morozov <dmitriy@mrzv.org>
Tue, 14 Apr 2009 14:38:08 -0700
branchdev
changeset 129 95454ea3f9c0
parent 55 7e71f5984931
permissions -rw-r--r--
Cleaned up Python bindings to restore functionality: * StaticPersistence is iterable, its nodes are usable (sign, pair, cycle) * StaticPersistence knows how to map its nodes into Filtration indices * moved PythonCmp into utils.h * minor cosmetic changes

#include "geometry/linalg.h"
#include <iostream>

#include <synaps/upol.h>
#include <synaps/upol/gcd.h>
#include "geometry/rational-function.h"


typedef			UPolDse<double>					Polynomial;
typedef			RationalFunction<Polynomial>	RationalF;

//typedef 		LinearAlgebra<double>			LinAlg;
//typedef 		LinearAlgebra<Polynomial>		LinAlg;
typedef 		LinearAlgebra<RationalF>		LinAlg;

int main()
{
	LinAlg::MatrixType  a(2,2);
	a(0,0) = Polynomial("3*x"); a(1,0) = Polynomial(4); a(0,1) = Polynomial(0); a(1,1) = Polynomial(7);

	std::cout << a << std::endl;
	std::cout << LinAlg::determinant(a) << std::endl;
	std::cout << Polynomial("3*x^2 + 4*x") / Polynomial("3*x^2") << std::endl;

	LinAlg::VectorType b(2), x;
	b(0) = Polynomial(4); b(1) = Polynomial(3);
	LinAlg::solve(a, b, x);
	std::cout << x << std::endl;

	x(0).normalize(); x(1).normalize();
	std::cout << x << std::endl;
}