Papers by Author: Ya Mian Peng

Abstract: It is feasible for the inverse problem of research in the very vital significance between in practical application. Genetic algorithm is applied in many aspects, but we are more concerned with the application in mathematics. From the start of genetic algorithm, the collection to search for comprehensive coverage of preferred. Due to genetic algorithm is used to search the information, and does not need such problems with the problem is directly related to the derivative of the information. Finally, the results of numerical simulation show that the GA method has high accuracy and quick convergent speed. And it is easy to program and calculate. It is worth of practical application.

Abstract: The regularization which constructs with the first filter function is precisely the Tikhonov regularization. This article has proven the Tikhonov functional minimization problem is decides suitably, namely satisfies the solution the existence, the solution unique reconciliation to rely on continuously the data stability; and this minimization problem in solves the first class equation equally the normal equation. The numerical simulation experiment's result indicated that distinguishes the inverse with the regular reduction solution parameter to have the numerical precision to be high and the stability is good and convergence rate quick characteristic.

Abstract: This paper is to discuss the competition and cooperation of portal and search engine mainly by building stability model. We can use Lotka-Volterra mutualism model to describe and build cooperation model of portal and search engine, and we can use Lotka-Volterra predator – prey model with Logistic items to describe and build competition model of portal and search engine.

Abstract: Let E be a real q-uniformly smooth and uniformly convex Banach space and K a nonempty closed convex subset of E. Let Ti : K ! K, i = 1; 2; : : : ;N be ki-strictly asymptotically pseudocon- tractive mappings with \N i=1F (Ti) 6= ;, where F(Ti) = fx 2 K : Tix = xg. Let fxng be the sequence generated by xn+1 = (1 ¡ ®n)xn + ®nTn [n]xn; where f®ng is a sequence in [0,1] satisfying certain conditions and Tn [n] = Ti n; i = n(modN). Weak and strong convergence theorems for the iterative approximation of common ¯xed points of the family fTigN i=1 are proved.

Abstract: It is difficult to solve the inverse problem because it always ill-posed. This paper introduced a new approach based on Genetic Algorithms (GA) for solve the parabolic equation inverse problem. The GA transforms the inverse problem into an optimization problem. The results of numerical simulation show that the method has high accuracy and quick convergent speed. And it is easy to program and calculate. It is worth of practical application.

Abstract: With rapid growth of national economy, infrastructure construction maintains vigorous development, but there are some serious problems in this field such as the conspiracy between construction unit and supervision unit. This paper introduces some background of construction project management system, analyses relation and benefit of project’s tripartite main body, and establishes game model between government and supervision unit. Finally, the paper designs governmental incentive contract, and calculates optimal incentive reward which maximize governmental expected utility, which could encourage supervision unit to supervise construction unit by adjusting reward, and decrease probability of conspiracy between supervision unit and construction unit.

Abstract: In this paper, we study the infinite time interval backward stochastic differential equations (BSDEs) driven by a Lévy process. A existence and uniqueness theorem for solution of the BSDEs is established, which can be considered a generalization of existence and uniqueness theorem of BSDEs. A continuous dependence theorem for solutions of the BSDEs is also given.

Abstract: Many calculations in engineering and scientific computation can summarized to the problem of solving a polynomial equation. Based on Sturm theorem, an adaptive algorithm for real root isolation is shown. This algorithm will firstly find the isolate interval for all the real roots rapidly. And then approximate the real roots by subdividing the isolate intervals and extracting subintervals each of which contains one real root. This method overcomes all the shortcomings of dichotomy method and iterative method. It doesn’t need to compute derivative values, no need to worry about the initial points, and could find all the real roots out parallelly.