The main aim of this paper is to study the approximation to viscoelasticity type equations with a Crouzeix-Raviart type nonconforming finite element on the anisotropic meshes. The superclose property of the exact solu...The main aim of this paper is to study the approximation to viscoelasticity type equations with a Crouzeix-Raviart type nonconforming finite element on the anisotropic meshes. The superclose property of the exact solution and the optimal error estimate of its derivative with respect to time are derived by using some novel techniques. Moreover, employing a postprocessing technique, the global superconvergence property for the discretization error of the postprocessed discrete solution to the solution itself is studied.展开更多
In this paper, we set up a general framework of parallel matrix mullisplitting relaxation methods for solving large scale system of linear equations. We investigate the convergence properties of this framework and giv...In this paper, we set up a general framework of parallel matrix mullisplitting relaxation methods for solving large scale system of linear equations. We investigate the convergence properties of this framework and give several sufficient conditions ensuring it to converge as well as diverge. At last, we conclude a necessary and sufficient condition for the convergence of this framework when the coefficient matrix is an L-matrix.展开更多
In this paper, we propose a globally convergent Polak-Ribiere-Polyak (PRP) conjugate gradient method for nonconvex minimization of differentiable functions by employing an Armijo-type line search which is simpler and ...In this paper, we propose a globally convergent Polak-Ribiere-Polyak (PRP) conjugate gradient method for nonconvex minimization of differentiable functions by employing an Armijo-type line search which is simpler and less demanding than those defined in [4,10]. A favorite property of this method is that we can choose the initial stepsize as the one-dimensional minimizer of a quadratic modelΦ(t):= f(xk)+tgkTdk+(1/2) t2dkTQkdk, where Qk is a positive definite matrix that carries some second order information of the objective function f. So, this line search may make the stepsize tk more easily accepted. Preliminary numerical results show that this method is efficient.展开更多
In this paper, two finite difference streamline diffusion (FDSD) schemes for solving two-dimensional time-dependent convection-diffusion equations are constructed. Stability and optimal order error estimati-ions for c...In this paper, two finite difference streamline diffusion (FDSD) schemes for solving two-dimensional time-dependent convection-diffusion equations are constructed. Stability and optimal order error estimati-ions for considered schemes are derived in the norm stronger than L^2-norm.展开更多
As we know, Newton's interpolation polynomial is based on divided differ-ences which can be calculated recursively by the divided-difference scheme while Thiele'sinterpolating continued fractions are geared to...As we know, Newton's interpolation polynomial is based on divided differ-ences which can be calculated recursively by the divided-difference scheme while Thiele'sinterpolating continued fractions are geared towards determining a rational functionwhich can also be calculated recursively by so-called inverse differences. In this paper,both Newton's interpolation polynomial and Thiele's interpolating continued fractionsare incorporated to yield a kind of bivariate vector valued blending rational interpolantsby means of the Samelson inverse. Blending differences are introduced to calculate theblending rational interpolants recursively, algorithm and matrix-valued case are dis-cussed and a numerical example is given to illustrate the efficiency of the algorithm.展开更多
The main aim of this paper is to provide convergence analysis of Quasi-Wilson nonconforming finite element to Maxwell's equations under arbitrary quadrilateral meshes.The error estimates are derived,which are the ...The main aim of this paper is to provide convergence analysis of Quasi-Wilson nonconforming finite element to Maxwell's equations under arbitrary quadrilateral meshes.The error estimates are derived,which are the same as those for conforming elements under conventional regular meshes.展开更多
In this paper, a high accuracy finite volume element method is presented for two-point boundary value problem of second order ordinary differential equation, which differs from the high order generalized difference me...In this paper, a high accuracy finite volume element method is presented for two-point boundary value problem of second order ordinary differential equation, which differs from the high order generalized difference methods. It is proved that the method has optimal order error estimate O(h3) in H1 norm. Finally, two examples show that the method is effective.展开更多
An inverse problem of determining magnitude of groundwater pollution in a hydrologic region is investigated. By applying integral identity methods, a conditional stability for the inverse problem here is constructed w...An inverse problem of determining magnitude of groundwater pollution in a hydrologic region is investigated. By applying integral identity methods, a conditional stability for the inverse problem here is constructed with aids of an optimal adjoint problem and a suitable topology.展开更多
In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear systems with multiple right-hand sides, and show how to incorporate deflation to drop converged linear systems using ...In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear systems with multiple right-hand sides, and show how to incorporate deflation to drop converged linear systems using a natural convergence criterion, and present an adaptive block Lanczos algorithm. We propose also a block version of Paige and Saunders’ MINRES method for iterative solution of symmetric linear systems, and describe important implementation details. We establish a relationship between the block Lanczos algorithm and block MINRES algorithm, and compare the numerical performance of the Lanczos algorithm and MINRES method for symmetric linear systems applied to a sequence of right hand sides with that of the block Lanczos algorithm and block MINRES algorithm for multiple linear systems simultaneously.[WT5,5”HZ]展开更多
In this paper, we present a new homotopy method for the nonlinear complementarity problems. Without the regularity or non-singulary assumptions for▽F(x), we prove that our homotopy equations have a bounded solution c...In this paper, we present a new homotopy method for the nonlinear complementarity problems. Without the regularity or non-singulary assumptions for▽F(x), we prove that our homotopy equations have a bounded solution curve. The numerical tests confirm the efficiency of our proposed method.展开更多
By making use of Thiele-type bivariate branched continued fractions and Sumelson inverse,we construct a few kinds of bivariate vector valued rational interpolonts (BVRIs) over rectangular grids and find out certain re...By making use of Thiele-type bivariate branched continued fractions and Sumelson inverse,we construct a few kinds of bivariate vector valued rational interpolonts (BVRIs) over rectangular grids and find out certain relations among these BVRIs such as boundary identity and duality.展开更多
Nonlinear Schrodinger equation (NSE) arises in many physical problems. It is a very important equation. A lot of works studied the wellposed, the existence of solution of NSE etc. And there are many works studied the ...Nonlinear Schrodinger equation (NSE) arises in many physical problems. It is a very important equation. A lot of works studied the wellposed, the existence of solution of NSE etc. And there are many works studied the numerical methods for it. Recently, since the development of infinite dimensional dynamic system the dynamical behavior of NSE has been investigated. The paper [1] studied the long time wellposedness, the existence of universal attractor and the estimate of Lyapunov exponent for NSE with weakly damped. At the same time it was need to study the large time new computational methods and to discuss its convergence error estimate, the existence of approximate attractors etc. In this pape we study the NSE with weakly damped (1.1). We assume,where 0【λ【2 is a constant. If we wish to construct the higher accuracy computational scheme, it will be difficult that staigh from the equation (1.1). Therefore we start with (1. 4) and use fully discrete Fourier spectral method with time difference to展开更多
There are many accelerating convergence factors (ACFs) for limit periodic continued fraction K(an/1)(an→a≠0). In this paper, some characteristics and comparative theorems are ob tained on ACFs. Two results are given...There are many accelerating convergence factors (ACFs) for limit periodic continued fraction K(an/1)(an→a≠0). In this paper, some characteristics and comparative theorems are ob tained on ACFs. Two results are given for most frequently used ACFs.展开更多
We consider the numerical solution for the Helmholtz equation in R^2 with mixed boundary conditions.The solvability of this mixed boundary value problem is estab- lished by the boundary integral equation method.Based ...We consider the numerical solution for the Helmholtz equation in R^2 with mixed boundary conditions.The solvability of this mixed boundary value problem is estab- lished by the boundary integral equation method.Based on the Green formula,we express the solution in terms of the boundary data.The key to the numerical real- ization of this method is the computation of weakly singular integrals.Numerical performances show the validity and feasibility of our method.The numerical schemes proposed in this paper have been applied in the realization of probe method for inverse scattering problems.展开更多
A subspace projected conjugate gradient method is proposed for solving large bound constrained quadratic programming. The conjugate gradient method is used to update the variables with indices outside of the active se...A subspace projected conjugate gradient method is proposed for solving large bound constrained quadratic programming. The conjugate gradient method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. At every iterative level, the search direction consists of two parts, one of which is a subspace trumcated Newton direction, another is a modified gradient direction. With the projected search the algorithm is suitable to large problems. The convergence of the method is proved and same numerical tests with dimensions ranging from 5000 to 20000 are given.展开更多
This paper discusses the solutions of the linear matrix equation BT X B=Don some linear manifolds.Some necessary and sufficient conditions for the existenceof the solution and the expression of the general solution ar...This paper discusses the solutions of the linear matrix equation BT X B=Don some linear manifolds.Some necessary and sufficient conditions for the existenceof the solution and the expression of the general solution are given.And also someoptimal approximation solutions are discussed.展开更多
We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting ...We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting scheme. We establish a general setting for the analysis of these methods, showing that the methods yield approximate solutions of the same convergence order as the best approximation from the subspace. These augmentation methods allow us to develop fast, accurate and stable nonconventional numerical algorithms for solving operator equations. In particular, for second kind equations, special splitting techniques are proposed to develop such algorithms. These algorithms are then applied to solve the linear systems resulting from matrix compression schemes using wavelet-like functions for solving Fredholm integral equations of the second kind. For this special case, a complete analysis for computational complexity and convergence order is presented. Numerical examples are included to demonstrate the efficiency and accuracy of the methods. In these examples we use the proposed augmentation method to solve large scale linear systems resulting from the recently developed wavelet Galerkin methods and fast collocation methods applied to integral equations of the secondkind. Our numerical results confirm that this augmentation method is particularly efficient for solving large scale linear systems induced from wavelet compression schemes.展开更多
In this paper, we discuss local convergence of a family of Chebychev Halley type methods with a parameter θ∈[0,1] in Banach space using Smale type δ criterion under 2 th γ condition. We will see that the propertie...In this paper, we discuss local convergence of a family of Chebychev Halley type methods with a parameter θ∈[0,1] in Banach space using Smale type δ criterion under 2 th γ condition. We will see that the properties of the condition used for local convergence is much more different from that used in [6][15] for the semi-local convergence.展开更多
A modification of a finite element method of Douglas and Roberts for approximating the solution of the equations describing compressible miscible displacement in a porous medium is proposed and analyzed. The pressure ...A modification of a finite element method of Douglas and Roberts for approximating the solution of the equations describing compressible miscible displacement in a porous medium is proposed and analyzed. The pressure is treated by a parabolic mixed finite element method using a Raviart-Thomas space of index rover a quasiregular partition, An extension of the Darcy velocity along Gauss lines is used in the evaluation of the coefficients in the Galerkin procedure for the concentration. A simple computational procedure allows the superconvergence property of the fluid velocity to be retained in our total algorithm.展开更多
In this paper, we investigate the Ishikawa iteration process in a p-uniformly smooth Banach space X. We prove that the Ishikawa iteration process converges strongly to the unique solution of the equation Tx=f when T i...In this paper, we investigate the Ishikawa iteration process in a p-uniformly smooth Banach space X. We prove that the Ishikawa iteration process converges strongly to the unique solution of the equation Tx=f when T is a Lipschitzian and strongly accretive operator frow X to X, or to the unique fixed point of T when T is a Lipschitzian and strictly pseudocontractive mapping from a nonempty closed convex subset K of X into itself. Our results are the extension and improvements of the earlier and recent results in this field.展开更多
基金This research is supported by the NSF of China (10371113 10471133),SF of Henan ProvinceSF of Education Committee of Henan Province (2006110011)
文摘The main aim of this paper is to study the approximation to viscoelasticity type equations with a Crouzeix-Raviart type nonconforming finite element on the anisotropic meshes. The superclose property of the exact solution and the optimal error estimate of its derivative with respect to time are derived by using some novel techniques. Moreover, employing a postprocessing technique, the global superconvergence property for the discretization error of the postprocessed discrete solution to the solution itself is studied.
基金Supported by Natural Science Fundations of China and Shanghai.
文摘In this paper, we set up a general framework of parallel matrix mullisplitting relaxation methods for solving large scale system of linear equations. We investigate the convergence properties of this framework and give several sufficient conditions ensuring it to converge as well as diverge. At last, we conclude a necessary and sufficient condition for the convergence of this framework when the coefficient matrix is an L-matrix.
基金This work is supported by the Chinese NSF grants 60475042 Guangxi NSF grants 0542043the Foundation of Advanced Research Center of Zhongshan University and Hong Kong
文摘In this paper, we propose a globally convergent Polak-Ribiere-Polyak (PRP) conjugate gradient method for nonconvex minimization of differentiable functions by employing an Armijo-type line search which is simpler and less demanding than those defined in [4,10]. A favorite property of this method is that we can choose the initial stepsize as the one-dimensional minimizer of a quadratic modelΦ(t):= f(xk)+tgkTdk+(1/2) t2dkTQkdk, where Qk is a positive definite matrix that carries some second order information of the objective function f. So, this line search may make the stepsize tk more easily accepted. Preliminary numerical results show that this method is efficient.
基金Project supported by National Natural Science Foundation of China and China State Key project for Basic Researchcs.
文摘In this paper, two finite difference streamline diffusion (FDSD) schemes for solving two-dimensional time-dependent convection-diffusion equations are constructed. Stability and optimal order error estimati-ions for considered schemes are derived in the norm stronger than L^2-norm.
基金Supported by the National Natural Science Foundation of China under Grant No.10171026 and in part by the Foundation for Excellent Young Teachers of the Ministry of Education of China and the Financially-Aiding Program for the Backbone Teachers of the Min
文摘As we know, Newton's interpolation polynomial is based on divided differ-ences which can be calculated recursively by the divided-difference scheme while Thiele'sinterpolating continued fractions are geared towards determining a rational functionwhich can also be calculated recursively by so-called inverse differences. In this paper,both Newton's interpolation polynomial and Thiele's interpolating continued fractionsare incorporated to yield a kind of bivariate vector valued blending rational interpolantsby means of the Samelson inverse. Blending differences are introduced to calculate theblending rational interpolants recursively, algorithm and matrix-valued case are dis-cussed and a numerical example is given to illustrate the efficiency of the algorithm.
基金The work was supported by the Chinese National Science Foundation Project (10671184).
文摘The main aim of this paper is to provide convergence analysis of Quasi-Wilson nonconforming finite element to Maxwell's equations under arbitrary quadrilateral meshes.The error estimates are derived,which are the same as those for conforming elements under conventional regular meshes.
基金heprojectissupportedbyNNSFofChina (No .1 9972 0 39) .
文摘In this paper, a high accuracy finite volume element method is presented for two-point boundary value problem of second order ordinary differential equation, which differs from the high order generalized difference methods. It is proved that the method has optimal order error estimate O(h3) in H1 norm. Finally, two examples show that the method is effective.
基金National Natural Science Foundation of China No. 10471080.
文摘An inverse problem of determining magnitude of groundwater pollution in a hydrologic region is investigated. By applying integral identity methods, a conditional stability for the inverse problem here is constructed with aids of an optimal adjoint problem and a suitable topology.
文摘In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear systems with multiple right-hand sides, and show how to incorporate deflation to drop converged linear systems using a natural convergence criterion, and present an adaptive block Lanczos algorithm. We propose also a block version of Paige and Saunders’ MINRES method for iterative solution of symmetric linear systems, and describe important implementation details. We establish a relationship between the block Lanczos algorithm and block MINRES algorithm, and compare the numerical performance of the Lanczos algorithm and MINRES method for symmetric linear systems applied to a sequence of right hand sides with that of the block Lanczos algorithm and block MINRES algorithm for multiple linear systems simultaneously.[WT5,5”HZ]
文摘In this paper, we present a new homotopy method for the nonlinear complementarity problems. Without the regularity or non-singulary assumptions for▽F(x), we prove that our homotopy equations have a bounded solution curve. The numerical tests confirm the efficiency of our proposed method.
基金Supported by the National Natural Science Foundation of China.
文摘By making use of Thiele-type bivariate branched continued fractions and Sumelson inverse,we construct a few kinds of bivariate vector valued rational interpolonts (BVRIs) over rectangular grids and find out certain relations among these BVRIs such as boundary identity and duality.
文摘Nonlinear Schrodinger equation (NSE) arises in many physical problems. It is a very important equation. A lot of works studied the wellposed, the existence of solution of NSE etc. And there are many works studied the numerical methods for it. Recently, since the development of infinite dimensional dynamic system the dynamical behavior of NSE has been investigated. The paper [1] studied the long time wellposedness, the existence of universal attractor and the estimate of Lyapunov exponent for NSE with weakly damped. At the same time it was need to study the large time new computational methods and to discuss its convergence error estimate, the existence of approximate attractors etc. In this pape we study the NSE with weakly damped (1.1). We assume,where 0【λ【2 is a constant. If we wish to construct the higher accuracy computational scheme, it will be difficult that staigh from the equation (1.1). Therefore we start with (1. 4) and use fully discrete Fourier spectral method with time difference to
基金Supported by the National Natural Science Foundation of china
文摘There are many accelerating convergence factors (ACFs) for limit periodic continued fraction K(an/1)(an→a≠0). In this paper, some characteristics and comparative theorems are ob tained on ACFs. Two results are given for most frequently used ACFs.
文摘We consider the numerical solution for the Helmholtz equation in R^2 with mixed boundary conditions.The solvability of this mixed boundary value problem is estab- lished by the boundary integral equation method.Based on the Green formula,we express the solution in terms of the boundary data.The key to the numerical real- ization of this method is the computation of weakly singular integrals.Numerical performances show the validity and feasibility of our method.The numerical schemes proposed in this paper have been applied in the realization of probe method for inverse scattering problems.
基金This research was supported by Chinese NNSF grant and NSF grant of Jiangsu Province
文摘A subspace projected conjugate gradient method is proposed for solving large bound constrained quadratic programming. The conjugate gradient method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. At every iterative level, the search direction consists of two parts, one of which is a subspace trumcated Newton direction, another is a modified gradient direction. With the projected search the algorithm is suitable to large problems. The convergence of the method is proved and same numerical tests with dimensions ranging from 5000 to 20000 are given.
基金This work was supposed by the National Nature Science Foundation of China
文摘This paper discusses the solutions of the linear matrix equation BT X B=Don some linear manifolds.Some necessary and sufficient conditions for the existenceof the solution and the expression of the general solution are given.And also someoptimal approximation solutions are discussed.
基金Supported in part by the Natural Science Foundation of China under grants 10371137and 10201034Foundation of Doctoral Program of National Higher Education of China under under grant 20030558008Guangdong Provincial Natural Science Foundation of China u
文摘We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting scheme. We establish a general setting for the analysis of these methods, showing that the methods yield approximate solutions of the same convergence order as the best approximation from the subspace. These augmentation methods allow us to develop fast, accurate and stable nonconventional numerical algorithms for solving operator equations. In particular, for second kind equations, special splitting techniques are proposed to develop such algorithms. These algorithms are then applied to solve the linear systems resulting from matrix compression schemes using wavelet-like functions for solving Fredholm integral equations of the second kind. For this special case, a complete analysis for computational complexity and convergence order is presented. Numerical examples are included to demonstrate the efficiency and accuracy of the methods. In these examples we use the proposed augmentation method to solve large scale linear systems resulting from the recently developed wavelet Galerkin methods and fast collocation methods applied to integral equations of the secondkind. Our numerical results confirm that this augmentation method is particularly efficient for solving large scale linear systems induced from wavelet compression schemes.
文摘In this paper, we discuss local convergence of a family of Chebychev Halley type methods with a parameter θ∈[0,1] in Banach space using Smale type δ criterion under 2 th γ condition. We will see that the properties of the condition used for local convergence is much more different from that used in [6][15] for the semi-local convergence.
基金Supported by China State Major Rey Project for Basic Researches
文摘A modification of a finite element method of Douglas and Roberts for approximating the solution of the equations describing compressible miscible displacement in a porous medium is proposed and analyzed. The pressure is treated by a parabolic mixed finite element method using a Raviart-Thomas space of index rover a quasiregular partition, An extension of the Darcy velocity along Gauss lines is used in the evaluation of the coefficients in the Galerkin procedure for the concentration. A simple computational procedure allows the superconvergence property of the fluid velocity to be retained in our total algorithm.
基金The project supported by the Science and Technology Development Fund of Shanghai Higher Learning
文摘In this paper, we investigate the Ishikawa iteration process in a p-uniformly smooth Banach space X. We prove that the Ishikawa iteration process converges strongly to the unique solution of the equation Tx=f when T is a Lipschitzian and strongly accretive operator frow X to X, or to the unique fixed point of T when T is a Lipschitzian and strictly pseudocontractive mapping from a nonempty closed convex subset K of X into itself. Our results are the extension and improvements of the earlier and recent results in this field.