Related papers: Computing confined elasticae
We introduce a novel energy method that reinterprets ``curve shortening'' as ``tangent aligning''. This conceptual shift enables the variational study of infinite-length curves evolving by the curve shortening flow, as well as higher order…
In this paper, we study the estimation of partially linear models for spatial data distributed over complex domains. We use bivariate splines over triangulations to represent the nonparametric component on an irregular two-dimensional…
We consider an optimal control problem on a bounded domain $\Omega\subset\mathbb{R}^2,$ governed by a parabolic convection--diffusion--reaction equation with pointwise control constraints. We follow the optimize--then--discretize approach,…
A new model description for the numerical simulation of elastic stents is proposed. Based on the new formulation an inf-sup inequality for the finite element discretization is proved and the proof of the inf-sup inequality for the…
Many high dimensional sparse learning problems are formulated as nonconvex optimization. A popular approach to solve these nonconvex optimization problems is through convex relaxations such as linear and semidefinite programming. In this…
High dimensional covariance estimation and graphical models is a contemporary topic in statistics and machine learning having widespread applications. An important line of research in this regard is to shrink the extreme spectrum of the…
Differential growth processes play a prominent role in shaping leaves and biological tissues. Using both analytical and numerical calculations, we consider the shapes of closed, elastic strips which have been subjected to an inhomogeneous…
An iterative, CFD-based approach for aeroelastic computations in the frequency domain is presented. The method relies on a linearized formulation of the aeroelastic problem and a fixed-point iteration approach and enables the computation of…
We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…
We prove that there exists a bounded convex domain $\Omega \subset \mathbf{R}^3$ of fixed volume that minimizes the first positive curl eigenvalue among all other bounded convex domains of the same volume. We show that this optimal domain…
For a wide class of curvature energy functionals defined for planar curves under the fixed-length constraint, we obtain optimal necessary conditions for global and local minimizers. Our results extend Maddocks' and Sachkov's rigidity…
This paper considers decentralized optimization of convex functions with mixed affine equality constraints involving both local and global variables. Constraints on global variables may vary across different nodes in the network, while…
We propose a fully discretised numerical scheme for the hyperelastic rod wave equation on the line. The convergence of the method is established. Moreover, the scheme can handle the blow-up of the derivative which naturally occurs for this…
Gradient compression is of growing interests for solving constrained optimization problems including compressed sensing, noisy recovery and matrix completion under limited communication resources and storage costs. Convergence analysis of…
In this work we analyze the stability and convergence properties of a loosely-coupled scheme, called the kinematically coupled scheme, and its extensions for the interaction between an incompressible, viscous fluid and a thin, elastic…
Inverse problems are ubiquitous in science and engineering. Many of these are naturally formulated as a PDE-constrained optimization problem. These non-linear, large-scale, constrained optimization problems know many challenges, of which…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
We define and study exact, efficient representations of realization spaces Euclidean Distance Constraint Systems (EDCS), which includes Linkages and Frameworks. Each representation corresponds to a choice of Cayley parameters and yields a…
We propose an {\em implementable} numerical scheme for the discretization of linear-quadratic optimal control problems involving SDEs in higher dimensions with {\em control constraint}. For time discretization, we employ the implicit Euler…
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…