Related papers: Computation of the nearest structured matrix tripl…
Reachability analysis is important for studying optimal control problems and differential games, which are powerful theoretical tools for analyzing and modeling many practical problems in robotics, aircraft control, among other application…
Given a database of bit strings $A_1,\ldots,A_m\in \{0,1\}^n$, a fundamental data structure task is to estimate the distances between a given query $B\in \{0,1\}^n$ with all the strings in the database. In addition, one might further want…
The kinematic/robotic community is not only interested in measuring the closeness of a given robot configuration to its next singular one but also in a geometric meaningful index evaluating how far the robot design is away from being…
The numerical solution of partial differential equations (PDEs) is challenging because of the need to resolve spatiotemporal features over wide length and timescales. Often, it is computationally intractable to resolve the finest features…
Analyzing high-dimensional data with manifold learning algorithms often requires searching for the nearest neighbors of all observations. This presents a computational bottleneck in statistical manifold learning when observations of…
We investigate higher derivative estimates for the Lam\'e system with hard inclusions embedded in a bounded domain in $\mathbb{R}^{d}$. As the distance $\varepsilon$ between two closely spaced hard inclusions approaches zero, the stress in…
We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the…
We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based…
Structured low-rank approximation is the problem of minimizing a weighted Frobenius distance to a given matrix among all matrices of fixed rank in a linear space of matrices. We study exact solutions to this problem by way of computational…
The notion of differentiation index for DAE systems of arbitrary order with generic second members is discussed by means of the study of the behavior of the ranks of certain Jacobian associated sub-matrices. As a by-product, we obtain upper…
A broad class of nonlinear acoustic wave models possess a Hamiltonian structure in their dissipation-free limit and a gradient flow structure for their dissipative dynamics. This structure may be exploited to design numerical methods which…
Let $[A]: Y'=AY$ with $A\in \mathrm{M}_n (k)$ be a differential linear system. We say that a matrix $R\in {\cal M}_{n}(\bar{k})$ is a {\em reduced form} of $[A]$ if $R\in \mathfrak{g}(\bar{k})$ and there exists $P\in GL_n (\bar{k})$ such…
This paper is devoted to the analysis of linear second order discrete-time descriptor systems (or singular difference equations (SiDEs) with control). Following the algebraic approach proposed by Kunkel and Mehrmann for pencils of matrix…
Consider a matrix polynomial $P \left( \lambda \right)= A_0 + \lambda A_1 + \ldots + \lambda^d A_d$, with $A_0,\ldots, A_d$ complex (or real) matrices with a certain structure. In this paper we discuss an iterative method to numerically…
In this work, we solve a discrete optimal transport problem in a nonuniform environment. To solve the optimal transport problem, we build the cost matrix and then use classical solvers for discrete optimal transport. The challenge is to…
The $\Sigma$-method for structural analysis of a differential-algebraic equation (DAE) system produces offset vectors from which the sparsity pattern of DAE's system Jacobian is derived; this pattern implies a fine block-triangular form…
Consider a discrete-time linear time-invariant descriptor system $Ex(k+1)=Ax(k)$ for $k \in \mathbb Z_{+}$. In this paper, we tackle for the first time the problem of stabilizing such systems by computing a nearby regular index one stable…
Graham and Winkler derived a formula for the determinant of the distance matrix of a full-dimensional set of $n + 1$ points $\{ x_{0}, x_{1}, \ldots , x_{n} \}$ in the Hamming cube $H_{n} = ( \{ 0,1 \}^{n}, \ell_{1} )$. In this article we…
The present article presents a summarizing view at differential-algebraic equations (DAEs) and analyzes how new application fields and corresponding mathematical models lead to innovations both in theory and in numerical analysis for this…
We introduce a generalized finite difference method for solving a large range of fully nonlinear elliptic partial differential equations in three dimensions. Methods are based on Cartesian grids, augmented by additional points carefully…