Related papers: Solving linear difference equations with coefficie…
We consider the problem of efficiently solving large-scale linear least squares problems that have one or more linear constraints that must be satisfied exactly. Whilst some classical approaches are theoretically well founded, they can face…
A construction of differential constraints compatible with partial differential equations is considered. Certain linear determining equations with parameters are used to find such differential constraints. They generalize the classical…
We present a new eigenvalue method for solving a system of Laurent polynomial equations defining a zero-dimensional reduced subscheme of a toric compactification $X$ of $(\mathbb{C} \setminus \{0\})^n$. We homogenize the input equations to…
Consider the linear differential equation of $m$-th order with constant coefficients from the valuation ring $K$ of a non-Archimedean field. We get sufficient conditions of uniqueness and existence for the solution of this equation from…
This paper exhibits a very simple formula for a particular solution of a linear ordinary differential equation with constant real coefficients, P(d/dt)x = f, f a function given by a linear combination of polynomials, trigonometrical and…
Generalization problems in languages with binders involve computing the most common structure between expressions while respecting bound variable renaming and freshness constraints. These problems often lack a least general solution.…
Finite difference schemes are here solved by means of a linear matrix equation. The theoretical study of the related algebraic system is exposed, and enables us to minimize the error due to a finite difference approximation.
A new approach to group classification problems and more general investigations on transformational properties of classes of differential equations is proposed. It is based on mappings between classes of differential equations, generated by…
We extend classical results of Rado on partition regularity of systems of linear equations with integer coefficients to the case when the coefficient ring is either an arbitrary integral domain or a noetherian ring. In particular, we show…
We consider the iterative solution of large linear systems of equations in which the coefficient matrix is the sum of two terms, a sparse matrix $A$ and a possibly dense, rank deficient matrix of the form $\gamma UU^T$, where $\gamma > 0$…
This paper proposes a reduction technique for the generalised Riccati difference equation arising in optimal control and optimal filtering. This technique relies on a study on the generalised discrete algebraic Riccati equation. In…
In this paper we provide concrete constructions of idempotents to represent typical singular matrices over a given ring as a product of idempotents and apply these factorizations for proving our main results. We generalize works due to…
To find consistent initial data points for a system of differential-algebraic equations, requires the identification of its missing constraints. An efficient class of structural methods exploiting a dependency graph for this task was…
In this paper, we propose a procedure for constructing an infinite number of families of solutions of given linear differential equations with partial derivatives with constant coefficients. We use monogenic functions that are defined on…
In this paper we introduce a new type of differential equations with piecewise constant argument (EPCAG), more general than EPCA. The Reduction Principle is proved for EPCAG. The structure of the set of solutions is specified. We establish…
A novel method, connecting the space of solutions of a linear differential equation, of arbitrary order, to the space of monomials, is used for exploring the algebraic structure of the solution space. Apart from yielding new expressions for…
In this paper, we present methods to simplify reducible linear differential systems before solving. Classical integrals appear naturally as solutions of such systems. We will illustrate the methods developed in a previous paper on several…
In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…
We give improved lower bounds for the number of solutions of some $S$-unit equations over the integers, by counting the solutions of some associated linear equations as the coefficients in those equations vary over sparse sets. This method…
This is a continuation of a previous paper by the same authors. In the former paper, it was proved that in order to obtain local uniformization for valuations centered on local domains, it is enough to prove it for rank one valuations. In…