Related papers: Using noncommutative Groebner bases in solving par…
A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…
Bit-vectors, which are integers in a finite number of bits, are ubiquitous in software and hardware systems. In this work, we consider the satisfiability modulo theories (SMT) of bit-vectors. Unlike normal integers, the arithmetics of…
Over the past decade, the Gr\"obner basis theory and automatic solver generation have lead to a large number of solutions to geometric vision problems. In practically all cases, the derived solvers apply a fixed elimination template to…
Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
We establish a new iterative method for solving a class of large and sparse linear systems of equations with three-by-three block coefficient matrices having saddle point structure. Convergence properties of the proposed method are studied…
We present Groebner.jl, a Julia package for computing Groebner bases with the F4 algorithm. Groebner.jl is an efficient, portable, and open-source software. Groebner.jl works over integers modulo a prime and over the rationals, supports…
Exploiting symmetry in Groebner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being…
We consider parameter identification problems in parametrized partial differential equations (PDE). This leads to nonlinear ill-posed inverse problems. One way to solve them are iterative regularization methods, which typically require…
In this paper we study the problem of bilinear regression and we further address the case when the response matrix contains missing data that referred as the problem of inductive matrix completion. We propose a quasi-Bayesian approach first…
In this paper, we consider parametric ideals and introduce a notion of comprehensive involutive system. This notion plays the same role in theory of involutive bases as the notion of comprehensive Groebner system in theory of Groebner…
We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In previous work [R. Hemmecke, M. Koeppe, R. Weismantel, A…
In this paper, in addition to the earlier introduced involutive divisions, we consider a new class of divisions induced by admissible monomial orderings. We prove that these divisions are noetherian and constructive. Thereby each of them…
Obtaining the inverse of a large symmetric positive definite matrix $\mathcal{A}\in\mathbb{R}^{p\times p}$ is a continual challenge across many mathematical disciplines. The computational complexity associated with direct methods can be…
This article introduces an iterative method for solving nonsingular non-Hermitian positive semidefinite systems of linear equations. To construct the iteration process, the coefficient matrix is split into two non-Hermitian positive…
The paper studies inverse problems of determining unknown coefficients in various semi-linear and quasi-linear wave equations. We introduce a method to solve inverse problems for non-linear equations using interaction of three waves, that…
To integer programming problems, computational algebraic approaches using Grobner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time…
We investigate systems of equations, involving parameters from the point of view of both control theory and computer algebra. The equations might involve linear operators such as partial (q-)differentiation, (q-)shift, (q-)difference as…
This paper is concerned with the nonnegative inverse eigenvalue problem of finding a nonnegative matrix such that its spectrum is the prescribed self-conjugate set of complex numbers. We first reformulate the nonnegative inverse eigenvalue…
The study of solving inverse singular value problems for nonnegative matrices has been around for decades. It is clear that an inverse singular problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…