Related papers: A New Algorithm for Proving Global Asymptotic Stab…
We prove that Runge-Kutta (RK) methods for numerical integration of arbitrarily large systems of Ordinary Differential Equations are linearly stable. Standard stability arguments -- based on spectral analysis, resolvent condition or strong…
We study a natural generalization of stable matching to the maximum weight stable matching problem and we obtain a combinatorial polynomial time algorithm for it by reducing it to the problem of finding a maximum weight ideal cut in a DAG.…
Perturbative renormalization group theory is developed as a unified tool for global asymptotic analysis. With numerous examples, we illustrate its application to ordinary differential equation problems involving multiple scales, boundary…
The diamond and completely bounded norms for linear maps play an increasingly important role in quantum information science, providing fundamental stabilized distance measures for differences of quantum operations. Based on the theory of…
Research of delayed neural networks with variable self-inhibitions, inter-connection weights, and inputs is an important issue. %In the real world, self-inhibitions, %inter-connection weights, and inputs should vary through time. In In this…
This paper presents a robust, distributed algorithm to solve general linear programs. The algorithm design builds on the characterization of the solutions of the linear program as saddle points of a modified Lagrangian function. We show…
We study the problem of asymptotic consensus as it occurs in a wide range of applications in both man-made and natural systems. In particular, we study systems with directed communication graphs that may change over time. We recently…
We consider difference equations of the form $x_{n+1}=F_0(x_n,\ldots,x_{n-k+1}),$ and increase the delay through a process of successive substitutions to obtain a sequence of systems $y_{n+1}=F_j(x_{n-j},\ldots,x_{n-k-j+1}),\;…
This paper synthesizes anytime algorithms, in the form of continuous-time dynamical systems, to solve monotone variational inequalities. We introduce three algorithms that solve this problem: the projected monotone flow, the safe monotone…
This paper introduces and investigates a regularity condition in the asymptotic sense for optimization problems whose objective functions are polynomial. Under this regularity condition, the normalization argument in asymptotic analysis…
We study approximation of non-autonomous linear differential equations with variable delay over infinite intervals. We use piecewise constant argument to obtain a corresponding discrete difference equation. The study of numerical…
A theory for stabilization of quantum resonances by a mechanism similar to one leading to classical resonances in nonlinear systems is presented. It explains recent surprising experimental results, obtained for cold Cesium atoms when driven…
A commonly used approach to study stability in a complex system is by analyzing the Jacobian matrix at an equilibrium point of a dynamical system. The equilibrium point is stable if all eigenvalues have negative real parts. Here, by…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
We extend the class of SQP methods for equality constrained optimization to the setting of differentiable manifolds. The use of retractions and stratifications allows us to pull back the involved mappings to linear spaces. We study local…
The aim of this paper is to extend the global error estimation and control addressed in Lang and Verwer [SIAM J. Sci. Comput. 29, 2007] for initial value problems to finite difference solutions of semilinear parabolic partial differential…
The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under…
For the delayed logistic equation $x_{n+1} = a x_n (a-x_{n-1})$ it is well known that the nontrivial fixed point is locally stable for $1<a\leq 2$, and unstable for $a>2$. We prove that for $1<a\leq 2$ the fixed point is globally stable, in…
The search of the optimal constant for a generalized Wirtinger inequality in an interval consists in minimizing the $p$-norm of the derivative among all functions whose $q$-norm is equal to~1 and whose $(r-1)$-power has zero average.…
Forecast stability, that is, the consistency of predictions over time, is essential in business settings where sudden shifts in forecasts can disrupt planning and erode trust in predictive systems. Despite its importance, stability is often…