Related papers: Polynomial Inequalities and Optimal Stability of N…
A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…
We extend the definition of $n$-dimensional difference equations to complex order $\alpha\in \mathbb{C} $. We investigate the stability of linear systems defined by an $n$-dimensional matrix $A$ and derive conditions for the stability of…
When simulating resistive-capacitive circuits or electroquasistatic problems where conductors and insulators coexist, one observes that large time steps or low frequencies lead to numerical instabilities, which are related to the condition…
Oscillatory integrals arise in many situations where it is important to obtain decay estimates which are stable under certain perturbations of the phase. Examining the structural problems underpinning these estimates leads one to consider…
Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ with the maximal ideal $\frak{m}=(x_1,...,x_n)$. Let $\astab(I)$ and $\dstab(I)$ be the smallest integer $n$ for which $\Ass(I^n)$ and $\depth(I^n)$ stabilize,…
We revisit the numerical stability of four well-established explicit stochastic integration schemes through a new generic benchmark stochastic differential equation designed to assess asymptotic statistical accuracy and stability…
We study the numerical stability of polynomial based encoding methods, which has emerged to be a powerful class of techniques for providing straggler and fault tolerance in the area of coded computing. Our contributions are as follows: 1)…
One of the main reasons for topological persistence being useful in data analysis is that it is backed up by a stability (isometry) property: persistence diagrams of $1$-parameter persistence modules are stable in the sense that the…
The ubiquitous Lanczos method can approximate $f(A)x$ for any symmetric $n \times n$ matrix $A$, vector $x$, and function $f$. In exact arithmetic, the method's error after $k$ iterations is bounded by the error of the best degree-$k$…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
Both the mean square polynomial stability and exponential stability of $\theta$ Euler-Maruyama approximation solutions of stochastic differential equations will be investigated for each $0\le\theta\le 1$ by using an auxiliary function $F$…
Given a polynomial $p$ with no zeros in the polydisk, or equivalently the poly-upper half-plane, we study the problem of determining the ideal of polynomials $q$ with the property that the rational function $q/p$ is bounded near a boundary…
We study the number of irreducible factors (over $\mathbb{Q}$) of the $n$th iterate of a polynomial of the form $f_r(x) = x^2 + r$ for rational $r$. When the number of such factors is bounded independent of $n$, we call $f_r(x)$…
The numerical integration of an analytical function $f(x)$ using a finite set of equidistant points can be performed by quadrature formulas like the Newton-Cotes. Unlike Gaussian quadrature formulas however, higher-order Newton-Cotes…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…
A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…
A polynomial $f(x)$ over a field $K$ is said to be stable if all its iterates are irreducible over $K$. L. Danielson and B. Fein have shown that over a large class of fields $K$, if $f(x)$ is an irreducible monic binomial, then it is stable…
We show how to compute the \emph{optimal relative backward error} for the numerical solution of the Dahlquist test problem by one-step methods. This is an example of a general approach that uses results from optimal control theory to…
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…
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-colorable, hamiltonian, etc.) if and only if a related system…