Related papers: Using noncommutative Groebner bases in solving par…
In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…
This paper introduces inexact versions of several block-splitting preconditioners for solving the three-by-three block linear systems arising from a special class of indefinite least squares problems. We first establish the convergence…
The theory of Groebner Bases originated in the work of Buchberger and is now considered to be one of the most important and useful areas of symbolic computation. A great deal of effort has been put into improving Buchberger's algorithm for…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with…
Nonlinear matrix equations arise in many practical contexts related to control theory, dynamical programming and finite element methods for solving some partial differential equations. In most of these applications, it is needed to compute…
We consider using the preconditioned-Krylov subspace method to solve the system of linear equations with a three-by-three block structure. By making use of the three-by-three block structure, eight inexact block factorization…
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
We consider computational and implementation issues for the completion of monomial sets to involution using different involutive divisions. Every of these divisions produces its own completion procedure. For the polynomial case it yields an…
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
The solution of matrices with $2\times 2$ block structure arises in numerous areas of computational mathematics, such as PDE discretizations based on mixed-finite element methods, constrained optimization problems, or the implicit or steady…
We consider the problem of robust matrix completion, which aims to recover a low rank matrix $L_*$ and a sparse matrix $S_*$ from incomplete observations of their sum $M=L_*+S_*\in\mathbb{R}^{m\times n}$. Algorithmically, the robust matrix…
One studies a particular algebraic system where the unknowns are matrices. We solve this system according to the parameters values thanks to the theory of Grobner basis.
We give an explicit algorithm to compute a projective resolution of a module over the noncommutative ring based on the noncommutative Groebner bases theory.
In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…
In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…
In this paper we present a new methodology for solving multiobjective integer linear programs using tools from algebraic geometry. We introduce the concept of partial Gr\"obner basis for a family of multiobjective programs where the…
In this paper we consider a twofold Ellis-Gohberg type inverse problem in an abstract *-algebraic setting. Under natural assumptions, necessary and sufficient conditions for the existence of a solution are obtained, and it is shown that in…
This paper investigates the structure of fully nonlinear equations and their applications to geometric problems. We solve some fully nonlinear version of the Loewner-Nirenberg and Yamabe problems. Notably, we introduce Morse theory…