Related papers: Rigid components in fixed-lattice and cone framewo…
Robust optimization (RO) has emerged as one of the leading paradigms to efficiently model parameter uncertainty. The recent connections between RO and problems in statistics and machine learning domains demand for solving RO problems in…
Assembly of large scale structural systems in space is understood as critical to serving applications that cannot be deployed from a single launch. Recent literature proposes the use of discrete modular structures for in-space assembly and…
Ellipse and ellipsoid fitting has been extensively researched and widely applied. Although traditional fitting methods provide accurate estimation of ellipse parameters in the low-noise case, their performance is compromised when the noise…
We study quadratic moduli schemes $X$ of algebra laws on a fixed vector space $W$ under the transport-of-structure action of $GL(W)$ on $Hom(W^{\otimes 2},W)$. We construct an intrinsic three-term deformation complex on $X$ whose fibers…
We provide an algorithm to compute generators of the orthogonal group of the discriminant group associated to an integral quadratic lattice over the integers. We give a closed formula for its order.
N.Katz's middle convolution algorithm provides a description of rigid connections on the projective line with regular singularities. We extend the algorithm by adding the Fourier transform to it. The extended algorithm provides a…
The work deals with the existence of solutions of a certain system of quadratic integral equations in H^2(R^d,R^N), d = 2, 3. We demonstrate the existence of a perturbed solution by virtue of a fixed point technique.
We provide both a general framework for discretizing de Rham sequences of differential forms of high regularity, and some examples of finite element spaces that fit in the framework. The general framework is an extension of the previously…
We provide a problem definition of the stable marriage problem for a general number of parties $p$ under a natural preference scheme in which each person has simple lists for the other parties. We extend the notion of stability in a natural…
We survey the numerical stability of some fast algorithms for solving systems of linear equations and linear least squares problems with a low displacement-rank structure. For example, the matrices involved may be Toeplitz or Hankel. We…
We show that a uniformly acute triangulation of the plane is rigid under Luo's discrete conformal change, extending previous results on hexagonal triangulations. Our result is a discrete analogue of the conformal rigidity of the plane. We…
Fitting geometric models onto outlier contaminated data is provably intractable. Many computer vision systems rely on random sampling heuristics to solve robust fitting, which do not provide optimality guarantees and error bounds. It is…
A (bar-and-joint) framework is a set of points in a normed space with a set of fixed distance constraints between them. Determining whether a framework is locally rigid - i.e. whether every other suitably close framework with the same…
In the context of state-space models, skeleton-based smoothing algorithms rely on a backward sampling step which by default has a $\mathcal O(N^2)$ complexity (where $N$ is the number of particles). Existing improvements in the literature…
The critical behavior of frustrated spin systems with nonplanar orderings is analyzed by a six-loop study in fixed dimension of an effective O$(N) \times $O$(M)$ Landau-Ginzburg-Wilson Hamiltonian. For this purpose the large-order behavior…
We present a stochastic algorithm for constructing a topologically disordered (i.e., non-regular) spatial lattice with nodes of constant coordination number, the CC lattice. The construction procedure dramatically improves on an earlier…
Robust principal component analysis is an important representative method in data analysis. It is usually viewed as an optimization problem involving the rank and $\ell_0$-norm of matrices. In this paper, we study the rank and $\ell_0$…
A chaos control algorithm is developed to actively stabilize unstable periodic orbits of higher-dimensional systems. The method assumes knowledge of the model equations and a small number of experimentally accessible parameters. General…
This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…
Lagrangian coherent structures (LCS) in fluid flows appear as co-dimension one ridges of the finite time Lyapunov exponent (FTLE) field. In three- dimensions this means two-dimensional ridges. A fast algorithm is presented here to locate…