检索结果-南通市图书馆

A NEW STABILIZED FINITE ELEMENT METHOD FOR SOLVING THE ADVECTION-DIFFUSION EQUATIONS

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computational mathematics 2002年第1期20卷 57-64页

作者： Huo-yuan Duan (Institute of mathematics, academy of mathematics and {3. Sciences, chinese academy of Sciences, beijing 100080, china) Institute of mathematics Academy of Mathematics and System Sciences Chinese Academy of Sciences 北京 100080

Focuses on a study on the development of a stabilized finite element method for solving the advection-diffusion equations with a zero Dirichlet boundary condition. Problem formulation; Error analysis.

关键词： advection-diffusion equation stabilized finite element method

A trust region algorithm for bilevel programing problems

在线全文

学校读者我要写书评

暂无评论

chinese Science Bulletin 1998年第10期43卷 820-824页

作者： LIU Guoshan 1, HAN Jiye 2.and WANG Shouyang 3.1. Department of mathematics, beijing Normal University, beijing 100875, china 2. Institute of Applied mathematics, chinese academy of Sciences, beijing 100080, china 3. Institute of systems Science, Chi Department of mathematics Beijing Normal University Beijing China Institute of Applied mathematics Chinese Academy of Sciences Beijing China Institute of systems Science Chinese Academy of Sciences Beijing China

A trust region algorithm is proposed for solving bilevel programming problems where the lower level programming problem is a strongly convex programming problem with linear constraints. This algorithm is based on a tr... 详细信息

关键词： bilevel programming problem trust region algorithm global convergence.

Modeling and verifying Web services driven by requirements:An ontology-based approach

在线全文

学校读者我要写书评

暂无评论

Science in china(Series F) 2006年第6期49卷 792-820页

作者： HOU Lishan1,3.JIN ZHi1,2.& WU Budan1,4 1. academy of mathematics and {2.s Science, chinese academy of Sciences, beijing 100080, china 2. Institute of Computing Technology, chinese academy of Sciences, beijing 100080, china 3. Institute of Software, chinese academy of Sciences, beijing 100080, china 4. Graduate University of chinese academy of Sciences, beijing 100049, china academy of mathematics and {2.s Science Chinese Academy of Sciences Beijing China Institute of Software Chinese Academy of Sciences Beijing China Institute of Computing Technology Chinese Academy of Sciences Bejing China Graduate University of chinese academy of Sciences Beijing China

Automatic discovery and composition of Web services is an important research area in Web service technology, in which the specification of Web services is a key issue. This paper presents a Web service capability description framework based on the environment ontology. This framework depicts Web services capability in two aspects： the operable environment and the environment changes resulting from behaviors of the Web service. On the basis of the framework, a requirement-driven Web service composition model has been constructed. This paper brings forward the formalization of Web service interactions with π calculus. And an automatic mechanism converting conceptual capability description to the formal process expression has been built. This kind of formal specification assists in verifying whether the composite Web service model matches the requirement.

关键词： Web service environment ontology automatic composition π calculus formal verification.

ON DISCRETE PROJECTION AND NUMERICAL BOUNDARY CONDITIONS FOR THE NUMERICAL SOLUTION OF THE UNSTEADY INCOMPRESSIBLE NAVIER-STOKESEQUATIONS

在线全文

学校读者我要写书评

暂无评论

Journal of Computational mathematics 2002年第1期20卷 35-56页

作者： Lan Chieh Huang (ICMSEC, academy of mathematics and {2. Sciences, {3. academy of Sciences, beijing 100080, china) ICMSEC Academy of Mathematics and System Sciences Chinese Academy of Sciences 北京 100080

Focuses on a study on the fully implicit Crank Nicholson (CN) schemes and three projection methods for approximate preservation of component-consistency under projection. Transformation from incompressible Navier-Stokes equations to differential algebraic equations CN schemes; Local errors of CN projection methods; Numerical boundary conditions.

关键词： differential algebraic equations discrete projection numerical boundary conditions

On conformal measures for infinitely renormalizable quadratic polynomials

在线全文

学校读者我要写书评

暂无评论

Science china mathematics 2005年第10期48卷 1411-1420页

作者： HUANG Zhiyong~1 JIANG Yunping~(2.3. & WANG Yuefei~3.1. School of Information,Renmin University of china,beijing 100872.{2. 2. Department of mathematics,Queens College,City University of New York,NY 113.7,USA Department of mathematics,Graduate School,City University of New York,New York,NY 10016,USA 3. academy of mathematics and systems Science,chinese academy of Sciences,beijing 100080,{2. School of Information Renmin University of China Beijing China Department of mathematics Queens College City University of New York NY USA Department of mathematics Graduate School City University of New York New York USA academy of mathematics and {2.s Science Chinese Academy of Sciences Beijing China

We study a conformal measure for an infinitely renormalizable quadratic polynomial. We prove that the conformal measure is ergodic if the polynomial is unbranched and has complex bounds. The main technique we use in t... 详细信息

关键词： Julia set, conformal measure, three-dimensional puzzle, infinitely renormalizable quadratic polynomial.

THE DUAL MIXED METHOD FOR AN UNILATERAL PROBLEM

在线全文

学校读者我要写书评

暂无评论

Journal of Computational mathematics 2003年第6期21卷 733-746页

作者： Lie-heng Wang(LSEC, ICMSEC, academy of mathematics and {2. Sciences, {3. academy of Sciences,beijing 100080, china) 中科院数学与系统科学院 LSEC ICMSEC CAS 北京 100080

In this paper, the dual mixed method for an unilateral problem, which is the simplified modelling of scalar function for the friction-free contact problem, is considered. The dual mixed problem is introduced, the existence and uniqeness of the solution of the problem are presented, and error bounds O(h3.4) and O(h3.2. are obtained for the dual mixed finite element approximations of Raviart-Thomas elements for k = 0 and k = 1 respectively.

关键词： Dual Mixed Method Unilateral Problem.

COMPOSITE-STEP LIKE FILTER METHODS FOR EQUALITY CONSTRAINT PROBLEMS

在线全文

学校读者我要写书评

暂无评论

Journal of Computational mathematics 2003年第5期21卷 613-624页

作者： Pu-yan Nie(LSEC, ICMSEC, academy of mathematics and {2. Sciences, {3. academy of Sciences, beijing 100080, china) 中科院数学与系统科学院 LSEC ICMSEC CAS 北京 100080

In a composite-step approach, a step Sk is computed as the sum of two components Uk and hk. The normal component Vk, which is called the vertical step, aims to improve the linearized feasibility, while the tangential component hk, which is also called horizontal step, concentrates on reducing a model of the merit functions. As a filter method, it reduces both the infeasibility and the objective function. This is the same property of these two methods. In this paper, one concerns the composite-step like filter approach. That is, a step is tangential component hk if the infeasibility is reduced. Or else, Sk is a composite step composed of normal component Uk, and tangential component hk.

关键词： Composite-step like approaches Filter methods Equality constraints Sequen- tial quadratic programming(SQP) algorithms Normal component Tangential component Convergence.

Approximation of dense-n/2.subgraph and table compression problems

在线全文

学校读者我要写书评

暂无评论

Science china mathematics 2005年第9期48卷 1223-1233页

作者： XU Dachuan~1 HAN Jiye~2.& DU Dongle~3.1. College of Applied Sciences,beijing University of Technology,beijing 10002.,{2. 2. Institute of Applied mathematics,academy of mathematics and systems Science,chinese academy of Sciences,beijing {13.,{2. 3. Faculty of Administration,University of New Brunswick,P.O.Box 4400,Fredericton,NB E3. 5A3.Canada College of Applied Sciences Beijing University of Technology Beijing 100022 China Institute of Applied mathematics Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100080 China Faculty of Administration University of New Brunswick P.O. Box 4400 Fredericton NB E3B 5A3 Canada

We develop improved approximation algorithms for two NP-hard problems: the dense-n/2.subgraph and table *** on SDP relaxation and advanced rounding techniques,we first propose 0. 5982.and 0. 5970-approximation algorithms respec- tively for the dense-n/2.subgraph problem (DSP) and the table compression problem (TCP). Then we improve these bounds to 0. 62.3.and 0. 6708 respectively for DSP and TCP by adding triangle inequalities to strengthen the SDP *** results for TCP beat the 0. 5 bound of a simple greedy algorithm on this problem,and hence answer an open question of Anderson in an affirmative way.

关键词： dense-n/2.subgraph problem(DSP) table compression problem(TCP) SDP approximation ratio

Transformations and non-degenerate maps

在线全文

学校读者我要写书评

暂无评论

Science china mathematics 2005年第Z1期48卷 195-205页

作者： LI Baokui & WANG Yuefei Institute of mathematics, academy of mathematics and {3. Sciences, chinese academy of Sciences, beijing 100080, china Graduate School, chinese academy of Sciences, beijing 100080, china Institute of mathematics Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing China Graduate School Chinese Academy of Sciences Beijing China

We shall prove the equivalences of a non-degenerate circle-preserving map and a M(o)bius transformation in ^Rn, of a non-degenerate geodesic-preserving map and an isometry in Hn of a non-degenerate line-preserving map and an affine transformation in Rn. That a map is non-degenerate means that the image of the whole space under the map is not a circle, or geodesic or line respectively. These results hold without either injective or surjective, or even continuous assumptions, which are new and of a fundamental nature in geometry.

关键词： M(o)bius transformation, circle-preserving map, non-degenerate map.