Related papers: Algebraic criteria for A-stability of peer two-ste…
Topological order has been proposed to go beyond Landau symmetry breaking theory for more than twenty years. But it is still a challenging problem to generally detect it in a generic many-body state. In this paper, we will introduce a…
Nowadays we are witnessing a transformation of the business processes towards a more computation driven approach. The ever increasing usage of Machine Learning techniques is the clearest example of such trend. This sort of revolution is…
This paper addresses issues concerning asymptotic stability testing and controller design for the two-dimensional Rosser model in Differential-Algebraic-Equations systems (DAEs). We present sufficient stability criteria based on the…
We investigate positive definiteness, Hurwitz stability and Schur stability of parametric interval matrices. We give a verifiable sufficient condition for positive definiteness of parametric interval matrices with non-linear dependencies.…
We present a stationary iteration method, namely Alternating Symmetric positive definite and Scaled symmetric positive semidefinite Splitting (ASSS), for solving the system of linear equations obtained by using finite element discretization…
We introduce the Morse parametric qualification condition for bilevel programming. Generic semi-algebraic functions are Morse parametric in a piecewise sense. Thus, bilevel programs with a Morse parametric lower level constitute a relevant…
In this paper, we analyze the instability of continuous-time Markov jump linear systems. Although there exist several effective criteria for the stability of Markov jump linear systems, there is a lack of methodologies for verifying their…
In this work, we consider ranking problems among a finite set of candidates: for instance, selecting the top-$k$ items among a larger list of candidates or obtaining the full ranking of all items in the set. These problems are often…
In this paper, we focus on the problem of existence and computing of small and large stable models. We show that for every fixed integer k, there is a linear-time algorithm to decide the problem LSM (large stable models problem): does a…
We consider the problem of choosing the optimal (in the sense of mean-squared prediction error) multistep predictor for an autoregressive (AR) process of finite but unknown order. If a working AR model (which is possibly misspecified) is…
This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…
The analysis of strong-stability-preserving (SSP) linear multistep methods is extended to semi-discretized problems for which different terms on the right-hand side satisfy different forward Euler (or circle) conditions. Optimal additive…
This paper presents a new paradigm to stabilize uncertain stochastic linear systems. Herein, second moment polytopic (SMP) systems are proposed that generalize systems with both uncertainty and randomness. The SMP systems are characterized…
In this paper, we present a new matrix approach for the analysis of subdivision schemes whose non-stationarity is due to linear dependency on parameters whose values vary in a compact set. Indeed, we show how to check the convergence in…
A nonlinear partial differential equation is a nonlinear relationship between an unknown function and how it changes due to two or more input variables. A numerical method reduces such an equation to arithmetic for quick visualization, but…
This paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which…
Variable steps implicit-explicit multistep methods for PDEs have been presented in [17], where the zero-stability is studied for ODEs; however, the stability analysis still remains an open question for PDEs. Based on the idea of linear…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
Linear multistep methods (LMMs) applied to approximate the solution of initial value problems---typically arising from method-of-lines semidiscretizations of partial differential equations---are often required to have certain monotonicity…
In this paper a class of robust two-stage combinatorial optimization problems is discussed. It is assumed that the uncertain second stage costs are specified in the form of a convex uncertainty set, in particular polyhedral or ellipsoidal…