In this note, using precise estimates for the regularized functionals, the upper and lower monotone approximations, in the sense of energy, of the regularized methods for the simplified contact problem with Coulumb fr...
详细信息
In this note, using precise estimates for the regularized functionals, the upper and lower monotone approximations, in the sense of energy, of the regularized methods for the simplified contact problem with Coulumb friction are presented,and a posteriori error estimate is obtained.
In this paper, based on the natural boundary reduction suggested by Feng and Yu,an overlapping domain decomposition method for harmonic boundary value problerns on the unbounded sector domain or the unbounded cracked ...
详细信息
In this paper, based on the natural boundary reduction suggested by Feng and Yu,an overlapping domain decomposition method for harmonic boundary value problerns on the unbounded sector domain or the unbounded cracked domain is discussed. The numerical examples show that this discrete Schwarz iteration is geometric *** the convergence rate of this method is independent of the finite element mesh size,but dependent on the frequency of the exact solution and the overlaPping degree of thesubdomains.
A predictor-correct interior point method is presented for solving convex quadraticprogramming problem with box constraints in this paper. Actually, the method isequivalent to solve a system of equations-the first ord...
详细信息
A predictor-correct interior point method is presented for solving convex quadraticprogramming problem with box constraints in this paper. Actually, the method isequivalent to solve a system of equations-the first order optimality conditions of theproblem by decomposing one Newton step with one simplified Newton step, and hasa nice convergent property with high order. Moreover, the center direction generatedby introducing the barrier parameter is used to correct the descent Newton directionsuch that the search direction which consists of the center and Newton direction avoidshitting the board of the feasible region. Therefore, the iterative sequence generated bythe algorithm is remained inside of the feasible region and converges to the optimalsolution. The numerical results for a group of test problems are also given, and haveshown that the algorithm works very efficiently.
In this paper we present a set of absorbing boundary conditions based on the higher order approximations of one-way wave equations. By introducing new functions, these absorbing boundary conditions are put into the fo...
详细信息
In this paper we present a set of absorbing boundary conditions based on the higher order approximations of one-way wave equations. By introducing new functions, these absorbing boundary conditions are put into the form of systems of lower order partial differential equations. The stability of initial boundary value problems with these type of boundary conditions is discussed. The energy estimates for their solutions are obtained.
Do-loop unrolling is an effective technique for improving performance of applicistion programs. This paper presents a method for unrolling nested Fortran DO-loops using the m4 macro language. m4 is a macro processor w...
详细信息
Do-loop unrolling is an effective technique for improving performance of applicistion programs. This paper presents a method for unrolling nested Fortran DO-loops using the m4 macro language. m4 is a macro processor widely available on UNIX platforms. By using carefully designed m4 macros, Do-loop unrolling becomes much simpler. More over, with this method, code can be written for general ullrolling parameters, allowing the program to be easily tuned bn different computers to reach optimal performance.
Asynchronous parallel multisplitting nonlinear symmetric Gauss-Seidel methods are established for the system of nonlinear equations , withA, B∈L(Rn) being matrices of particular properties, being diagonal and continu...
详细信息
Asynchronous parallel multisplitting nonlinear symmetric Gauss-Seidel methods are established for the system of nonlinear equations , withA, B∈L(Rn) being matrices of particular properties, being diagonal and continuous mappings, and b ∈Rn a known vector. The establishments of these new methods are according to the principle of sufficiently using the delayed information and are concerning about the concrete characteristics of the multiprocessor systems. Therefore, they have considerably higher parallel computingefficiency. The global convergenge as well as the asymptotic convergence rates of these new methods are investigated in detail under suitable conditions.
暂无评论