Related papers: On computing the distance to stability for matrice…
Given a homogeneous linear discrete or continuous dynamical system, its stability index is given by the dimension of the stable manifold of the zero solution. In particular, for the $n$ dimensional case, the zero solution is globally…
Stabilizing an unknown dynamical system is one of the central problems in control theory. In this paper, we study the sample complexity of the learn-to-stabilize problem in Linear Time-Invariant (LTI) systems on a single trajectory. Current…
With the ever increasing computational power available and the development of high-performances computing, investigating the properties of realistic very large-scale nonlinear dynamical systems has been become reachable. It must be noted…
A stable approach for integrating the impedance matrix in cylindrical, radial inhomogeneous structures is developed and studied. A Stroh-like system using the time-harmonic displacement-traction state vector is used to derive the Riccati…
In an earlier paper, we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of $n$-by-$n$ matrices can be done by any algorithm in $O(n^{\omega +…
This paper proposes a stochastic variant of a classic algorithm---the cubic-regularized Newton method [Nesterov and Polyak 2006]. The proposed algorithm efficiently escapes saddle points and finds approximate local minima for general…
In this paper, we study the problem of optimizing the stability of positive semi-Markov jump linear systems. We specifically consider the problem of tuning the coefficients of the system matrices for maximizing the exponential decay rate of…
This paper proposes a new approach to describe the stability of linear time-invariant systems via the torsion $\tau(t)$ of the state trajectory. For a system $\dot{r}(t)=Ar(t)$ where $A$ is invertible, we show that (1) if there exists a…
We present a novel method for approximately equilibrating a matrix $A \in {\bf R}^{m \times n}$ using only multiplication by $A$ and $A^T$. Our method is based on convex optimization and projected stochastic gradient descent, using an…
This paper focuses on using the first curvature $\kappa(t)$ of trajectory to describe the stability of linear time-invariant system. We extend the results for two and three-dimensional systems [Y. Wang, H. Sun, Y. Song et al.,…
We present a recursive formula for the computation of the static effective Hamiltonian of a system under a fast-oscillating drive. Our analytical result is well-suited to symbolic calculations performed by a computer and can be implemented…
Stable quantum computation requires noisy results to remain bounded even in the presence of noise fluctuations. Yet non-stationary noise processes lead to drift in the varying characteristics of a quantum device that can greatly influence…
Direct solution of simultaneous linear equations is regarded to be slow for large systems of equations and requires special treatment to avoid numerical instability. A new method is proposed that addresses the numerical instability without…
In this work, we construct a stable and fairly fast estimator for solving non-parametric multidimensional regression problems. The proposed estimator is based on the use of multivariate Jacobi polynomials that generate a basis for a reduced…
Using the framework of metriplectic systems on $\R^n$ we will describe a constructive geometric method to add a dissipation term to a Hamilton-Poisson system such that any solution starting in a neighborhood of a nonlinear stable…
For complex nonlinear systems, it is challenging to design algorithms that are fast, scalable, and give an accurate approximation of the stability region. This paper proposes a sampling-based approach to address these challenges. By…
We propose a fast, simple and robust algorithm for computing shortest paths and distances on Riemannian manifolds learned from data. This amounts to solving a system of ordinary differential equations (ODEs) subject to boundary conditions.…
We develop a numerical procedure to efficiently model the nonequilibrium steady state of one-dimensional arrays of open quantum systems, based on a matrix-product operator ansatz for the density matrix. The procedure searches for the null…
Explicit and semi-explicit geometric integration schemes for dissipative perturbations of Hamiltonian systems are analyzed. The dissipation is characterized by a small parameter $\epsilon$, and the schemes under study preserve the…
Collaborative filtering (CF) is a popular technique in today's recommender systems, and matrix approximation-based CF methods have achieved great success in both rating prediction and top-N recommendation tasks. However, real-world…