In this paper, we define a new nonconforming quadrilateral finite element based on the nonconforming rotated Q1 element by enforcing a constraint on each element, which has only three degrees of freedom. We investigat...In this paper, we define a new nonconforming quadrilateral finite element based on the nonconforming rotated Q1 element by enforcing a constraint on each element, which has only three degrees of freedom. We investigate the consistency, approximation, superclose property, discrete Green＇s function and superconvergence of this element. Moreover, we propose a new postprocessing technique and apply it to this element. It is proved that the postprocessed discrete solution is superconvergent under a mild assumption on the mesh.展开更多
We present a Hermitian and skew-Herrnitian splitting （HSS） iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semi- definite matrices. The unconditional...We present a Hermitian and skew-Herrnitian splitting （HSS） iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semi- definite matrices. The unconditional convergence of the HSS iteration method is proved and an upper bound on the convergence rate is derived. Moreover, to reduce the computing cost, we establish an inexact variant of the HSS iteration method and analyze its convergence property in detail. Numerical results show that the HSS iteration method and its inexact variant are efficient and robust solvers for this class of continuous Sylvester equations.展开更多
Based on two-grid discretizations, in this paper, some new local and parallel finite element algorithms are proposed and analyzed for the stationary incompressible Navier- Stokes problem. These algorithms are motivate...Based on two-grid discretizations, in this paper, some new local and parallel finite element algorithms are proposed and analyzed for the stationary incompressible Navier- Stokes problem. These algorithms are motivated by the observation that for a solution to the Navier-Stokes problem, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel procedure. One major technical tool for the analysis is some local a priori error estimates that are also obtained in this paper for the finite element solutions on general shape-regular grids.展开更多
In this paper we test different conjugate gradient (CG) methods for solving large-scale unconstrained optimization problems. The methods are divided in two groups: the first group includes five basic CG methods and th...In this paper we test different conjugate gradient (CG) methods for solving large-scale unconstrained optimization problems. The methods are divided in two groups: the first group includes five basic CG methods and the second five hybrid CG methods. A collection of medium-scale and large-scale test problems are drawn from a standard code of test problems, CUTE. The conjugate gradient methods are ranked according to the numerical results. Some remarks are given.展开更多
A shift splitting concept is introduced and, correspondingly, a shift-splitting iteration scheme and a shift-splitting preconditioner are presented, for solving the large sparse system of linear equations of which the...A shift splitting concept is introduced and, correspondingly, a shift-splitting iteration scheme and a shift-splitting preconditioner are presented, for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned non-Hermitian positive definite matrix. The convergence property of the shift-splitting iteration method and the eigenvalue distribution of the shift-splitting preconditioned matrix are discussed in depth, and the best possible choice of the shift is investigated in detail. Numerical computations show that the shift-splitting preconditioner can induce accurate, robust and effective preconditioned Krylov subspace iteration methods for solving the large sparse non-Hermitian positive definite systems of linear equations.展开更多
In this paper, three n-rectangle nonconforming elements are proposed with n ≥ 3. They are the extensions of well-known Morley element, Adini element and Bogner-Fox-Schmit element in two spatial dimensions to any high...In this paper, three n-rectangle nonconforming elements are proposed with n ≥ 3. They are the extensions of well-known Morley element, Adini element and Bogner-Fox-Schmit element in two spatial dimensions to any higher dimensions respectively. These elements are all proved to be convergent for a model biharmonic equation in n dimensions.展开更多
The steepest descent method is the simplest gradient method for optimization. It is well known that exact line searches along each steepest descent direction may converge very slowly. An important result was given by ...The steepest descent method is the simplest gradient method for optimization. It is well known that exact line searches along each steepest descent direction may converge very slowly. An important result was given by Barzilar and Borwein, which is proved to be superlinearly convergent for convex quadratic in two dimensional space, and performs quite well for high dimensional problems. The BB method is not monotone, thus it is not easy to be generalized for general nonlinear functions unless certain non-monotone techniques being applied. Therefore, it is very desirable to find stepsize formulae which enable fast convergence and possess the monotone property. Such a stepsize αk for the steepest descent method is suggested in this paper. An algorithm with this new stepsize in even iterations and exact line search in odd iterations is proposed. Numerical results are presented, which confirm that the new method can find the exact solution within 3 iteration for two dimensional problems. The new method is very efficient for small scale problems. A modified version of the new method is also presented, where the new technique for selecting the stepsize is used after every two exact line searches. The modified algorithm is comparable to the Barzilar-Borwein method for large scale problems and better for small scale problems.展开更多
A class of regularized conjugate gradient methods is presented for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned symmetric positive definite matrix. The conv...A class of regularized conjugate gradient methods is presented for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned symmetric positive definite matrix. The convergence properties of these methods are discussed in depth, and the best possible choices of the parameters involved in the new methods are investigated in detail. Numerical computations show that the new methods are more efficient and robust than both classical relaxation methods and classical conjugate direction methods.展开更多
The Hermitian and skew-Hermitian splitting （HSS） method is an unconditionally convergent iteration method for solving large sparse non-Hermitian positive definite system of linear equations. By making use of the HSS...The Hermitian and skew-Hermitian splitting （HSS） method is an unconditionally convergent iteration method for solving large sparse non-Hermitian positive definite system of linear equations. By making use of the HSS iteration as the inner solver for the Newton method, we establish a class of Newton-HSS methods for solving large sparse systems of nonlinear equations with positive definite Jacobian matrices at the solution points. For this class of inexact Newton methods, two types of local convergence theorems are proved under proper conditions, and numerical results are given to examine their feasibility and effectiveness. In addition, the advantages of the Newton-HSS methods over the Newton-USOR, the Newton-GMRES and the Newton-GCG methods are shown through solving systems of nonlinear equations arising from the finite difference discretization of a two-dimensional convection-diffusion equation perturbed by a nonlinear term. The numerical implemen- tations also show that as preconditioners for the Newton-GMRES and the Newton-GCG methods the HSS iteration outperforms the USOR iteration in both computing time and iteration step.展开更多
To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based syn- chronous multisplitting iteration method and the corres...To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based syn- chronous multisplitting iteration method and the corresponding symmetric modulus-based multisplitting relaxation methods. The convergence theorems are established when the system matrix is an H＋-matrix, which improve the existing convergence theory. Numeri- cal results show that the symmetric modulus-based multisplitting relaxation methods are effective in actual implementation.展开更多
The block-by-block method,proposed by Linz for a kind of Volterra integral equations with nonsingular kernels,and extended by Kumar and Agrawal to a class of initial value problems of fractional differential equations...The block-by-block method,proposed by Linz for a kind of Volterra integral equations with nonsingular kernels,and extended by Kumar and Agrawal to a class of initial value problems of fractional differential equations(FDEs)with Caputo derivatives,is an efficient and stable scheme.We analytically prove and numerically verify that this method is convergent with order at least 3 for any fractional order indexα>0.展开更多
Based on an asymptotic expansion of （bi）linear finite elements, a new extrapolation formula and extrapolation cascadic multigrid method （EXCMG） are proposed. The key ingredients of the proposed methods are some ne...Based on an asymptotic expansion of （bi）linear finite elements, a new extrapolation formula and extrapolation cascadic multigrid method （EXCMG） are proposed. The key ingredients of the proposed methods are some new extrapolations and quadratic interpolations, which are used to provide better initial values on the refined grid. In the case of triple grids, the errors of the new initial values are analyzed in detail. The numerical experiments show that EXCMG has higher accuracy and efficiency.展开更多
In the present paper, the authors discuss the locking phenomenon oI the lmlte element method for three-dimensional elasticity as the Lamé constant λ→∞. Three kinds of finite elements are proposed and analyzed ...In the present paper, the authors discuss the locking phenomenon oI the lmlte element method for three-dimensional elasticity as the Lamé constant λ→∞. Three kinds of finite elements are proposed and analyzed to approximate the three-dimensional elasticity with pure displacement boundary condition. Optimal order error estimates which are uniform with respect to λ ∈(0,∞) are obtained for three schemes. Furthermore, numerical results are presented to show that, our schemes are locking-free and and the trilinear conforming finite element scheme is locking.展开更多
Presents information on a study which proposed a mortar element version for rotated Q1 element. Introduction of the model problem; Auxiliary technical lemmas necessary to prove the results; Error estimate.
We introduce some ways to compute the lower and upper bounds of the Laplace eigenvalue problem.By using the special nonconforming finite elements,i.e.,enriched Crouzeix-Raviart element and extended Q1ro t,we get the l...We introduce some ways to compute the lower and upper bounds of the Laplace eigenvalue problem.By using the special nonconforming finite elements,i.e.,enriched Crouzeix-Raviart element and extended Q1ro t,we get the lower bound of the eigenvalue.Additionally,we use conforming finite elements to do the postprocessing to get the upper bound of the eigenvalue,which only needs to solve the corresponding source problems and a small eigenvalue problem if higher order postprocessing method is implemented.Thus,we can obtain the lower and upper bounds of the eigenvalues simultaneously by solving eigenvalue problem only once.Some numerical results are also presented to demonstrate our theoretical analysis.展开更多
The Hamiltonian formulations of the linear 'good' Boussinesq (L.G.B.) equation and the multi-symplectic formulation of the nonlinear 'good' Boussinesq (N.G.B.) equation are considered. For the multi-sy...The Hamiltonian formulations of the linear 'good' Boussinesq (L.G.B.) equation and the multi-symplectic formulation of the nonlinear 'good' Boussinesq (N.G.B.) equation are considered. For the multi-symplectic formulation, a new fifteen-point difference scheme which is equivalent to the multi-symplectic Preissmann integrator is derived. We also present numerical experiments, which show that the symplectic and multi-symplectic schemes have excellent long-time numerical behavior.展开更多
In this paper, the authors present a locking-free scheme of the lowest order nonconforming rectangle finite element method for the planar elasticity with the pure displacement boundary condition. Optimal order error e...In this paper, the authors present a locking-free scheme of the lowest order nonconforming rectangle finite element method for the planar elasticity with the pure displacement boundary condition. Optimal order error estimate, uniformly for the Lamé constant λ∈(0,∞) is obtained.展开更多
In this paper, we study natural boundary reduction for Laplace equation with Dirichlet or Neumann boundary condition in a three-dimensional unbounded domain, which is the outside domain of a prolate spheroid. We expre...In this paper, we study natural boundary reduction for Laplace equation with Dirichlet or Neumann boundary condition in a three-dimensional unbounded domain, which is the outside domain of a prolate spheroid. We express the Poisson integral formula and natural integral operator in a series form explicitly. Thus the original problem is reduced to a boundary integral equation on a prolate spheroid. The variational formula for the reduced problem and its well-posedness are discussed. Boundary element approximation for the variational problem and its error estimates, which have relation to the mesh size and the terms after the series is truncated, are also presented. Two numerical examples are presented to demonstrate the effectiveness and error estimates of this method.展开更多
文摘In this paper, we define a new nonconforming quadrilateral finite element based on the nonconforming rotated Q1 element by enforcing a constraint on each element, which has only three degrees of freedom. We investigate the consistency, approximation, superclose property, discrete Green＇s function and superconvergence of this element. Moreover, we propose a new postprocessing technique and apply it to this element. It is proved that the postprocessed discrete solution is superconvergent under a mild assumption on the mesh.
文摘We present a Hermitian and skew-Herrnitian splitting （HSS） iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semi- definite matrices. The unconditional convergence of the HSS iteration method is proved and an upper bound on the convergence rate is derived. Moreover, to reduce the computing cost, we establish an inexact variant of the HSS iteration method and analyze its convergence property in detail. Numerical results show that the HSS iteration method and its inexact variant are efficient and robust solvers for this class of continuous Sylvester equations.
基金The first author was partially subsidized by the NSF of China 10371095. The third author was partially supported by the National Science Foundation of China under the grant 10425105 and the National Basic Research Program under the grant 2005CB321704.
文摘Based on two-grid discretizations, in this paper, some new local and parallel finite element algorithms are proposed and analyzed for the stationary incompressible Navier- Stokes problem. These algorithms are motivated by the observation that for a solution to the Navier-Stokes problem, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel procedure. One major technical tool for the analysis is some local a priori error estimates that are also obtained in this paper for the finite element solutions on general shape-regular grids.
基金Research partially supported by Chinese NSF grants 19801033,19771047 and 10171104
文摘In this paper we test different conjugate gradient (CG) methods for solving large-scale unconstrained optimization problems. The methods are divided in two groups: the first group includes five basic CG methods and the second five hybrid CG methods. A collection of medium-scale and large-scale test problems are drawn from a standard code of test problems, CUTE. The conjugate gradient methods are ranked according to the numerical results. Some remarks are given.
基金Research supported by The China NNSF 0utstanding Young Scientist Foundation （No.10525102）, The National Natural Science Foundation （No.10471146）, and The National Basic Research Program （No.2005CB321702）, P.R. China.
文摘A shift splitting concept is introduced and, correspondingly, a shift-splitting iteration scheme and a shift-splitting preconditioner are presented, for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned non-Hermitian positive definite matrix. The convergence property of the shift-splitting iteration method and the eigenvalue distribution of the shift-splitting preconditioned matrix are discussed in depth, and the best possible choice of the shift is investigated in detail. Numerical computations show that the shift-splitting preconditioner can induce accurate, robust and effective preconditioned Krylov subspace iteration methods for solving the large sparse non-Hermitian positive definite systems of linear equations.
基金The work of the first author was supported by the National Natural Science Fbundation of china(10571006)The work of the shird author was supperted by the Changjiang Professorship of the Ministry of Education of China through Peking University
文摘In this paper, three n-rectangle nonconforming elements are proposed with n ≥ 3. They are the extensions of well-known Morley element, Adini element and Bogner-Fox-Schmit element in two spatial dimensions to any higher dimensions respectively. These elements are all proved to be convergent for a model biharmonic equation in n dimensions.
文摘The steepest descent method is the simplest gradient method for optimization. It is well known that exact line searches along each steepest descent direction may converge very slowly. An important result was given by Barzilar and Borwein, which is proved to be superlinearly convergent for convex quadratic in two dimensional space, and performs quite well for high dimensional problems. The BB method is not monotone, thus it is not easy to be generalized for general nonlinear functions unless certain non-monotone techniques being applied. Therefore, it is very desirable to find stepsize formulae which enable fast convergence and possess the monotone property. Such a stepsize αk for the steepest descent method is suggested in this paper. An algorithm with this new stepsize in even iterations and exact line search in odd iterations is proposed. Numerical results are presented, which confirm that the new method can find the exact solution within 3 iteration for two dimensional problems. The new method is very efficient for small scale problems. A modified version of the new method is also presented, where the new technique for selecting the stepsize is used after every two exact line searches. The modified algorithm is comparable to the Barzilar-Borwein method for large scale problems and better for small scale problems.
基金Subsidized by The Special Funds For Major State Basic Research Projects G1999032803.
文摘A class of regularized conjugate gradient methods is presented for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned symmetric positive definite matrix. The convergence properties of these methods are discussed in depth, and the best possible choices of the parameters involved in the new methods are investigated in detail. Numerical computations show that the new methods are more efficient and robust than both classical relaxation methods and classical conjugate direction methods.
基金supported by the National Basic Research Program (No. 2005CB321702)the China Outstanding Young Scientist Foundation (No. 10525102)the National Natural Science Foundation (No.10471146, No. 10571059 and No. 10571060), P.R. China
文摘The Hermitian and skew-Hermitian splitting （HSS） method is an unconditionally convergent iteration method for solving large sparse non-Hermitian positive definite system of linear equations. By making use of the HSS iteration as the inner solver for the Newton method, we establish a class of Newton-HSS methods for solving large sparse systems of nonlinear equations with positive definite Jacobian matrices at the solution points. For this class of inexact Newton methods, two types of local convergence theorems are proved under proper conditions, and numerical results are given to examine their feasibility and effectiveness. In addition, the advantages of the Newton-HSS methods over the Newton-USOR, the Newton-GMRES and the Newton-GCG methods are shown through solving systems of nonlinear equations arising from the finite difference discretization of a two-dimensional convection-diffusion equation perturbed by a nonlinear term. The numerical implemen- tations also show that as preconditioners for the Newton-GMRES and the Newton-GCG methods the HSS iteration outperforms the USOR iteration in both computing time and iteration step.
文摘To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based syn- chronous multisplitting iteration method and the corresponding symmetric modulus-based multisplitting relaxation methods. The convergence theorems are established when the system matrix is an H＋-matrix, which improve the existing convergence theory. Numeri- cal results show that the symmetric modulus-based multisplitting relaxation methods are effective in actual implementation.
基金supported by the State Key Laboratory of Scientific and Engineering Computing,Chinese Academy of Sciences and by Hunan Key Laboratory for Computation and Simulation in Science and Engineering,by National Natural Science Foundation of China(Grant Nos.60931002,11001072 and 11026154)partially by the Spanish Ministry of Science and Innovation under Grant AYA2009-14212-C05-05.
文摘The block-by-block method,proposed by Linz for a kind of Volterra integral equations with nonsingular kernels,and extended by Kumar and Agrawal to a class of initial value problems of fractional differential equations(FDEs)with Caputo derivatives,is an efficient and stable scheme.We analytically prove and numerically verify that this method is convergent with order at least 3 for any fractional order indexα>0.
基金The research is supported by the National Natural Science Foundation of China （No. 11071067） and the Key Laboratory of Education Ministry.
文摘Based on an asymptotic expansion of （bi）linear finite elements, a new extrapolation formula and extrapolation cascadic multigrid method （EXCMG） are proposed. The key ingredients of the proposed methods are some new extrapolations and quadratic interpolations, which are used to provide better initial values on the refined grid. In the case of triple grids, the errors of the new initial values are analyzed in detail. The numerical experiments show that EXCMG has higher accuracy and efficiency.
文摘In the present paper, the authors discuss the locking phenomenon oI the lmlte element method for three-dimensional elasticity as the Lamé constant λ→∞. Three kinds of finite elements are proposed and analyzed to approximate the three-dimensional elasticity with pure displacement boundary condition. Optimal order error estimates which are uniform with respect to λ ∈(0,∞) are obtained for three schemes. Furthermore, numerical results are presented to show that, our schemes are locking-free and and the trilinear conforming finite element scheme is locking.
基金Subsidized by the National Natural Science Foundation of China under Grant 19901014 the Special Funds for Major State Basic Research Projects.
文摘Presents information on a study which proposed a mortar element version for rotated Q1 element. Introduction of the model problem; Auxiliary technical lemmas necessary to prove the results; Error estimate.
基金supported by National Science Foundations of China (Grant Nos. 11001259,11031006)Croucher Foundation of Hong Kong Baptist University
文摘We introduce some ways to compute the lower and upper bounds of the Laplace eigenvalue problem.By using the special nonconforming finite elements,i.e.,enriched Crouzeix-Raviart element and extended Q1ro t,we get the lower bound of the eigenvalue.Additionally,we use conforming finite elements to do the postprocessing to get the upper bound of the eigenvalue,which only needs to solve the corresponding source problems and a small eigenvalue problem if higher order postprocessing method is implemented.Thus,we can obtain the lower and upper bounds of the eigenvalues simultaneously by solving eigenvalue problem only once.Some numerical results are also presented to demonstrate our theoretical analysis.
基金Supported by State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences and Foundation of office of overseas Chinese affair under the state council (02
文摘The Hamiltonian formulations of the linear 'good' Boussinesq (L.G.B.) equation and the multi-symplectic formulation of the nonlinear 'good' Boussinesq (N.G.B.) equation are considered. For the multi-symplectic formulation, a new fifteen-point difference scheme which is equivalent to the multi-symplectic Preissmann integrator is derived. We also present numerical experiments, which show that the symplectic and multi-symplectic schemes have excellent long-time numerical behavior.
文摘In this paper, the authors present a locking-free scheme of the lowest order nonconforming rectangle finite element method for the planar elasticity with the pure displacement boundary condition. Optimal order error estimate, uniformly for the Lamé constant λ∈(0,∞) is obtained.
基金This work was subsidized by the National Basic Research Program of China under the grant G19990328, 2005CB321701, and the National Natural Science Foundation of China under the grant 10531080.
文摘In this paper, we study natural boundary reduction for Laplace equation with Dirichlet or Neumann boundary condition in a three-dimensional unbounded domain, which is the outside domain of a prolate spheroid. We express the Poisson integral formula and natural integral operator in a series form explicitly. Thus the original problem is reduced to a boundary integral equation on a prolate spheroid. The variational formula for the reduced problem and its well-posedness are discussed. Boundary element approximation for the variational problem and its error estimates, which have relation to the mesh size and the terms after the series is truncated, are also presented. Two numerical examples are presented to demonstrate the effectiveness and error estimates of this method.
