We present and analyze a robust preconditioned conjugate gradient method for the higher order Lagrangian finite element systems of a class of elliptic problems. An auxiliary linear element stiffness matrix is chosen t...We present and analyze a robust preconditioned conjugate gradient method for the higher order Lagrangian finite element systems of a class of elliptic problems. An auxiliary linear element stiffness matrix is chosen to be the preconditioner for higher order finite elements. Then an algebraic multigrid method of linear finite element is applied for solving the preconditioner. The optimal condition number which is independent of the mesh size is obtained. Numerical experiments confirm the efficiency of the algorithm.展开更多
This article is to discuss the bilinear and linear immersed finite element(IFE)solutions generated from the algebraic multigrid solver for both stationary and moving interface problems.For the numerical methods based ...This article is to discuss the bilinear and linear immersed finite element(IFE)solutions generated from the algebraic multigrid solver for both stationary and moving interface problems.For the numerical methods based on finite difference formulation and a structured mesh independent of the interface,the stiffness matrix of the linear system is usually not symmetric positive-definite,which demands extra efforts to design efficient multigrid methods.On the other hand,the stiffness matrix arising from the IFE methods are naturally symmetric positive-definite.Hence the IFE-AMG algorithm is proposed to solve the linear systems of the bilinear and linear IFE methods for both stationary and moving interface problems.The numerical examples demonstrate the features of the proposed algorithms,including the optimal convergence in both L 2 and semi-H1 norms of the IFE-AMG solutions,the high efficiency with proper choice of the components and parameters of AMG,the influence of the tolerance and the smoother type of AMG on the convergence of the IFE solutions for the interface problems,and the relationship between the cost and the moving interface location.展开更多
In this paper image with horizontal motion blur, vertical motion blur and angled motion blur are considered. We construct several difference schemes to the highly nonlinear term △↓.（△↓u/√｜△↓｜^2＋β） of the ...In this paper image with horizontal motion blur, vertical motion blur and angled motion blur are considered. We construct several difference schemes to the highly nonlinear term △↓.（△↓u/√｜△↓｜^2＋β） of the total variation-based image motion deblurring problem. The large nonlinear system is linearized by fixed point iteration method. An algebraic multigrid method with Krylov subspace acceleration is used to solve the corresponding linear equations as in [7]. The algorithms can restore the image very well. We give some numerical experiments to demonstrate that our difference schemes are efficient and robust.展开更多
The concrete aggregate model is considered as a type of weakly discontinuous problem consisting of three phases:aggregates which randomly distributed in different shapes,cement paste and internal transition zone(ITZ)....The concrete aggregate model is considered as a type of weakly discontinuous problem consisting of three phases:aggregates which randomly distributed in different shapes,cement paste and internal transition zone(ITZ).Because of different shapes of aggregate and thin ITZs,a huge number of elements are often used in the finite element(FEM)analysis.In order to ensure the accuracy of the numerical solutions near the interfaces,we need to use higher-order elements.The widely used FEM softwares such as ANSYS and ABAQUS all provide the option of quadratic elements.However,they have much higher computational complexity than the linear elements.The corresponding coefficient matrix of the system of equations is a highly ill-conditioned matrix due to the large difference between three phase materials,and the convergence rate of the commonly used solving methods will deteriorate.In this paper,two types of simple and efficient preconditioners are proposed for the system of equations of the concrete aggregate models on unstructured triangle meshes by using the resulting hierarchical structure and the properties of the diagonal block matrices.The main computational cost of these preconditioners is how to efficiently solve the system of equations by using linear elements,and thus we can provide some efficient and robust solvers by calling the existing geometric-based algebraic multigrid(GAMG)methods.Since the hierarchical basis functions are used,we need not present those algebraic criterions to judge the relationships between the unknown variables and the geometric node types,and the grid transfer operators are also trivial.This makes it easy to find the linear element matrix derived directly from the fine level matrix,and thus the overall efficiency is greatly improved.The numerical results have verified the efficiency of the resulting preconditioned conjugate gradient(PCG)methods which are applied to the solution of several typical aggregate models.展开更多
We study a class of preconditioners to solve large-scale linear systems arising from fully implicit reservoir simulation. These methods are discussed in the framework of the auxiliary space preconditioning method for ...We study a class of preconditioners to solve large-scale linear systems arising from fully implicit reservoir simulation. These methods are discussed in the framework of the auxiliary space preconditioning method for generality. Unlike in the case of classical algebraic preconditioning methods, we take several analytical and physical considerations into account. In addition, we choose appropriate auxiliary problems to design the robust solvers herein. More importantly, our methods are user-friendly and general enough to be easily ported to existing petroleum reservoir simulators. We test the efficiency and robustness of the proposed method by applying them to a couple of benchmark problems and real-world reservoir problems. The numerical results show that our methods are both efficient and robust for large reservoir models.展开更多
We have developed efficient numerical algorithms for solving 3D steadystate Poisson-Nernst-Planck(PNP)equations with excess chemical potentials described by the classical density functional theory(cDFT).The coupled PN...We have developed efficient numerical algorithms for solving 3D steadystate Poisson-Nernst-Planck(PNP)equations with excess chemical potentials described by the classical density functional theory(cDFT).The coupled PNP equations are discretized by a finite difference scheme and solved iteratively using the Gummel method with relaxation.The Nernst-Planck equations are transformed into Laplace equations through the Slotboom transformation.Then,the algebraic multigrid method is applied to efficiently solve the Poisson equation and the transformed Nernst-Planck equations.A novel strategy for calculating excess chemical potentials through fast Fourier transforms is proposed,which reduces computational complexity from O(N2)to O(NlogN),where N is the number of grid points.Integrals involving the Dirac delta function are evaluated directly by coordinate transformation,which yields more accurate results compared to applying numerical quadrature to an approximated delta function.Numerical results for ion and electron transport in solid electrolyte for lithiumion(Li-ion)batteries are shown to be in good agreement with the experimental data and the results from previous studies.展开更多
Image restoration is a fundamental problem in image processing. Blind image restoration has a great value in its practical application. However, it is not an easy problem to solve due to its complexity and difficulty....Image restoration is a fundamental problem in image processing. Blind image restoration has a great value in its practical application. However, it is not an easy problem to solve due to its complexity and difficulty. In this paper, we combine our robust algorithm for known blur operator with an alternating minimization implicit iterative scheme to deal with blind deconvolution problem, recover the image and identify the point spread function（PSF）. The only assumption needed is satisfy the practical physical sense. Numerical experiments demonstrate that this minimization algorithm is efficient and robust over a wide range of PSF and have almost the same results compared with known PSF algorithm.展开更多
文摘We present and analyze a robust preconditioned conjugate gradient method for the higher order Lagrangian finite element systems of a class of elliptic problems. An auxiliary linear element stiffness matrix is chosen to be the preconditioner for higher order finite elements. Then an algebraic multigrid method of linear finite element is applied for solving the preconditioner. The optimal condition number which is independent of the mesh size is obtained. Numerical experiments confirm the efficiency of the algorithm.
基金supported by DOE grant DE-FE0009843National Natural Science Foundation of China(11175052)GRF of HKSAR#501012 and NSERC(Canada).
文摘This article is to discuss the bilinear and linear immersed finite element(IFE)solutions generated from the algebraic multigrid solver for both stationary and moving interface problems.For the numerical methods based on finite difference formulation and a structured mesh independent of the interface,the stiffness matrix of the linear system is usually not symmetric positive-definite,which demands extra efforts to design efficient multigrid methods.On the other hand,the stiffness matrix arising from the IFE methods are naturally symmetric positive-definite.Hence the IFE-AMG algorithm is proposed to solve the linear systems of the bilinear and linear IFE methods for both stationary and moving interface problems.The numerical examples demonstrate the features of the proposed algorithms,including the optimal convergence in both L 2 and semi-H1 norms of the IFE-AMG solutions,the high efficiency with proper choice of the components and parameters of AMG,the influence of the tolerance and the smoother type of AMG on the convergence of the IFE solutions for the interface problems,and the relationship between the cost and the moving interface location.
文摘In this paper image with horizontal motion blur, vertical motion blur and angled motion blur are considered. We construct several difference schemes to the highly nonlinear term △↓.（△↓u/√｜△↓｜^2＋β） of the total variation-based image motion deblurring problem. The large nonlinear system is linearized by fixed point iteration method. An algebraic multigrid method with Krylov subspace acceleration is used to solve the corresponding linear equations as in [7]. The algorithms can restore the image very well. We give some numerical experiments to demonstrate that our difference schemes are efficient and robust.
基金This work was supported in part by the National Natural Science Foundation of China(Grant No.11601462)the Hunan Provincial Natural Science Foundation of China(Grant No.14JJ2063)the Scientific Research Fund of Hunan Provincial Education Department(Grant No.15A183).
文摘The concrete aggregate model is considered as a type of weakly discontinuous problem consisting of three phases:aggregates which randomly distributed in different shapes,cement paste and internal transition zone(ITZ).Because of different shapes of aggregate and thin ITZs,a huge number of elements are often used in the finite element(FEM)analysis.In order to ensure the accuracy of the numerical solutions near the interfaces,we need to use higher-order elements.The widely used FEM softwares such as ANSYS and ABAQUS all provide the option of quadratic elements.However,they have much higher computational complexity than the linear elements.The corresponding coefficient matrix of the system of equations is a highly ill-conditioned matrix due to the large difference between three phase materials,and the convergence rate of the commonly used solving methods will deteriorate.In this paper,two types of simple and efficient preconditioners are proposed for the system of equations of the concrete aggregate models on unstructured triangle meshes by using the resulting hierarchical structure and the properties of the diagonal block matrices.The main computational cost of these preconditioners is how to efficiently solve the system of equations by using linear elements,and thus we can provide some efficient and robust solvers by calling the existing geometric-based algebraic multigrid(GAMG)methods.Since the hierarchical basis functions are used,we need not present those algebraic criterions to judge the relationships between the unknown variables and the geometric node types,and the grid transfer operators are also trivial.This makes it easy to find the linear element matrix derived directly from the fine level matrix,and thus the overall efficiency is greatly improved.The numerical results have verified the efficiency of the resulting preconditioned conjugate gradient(PCG)methods which are applied to the solution of several typical aggregate models.
基金supported by Petro-China Joint Research Funding(Grant No.12HT1050002654)National Science Foundation of USA(Grant No.DMS-1217142)+1 种基金the Dean’s Startup FundAcademy of Mathematics and System Sciences and the State High Tech Development Plan of China(863 Program)(GrantNo.2012AA01A309)
文摘We study a class of preconditioners to solve large-scale linear systems arising from fully implicit reservoir simulation. These methods are discussed in the framework of the auxiliary space preconditioning method for generality. Unlike in the case of classical algebraic preconditioning methods, we take several analytical and physical considerations into account. In addition, we choose appropriate auxiliary problems to design the robust solvers herein. More importantly, our methods are user-friendly and general enough to be easily ported to existing petroleum reservoir simulators. We test the efficiency and robustness of the proposed method by applying them to a couple of benchmark problems and real-world reservoir problems. The numerical results show that our methods are both efficient and robust for large reservoir models.
基金the Materials Synthesis and Simulation across Scales(MS3)Initiative(Laboratory Directed Research and Development(LDRD)Program)at Pacific Northwest National Laboratory(PNNL).Work by GL was supported by the U.S.Department of Energy(DOE)Office of Science’s Advanced Scientific Computing Research Applied Mathematics program and work by BZ by Early Career Award Initiative(LDRD Program)at PNNL.PNNL is operated by Battelle for the DOE under Contract DE-AC05-76RL01830.
文摘We have developed efficient numerical algorithms for solving 3D steadystate Poisson-Nernst-Planck(PNP)equations with excess chemical potentials described by the classical density functional theory(cDFT).The coupled PNP equations are discretized by a finite difference scheme and solved iteratively using the Gummel method with relaxation.The Nernst-Planck equations are transformed into Laplace equations through the Slotboom transformation.Then,the algebraic multigrid method is applied to efficiently solve the Poisson equation and the transformed Nernst-Planck equations.A novel strategy for calculating excess chemical potentials through fast Fourier transforms is proposed,which reduces computational complexity from O(N2)to O(NlogN),where N is the number of grid points.Integrals involving the Dirac delta function are evaluated directly by coordinate transformation,which yields more accurate results compared to applying numerical quadrature to an approximated delta function.Numerical results for ion and electron transport in solid electrolyte for lithiumion(Li-ion)batteries are shown to be in good agreement with the experimental data and the results from previous studies.
文摘Image restoration is a fundamental problem in image processing. Blind image restoration has a great value in its practical application. However, it is not an easy problem to solve due to its complexity and difficulty. In this paper, we combine our robust algorithm for known blur operator with an alternating minimization implicit iterative scheme to deal with blind deconvolution problem, recover the image and identify the point spread function（PSF）. The only assumption needed is satisfy the practical physical sense. Numerical experiments demonstrate that this minimization algorithm is efficient and robust over a wide range of PSF and have almost the same results compared with known PSF algorithm.
