Considering the coupled nonlinear Schr¨odinger system with multiply components, we provide a novel framework for constructing energy-preserving algorithms. In detail, based on the high order compact finite differ...Considering the coupled nonlinear Schr¨odinger system with multiply components, we provide a novel framework for constructing energy-preserving algorithms. In detail, based on the high order compact finite difference method, Fourier pseudospectral method and wavelet collocation method for spatial discretizations, a series of high accurate conservative algorithms are presented. The proposed algorithms can preserve the corresponding discrete charge and energy conservation laws exactly, which would guarantee their numerical stabilities during long time computations.Furthermore, several analogous multi-symplectic algorithms are constructed as comparison. Numerical experiments for the unstable plane waves will show the advantages of the proposed algorithms over long time and verify the theoretical analysis.展开更多
A complete mesh free adaptive algorithm （MFAA）, with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in s...A complete mesh free adaptive algorithm （MFAA）, with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in structured grids. Unnecessary redundant points and elements are avoided by using the mesh free local clouds refinement technology in shock influencing regions and regions near large curvature places on the boundary. Inviscid compressible flows over NACA0012 and RAE2822 airfoils are computed. Finally numerical results validate the accuracy of the above method.展开更多
This paper presents a finite element procedure for solving transient, multidimensional convection-diffusion equations. The procedure is based on the characteristic Galerkin method with an implicit algorithm using prec...This paper presents a finite element procedure for solving transient, multidimensional convection-diffusion equations. The procedure is based on the characteristic Galerkin method with an implicit algorithm using precise integration method. With the operator splitting procedure, the precise integration method is introduced to determine the material derivative in the convection-diffusion equation, consequently, the physical quantities of material points. An implicit algorithm with a combination of both the precise and the traditional numerical integration procedures in time domain in the Lagrange coordinates for the characteristic Galerkin method is formulated. The stability analysis of the algorithm shows that the unconditional stability of present implicit algorithm is enhanced as compared with that of the traditional implicit numerical integration procedure. The numerical results validate the presented method in solving convection-diffusion equations. As compared with SUPG method and explicit characteristic Galerkin method, the present method gives the results with higher accuracy and better stability.展开更多
A fast hybrid algorithm based on gridless method coupled with finite volume method （FVM） is developed for the solution to Euler equations. Compared with pure gridless method, the efficiency of the hybrid algorithm i...A fast hybrid algorithm based on gridless method coupled with finite volume method （FVM） is developed for the solution to Euler equations. Compared with pure gridless method, the efficiency of the hybrid algorithm is improved to the level of finite volume method for most parts of the flow filed arc covered with grid cells. Moreover, the hybrid method is flexible to deal with the configurations as clouds of points are used to cover the region adjacent to the bodies. Mirror satellites and mirror grid cells arc introduced to the interface to accomplish data communication between the different parts of the flow field. The Euler Equations arc spatially discretized with finite volume method and gridless method in mesh and clouds of points respectively, and an explicit four-stage Runge-Kutta scheme is utilized to reach the steady-state solution. Internal flows in channels and external flows over airfoils arc investigated with hybrid method, and the solutions arc comparad to those using pure finite volume method and pure gridless method. Numerical examples show that the hybrid algorithm captures the shock waves accurately, and it is as efficient as fmite volume method.展开更多
In this paper, we establish the existence of four families of simple wave solu- tion for two dimensional compressible full Euler system in the self-similar plane. For the 2 × 2 quasilinear non-reducible hyperboli...In this paper, we establish the existence of four families of simple wave solu- tion for two dimensional compressible full Euler system in the self-similar plane. For the 2 × 2 quasilinear non-reducible hyperbolic system, there not necessarily exists any simple wave solution. We prove the result that there are simple wave solutions for this 4× 4 non- reducible hyperbolic system, its simple wave flow is covered by four straight characteristics λ0 =λ1,λA2, λ3 and the solutions keep constants along these lines. We also investigate the existence of simple wave solution for the isentropic relativistic hydrodynamic system in the self-similar plane.展开更多
This paper introduces Soccer League Competition (SLC) algorithm as a new optimization technique for solving nonlinear systems of equations. Fundamental ideas of the method are inspired from soccer leagues and based on...This paper introduces Soccer League Competition (SLC) algorithm as a new optimization technique for solving nonlinear systems of equations. Fundamental ideas of the method are inspired from soccer leagues and based on the competitions among teams and players. Like other meta-heuristic methods, the proposed technique starts with an initial population. Population individuals called players are in two types: fixed players and substitutes that all together form some teams. The competition among teams to take the possession of the top ranked positions in the league table and the internal competitions between players in each team for personal improvements results in the convergence of population individuals to the global optimum. Results of applying the proposed algorithm in solving nonlinear systems of equations demonstrate that SLC converges to the answer more accurately and rapidly in comparison with other Meta-heuristic and Newton-type methods.展开更多
In this paper, we prove that if p, q are distinct primes, (p,q)≡(1,7) (mod 12) and Legendres symbol pq=1 , then the equation 1+p a=2 bq c+2 dp eq f has only solutions of the form (a,b,c,d,e,f)=...In this paper, we prove that if p, q are distinct primes, (p,q)≡(1,7) (mod 12) and Legendres symbol pq=1 , then the equation 1+p a=2 bq c+2 dp eq f has only solutions of the form (a,b,c,d,e,f)=(t,0,0,0,t,0), where t is a non negative integer. We also give all solutions of a kind of generalized Ramanujan Nagell equations by using the theories of imaginary quadratic field and Pells equation.展开更多
In this paper, we propose a two-grid algorithm for solving the stream function formulation of the stationary Navies-Stokes equations. The algorithm is constructed by reducing the original system to one small, nonlinea...In this paper, we propose a two-grid algorithm for solving the stream function formulation of the stationary Navies-Stokes equations. The algorithm is constructed by reducing the original system to one small, nonlinear system on the coarse mesh space and two similar linear systems （with same stiffness matrix but different right-hand side） on the fine mesh space. The convergence analysis and error estimation of the algorithm are given for the case of conforming elements. Furthermore, the Mgorithm produces a numerical solution with the optimal asymptotic H^2-error. Finally, we give a numerical illustration to demonstrate the effectiveness of the two-grid algorithm for solving the Navier-Stokes equations.展开更多
In this article, the modified simple equation method has been extended to celebrate the exact solutions of nonlinear partial time-space differential equations of fractional order. Firstly, the fractional complex trans...In this article, the modified simple equation method has been extended to celebrate the exact solutions of nonlinear partial time-space differential equations of fractional order. Firstly, the fractional complex transformation has been implemented to convert nonlinear partial fractional differential equations into nonlinear ordinary differential equations. Afterwards, modified simple equation method has been implemented, to find the exact solutions of these equations, in the sense of modified Riemann-Liouville derivative. For applications, the exact solutions of time-space fractional derivative Burgers’ equation and time-space fractional derivative foam drainage equation have been discussed. Moreover, it can also be concluded that the proposed method is easy, direct and concise as compared to other existing methods.展开更多
In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared wi...In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.展开更多
The accuracy of numerical simulations and many other material design calculations, such as the rolling force, rollingtorque, etc., depends on the description of stress-strain relationship of the deformed materials. On...The accuracy of numerical simulations and many other material design calculations, such as the rolling force, rollingtorque, etc., depends on the description of stress-strain relationship of the deformed materials. One common methodof describing the stress-strain relationship is using constitutive equations, with the unknown parameters fitted byexperimental data obtained via plane strain compression (PSC). Due to the highly nonlinear behaviour of the constitutive equations and the noise included in the PSC data, determination of the model parameters is difficult. Inthis paper, genetic algorithms were exploited to optimise parameters for the constitutive equations based on thePSC data. The original PSC data were processed to generate the stress-strain data, and data pre-processing wascarried out to remove the noise contained in the original PSC data. Several genetic optimisation schemes have beeninvestigated, with different coding schemes and different genetic operators for selection, crossover and mutation.It was found that the real value coded genetic algorithms converged much faster and were more efficient for theparameter optimisation problem.展开更多
In this paper, the authors show that the general linear second order ordinary Differential Equation can be formulated as an optimization problem and that evolutionary algorithms for solving optimization problems can a...In this paper, the authors show that the general linear second order ordinary Differential Equation can be formulated as an optimization problem and that evolutionary algorithms for solving optimization problems can also be adapted for solving the formulated problem. The authors propose a polynomial based scheme for achieving the above objectives. The coefficients of the proposed scheme are approximated by an evolutionary algorithm known as Differential Evolution (DE). Numerical examples with good results show the accuracy of the proposed method compared with some existing methods.展开更多
Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations.Using the‘sender-receiver’model,we propose quantum algorithms for matrix operations such as matrix-ve...Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations.Using the‘sender-receiver’model,we propose quantum algorithms for matrix operations such as matrix-vector product,matrix-matrix product,the sum of two matrices,and the calculation of determinant and inverse matrix.We encode the matrix entries into the probability amplitudes of the pure initial states of senders.After applying proper unitary transformation to the complete quantum system,the desired result can be found in certain blocks of the receiver’s density matrix.These quantum protocols can be used as subroutines in other quantum schemes.Furthermore,we present an alternative quantum algorithm for solving linear systems of equations.展开更多
Nonlinear equations systems(NESs)are widely used in real-world problems and they are difficult to solve due to their nonlinearity and multiple roots.Evolutionary algorithms(EAs)are one of the methods for solving NESs,...Nonlinear equations systems(NESs)are widely used in real-world problems and they are difficult to solve due to their nonlinearity and multiple roots.Evolutionary algorithms(EAs)are one of the methods for solving NESs,given their global search capabilities and ability to locate multiple roots of a NES simultaneously within one run.Currently,the majority of research on using EAs to solve NESs focuses on transformation techniques and improving the performance of the used EAs.By contrast,problem domain knowledge of NESs is investigated in this study,where we propose the incorporation of a variable reduction strategy(VRS)into EAs to solve NESs.The VRS makes full use of the systems of expressing a NES and uses some variables(i.e.,core variable)to represent other variables(i.e.,reduced variables)through variable relationships that exist in the equation systems.It enables the reduction of partial variables and equations and shrinks the decision space,thereby reducing the complexity of the problem and improving the search efficiency of the EAs.To test the effectiveness of VRS in dealing with NESs,this paper mainly integrates the VRS into two existing state-of-the-art EA methods(i.e.,MONES and DR-JADE)according to the integration framework of the VRS and EA,respectively.Experimental results show that,with the assistance of the VRS,the EA methods can produce better results than the original methods and other compared methods.Furthermore,extensive experiments regarding the influence of different reduction schemes and EAs substantiate that a better EA for solving a NES with more reduced variables tends to provide better performance.展开更多
In this paper we introduce two kinds of parallel Schwarz domain decomposition me thods for general, selfadjoint, second order parabolic equations and study the dependence of their convergence rates on parameters of ti...In this paper we introduce two kinds of parallel Schwarz domain decomposition me thods for general, selfadjoint, second order parabolic equations and study the dependence of their convergence rates on parameters of time-step and space-mesh. We prove that the, approximate solution has convergence independent of iteration times at each time-level. And the L^2 error estimates are given.展开更多
Jaumann rate, generalized Jaumann rate,Fu rate and Wu rate were incorporated into endochronic equations for finite plastic deformation to analyze simple shear finite deformation. The results show that an oscillatory s...Jaumann rate, generalized Jaumann rate,Fu rate and Wu rate were incorporated into endochronic equations for finite plastic deformation to analyze simple shear finite deformation. The results show that an oscillatory shear stress and normal stress response to a monotonically increasing shear strain occurs when Jaumann rate objective model is adopted for hypoelastic or endochronic materials. The oscillatory response is dependent on objective rate adopted,independent on elastoplastic models. Normal stress is unequal to zero during simple shear finite deformation.展开更多
This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obt...This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.展开更多
The idea of AC = BD was applied to solve the nonlinear differential equations. Suppose that Au = 0 is a given equation to he solved and Dv = 0 is an equation to be easily solved. If the transformation u = Cv is obtain...The idea of AC = BD was applied to solve the nonlinear differential equations. Suppose that Au = 0 is a given equation to he solved and Dv = 0 is an equation to be easily solved. If the transformation u = Cv is obtained so that v satisfies Dv = 0, then the solutions for Au = 0 can be found. In order to illustrate this approach, several examples about the transformation C are given.展开更多
In this paper, an iterative algorithm is presented to solve the Sylvester and Lyapunov matrix equations. By this iterative algorithm, for any initial matrix X1, a solution X＊ can be obtained within finite iteration s...In this paper, an iterative algorithm is presented to solve the Sylvester and Lyapunov matrix equations. By this iterative algorithm, for any initial matrix X1, a solution X＊ can be obtained within finite iteration steps in the absence of roundoff errors. Some examples illustrate that this algorithm is very efficient and better than that of [ 1 ] and [2].展开更多
Several kind of new numerical schemes for the stationary Navier-Stokes equations based on the virtue of Inertial Manifold and Approximate Inertial Manifold, which we call them inertial algorithms in this paper, togeth...Several kind of new numerical schemes for the stationary Navier-Stokes equations based on the virtue of Inertial Manifold and Approximate Inertial Manifold, which we call them inertial algorithms in this paper, together with their error estimations are presented. All these algorithms are constructed under an uniform frame, that is to construct some kind of new projections for the Sobolev space in which the true solution is sought. It is shown that the proposed inertial algorithms can greatly improve the convergence rate of the standard Galerkin approximate solution with lower computing effort. And some numerical examples are also given to verify results of this paper.展开更多
基金Supported by the National Natural Science Foundation of China under Grant No.91130013Hunan Provincial Innovation Foundation under Grant No.CX2012B010+1 种基金the Innovation Fund of National University of Defense Technology under Grant No.B120205the Open Foundation of State Key Laboratory
文摘Considering the coupled nonlinear Schr¨odinger system with multiply components, we provide a novel framework for constructing energy-preserving algorithms. In detail, based on the high order compact finite difference method, Fourier pseudospectral method and wavelet collocation method for spatial discretizations, a series of high accurate conservative algorithms are presented. The proposed algorithms can preserve the corresponding discrete charge and energy conservation laws exactly, which would guarantee their numerical stabilities during long time computations.Furthermore, several analogous multi-symplectic algorithms are constructed as comparison. Numerical experiments for the unstable plane waves will show the advantages of the proposed algorithms over long time and verify the theoretical analysis.
文摘A complete mesh free adaptive algorithm （MFAA）, with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in structured grids. Unnecessary redundant points and elements are avoided by using the mesh free local clouds refinement technology in shock influencing regions and regions near large curvature places on the boundary. Inviscid compressible flows over NACA0012 and RAE2822 airfoils are computed. Finally numerical results validate the accuracy of the above method.
文摘This paper presents a finite element procedure for solving transient, multidimensional convection-diffusion equations. The procedure is based on the characteristic Galerkin method with an implicit algorithm using precise integration method. With the operator splitting procedure, the precise integration method is introduced to determine the material derivative in the convection-diffusion equation, consequently, the physical quantities of material points. An implicit algorithm with a combination of both the precise and the traditional numerical integration procedures in time domain in the Lagrange coordinates for the characteristic Galerkin method is formulated. The stability analysis of the algorithm shows that the unconditional stability of present implicit algorithm is enhanced as compared with that of the traditional implicit numerical integration procedure. The numerical results validate the presented method in solving convection-diffusion equations. As compared with SUPG method and explicit characteristic Galerkin method, the present method gives the results with higher accuracy and better stability.
基金Aeronautical Science Foundation of China (02A52002), National Natural Science Foundation of China(10372043)
文摘A fast hybrid algorithm based on gridless method coupled with finite volume method （FVM） is developed for the solution to Euler equations. Compared with pure gridless method, the efficiency of the hybrid algorithm is improved to the level of finite volume method for most parts of the flow filed arc covered with grid cells. Moreover, the hybrid method is flexible to deal with the configurations as clouds of points are used to cover the region adjacent to the bodies. Mirror satellites and mirror grid cells arc introduced to the interface to accomplish data communication between the different parts of the flow field. The Euler Equations arc spatially discretized with finite volume method and gridless method in mesh and clouds of points respectively, and an explicit four-stage Runge-Kutta scheme is utilized to reach the steady-state solution. Internal flows in channels and external flows over airfoils arc investigated with hybrid method, and the solutions arc comparad to those using pure finite volume method and pure gridless method. Numerical examples show that the hybrid algorithm captures the shock waves accurately, and it is as efficient as fmite volume method.
文摘In this paper, we establish the existence of four families of simple wave solu- tion for two dimensional compressible full Euler system in the self-similar plane. For the 2 × 2 quasilinear non-reducible hyperbolic system, there not necessarily exists any simple wave solution. We prove the result that there are simple wave solutions for this 4× 4 non- reducible hyperbolic system, its simple wave flow is covered by four straight characteristics λ0 =λ1,λA2, λ3 and the solutions keep constants along these lines. We also investigate the existence of simple wave solution for the isentropic relativistic hydrodynamic system in the self-similar plane.
文摘This paper introduces Soccer League Competition (SLC) algorithm as a new optimization technique for solving nonlinear systems of equations. Fundamental ideas of the method are inspired from soccer leagues and based on the competitions among teams and players. Like other meta-heuristic methods, the proposed technique starts with an initial population. Population individuals called players are in two types: fixed players and substitutes that all together form some teams. The competition among teams to take the possession of the top ranked positions in the league table and the internal competitions between players in each team for personal improvements results in the convergence of population individuals to the global optimum. Results of applying the proposed algorithm in solving nonlinear systems of equations demonstrate that SLC converges to the answer more accurately and rapidly in comparison with other Meta-heuristic and Newton-type methods.
文摘In this paper, we prove that if p, q are distinct primes, (p,q)≡(1,7) (mod 12) and Legendres symbol pq=1 , then the equation 1+p a=2 bq c+2 dp eq f has only solutions of the form (a,b,c,d,e,f)=(t,0,0,0,t,0), where t is a non negative integer. We also give all solutions of a kind of generalized Ramanujan Nagell equations by using the theories of imaginary quadratic field and Pells equation.
基金supported by National Foundation of Natural Science under the Grant 11071216
文摘In this paper, we propose a two-grid algorithm for solving the stream function formulation of the stationary Navies-Stokes equations. The algorithm is constructed by reducing the original system to one small, nonlinear system on the coarse mesh space and two similar linear systems （with same stiffness matrix but different right-hand side） on the fine mesh space. The convergence analysis and error estimation of the algorithm are given for the case of conforming elements. Furthermore, the Mgorithm produces a numerical solution with the optimal asymptotic H^2-error. Finally, we give a numerical illustration to demonstrate the effectiveness of the two-grid algorithm for solving the Navier-Stokes equations.
文摘In this article, the modified simple equation method has been extended to celebrate the exact solutions of nonlinear partial time-space differential equations of fractional order. Firstly, the fractional complex transformation has been implemented to convert nonlinear partial fractional differential equations into nonlinear ordinary differential equations. Afterwards, modified simple equation method has been implemented, to find the exact solutions of these equations, in the sense of modified Riemann-Liouville derivative. For applications, the exact solutions of time-space fractional derivative Burgers’ equation and time-space fractional derivative foam drainage equation have been discussed. Moreover, it can also be concluded that the proposed method is easy, direct and concise as compared to other existing methods.
基金Project supported by the National Natural Science Foundation of China （Grant No.10271074）, and the Special Funds for Major Specialities of Shanghai Education Commission （Grant No.J50101）
文摘In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.
文摘The accuracy of numerical simulations and many other material design calculations, such as the rolling force, rollingtorque, etc., depends on the description of stress-strain relationship of the deformed materials. One common methodof describing the stress-strain relationship is using constitutive equations, with the unknown parameters fitted byexperimental data obtained via plane strain compression (PSC). Due to the highly nonlinear behaviour of the constitutive equations and the noise included in the PSC data, determination of the model parameters is difficult. Inthis paper, genetic algorithms were exploited to optimise parameters for the constitutive equations based on thePSC data. The original PSC data were processed to generate the stress-strain data, and data pre-processing wascarried out to remove the noise contained in the original PSC data. Several genetic optimisation schemes have beeninvestigated, with different coding schemes and different genetic operators for selection, crossover and mutation.It was found that the real value coded genetic algorithms converged much faster and were more efficient for theparameter optimisation problem.
文摘In this paper, the authors show that the general linear second order ordinary Differential Equation can be formulated as an optimization problem and that evolutionary algorithms for solving optimization problems can also be adapted for solving the formulated problem. The authors propose a polynomial based scheme for achieving the above objectives. The coefficients of the proposed scheme are approximated by an evolutionary algorithm known as Differential Evolution (DE). Numerical examples with good results show the accuracy of the proposed method compared with some existing methods.
基金supported by the National Natural Science Foundation of China(Grant No.12031004 and Grant No.12271474,61877054)the Fundamental Research Foundation for the Central Universities(Project No.K20210337)+1 种基金the Zhejiang University Global Partnership Fund,188170+194452119/003partially funded by a state task of Russian Fundamental Investigations(State Registration No.FFSG-2024-0002)。
文摘Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations.Using the‘sender-receiver’model,we propose quantum algorithms for matrix operations such as matrix-vector product,matrix-matrix product,the sum of two matrices,and the calculation of determinant and inverse matrix.We encode the matrix entries into the probability amplitudes of the pure initial states of senders.After applying proper unitary transformation to the complete quantum system,the desired result can be found in certain blocks of the receiver’s density matrix.These quantum protocols can be used as subroutines in other quantum schemes.Furthermore,we present an alternative quantum algorithm for solving linear systems of equations.
基金This work was supported by the National Natural Science Foundation of China(62073341)in part by the Natural Science Fund for Distinguished Young Scholars of Hunan Province(2019JJ20026).
文摘Nonlinear equations systems(NESs)are widely used in real-world problems and they are difficult to solve due to their nonlinearity and multiple roots.Evolutionary algorithms(EAs)are one of the methods for solving NESs,given their global search capabilities and ability to locate multiple roots of a NES simultaneously within one run.Currently,the majority of research on using EAs to solve NESs focuses on transformation techniques and improving the performance of the used EAs.By contrast,problem domain knowledge of NESs is investigated in this study,where we propose the incorporation of a variable reduction strategy(VRS)into EAs to solve NESs.The VRS makes full use of the systems of expressing a NES and uses some variables(i.e.,core variable)to represent other variables(i.e.,reduced variables)through variable relationships that exist in the equation systems.It enables the reduction of partial variables and equations and shrinks the decision space,thereby reducing the complexity of the problem and improving the search efficiency of the EAs.To test the effectiveness of VRS in dealing with NESs,this paper mainly integrates the VRS into two existing state-of-the-art EA methods(i.e.,MONES and DR-JADE)according to the integration framework of the VRS and EA,respectively.Experimental results show that,with the assistance of the VRS,the EA methods can produce better results than the original methods and other compared methods.Furthermore,extensive experiments regarding the influence of different reduction schemes and EAs substantiate that a better EA for solving a NES with more reduced variables tends to provide better performance.
基金This work was supported by Natural Science Foundation of China and Shandong Province.
文摘In this paper we introduce two kinds of parallel Schwarz domain decomposition me thods for general, selfadjoint, second order parabolic equations and study the dependence of their convergence rates on parameters of time-step and space-mesh. We prove that the, approximate solution has convergence independent of iteration times at each time-level. And the L^2 error estimates are given.
文摘Jaumann rate, generalized Jaumann rate,Fu rate and Wu rate were incorporated into endochronic equations for finite plastic deformation to analyze simple shear finite deformation. The results show that an oscillatory shear stress and normal stress response to a monotonically increasing shear strain occurs when Jaumann rate objective model is adopted for hypoelastic or endochronic materials. The oscillatory response is dependent on objective rate adopted,independent on elastoplastic models. Normal stress is unequal to zero during simple shear finite deformation.
基金This project is supported by the National Natural Science Foundation of China
文摘This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.
文摘The idea of AC = BD was applied to solve the nonlinear differential equations. Suppose that Au = 0 is a given equation to he solved and Dv = 0 is an equation to be easily solved. If the transformation u = Cv is obtained so that v satisfies Dv = 0, then the solutions for Au = 0 can be found. In order to illustrate this approach, several examples about the transformation C are given.
基金supported by the National Natural Science Foundation of China (No.10771073)
文摘In this paper, an iterative algorithm is presented to solve the Sylvester and Lyapunov matrix equations. By this iterative algorithm, for any initial matrix X1, a solution X＊ can be obtained within finite iteration steps in the absence of roundoff errors. Some examples illustrate that this algorithm is very efficient and better than that of [ 1 ] and [2].
基金Subsidized by the Special Funds for Major State Basic Research ProjectsG1999032801-07,NSFC(10101020,10001028)Tian Yuan Funds(TY10126004)
文摘Several kind of new numerical schemes for the stationary Navier-Stokes equations based on the virtue of Inertial Manifold and Approximate Inertial Manifold, which we call them inertial algorithms in this paper, together with their error estimations are presented. All these algorithms are constructed under an uniform frame, that is to construct some kind of new projections for the Sobolev space in which the true solution is sought. It is shown that the proposed inertial algorithms can greatly improve the convergence rate of the standard Galerkin approximate solution with lower computing effort. And some numerical examples are also given to verify results of this paper.
