相关论文: On the unique solution of the generalized absolute…
We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…
We consider linear systems of equations and inequalities with coefficients varying inside given intervals. We define their solutions (so called AE solutions) and solvability (so called AE solvability) by using forall-exists quantification…
In this paper, we derive a formula to compute the solution of the linear matrix equation $X=Af(X)B+C$ via finding any solution of a specific Stein matrix equation $\mathcal{X}=\mathcal{A} \mathcal{X} \mathcal{B}+\mathcal{C}$, where the…
The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein-Vandermonde matrix is…
The solution of systems of non-autonomous linear ordinary differential equations is crucial in a variety of applications, such us nuclear magnetic resonance spectroscopy. A new method with spectral accuracy has been recently introduced in…
It is shown that globally positive solutions of a linear second order parabolic partial differential equation on a bounded domain, with Robin boundary conditions, are unique up to multiplication by a positive constant.
In this very short paper, we provide a strong motivation for the study of the following problem: given a real normed space $E$, a closed, convex, unbounded set $X\subseteq E$ and a function $f:X\to X$, find suitable conditions under which,…
We provide a generalization of first-order necessary conditions of optimality for infinite-dimensional optimization problems with a finite number of inequality constraints and with a finite number of inequality and equality constraints. Our…
The Bellman equation and its continuous-time counterpart, the Hamilton-Jacobi-Bellman (HJB) equation, serve as necessary conditions for optimality in reinforcement learning and optimal control. While the value function is known to be the…
This paper shows that guarded systems of recursive equations have unique solutions up to strong bisimilarity for any process algebra with a structural operation semantics in the ready simulation format. A similar result holds for simulation…
Let us consider the autonomous obstacle problem \begin{equation*} \min_v \int_\Omega F(Dv(x)) \, dx \end{equation*} on a specific class of admissible functions, where we suppose the Lagrangian satisfies proper hypotheses of convexity and…
The theory of complete generalized Jordan sets is employed to reduce the PDE with the irreversible linear operator $B$ of finite index to the regular problems. It is demonstrated how the question of the choice of boundary conditions is…
In this article we propose a shooting algorithm for a class of optimal control problems for which all control variables appear linearly. The shooting system has, in the general case, more equations than unknowns and the Gauss-Newton method…
Let $A$ be a real $n\times n$ matrix and $z,b\in \mathbb R^n$. The piecewise linear equation system $z-A\vert z\vert = b$ is called an \textit{absolute value equation}. We consider two solvers for this problem, one direct, one…
The problem of solving linear systems is one of the most fundamental problems in computer science, where given a satisfiable linear system $(A,b)$, for $A \in \mathbb{R}^{n \times n}$ and $b \in \mathbb{R}^n$, we wish to find a vector $x…
We consider the convolution equation $F*X=B$, where $F\in\mathbb{R}^{3\times 3}$ and $B\in\mathbb{R}^{m\times n}$ are given, and $X\in\mathbb{R}^{m\times n}$ is to be determined. The convolution equation can be regarded as a linear system…
A distributed algorithm is described for solving a linear algebraic equation of the form $Ax=b$ assuming the equation has at least one solution. The equation is simultaneously solved by $m$ agents assuming each agent knows only a subset of…
Let V be a set of number-theoretical functions. We define a notion of absolute V-realizability for predicate formulas and sequents in such a way that the indices of functions in V are used for interpreting the implication and the universal…
We derive closed formulas for the condition number of a linear function of the total least squares solution. Given an over determined linear system Ax=b, we show that this condition number can be computed using the singular values and the…
This paper provides second-order optimality conditions for optimization problems with generalized equation constraints (GEPs), a framework that encompasses several important and challenging models in mathematical programming, including…