The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...
In this paper we improve the BIF algorithm which computes simultaneously the LU factors (direct factors) of a given matrix, and their inverses (inverse factors). This algorithm was...
Abstract. It is shown that for a broad class of equations that numerical solutions computed using the discontinuous Galerkin or the continuous Galerkin time stepping schemes of arb...
This is the sample implementation and benchmark dataset of the binary image registration algorithm described in the following paper:
Csaba Domokos and Zoltan Kato. Parametric E...
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...