Related papers: Carleman Linearization of Nonlinear Systems and It…
We develop a numerical method for solving a system of nonlinear integral equations involving two integral terms: at the current time t, one integral is taken from 0 to t, and a different integral is taken from t to infinity. We prove the…
This paper investigates the errors of the solutions as well as the shadowing property of a class of nonlinear differential equations which possess unique solutions on a certain interval for any admissible initial conditions. The class of…
The randomized version of the Kaczmarz method for the solution of linear systems is known to converge linearly in expectation. In this work we extend this result and show that the recently proposed Randomized Sparse Kaczmarz method for…
This paper establishes the existence of infinitely many solutions for nonlinear problems without any symmetry, achieving three major advances. First, in the setting of semilinear elliptic PDEs, we introduce a refined variational truncation…
In this paper, we analyze the finite sample complexity of stochastic system identification using modern tools from machine learning and statistics. An unknown discrete-time linear system evolves over time under Gaussian noise without…
In this paper, the problem of full state approximation by model reduction is studied for stochastic and bilinear systems. Our proposed approach relies on identifying the dominant subspaces based on the reachability Gramian of a system. Once…
We study the classical scheduling problem on parallel machines %with precedence constraints where the precedence graph has the bounded depth $h$. Our goal is to minimize the maximum completion time. We focus on developing approximation…
Straight lines are common features in human made environments, which makes them a frequently explored feature for control applications. Many control schemes, like Visual Servoing, require the 3D parameters of the features to be estimated.…
This paper proposes a method to identify a Koopman model of a feedback-controlled system given a known controller. The Koopman operator allows a nonlinear system to be rewritten as an infinite-dimensional linear system by viewing it in…
The linearization of nonlinear systems is an important digital enhancement technique. In this paper, a real-time capable post- and pre-linearization method for the widely applicable time-varying discrete-time Volterra series is presented.…
This paper deals with time-optimal control of nonlinear continuous-time systems based on direct collocation. The underlying discretization grid is variable in time, as the time intervals are subject to optimization. This technique differs…
This paper focuses on finding approximate solutions to stochastic optimal control problems with control domains being not necessarily convex, where the state trajectory is subject to controlled stochastic differential equations. The…
The non-stationary evolution of observable quantities in complex systems can frequently be described as a juxtaposition of quasi-stationary spells. Given that standard theoretical and data analysis approaches usually rely on the assumption…
Computing the stationary distributions of a continuous-time Markov chain (CTMC) involves solving a set of linear equations. In most cases of interest, the number of equations is infinite or too large, and the equations cannot be solved…
The main aim of this paper is to solve an inverse source problem for a general nonlinear hyperbolic equation. Combining the quasi-reversibility method and a suitable Carleman weight function, we define a map of which fixed point is the…
We propose a global convergent numerical method to reconstruct the initial condition of a nonlinear parabolic equation from the measurement of both Dirichlet and Neumann data on the boundary of a bounded domain. The first step in our method…
Given a finite metric space $(X\cup Y, \mathbf{d})$ the $k$-median problem is to find a set of $k$ centers $C\subseteq Y$ that minimizes $\sum_{p\in X} \min_{c\in C} \mathbf{d}(p,c)$. In general metrics, the best polynomial time algorithm…
A sequential piecewise linear programming method is presented where bounded domains of non-convex functions are successively contracted about the solution of a piecewise linear program at each iteration of the algorithm. Although…
In this article, we present the mathematical analysis of the convergence of the linearized Crank-Nicolson Galerkin method for a nonlinear Schrodinger problem related to a domain with a moving boundary. The convergence analysis of the…
In this paper we consider approximations of Neumann problems for the integral fractional Laplacian by continuous, piecewise linear finite elements. We analyze the weak formulation of such problems, including their well-posedness and…