English
Related papers

Related papers: The distance to cubic symmetry class as a polynomi…

200 papers

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

Optimization and Control · Mathematics 2015-05-07 Alberto Del Pia , Robert Hildebrand , Robert Weismantel , Kevin Zemmer

New low-order $H(\textrm{div})$-conforming finite elements for symmetric tensors are constructed in arbitrary dimension. The space of shape functions is defined by enriching the symmetric quadratic polynomial space with the $(d+1)$-order…

Numerical Analysis · Mathematics 2024-02-22 Xuehai Huang , Chao Zhang , Yaqian Zhou , Yangxing Zhu

We study the quadratic invariants of the elasticity tensor in the framework of its unique irreducible decomposition. The key point is that this decomposition generates the direct sum reduction of the elasticity tensor space. The…

Other Condensed Matter · Physics 2017-04-18 Yakov Itin

This paper studies the rank-1 tensor completion problem for cubic tensors when there are noises for observed tensor entries. First, we propose a robust biquadratic optimization model for obtaining rank-1 completing tensors. When the…

Optimization and Control · Mathematics 2025-04-02 Jiawang Nie , Xindong Tang , Jinling Zhou

The existing theory of incompatible elastic sheets uses the deviation of the surface metric from a reference metric to define the strain tensor [Efrati et al., J. Mech. Phys. Solids {\bf 57}, 762 (2009)]. For a class of simple axisymmetric…

Soft Condensed Matter · Physics 2017-05-24 Oz Oshri , Haim Diamant

We consider the problem of optimally insulating a given domain $\Omega$ of ${\mathbb{R}}^d$; this amounts to solve a nonlinear variational problem, where the optimal thickness of the insulator is obtained as the boundary trace of the…

Optimization and Control · Mathematics 2016-01-12 Dorin Bucur , Giuseppe Buttazzo , Carlo Nitsch

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

Optimization and Control · Mathematics 2019-06-06 Victor Magron , Pierre-Loic Garoche , Didier Henrion , Xavier Thirioux

We show that the optimal packing of hard spheres in an infinitely long cylinder yields structures characterised by a screw symmetry. Each packing can be assembled by stacking a basic unit cell ad infinitum along the length of the cylinder…

Soft Condensed Matter · Physics 2014-03-05 A. Mughal

We present an efficient algorithm for computing the closest singular configuration to each non-singular pose of a 3-RPR planar manipulator performing a 1-parametric motion. By considering a 3-RPR manipulator as a planar framework, one can…

Robotics · Computer Science 2023-10-12 Aditya Kapilavai , Georg Nawratil

The set $GU_f$ of possible effective elastic tensors of composites built from two materials with positive definite elasticity tensors $\BC_1$ and $\BC_2=\Gd\BC_0$ comprising the set $U=\{\BC_1,\Gd\BC_0\}$ and mixed in proportions $f$ and…

Materials Science · Physics 2017-04-19 Graeme W. Milton , Davit Harutyunyan , Marc Briane

The crystal symmetry of a material dictates the type of topological band structures it may host, and therefore symmetry is the guiding principle to find topological materials. Here we introduce an alternative guiding principle, which we…

We show {\it semidefinite programming} (SDP) feasibility problem is equivalent to solving a {\it convex hull relaxation} (CHR) for a finite system of quadratic equations. On the one hand, this offers a simple description of SDP. On the…

Optimization and Control · Mathematics 2020-08-18 Bahman Kalantari

Due to the multi-linearity of tensors, most algorithms for tensor optimization problems are designed based on the block coordinate descent method. Such algorithms are widely employed by practitioners for their implementability and…

Optimization and Control · Mathematics 2022-01-14 Ke Ye , Shenglong Hu

An analytical solution in a closed form is obtained for the three-dimensional elastic strain distribution in an unlimited medium containing an inclusion with a coordinate-dependent lattice mismatch (an eigenstrain). Quantum dots consisting…

Mesoscale and Nanoscale Physics · Physics 2017-04-05 A. V. Nenashev , A. V. Dvurechenskii

The Golomb ruler problem is defined as follows: Given a positive integer n, locate n marks on a ruler such that the distance between any two distinct pair of marks are different from each other and the total length of the ruler is…

Optimization and Control · Mathematics 2019-06-11 Burak Kocuk , Willem-Jan van Hoeve

We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1+epsilon by a piecewise-linear minimization problem over the same feasible set. Our…

Optimization and Control · Mathematics 2012-01-17 Thomas L. Magnanti , Dan Stratila

Understanding crystal growth over arbitrary curved surfaces with arbitrary boundaries is a formidable challenge, stemming from the complexity of formulating non-linear elasticity using geometric invariant quantities. Solutions are generally…

Soft Condensed Matter · Physics 2025-01-22 Yankang Liu , Siyu Li , Roya Zandi , Alex Travesset

The symmetry dimension of a geometric structure is the dimension of its symmetry algebra. We investigate symmetries of almost quaternionic structures of quaternionic dimension $n$. The maximal possible symmetry is realized by the…

Differential Geometry · Mathematics 2016-07-08 Boris Kruglikov , Henrik Winther , Lenka Zalabova

We study the problem of identifying those cubic B\'ezier curves that are close in the L2 norm to planar elastic curves. The problem arises in design situations where the manufacturing process produces elastic curves; these are difficult to…

Numerical Analysis · Mathematics 2018-05-22 David Brander , J. Andreas Bærentzen , Ann-Sofie Fisker , Jens Gravesen

We consider the problem of approximately solving a standard bi-quadratic programming (StBQP), which is NP-hard. After reformulating the original problem as an equivalent copositive tensor programming, we show how to approximate the optimal…

Optimization and Control · Mathematics 2015-01-14 Chen Ling , Hongjin He , Liqun Qi