English
Related papers

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

200 papers

We study the problem of a cholesteric liquid crystal confined to an elliptical channel. The system is geometrically frustrated because the cholesteric prefers to adopt a uniform rate of twist deformation, but the elliptical domain precludes…

Soft Condensed Matter · Physics 2017-06-15 David B. Emerson , Patrick E. Farrell , James H. Adler , Scott P. MacLachlan , Timothy J. Atherton

Bi-quadratic programming over unit spheres is a fundamental problem in quantum mechanics introduced by pioneer work of Einstein, Schr\"odinger, and others. It has been shown to be NP-hard; so it must be solve by efficient heuristic…

Numerical Analysis · Mathematics 2022-08-23 Shigui Li , Linzhang Lu , Xing Qiu , Zhen Chen , Delu Zeng

We construct finite element subspaces of the space of symmetric tensors with square-integrable divergence on a three-dimensional domain. These spaces can be used to approximate the stress field in the classical Hellinger--Reissner mixed…

Numerical Analysis · Mathematics 2014-01-29 Douglas N. Arnold , Gerard Awanou , Ragnar Winther

In this paper we propose a special type of a tree tensor network that has the geometry of a comb---a 1D backbone with finite 1D teeth projecting out from it. This tensor network is designed to provide an effective description of higher…

Strongly Correlated Electrons · Physics 2019-06-27 Natalia Chepiga , Steven R. White

In this paper we introduce an abstract nonsmooth optimization problem and prove existence and uniqueness of its solution. We present a numerical scheme to approximate this solution. The theory is later applied to a sample static contact…

Numerical Analysis · Mathematics 2019-03-12 Michal Jureczka , Anna Ochal

High-order tensor methods for solving both convex and nonconvex optimization problems have generated significant research interest, leading to algorithms with optimal global rates of convergence and local rates that are faster than Newton's…

Optimization and Control · Mathematics 2023-12-25 Wenqi Zhu , Coralia Cartis

In this paper, we develop two fully nonconforming (both H(grad curl)-nonconforming and H(curl)-nonconforming) finite elements on cubical meshes which can fit into the Stokes complex. The newly proposed elements have 24 and 36 degrees of…

Numerical Analysis · Mathematics 2023-01-16 Lixiu Wang , Mingyan Zhang , Qian Zhang

In this paper we examine a new class of five dimensional (5D) exact solutions in extra dimension gravity possessing Lie algebroid symmetry. The constructions provide a motivation for the theory of Clifford nonholonomic algebroids elaborated…

High Energy Physics - Theory · Physics 2007-05-23 Sergiu I. Vacaru

We propose two classes of mixed finite elements for linear elasticity of any order, with interior penalty for nonconforming symmetric stress approximation. One key point of our method is to introduce some appropriate nonconforming…

Numerical Analysis · Mathematics 2017-05-22 Shuonan Wu , Shihua Gong , Jinchao Xu

We study the Travelling Salesman Problem (TSP) on the metric completion of cubic and subcubic graphs, which is known to be NP-hard. The problem is of interest because of its relation to the famous 4/3 conjecture for metric TSP, which says…

Data Structures and Algorithms · Computer Science 2011-07-07 Sylvia Boyd , René Sitters , Suzanne van der Ster , Leen Stougie

We consider 2- and 3-dimensional cubic monocrystalline and polycrystalline materials. Expressions for Young's and shear moduli and Poisson's ratio are expressed in terms of eigenvalues of the stiffness tensor. Such a form is well suited for…

Materials Science · Physics 2015-05-14 C. Jasiukiewicz , T. Paszkiewicz , S. Wolski

The Gromov-Wasserstein distance is a notable extension of optimal transport. In contrast to the classic Wasserstein distance, it solves a quadratic assignment problem that minimizes the pair-wise distance distortion under the transportation…

Machine Learning · Computer Science 2024-04-16 Wei Zhang , Zihao Wang , Jie Fan , Hao Wu , Yong Zhang

We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…

Computational Geometry · Computer Science 2014-01-08 Stefan König

This paper presents a methodology for solving a geometrically robust least squares problem, which arises in various applications where the model is subject to geometric constraints. The problem is formulated as a minimax optimization…

Optimization and Control · Mathematics 2025-11-06 Jeremy Coulson , Alberto Padoan , Cyrus Mostajeran

The composite plate problem is an eigenvalue optimization problem related to the fourth order operator $(-\Delta)^2$. In this paper we continue the study started in [10], focusing on symmetry and rigidity issues in the case of the hinged…

Analysis of PDEs · Mathematics 2020-02-28 Francesca Colasuonno , Eugenio Vecchi

The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…

Numerical Analysis · Mathematics 2021-02-26 Aleš Vavpetič , Emil Žagar

We present a finite-element approximation for the one-sided Stefan problem and the one-sided Mullins--Sekerka problem, respectively. The problems feature a fully anisotropic Gibbs--Thomson law, as well as kinetic undercooling. Our…

Computational Physics · Physics 2013-03-25 John W. Barrett , Harald Garcke , Robert Nürnberg

We design the conforming virtual element method for the numerical approximation of the two dimensional elastodynamics problem. We prove stability and convergence of the semi-discrete approximation and derive optimal error estimates under…

Numerical Analysis · Mathematics 2020-10-16 P. F. Antonietti , G. Manzini , I. Mazzieri , H. Mourad , M. Verani

A space-discretization for the elastic flow of inextensible curves is devised and quasi-optimal convergence of the corresponding semi-discrete problem is proved for a suitable discretization of the nonlinear inextensibility constraint.…

Numerical Analysis · Mathematics 2025-04-07 Sören Bartels , Klaus Deckelnick , Dominik Schneider

This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-02-04 Abdullah Rasheed , Nidhi Dubagunta