Presents a study on methods for unconstrained optimization. Assumptions of the study; Main results; Convergence properties of the methods under simplified Armijo-type line search.
Presents a study on methods for unconstrained optimization. Assumptions of the study; Main results; Convergence properties of the methods under simplified Armijo-type line search.
Presents preconditioning matrices having parallel computing function for the coefficient matrix and a class of parallel hybrid algebraic multilevel iteration methods for solving linear equations. Solution to elliptic ...
详细信息
Presents preconditioning matrices having parallel computing function for the coefficient matrix and a class of parallel hybrid algebraic multilevel iteration methods for solving linear equations. Solution to elliptic boundary value problem; Discussion on symmetric positive definite matrix; Computational complexities.
A searching method of slide path in the rock mass based on domain-divide statistics model of discontinuities and the rock mass stress field is presented in this paper. Firstly, producing method of statistics model of ...
详细信息
A searching method of slide path in the rock mass based on domain-divide statistics model of discontinuities and the rock mass stress field is presented in this paper. Firstly, producing method of statistics model of discontinuities and smoothing method of FEM stress field in the rock mass are described. Then the formulas of slide resistance reserve in specified oritentation and local location in the rock mass based on Einstein’s theory and the rock mass stress field is developed. Finally, the concrete seaching method and some numerical results are shown.
This paper is to study extension of high resolution kinetic flux-vector splitting (KFVS) methods. In this new method, two Maxwellians are first introduced to recover the Euler equations with an additional conservative...
详细信息
This paper is to study extension of high resolution kinetic flux-vector splitting (KFVS) methods. In this new method, two Maxwellians are first introduced to recover the Euler equations with an additional conservative equation. Next, based on the well-known connection between the Euler equations and Boltzmann equations, a class of high resolution KFVS methods are presented to solve numerically multicomponent flows. Our method does not solve any Riemann problems, and add any nonconservative corrections. The numerical results are also presented to show the accuracy and robustness of our methods. These include one-dimensional shock tube problem, and two-dimensional interface motion in compressible flows. The computed solutions are oscillation-free near material fronts, and produce correct shock speeds.
In the paper we introduce and study the explicit scheme of lagrangian multi- plier domain decomposition method dependent on time. The Uzawa algorithm is introduced to solve the interior displacement variables and the ...
详细信息
In the paper we introduce and study the explicit scheme of lagrangian multi- plier domain decomposition method dependent on time. The Uzawa algorithm is introduced to solve the interior displacement variables and the boundary multiplier variables. It will be shown that the condition number of the stiffness matrix of the lagrangian multiplier has a constant bound, i.e. O(1). The numerical experiments indicate that the method is very efficient.
Differential-algebraic equations (DAE’s) arise naturally in many applied fields, but numerical and analytical difficulties that have not appeared in ordinary differential equations (ODE’s) occur in DAE’s because it...
详细信息
Differential-algebraic equations (DAE’s) arise naturally in many applied fields, but numerical and analytical difficulties that have not appeared in ordinary differential equations (ODE’s) occur in DAE’s because it includes algebraic constrained equations. Some efficient numerical methods for ODE’s can not work well for DAE’s. So many eminent numerical analysis scholars are interested in this field recently. But few numerical methods are able to solve all DAE’s because of its essential difficulties. This paper discusses the simulation algorithm character of DAE’s. And we construct an efficient constrained-algebraic algorithm based on the Runge-Kutta methods of order two for the semi-explicit differential-algebraic equations with index two and give the computational experiment results for specific examples. The experiment results indicate that the constrained-algebraic algorithm is high efficient for semi-explicit differential-algebraic equations with index two.
暂无评论