相关论文: Effective Localization Using Double Ideal Quotient…
We present an algorithm to compute the primary decomposition of a submodule $\mathcal{N}$ of the free module $\Z[x_1, \ldots, x_n]^m$. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the…
The detection of the top eigenvalue and its corresponding eigenvector in ensembles of random matrices has significant applications across various fields. An existing method, based on the linear stability of a complementary set of cavity…
In this paper we generalize the Interior Point-Proximal Method of Multipliers (IP-PMM) presented in [An Interior Point-Proximal Method of Multipliers for Convex Quadratic Programming, Computational Optimization and Applications, 78,…
We introduce an approach for exploring eigenvector localization phenomena for a class of (unbounded) selfadjoint operators. More specifically, given a target region and a tolerance, the algorithm identifies candidate eigenpairs for which…
In this paper, we focus on computing local minimizers of a multivariate polynomial optimization problem under certain genericity conditions. By using a technique in computer algebra and the second-order optimality condition, we provide a…
This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…
In this article, we will discuss the smooth $(X_{M}+\sqrt{-1}Y_{M})$-invariant forms on $M$ and to establish a localization formulas. As an application, we get a localization formulas for characteristic numbers.
Given a $d \times n$ integer matrix $A$, the main result is an elementary, simple-to-state algorithm that finds the largest $A$-graded ideal contained in any ideal $I$ in a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. The special case where $A$…
We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…
In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…
We improve the local generic position method for isolating the real roots of a zero-dimensional bivariate polynomial system with two polynomials and extend the method to general zero-dimensional polynomial systems. The method mainly…
The primal-dual interior point method (IPM) is widely regarded as the most efficient IPM variant for linear optimization. In this paper, we demonstrate that the improved stability of the pure primal IPM can allow speedups relative to a…
Integer linear programming (ILP) models a wide range of practical combinatorial optimization problems and significantly impacts industry and management sectors. This work proposes new characterizations of ILP with the concept of boundary…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
We suggest an iterative quantum protocol, allowing to solve optimization problems with a glassy energy landscape. It is based on a periodic cycling around the tricritical point of the many-body localization transition. This ensures that…
Simultaneous localization and mapping (SLAM) are essential in numerous robotics applications, such as autonomous navigation. Traditional SLAM approaches infer the metric state of the robot along with a metric map of the environment. While…
The next point-of-interest (POI) prediction is a significant task in location-based services, yet its complexity arises from the consolidation of spatial and semantic intent. This fusion is subject to the influences of historical…
This paper shows the existence of ideals whose localizations and completions at prime ideals are parameter test ideals of the localized and completed rings. We do this for Cohen-Macaulay localizations (resp., completions) of non-local…
Given a $D$-module $M$ generated by a single element, and a polynomial $f$, one can construct several $D$-modules attached to $M$ and $f$ and can define the notion of the (generalized) $b$-function following M. Kashiwara. These modules are…
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabilistic algorithms known as Monte Carlo Localization (MCL) is…