Suggests: spatstat, lattice, testthat, mvtnorm, statmod, rgeos, gpclib

Description: Numerical integration of continuously differentiable
functions f(x,y) over simple closed polygonal domains.
The following cubature methods are implemented:
product Gauss cubature (Sommariva and Vianello, 2007,
the simple two-dimensional midpoint rule
adaptive cubature for radially symmetric functions via line
integrate() along the polygon boundary (Meyer and Held, 2014,
and integration of the bivariate Gaussian density based on a
For simple integration along the axes, the packages 'cubature'
Imports: grDevices, graphics, stats, sp (>= 1.0-11)
Suggests: spatstat, lattice, testthat, mvtnorm, statmod, rgeos, gpclib,

and integration of the bivariate Gaussian density based on
For simple integration along the axes, the 'cubature' package

Suggests: spatstat.geom, lattice, mvtnorm, statmod, rgeos, gpclib, sf,

Title: Infrastructure for Manipulation Polynomial Matrices
Implementation of class "polyMatrix" for storing a matrix of polynomials and implements
basic matrix operations; including a determinant and characteristic polynomial.
It is based on the package 'polynom' and uses a lot of its methods to implement matrix operations.
This package includes 2 methods of triangularization of polynomial matrices:
Extended Euclidean algorithm which is most classical but numerically unstable;
Sylvester algorithm based on LQ decomposition.
D. Henrion & M. Sebek, Reliable numerical methods for polynomial matrix triangularization,
IEEE Transactions on Automatic Control (Volume 44, Issue 3, Mar 1999, Pages 497-508) <doi:10.1109/9.751344>
Salah Labhalla, Henri Lombardi & Roger Marlin,
Algorithmes de calcule de la reduction de Hermite d'une matrice a coefficients polynomeaux,
person("Nikolai", "Ryzhkov", email="namezys@gmail.com", role=c("aut", "cre")),
person("Ildiko", "Laszlo", role="ctb", comment = c(ORCID = "0000-0003-2324-8183")),

person("Ildiko", "Laszlo", role="aut", comment = c(ORCID = "0000-0003-2324-8183")),

This package includes 3 methods of triangularization of polynomial matrices:
Sylvester algorithm based on LQ decomposition;
Interpolation algorithm is based on LQ decomposition and Newton interpolation.