Searcharxiv⌕ Search

arXiv subjects

Hehu Xie

Publications and source records attributed to Hehu Xie.

At least 55 records · Page 3Linked to original sources
arXiv2021

On accelerating a multilevel correction adaptive finite element method for Kohn-Sham equation

Based on the numerical method proposed in [G. Hu, X. Xie, F. Xu, J. Comput. Phys., 355 (2018), 436-449.] for Kohn-Sham equation, further improvement on the efficiency is obtained in this paper by i). designing a numerical method with the strategy of separately handling the nonlinear Hartree potential and exchange-correlation potential, and ii).parallelizing the algorithm in an eigenpairwise approach. The feasibility of two approaches are analyzed in detail, and the new algorithm is described completely. Compared with previous results, a significant improvement of numerical efficiency can be observed from plenty of numerical experiments, which make the new method more suitable for the practical problems.

math.NA↗
arXiv2020

A Nonnested Augmented Subspace Method for Eigenvalue Problems with Curved Interfaces

In this paper, we present a nonnested augmented subspace algorithm and its multilevel correction method for solving eigenvalue problems with curved interfaces. The augmented subspace algorithm and the corresponding multilevel correction method are designed based on a coarse finite element space which is not the subset of the finer finite element space. The nonnested augmented subspace method can transform the eigenvalue problem solving on the finest mesh to the solving linear equation on the same mesh and small scale eigenvalue problem on the low dimensional augmented subspace. The corresponding theoretical analysis and numerical experiments are provided to demonstrate the efficiency of the proposed algorithms.

math.NA↗
arXiv2020

A Parallel Augmented Subspace Method for Eigenvalue Problems

A type of parallel augmented subspace scheme for eigenvalue problems is proposed by using coarse space in the multigrid method. With the help of coarse space in multigrid method, solving the eigenvalue problem in the finest space is decomposed into solving the standard linear boundary value problems and very low dimensional eigenvalue problems. The computational efficiency can be improved since there is no direct eigenvalue solving in the finest space and the multigrid method can act as the solver for the deduced linear boundary value problems. Furthermore, for different eigenvalues, the corresponding boundary value problem and low dimensional eigenvalue problem can be solved in the parallel way since they are independent of each other and there exists no data exchanging. This property means that we do not need to do the orthogonalization in the highest dimensional spaces. This is the main aim of this paper since avoiding orthogonalization can improve the scalability of the proposed numerical method. Some numerical examples are provided to validate the proposed parallel augmented subspace method.

math.NA↗
arXiv2020

An Algebraic Multigrid Method for Eigenvalue Problems in Some Different Cases

The aim of this paper is to develop an algebraic multigrid method to solve eigenvalue problems based on the combination of the multilevel correction scheme and the algebraic multigrid method for linear equations. Our approach uses the algebraic multigrid method setup procedure to construct the hierarchy and the intergrid transfer operators. In this algebraic multigrid scheme, a large scale eigenvalue problem is solved by some algebraic multigrid smoothing steps in the hierarchy and very small-dimensional eigenvalue problems. To emphasize the efficiency and flexibility of the proposed method, here we consider a set of test eigenvalue problems, discretized on unstructured meshes, with different shape of domain, singularity, and discontinuous parameters. Moreover, global convergence independent of the number of desired eigenvalues is obtained.

math.NA↗
arXiv2019

Fast eigenpairs computation with operator adapted wavelets and hierarchical subspace correction

We present a method for the fast computation of the eigenpairs of a bijective positive symmetric linear operator $\mathcal{L}$. The method is based on a combination of operator adapted wavelets (gamblets) with hierarchical subspace correction.First, gamblets provide a raw but fast approximation of the eigensubspaces of $\mathcal{L}$ by block-diagonalizing $\mathcal{L}$ into sparse and well-conditioned blocks. Next, the hierarchical subspace correction method, computes the eigenpairs associated with the Galerkin restriction of $\mathcal{L}$ to a coarse (low dimensional) gamblet subspace, and then, corrects those eigenpairs by solving a hierarchy of linear problems in the finer gamblet subspaces (from coarse to fine, using multigrid iteration). The proposed algorithm is robust for the presence of multiple (a continuum of) scales and is shown to be of near-linear complexity when $\mathcal{L}$ is an (arbitrary local, e.g.~differential) operator mapping $\mathcal{H}^s_0(Ω)$ to $\mathcal{H}^{-s}(Ω)$ (e.g.~an elliptic PDE with rough coefficients).

math.NA↗
arXiv2018

Guaranteed eigenvalue bounds for the Steklov eigenvalue problem

To provide mathematically rigorous eigenvalue bounds for the Steklov eigenvalue problem, an enhanced version of the eigenvalue estimation algorithm developed by the third author is proposed, which removes the requirements of the positive definiteness of bilinear forms in the formulation of eigenvalue problems. In practical eigenvalue estimation, the Crouzeix--Raviart finite element method (FEM) along with quantitative error estimation is adopted. Numerical experiments for eigenvalue problems defined on a square domain and an L-shaped domain are provided to validate the precision of computed eigenvalue bounds.

math.NA↗
arXiv2017

An Efficient Multigrid Method for Ground State Solution of Bose-Einstein Condensates

An efficient multigrid method is proposed to compute the ground state solution of Bose-Einstein condensations by the finite element method based on the combination of the multigrid method for nonlinear eigenvalue problem and an efficient implementation for the nonlinear iteration. The proposed numerical method not only has the optimal convergence rate, but also has the asymptotically optimal computational work which is independent from the nonlinearity of the problem. The independence from the nonlinearity means that the asymptotic estimate of the computational work can reach almost the same as that of solving the corresponding linear boundary value problem by the multigrid method. Some numerical experiments are provided to validate the efficiency of the proposed method.

math.NA↗
arXiv2017

Acceleration of weak Galerkin methods for the Laplacian eigenvalue problem

Recently, we proposed a weak Galerkin finite element method for the Laplace eigenvalue problem. In this paper, we present two-grid and two-space skills to accelerate the weak Galerkin method. By choosing parameters properly, the two-grid and two-space weak Galerkin method not only doubles the convergence rate, but also maintains the asymptotic lower bounds property of the weak Galerkin method. Some numerical examples are provided to validate our theoretical analysis.

math.NA↗
arXiv2017

Energy Error Estimates of Subspace Method and Multigrid Algorithm for Eigenvalue Problems

This paper is to give a new understanding and applications of the subspace projection method for selfadjoint eigenvalue problems. A new error estimate in the energy norm, which is induced by the stiff matrix, of the subspace projection method for eigenvalue problems is given. The relation between error estimates in $L^2$-norm and energy norm is also deduced. Based on this relation, a new type of inverse power method is designed for eigenvalue problems and the corresponding convergence analysis is also provided. Then we present the analysis of the geometric and algebraic multigrid methods for eigenvalue problems based on the convergence result of the new inverse power method.

math.NA↗
arXiv2017

A Full Multigrid Method For Semilinear Elliptic Equation

A full multigrid finite element method is proposed for semilinear elliptic equations. The main idea is to transform the solution of the semilinear problem into a series of solutions of the corresponding linear boundary value problems on the sequence of finite element spaces and semilinear problems on a very low dimensional space. The linearized boundary value problems are solved by some multigrid iterations. Besides the multigrid iteration, all other efficient numerical methods can also serve as the linear solver for solving boundary value problems. The optimality of the computational work is also proved. Compared with the existing multigrid methods which need the bounded second order derivatives of the nonlinear term, the proposed method only needs the Lipschitz continuation in some sense of the nonlinear term.

math.NA↗
arXiv2016

A Multilevel Correction Scheme for Nonsymmetric Eigenvalue Problems by Finite Element Methods

A multilevel correction scheme is proposed to solve defective and nodefective of nonsymmetric partial differential operators by the finite element method. The method includes multi correction steps in a sequence of finite element spaces. In each correction step, we only need to solve two source problems on a finer finite element space and two eigenvalue problems on the coarsest finite element space. The accuracy of the eigenpair approximation is improved after each correction step. This correction scheme improves overall efficiency of the finite element method in solving nonsymmetric eigenvalue problems.

math.NA↗
arXiv2016

A Small Note About Lower Bound of Eigenvalues

This paper gives a framework to produce the lower bound of eigenvalues defined in a Hilbert space by the eigenvalues defined in another Hilbert space. The method is based on using the max-min principle for the eigenvalue problems.

math.NA↗
arXiv2016

Fully Computable Error Bounds for Eigenvalue Problem

This paper is concerned with the computable error estimates for the eigenvalue problem which is solved by the general conforming finite element methods on the general meshes. Based on the computable error estimate, we can give an asymptotically lower bound of the general eigenvalues. Furthermore, we also give a guaranteed upper bound of the error estimates for the first eigenfunction approximation and a guaranteed lower bound of the first eigenvalue based on computable error estimator. Some numerical examples are presented to validate the theoretical results deduced in this paper.

math.NA↗
arXiv2016

A Multilevel Correction Method for Interior Transmission Eigenvalue Problem

In this paper, we give a numerical analysis for the transmission eigenvalue problem by the finite element method. A type of multilevel correction method is proposed to solve the transmission eigenvalue problem. The multilevel correction method can transform the transmission eigenvalue solving in the finest finite element space to a sequence of linear problems and some transmission eigenvalue solving in a very low dimensional spaces. Since the main computational work is to solve the sequence of linear problems, the multilevel correction method improves the overfull efficiency of the transmission eigenvalue solving. Some numerical examples are provided to validate the theoretical results and the efficiency of the proposed numerical scheme.

math.NA↗
arXiv2016

A Multigrid Method for the Ground State Solution of Bose-Einstein Condensates Based on Newton Iteration

In this paper, a new kind of multigrid method is proposed for the ground state solution of Bose-Einstein condensates based on Newton iteration method. Instead of treating eigenvalue $λ$ and eigenvector $u$ respectively, we regard the eigenpair $(λ, u)$ as one element in the composite space $\R \times H_0^1(Ω)$ and then Newton iteration method is adopted for the nonlinear problem. Thus in this multigrid scheme, we only need to solve a linear discrete boundary value problem in every refined space, which can improve the overall efficiency for the simulation of Bose-Einstein condensations.

math.NA↗
arXiv2016

Computable Error Estimates for Ground State Solution of Bose-Einstein Condensates

In this paper, we propose a computable error estimate of the Gross-Pitaevskii equation for ground state solution of Bose-Einstein condensates by general conforming finite element methods on general meshes. Based on the proposed error estimate, asymptotic lower bounds of the smallest eigenvalue and ground state energy can be obtained. Several numerical examples are presented to validate our theoretical results in this paper.

math.NA↗
arXiv2016

Anisotropic meshes and stabilized parameters for the stabilized finite element methods

We propose a numerical strategy to generate the anisotropic meshes and select the appropriate stabilized parameters simultaneously for two dimensional convection-dominated convection-diffusion equations by stabilized continuous linear finite elements. Since the discretized error in a suitable norm can be bounded by the sum of interpolation error and its variants in different norms, we replace them by some terms which contain the Hessian matrix of the true solution, convective fields, and the geometric properties such as directed edges and the area of the triangle. Based on this observation, the shape, size and equidistribution requirements are used to derive the corresponding metric tensor and the stabilized parameters. It is easily found from our derivation that the optimal stabilized parameter is coupled with the optimal metric tensor on each element. Some numerical results are also provided to validate the stability and efficiency of the proposed numerical strategy.

math.NA↗