arXiv subjects

Weizhang Huang

Publications and source records attributed to Weizhang Huang.

At least 55 records · Page 3Linked to original sources

arXiv2018

Adaptive Finite Element Solution of the Porous Medium Equation in Pressure Formulation

A lack of regularity in the solution of the porous medium equation poses a serious challenge in its theoretical and numerical studies. A common strategy in theoretical studies is to utilize the pressure formulation of the equation where a new variable called the mathematical pressure is introduced. It is known that the new variable has much better regularity than the original one and Darcy's law for the movement of the free boundary can be expressed naturally in this new variable. The pressure formulation has not been used in numerical studies. The goal of this work is to study its use in the adaptive finite element solution of the porous medium equation. The MMPDE moving mesh strategy is employed for adaptive mesh movement while linear finite elements are used for spatial discretization. The free boundary is traced explicitly by integrating Darcy's law with the Euler scheme. Numerical results are presented for three two-dimensional examples. The method is shown to be second-order in space and first-order in time in the pressure variable. Moreover, the convergence order of the error in the location of the free boundary is almost second-order in the maximum norm. However, numerical results also show that the convergence order of the method in the original variable stays between first-order and second-order in the $L^1$ norm or between 0.5th-order and first-order in the $L^2$ norm. Nevertheless, the current method can offer some advantages over numerical methods based on the original formulation for situations with large exponents or when a more accurate location of the free boundary is desired.

math.NA↗

arXiv2017

Moving mesh finite element simulation for phase-field modeling of brittle fracture and convergence of newton's iteration

A moving mesh finite element method is studied for the numerical solution of a phase-field model for brittle fracture. The moving mesh partial differential equation approach is employed to dynamically track crack propagation. Meanwhile, the decomposition of the strain tensor into tensile and compressive components is essential for the success of the phase-field modeling of brittle fracture but results in a non-smooth elastic energy and stronger nonlinearity in the governing equation. This makes the governing equation much more difficult to solve and, in particular, Newton's iteration often to fail to converge. Three regularization methods are proposed to smooth out the decomposition of the strain tensor. Numerical examples of fracture propagation under quasi-static load demonstrate that all of the methods can effectively improve the convergence of Newton's iteration for relatively small values of the regularization parameter but without comprising the accuracy of the numerical solution. They also show that the moving mesh finite element method is able to adaptively concentrate the mesh elements around propagating cracks and handle multiple and complex crack systems.

math.NA↗

arXiv2017

A Third-Order Moving Mesh Cell-Centered Scheme for One-Dimensional Elastic-Plastic Flows

A third-order moving mesh cell-centered scheme without the remapping of physical variables is developed for the numerical solution of one-dimensional elastic-plastic flows with the Mie-Grüneisen equation of state, the Wilkins constitutive model, and the von Mises yielding criterion. The scheme combines the Lagrangian method with the MMPDE moving mesh method and adaptively moves the mesh to better resolve shock and other types of waves while preventing the mesh from crossing and tangling. It can be viewed as a direct arbitrarily Lagrangian-Eulerian method but can also be degenerated to a purely Lagrangian scheme. It treats the relative velocity of the fluid with respect to the mesh as constant in time between time steps, which allows high-order approximation of free boundaries. A time dependent scaling is used in the monitor function to avoid possible sudden movement of the mesh points due to the creation or diminishing of shock and rarefaction waves or the steepening of those waves. A two-rarefaction Riemann solver with elastic waves is employed to compute the Godunov values of the density, pressure, velocity, and deviatoric stress at cell interfaces. Numerical results are presented for three examples. The third-order convergence of the scheme and its ability to concentrate mesh points around shock and elastic rarefaction waves are demonstrated. The obtained numerical results are in good agreement with those in literature. The new scheme is also shown to be more accurate in resolving shock and rarefaction waves than an existing third-order cell-centered Lagrangian scheme.

math.NA↗

arXiv2017

A New Functional for Variational Mesh Generation and Adaptation Based on Equidistribution and Alignment Conditions

A new functional is presented for variational mesh generation and adaptation. It is formulated based on combining the equidistribution and alignment conditions into a single condition with only one dimensionless parameter. The functional is shown to be coercive but not convex. A solution procedure using a discrete moving mesh partial differential equation is employed. It is shown that the element volumes and altitudes of a mesh trajectory of the mesh equation associated with the new functional are bounded away from zero and the mesh trajectory stays nonsingular if it is so initially. Numerical examples demonstrate that the new functional performs comparably as an existing one that is also based on the equidistribution and alignment conditions and known to work well but contains an additional parameter.

math.NA↗

arXiv2017

Selection of the Regularization Parameter in the Ambrosio-Tortorelli Approximation of the Mumford-Shah Functional for Image Segmentation

The Ambrosio-Tortorelli functional is a phase-field approximation of the Mumford-Shah functional that has been widely used for image segmentation. The approximation has the advantages of being easy to implement, maintaining the segmentation ability, and $Γ$-converging to the Mumford-Shah functional. However, it has been observed in actual computation that the segmentation ability of the Ambrosio-Tortorelli functional varies significantly with different values of the parameter and it even fails to $Γ$-converge to the original functional for some cases. In this paper we present an asymptotic analysis on the gradient flow equation of the Ambrosio-Tortorelli functional and show that the functional can have different segmentation behavior for small but finite values of the regularization parameter and eventually loses its segmentation ability as the parameter goes to zero when the input image is treated as a continuous function. This is consistent with the existing observation as well as the numerical examples presented in this work. A selection strategy for the regularization parameter and a scaling procedure for the solution are devised based on the analysis. Numerical results show that they lead to good segmentation of the Ambrosio-Tortorelli functional for real images.

math.NA↗

arXiv2017

A study on nonnegativity preservation in finite element approximation of Nagumo-type nonlinear differential equations

Preservation of nonnengativity and boundedness in the finite element solution of Nagumo-type equations with general anisotropic diffusion is studied. Linear finite elements and the backward Euler scheme are used for the spatial and temporal discretization, respectively. An explicit, an implicit, and two hybrid explicit-implicit treatments for the nonlinear reaction term are considered. Conditions for the mesh and the time step size are developed for the numerical solution to preserve nonnegativity and boundedness. The effects of lumping of the mass matrix and the reaction term are also discussed. The analysis shows that the nonlinear reaction term has significant effects on the conditions for both the mesh and the time step size. Numerical examples are given to demonstrate the theoretical findings.

math.NA↗

arXiv2017

Anisotropic mesh adaptation for 3D anisotropic diffusion problems with application to fractured reservoir simulation

Anisotropic mesh adaptation is studied for linear finite element solution of 3D anisotropic diffusion problems. The M-uniform mesh approach is used, where an anisotropic adaptive mesh is generated as a uniform one in the metric specified by a tensor. In addition to mesh adaptation, preservation of the maximum principle is also studied. Some new sufficient conditions for maximum principle preservation are developed, and a mesh quality measure is defined to server as a good indicator. Four different metric tensors are investigated: one is the identity matrix, one focuses on minimizing an error bound, another one on preservation of the maximum principle, while the fourth combines both. Numerical examples show that these metric tensors serve their purposes. Particularly, the fourth leads to meshes that improve the satisfaction of the maximum principle by the finite element solution while concentrating elements in regions where the error is large. Application of the anisotropic mesh adaptation to fractured reservoir simulation in petroleum engineering is also investigated, where unphysical solutions can occur and mesh adaptation can help improving the satisfaction of the maximum principle.

math.NA↗

arXiv2017

On the mesh nonsingularity of the moving mesh PDE method

The moving mesh PDE (MMPDE) method for variational mesh generation and adaptation is studied theoretically at the discrete level, in particular the nonsingularity of the obtained meshes. Meshing functionals are discretized geometrically and the MMPDE is formulated as a modified gradient system of the corresponding discrete functionals for the location of mesh vertices. It is shown that if the meshing functional satisfies a coercivity condition, then the mesh of the semi-discrete MMPDE is nonsingular for all time if it is nonsingular initially. Moreover, the altitudes and volumes of its elements are bounded below by positive numbers depending only on the number of elements, the metric tensor, and the initial mesh. Furthermore, the value of the discrete meshing functional is convergent as time increases, which can be used as a stopping criterion in computation. Finally, the mesh trajectory has limiting meshes which are critical points of the discrete functional. The convergence of the mesh trajectory can be guaranteed when a stronger condition is placed on the meshing functional. Two meshing functionals based on alignment and equidistribution are known to satisfy the coercivity condition. The results also hold for fully discrete systems of the MMPDE provided that the time step is sufficiently small and a numerical scheme preserving the property of monotonically decreasing energy is used for the temporal discretization of the semi-discrete MMPDE. Numerical examples are presented.

math.NA↗

arXiv2016

A Study on Moving Mesh Finite Element Solution of the Porous Medium Equation

An adaptive moving mesh finite element method is studied for the numerical solution of the porous medium equation with and without variable exponents and absorption. The method is based on the so-called moving mesh partial differential equation approach and employs its newly developed implementation. Three types of mesh are considered, uniform and arclength-based and Hessian-based adaptive meshes. The method shows a first order convergence for uniform and arclength-based adaptive meshes and a second-order convergence for Hessian-based adaptive meshes. It is also shown that the method can be used for situations with complex free boundaries, emerging and splitting of free boundaries, and the porous medium equation with variable exponents and absorption. Two dimensional numerical results are presented.

math.NA↗

arXiv2016

Stability of explicit one-step methods for P1-finite element approximation of linear diffusion equations on anisotropic meshes

We study the stability of explicit one-step integration schemes for the linear finite element approximation of linear parabolic equations. The derived bound on the largest permissible time step is tight for any mesh and any diffusion matrix within a factor of $2(d+1)$, where $d$ is the spatial dimension. Both full mass matrix and mass lumping are considered. The bound reveals that the stability condition is affected by two factors. The first one depends on the number of mesh elements and corresponds to the classic bound for the Laplace operator on a uniform mesh. The other factor reflects the effects of the interplay of the mesh geometry and the diffusion matrix. It is shown that it is not the mesh geometry itself but the mesh geometry in relation to the diffusion matrix that is crucial to the stability of explicit methods. When the mesh is uniform in the metric specified by the inverse of the diffusion matrix, the stability condition is comparable to the situation with the Laplace operator on a uniform mesh. Numerical results are presented to verify the theoretical findings.

math.NA↗

arXiv2015

A geometric discretization and a simple implementation for variational mesh generation and adaptation

We present a simple direct discretization for functionals used in the variational mesh generation and adaptation. Meshing functionals are discretized on simplicial meshes and the Jacobian matrix of the continuous coordinate transformation is approximated by the Jacobian matrices of affine mappings between elements. The advantage of this direct geometric discretization is that it preserves the basic geometric structure of the continuous functional, which is useful in preventing strong decoupling or loss of integral constraints satisfied by the functional. Moreover, the discretized functional is a function of the coordinates of mesh vertices and its derivatives have a simple analytical form, which allows a simple implementation of variational mesh generation and adaptation on computer. Since the variational mesh adaptation is the base for a number of adaptive moving mesh and mesh smoothing methods, the result in this work can be used to develop simple implementations of those methods. Numerical examples are given.

math.NA↗

arXiv2015

A hybrid LDG-HWENO scheme for KdV-type equations

A hybrid LDG-HWENO scheme is proposed for the numerical solution of KdV-type partial differential equations. It evolves the cell averages of the physical solution and its moments (a feature of Hermite WENO) while discretizes high order spatial derivatives using the local DG method. The new scheme has the advantages of both LDG and HWENO methods, including the ability to deal with high order spatial derivatives and the use of a small number of global unknown variables. The latter is independent of the order of the scheme and the spatial order of the underlying differential equations. One and two dimensional numerical examples are presented to show that the scheme can attain the same formal high order accuracy as the LDG method.

math.NA↗

arXiv2015

A comparative numerical study of meshing functionals for variational mesh adaptation

We present a comparative numerical study for three functionals used for variational mesh adaptation. One of them is a generalisation of Winslow's variable diffusion functional while the others are based on equidistribution and alignment. These functionals are known to have nice theoretical properties and work well for most mesh adaptation problems either as a stand-alone variational method or combined within the moving mesh framework. Their performance is investigated numerically in terms of equidistribution and alignment mesh quality measures. Numerical results in 2D and 3D are presented.

math.NA↗

arXiv2015

Discrete maximum principle for the weak Galerkin method for anisotropic diffusion problems

A weak Galerkin discretization of the boundary value problem of a general anisotropic diffusion problem is studied for preservation of the maximum principle. It is shown that the direct application of the $M$-matrix theory to the stiffness matrix of the weak Galerkin discretization leads to a strong mesh condition requiring all of the mesh dihedral angles to be strictly acute (a constant-order away from 90 degrees). To avoid this difficulty, a reduced system is considered and shown to satisfy the discrete maximum principle under weaker mesh conditions. The discrete maximum principle is then established for the full weak Galerkin approximation using the relations between the degrees of freedom located on elements and edges. Sufficient mesh conditions for both piecewise constant and general anisotropic diffusion matrices are obtained. These conditions provide a guideline for practical mesh generation for preservation of the maximum principle. Numerical examples are presented.

math.NA↗

arXiv2015

Monotone finite difference schemes for anisotropic diffusion problems via nonnegative directional splittings

Nonnegative directional splittings of anisotropic diffusion operators in the divergence form are investigated. Conditions are established for nonnegative directional splittings to hold in a neighborhood of an arbitrary interior point. The result is used to construct monotone finite difference schemes for the boundary value problem of anisotropic diffusion operators. It is shown that such a monotone scheme can be constructed if the underlying diffusion matrix is continuous on the closure of the physical domain and symmetric and uniformly positive definite on the domain, the mesh spacing is sufficiently small, and the size of finite difference stencil is sufficiently large. An upper bound for the stencil size is obtained, which is determined completely by the diffusion matrix. Loosely speaking, the more anisotropic the diffusion matrix is, the larger stencil is required. An exception is the situation with a strictly diagonally dominant diffusion matrix where a three-by-three stencil is sufficient for the construction of a monotone finite difference scheme. Numerical examples are presented to illustrate the theoretical findings.

math.NA↗

arXiv2014

How a nonconvergent recovered Hessian works in mesh adaptation

Hessian recovery has been commonly used in mesh adaptation for obtaining the required magnitude and direction information of the solution error. Unfortunately, a recovered Hessian from a linear finite element approximation is nonconvergent in general as the mesh is refined. It has been observed numerically that adaptive meshes based on such a nonconvergent recovered Hessian can nevertheless lead to an optimal error in the finite element approximation. This also explains why Hessian recovery is still widely used despite its nonconvergence. In this paper we develop an error bound for the linear finite element solution of a general boundary value problem under a mild assumption on the closeness of the recovered Hessian to the exact one. Numerical results show that this closeness assumption is satisfied by the recovered Hessian obtained with commonly used Hessian recovery methods. Moreover, it is shown that the finite element error changes gradually with the closeness of the recovered Hessian. This provides an explanation on how a nonconvergent recovered Hessian works in mesh adaptation.

math.NA↗

arXiv2014

Image Segmentation with Eigenfunctions of an Anisotropic Diffusion Operator

We propose the eigenvalue problem of an anisotropic diffusion operator for image segmentation. The diffusion matrix is defined based on the input image. The eigenfunctions and the projection of the input image in some eigenspace capture key features of the input image. An important property of the model is that for many input images, the first few eigenfunctions are close to being piecewise constant, which makes them useful as the basis for a variety of applications such as image segmentation and edge detection. The eigenvalue problem is shown to be related to the algebraic eigenvalue problems resulting from several commonly used discrete spectral clustering models. The relation provides a better understanding and helps developing more efficient numerical implementation and rigorous numerical analysis for discrete spectral segmentation methods. The new continuous model is also different from energy-minimization methods such as geodesic active contour in that no initial guess is required for in the current model. The multi-scale feature is a natural consequence of the anisotropic diffusion operator so there is no need to solve the eigenvalue problem at multiple levels. A numerical implementation based on a finite element method with an anisotropic mesh adaptation strategy is presented. It is shown that the numerical scheme gives much more accurate results on eigenfunctions than uniform meshes. Several interesting features of the model are examined in numerical examples and possible applications are discussed.

math.NA↗

arXiv2014

A study on anisotropic mesh adaptation for finite element approximation of eigenvalue problems with anisotropic diffusion operators

Anisotropic mesh adaptation is studied for the linear finite element solution of eigenvalue problems with anisotropic diffusion operators. The M-uniform mesh approach is employed with which any nonuniform mesh is characterized mathematically as a uniform one in the metric specified by a metric tensor. Bounds on the error in the computed eigenvalues are established for quasi-M-uniform meshes. Numerical examples arising from the Laplace-Beltrami operator on parameterized surfaces, nonlinear diffusion, thermal diffusion in a magnetic field in plasma physics, and the Laplacian operator on an L-shape domain are presented. Numerical results show that anisotropic adaptive meshes can lead to more accurate computed eigenvalues than uniform or isotropic adaptive meshes. They also confirm the second order convergence of the error that is predicted by the theoretical analysis. The effects of approximation of curved boundaries on the computation of eigenvalue problems is also studied in two dimensions. It is shown that the initial mesh used to define the geometry of the physical domain should contain at least \sqrt{N} boundary points to keep the effects of boundary approximation at the level of the error of the finite element approximation, where N is the number of the elements in the final adaptive mesh. Only about N^{1/3} boundary points in the initial mesh are needed for boundary value problems. This implies that the computation of eigenvalue problems is more sensitive to the boundary approximation than that of boundary value problems.

math.NA↗