Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userComputational p-Willmore Flow with Conformal Penalty
55
0
0.0
(
0
)
Added by
Anthony Gruber
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
In this corrigendum, we offer a correction to [J. Korean. Math. Soc., 54 (2017), pp. 461--477]. We construct a counterexample for the strengthened Cauchy--Schwarz inequality used in the original paper. In addition, we provide a new proof for Lemma 5 of the original paper, an estimate for the extremal eigenvalues of the standard unpreconditioned FETI-DP dual operator.
In this paper, the optimal choice of the interior penalty parameter of the discontinuous Galerkin finite element methods for both the elliptic problems and the Biots systems are studied by utilizing the neural network and machine learning. It is crucial to choose the optimal interior penalty parameter, which is not too small or not too large for the stability, robustness, and efficiency of the numerical discretized solutions. Both linear regression and nonlinear artificial neural network methods are employed and compared using several numerical experiments to illustrate the capability of our proposed computational framework. This framework is an integral part of a developing automated numerical simulation platform because it can automatically identify the optimal interior penalty parameter. Real-time feedback could also be implemented to update and improve model accuracy on the fly.
In this paper, we consider the minimization of a Tikhonov functional with an $ell_1$ penalty for solving linear inverse problems with sparsity constraints. One of the many approaches used to solve this problem uses the Nemskii operator to transform the Tikhonov functional into one with an $ell_2$ penalty term but a nonlinear operator. The transformed problem can then be analyzed and minimized using standard methods. However, by the nature of this transform, the resulting functional is only once continuously differentiable, which prohibits the use of second order methods. Hence, in this paper, we propose a different transformation, which leads to a twice differentiable functional that can now be minimized using efficient second order methods like Newtons method. We provide a convergence analysis of our proposed scheme, as well as a number of numerical results showing the usefulness of our proposed approach.
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.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
