We investigate moduli of planar circular quadrilaterals symmetric with respect to both the coordinate axes. First we develop an analytic approach which reduces this problem to ODEs and devise a numeric method to find out the accessory parameters. This method uses the Schwarz equation to determine conformal mapping of the unit disk onto a given circular quadrilateral. We also give an example of a circular quadrilateral for which the value of the conformal modulus can be found in the analytic form; this example is used to validate the numeric calculations. We also use another method, so called hpFEM, for the numeric calculation of the moduli. These two different approaches provide results agreeing with high accuracy.
We study numerical conformal mappings of planar Jordan domains with boundaries consisting of finitely many circular arcs and compute the moduli of quadrilaterals for these domains. Experimental error estimates are provided and, when possible, comparison to exact values or other methods are given. The main ingredients of the computation are boundary integral equations combined with the fast multipole method.
The unsigned p-Willmore functional introduced in cite{mondino2011} generalizes important geometric functionals which measure the area and Willmore energy of immersed surfaces. Presently, techniques from cite{dziuk2008} are adapted to compute the first variation of this functional as a weak-form system of equations, which are subsequently used to develop a model for the p-Willmore flow of closed surfaces in $mathbb{R}^3$. This model is amenable to constraints on surface area and enclosed volume, and is shown to decrease the p-Willmore energy monotonically over time. In addition, a penalty-based regularization procedure is formulated to prevent artificial mesh degeneration along the flow; inspired by a conformality condition derived in cite{kamberov1996}, this procedure encourages angle-preservation in a closed and oriented surface immersion as it evolves. Following this, a finite-element discretization of both systems is discussed, and an application to mesh editing is presented.
We consider universal approximations of symmetric and anti-symmetric functions, which are important for applications in quantum physics, as well as other scientific and engineering computations. We give constructive approximations with explicit bounds on the number of parameters with respect to the dimension and the target accuracy $epsilon$. While the approximation still suffers from curse of dimensionality, to the best of our knowledge, these are first results in the literature with explicit error bounds. Moreover, we also discuss neural network architecture that can be suitable for approximating symmetric and anti-symmetric functions.
The main purpose of this article is to develop a novel refinement strategy for four-dimensional hybrid meshes based on cubic pyramids. This optimal refinement strategy subdivides a given cubic pyramid into a conforming set of congruent cubic pyramids and invariant bipentatopes. The theoretical properties of the refinement strategy are rigorously analyzed and evaluated. In addition, a new class of fully symmetric quadrature rules with positive weights are generated for the cubic pyramid. These rules are capable of exactly integrating polynomials with degrees up to 12. Their effectiveness is successfully demonstrated on polynomial and transcendental functions. Broadly speaking, the refinement strategy and quadrature rules in this paper open new avenues for four-dimensional hybrid meshing, and space-time finite element methods.
We study the problem of finding orthogonal low-rank approximations of symmetric tensors. In the case of matrices, the approximation is a truncated singular value decomposition which is then symmetric. Moreover, for rank-one approximations of tensors of any dimension, a classical result proven by Banach in 1938 shows that the optimal approximation can always be chosen to be symmetric. In contrast to these results, this article shows that the corresponding statement is no longer true for orthogonal approximations of higher rank. Specifically, for any of the four common notions of tensor orthogonality used in the literature, we show that optimal orthogonal approximations of rank greater than one cannot always be chosen to be symmetric.