Related papers: Stability of fast algorithms for structured linear…
We study the stability properties of linear time-varying systems in continuous time whose system matrix is Metzler with zero row sums. This class of systems arises naturally in the context of distributed decision problems, coordination and…
In the design of decentralized networked systems, it is useful to know whether a given network topology can sustain stable dynamics. We consider a basic version of this problem here: given a vector space of sparse real matrices, does it…
This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable. We present sufficient conditions on the subsystems matrices such that a switched system is globally exponentially stable under a set…
We study the stability with respect to perturbations and the accuracy of numerical algorithms for computing solutions to the multilinear PageRank problem $\mathbf{x} = (1-\alpha)\mathbf{v} + \alpha \mathcal{P} \mathbf{x}^2$. Our results…
An algorithm for detecting periodic orbits in chaotic systems [Phys. Rev. E, 60 (1999), pp.~6172--6175], which combines the set of stabilising transformations proposed by Schmelcher and Diakonos [Phys. Rev. Lett., 78 (1997), pp.~4733--4736]…
We derive a sufficient condition for stability in probability of an equilibrium of a randomly perturbed map in ${\mathbb R}^d$. This condition can be used to stabilize weakly unstable equilibria by random forcing. Analytical results on…
Structure-preserving algorithms and algorithms with uniform error bound have constituted two interesting classes of numerical methods. In this paper, we blend these two kinds of methods for solving nonlinear Hamiltonian systems with highly…
We show cocycle stability for linear maps with a weak irreducibility condition and their jointly integrable perturbations.
An algorithm for detecting unstable periodic orbits in chaotic systems [Phys. Rev. E, 60 (1999), pp. 6172-6175] which combines the set of stabilising transformations proposed by Schmelcher and Diakonos [Phys. Rev. Lett., 78 (1997), pp.…
Graph algorithms are widely used for decision making and knowledge discovery. To ensure their effectiveness, it is essential that their output remains stable even when subjected to small perturbations to the input because frequent output…
In this paper, we mainly study tilt stability and Lipschitz stability of convex optimization problems. Our characterizations are geometric and fully computable in many important cases. As a result, we apply our theory to the group Lasso…
This paper considers the non-convex problem of finding the nearest Metzler matrix to a given possibly unstable matrix. Linear systems whose state vector evolves according to a Metzler matrix have many desirable properties in analysis and…
Designing the topology of three-dimensional structures is a challenging problem due to its memory and time consumption. In this paper, we present a robust and efficient algorithm for solving large-scale 3D topology optimization problems.…
Recent theory of mapping an image into a structured low-rank Toeplitz or Hankel matrix has become an effective method to restore images. In this paper, we introduce a generalized structured low-rank algorithm to recover images from their…
The issues of robust stability for two types of uncertain fractional-order systems of order $\alpha \in (0,1)$ are dealt with in this paper. For the polytope-type uncertainty case, a less conservative sufficient condition of robust…
Stability of nonconvex quadratic programming problems under finitely many convex quadratic constraints in Hilbert spaces is investigated. We present several stability properties of the global solution map, and the continuity of the optimal…
Robustness of linear systems with constant coefficients is considered. There exist methods and tools for analyzing the stability of systems with random or deterministic uncertainties. At the same time, there are no approaches for the…
Given a family of systems, identifying stabilizing switching signals in terms of infinite walks constructed by concatenating cycles on the underlying directed graph of a switched system that satisfy certain conditions, is a well-known…
We propose a space-time isogeometric finite element method for the linear Schr\"odinger equation, and establish its unconditional stability through a matrix-based analysis. Although maximal-regularity splines in time provide higher accuracy…
A matrix algorithm is said to be superfast (that is, runs at sublinear cost) if it involves much fewer scalars and flops than the input matrix has entries. Such algorithms have been extensively studied and widely applied in modern…