arXiv subjects

Quanling Deng

Publications and source records attributed to Quanling Deng.

46 records · Page 3Linked to original sources

arXiv2018

Optimal spectral approximation of $2n$-order differential operators by mixed isogeometric analysis

We approximate the spectra of a class of $2n$-order differential operators using isogeometric analysis in mixed formulations. This class includes a wide range of differential operators such as those arising in elliptic, biharmonic, Cahn-Hilliard, Swift-Hohenberg, and phase-field crystal equations. The spectra of the differential operators are approximated by solving differential eigenvalue problems in mixed formulations, which require auxiliary parameters. The mixed isogeometric formulation when applying classical quadrature rules leads to an eigenvalue error convergence of order $2p$ where $p$ is the order of the underlying B-spline space. We improve this order to be $2p+2$ by applying optimally-blended quadrature rules developed in \cite{20,52} and this order is an optimum in the view of dispersion error. We also compare these results with the mixed finite elements and show numerically that mixed isogeometric analysis leads to significantly better spectral approximations.

math.NA↗

arXiv2018

Isogeometric spectral approximation for elliptic differential operators

We study the spectral approximation of a second-order elliptic differential eigenvalue problem that arises from structural vibration problems using isogeometric analysis. In this paper, we generalize recent work in this direction. We present optimally blended quadrature rules for the isogeometric spectral approximation of a diffusion-reaction operator with both Dirichlet and Neumann boundary conditions. The blended rules improve the accuracy and the robustness of the isogeometric approximation. In particular, the optimal blending rules minimize the dispersion error and lead to two extra orders of super-convergence in the eigenvalue error. Various numerical examples (including the Schr$\ddot{\text{o}}$dinger operator for quantum mechanics) in one and three spatial dimensions demonstrate the performance of the blended rules.

math.NA↗

arXiv2017

Dispersion-minimized mass for isogeometric analysis

We introduce the dispersion-minimized mass for isogeometric analysis to approximate the structural vibration which we model as a second-order differential eigenvalue problem. The dispersion-minimized mass reduces the eigenvalue error significantly, from the optimum order of $2p$ to the superconvergence order of $2p+2$ for the $p$-th order isogeometric elements with maximum continuity, which in return leads to more robust of the isogeomectric analysis. We first establish the dispersion error for arbitrary polynomial order isogeometric elements. We derive the dispersion-minimized mass in one dimension by solving a $p$-dimensional local matrix problem for the $p$-th order approximation and then extend it to multiple dimensions on tensor-product grids. We show that the dispersion-minimized mass can also be obtained by approximating the mass matrix using optimally blended quadratures. We generalize the results of optimally blended quadratures from polynomial orders $p=1,\cdots, 7$ that were studied in \cite{calo2017dispersion} to arbitrary polynomial order isogeometric approximations. Various numerical examples validate the eigenvalue and eigenfunction error estimates we derive.

math.NA↗

arXiv2017

Efficient mass and stiffness matrix assembly via weighted Gaussian quadrature rules for B-splines

Calabro et al. (2017) changed the paradigm of the mass and stiffness computation from the traditional element-wise assembly to a row-wise concept, showing that the latter one offers integration that may be orders of magnitude faster. Considering a B-spline basis function as a non-negative measure, each mass matrix row is integrated by its own quadrature rule with respect to that measure. Each rule is easy to compute as it leads to a linear system of equations, however, the quadrature rules are of the Newton-Cotes type, that is, they require a number of quadrature points that is equal to the dimension of the spline space. In this work, we propose weighted quadrature rules of Gaussian type which require the minimum number of quadrature points while guaranteeing exactness of integration with respect to the weight function. The weighted Gaussian rules arise as solutions of non-linear systems of equations. We derive rules for the mass and stiffness matrices for uniform $C^1$ quadratic and $C^2$ cubic isogeometric discretizations. Our rules further reduce the number of quadrature points by a factor of $(\frac{p+1}{2p+1})^d$ when compared to Calabro et al. (2017), $p$ being the polynomial degree and $d$ the dimension of the problem, and consequently reduce the computational cost of the mass and stiffness matrix assembly by a similar factor.

math.NA↗

arXiv2017

Spectral approximation properties of isogeometric analysis with variable continuity

We study the spectral approximation properties of isogeometric analysis with local continuity reduction of the basis. Such continuity reduction results in a reduction in the interconnection between the degrees of freedom of the mesh, which allows for large savings in computational requirements during the solution of the resulting linear system. The continuity reduction results in extra degrees of freedom that modify the approximation properties of the method. The convergence rate of such refined isogeometric analysis is equivalent to that of the maximum continuity basis. We show how the breaks in continuity and inhomogeneity of the basis lead to artefacts in the frequency spectra, such as stopping bands and outliers, and present a unified description of these effects in finite element method, isogeometric analysis, and refined isogeometric analysis. Accuracy of the refined isogeometric analysis approximations can be improved by using non-standard quadrature rules. In particular, optimal quadrature rules lead to large reductions in the eigenvalue errors and yield two extra orders of convergence similar to classical isogeometric analysis.

math.NA↗

arXiv2017

Dispersion-minimizing quadrature rules for $C^1$ quadratic isogeometric analysis

We develop quadrature rules for the isogeometric analysis of wave propagation and structural vibrations that minimize the discrete dispersion error of the approximation. The rules are optimal in the sense that they only require two quadrature points per element to minimize the dispersion error [1], and they are equivalent to the optimized blending rules we recently described. Our approach further simplifies the numerical integration: instead of blending two three-point standard quadrature rules, we construct directly a single two-point quadrature rule that reduces the dispersion error to the same order for uniform meshes with periodic boundary conditions. Also, we present a 2.5-point rule for both uniform and non-uniform meshes with arbitrary boundary conditions. Consequently, we reduce the computational cost by using the proposed quadrature rules. Various numerical examples demonstrate the performance of these quadrature rules.

math.NA↗

arXiv2016

Dispersion-optimized quadrature rules for isogeometric analysis: modified inner products, their dispersion properties, and optimally blended schemes

This paper introduces optimally-blended quadrature rules for isogeometric analysis and analyzes the numerical dispersion of the resulting discretizations. To quantify the approximation errors when we modify the inner products, we generalize the Pythagorean eigenvalue theorem of Strang and Fix. The proposed blended quadrature rules have advantages over alternative integration rules for isogeometric analysis on uniform and non-uniform meshes as well as for different polynomial orders and continuity of the basis. The optimally-blended schemes improve the convergence rate of the method by two orders with respect to the fully-integrated Galerkin method. The proposed technique increases the accuracy and robustness of isogeometric analysis for wave propagation problems.

math.NA↗

arXiv2016

Locally Conservative Continuous Galerkin FEM for Pressure Equation in Two-Phase Flow Model in Subsurfaces

A typical two-phase model for subsurface flow couples the Darcy equation for pressure and a transport equation for saturation in a nonlinear manner. In this paper, we study a combined method consisting of continuous Galerkin finite element methods (CGFEMs) followed by a post-processing technique for Darcy equation and finite volume method (FVM) with upwind schemes for the saturation transport equation, in which the coupled nonlinear problem is solved in the framework of operator decomposition. The postprocessing technique is applied to CGFEM solutions to obtain locally conservative fluxes which ensures accuracy and robustness of the FVM solver for the saturation transport equation. We applied both upwind scheme and upwind scheme with slope limiter for FVM on triangular meshes in order to eliminate the non-physical oscillations. Various numerical examples are presented to demonstrate the performance of the overall methodology.

math.NA↗

arXiv2016

Construction of Locally Conservative Fluxes for High Order Continuous Galerkin Finite Element Methods

We propose a simple post-processing technique for linear and high order continuous Galerkin Finite Element Methods (CGFEMs) to obtain locally conservative flux field. The post-processing technique requires solving an auxiliary problem on each element independently which results in solving a linear algebra system whose size is low for any order CGFEM. The post-processing could have been done directly from the finite element solution that results in locally conservative flux on the element. However, the normal flux is not continuous at the elemental boundary. To construct locally conservative flux field whose normal component is also continuous, we propose to do the post-processing on the nodal-centered control volumes which are constructed from the original finite element mesh. We show that the post-processed solution converges in an optimal fashion to the true solution in an H1 semi-norm. We present various numerical examples to demonstrate the performance of the post-processing technique.

math.NA↗

arXiv2014

A Post-processing Technique for Streamline Upwind/Petrov-Galerkin for Advection Dominated Partial Differential Equations

We consider the construction of locally conservative fluxes by means of a simple post-processing technique obtained from the finite element solutions of advection diffusion equations. It is known that a naive calculation of fluxes from these solutions yields non-conservative fluxes. We consider two finite element methods: the usual continuous Galerkin finite element (CGFEM) for solving non dominating advection diffusion equations and the streamline upwind/Petrov-Galerkin (SUPG) for solving advection dominated problems. We then describe the post-processing technique for constructing conservative fluxes from the numerical solutions of the general variational formulation. The post-processing technique requires solving an auxiliary Neumann boundary value problem on each element independently and it produces a locally conservative flux on a vertex centered dual mesh relative to the finite element mesh. We provide a convergence analysis for the post-processing technique. Performance of the technique and the convergence behavior are demonstrated through numerical examples including a set of test problems for advection diffusion equations, advection dominated equations, and drift-diffusion equations.

math.NA↗