相关论文: Completion of Linear Differential Systems to Invol…

For a polynomial dynamical system, we study the problem of computing the minimal differential equation satisfied by a chosen coordinate (in other words, projecting the system on the coordinate). This problem can be viewed as a special case…

A procedure and theoretical results are presented for the problem of determining a minimal robust positively invariant (RPI) set for a linear discrete-time system subject to unknown, bounded disturbances. The procedure computes, via the…

In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…

Invariants of general linear system of two hyperbolic partial differential equations (PDEs) are derived under transformations of the dependent and independent variables by real infinitesimal method earlier. Here a subclass of the general…

The Painleve test is very useful to construct not only the Laurent-series solutions but also the elliptic and trigonometric ones. Such single-valued functions are solutions of some polynomial first order differential equations. To find the…

There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…

We present an approach for construction of functional bases of differential invariants for some infinite-dimensional algebras with coefficients of generating operators depending on arbitrary functions. An example for the…

We propose the method for obtaining invariants of arbitrary representations of Lie groups that reduces this problem to known problems of linear algebra. The basis of this method is the idea of a special extension of the representation…

Time-invariant linear dynamical system arises in many real-world applications,and its usefulness is widely acknowledged. A practical limitation with this model is that its latent dimension that has a large impact on the model capability…

We present a novel deep learning approach to approximate the solution of large, sparse, symmetric, positive-definite linear systems of equations. These systems arise from many problems in applied science, e.g., in numerical methods for…

We develop the theory of difference algebraic groups in the case where we have finitely many pairwise commuting difference operators. We show that the defining ideal of a difference algebraic group is finitely generated as a difference…

In this paper, we consider an extended concept of invariant for polynomial dynamical system (PDS) with domain and initial condition, and establish a sound and complete criterion for checking semi-algebraic invariants (SAI) for such PDSs.…

Nonlinear polynomial selection algorithms for the number field sieve address the problem of constructing polynomials with small coefficients by reducing to instances of the well-studied problem of finding short vectors in lattices. The…

The construction of the general solution sequence of row-finite linear systems is accomplished by implementing -ad infinitum- the Gauss-Jordan algorithm under a rightmost pivot elimination strategy. The algorithm generates a basis (finite…

We completely characterize all nonlinear partial differential equations leaving a given finite-dimensional vector space of analytic functions invariant. Existence of an invariant subspace leads to a re duction of the associated dynamical…

Methods for the design of physical parameterization schemes that possess certain invariance properties are discussed. These methods are based on different techniques of group classification and provide means to determine expressions for…

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

A central question in verification is characterizing when a system has invariants of a certain form, and then synthesizing them. We say a system has a $k$ linear invariant, $k$-LI in short, if it has a conjunction of $k$ linear (non-strict)…

Several recent works have developed a new, probabilistic interpretation for numerical algorithms solving linear systems in which the solution is inferred in a Bayesian framework, either directly or by inferring the unknown action of the…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…