Related papers: On a class of parameterized solutions to interval …
In this work, we study the existence and nonexistence of solution for strongly coupled elliptic systems to m-parameters.
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 address the problem of state observation of linear time-varying systems with delayed measurements, which has attracted the attention of many researchers|see [7] and references therein. We show that, adopting the parameter…
The work is devoted to the development of numerical methods for computing "formal solutions" of interval systems of linear algebraic equations. These solutions are found in Kaucher interval arithmetic, which extends and completes the…
Probabilistic bisimulation is a fundamental notion of process equivalence for probabilistic systems. Among others, it has important applications including formalizing the anonymity property of several communication protocols. There is a lot…
In this article, we present a new approach to averaging in non-Hamiltonian systems with periodic forcing. The results here do not depend on the existence of a small parameter. In fact, we show that our averaging method fits into an…
This article presents novel proof methods for estimating interpolation errors, predicated on the understanding that one has already studied foundational error analysis using the finite element method.
We present a novel approach for learning nonlinear dynamic models, which leads to a new set of tools capable of solving problems that are otherwise difficult. We provide theory showing this new approach is consistent for models with long…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
The Interior-Point Methods are a class for solving linear programming problems that rely upon the solution of linear systems. At each iteration, it becomes important to determine how to solve these linear systems when the constraint matrix…
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability…
We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with…
Recent research has shown growing interest in modeling hypergraphs, which capture polyadic interactions among entities beyond traditional dyadic relations. However, most existing methodologies for hypergraphs face significant limitations,…
This paper is devoted to integrability conditions for systems of linear difference and differential equations with difference parameters. It is shown that such a system is difference isomonodromic if and only if it is difference…
The modern design of industrial structures leads to very complex simulations characterized by nonlinearities, high heterogeneities, tortuous geometries... Whatever the modelization may be, such an analysis leads to the solution to a family…
A method of quantizing parametrized systems is developed that is based on a kind of ``gauge invariant'' quantities---the so-called perennials (a perennial must also be an ``integral of motion''). The problem of time in its particular form…
A new pattern search method for bound constrained optimization is introduced. The proposed algorithm employs the coordinate directions, in a suitable way, with a nonmonotone line search for accepting the new iterate, without using…
In this short paper we present a linear constraint solver for the UniCalc system, an environment for reliable solution of mathematical modeling problems.
A multiparameter class of integrable systems is introduced.
We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…