نتایج جستجو برای: mathematical method

تعداد نتایج: 1795708  

2009
Tao Yan Masao Fukushima

In this paper, we consider the mathematical program with symmetric cone complementarity constraints (MPSCCC) in a general form. It includes the mathematical program with second-order-cone complementarity constraints (MPSOCCC) and the mathematical program with complementarity constraints (MPCC). We present a smoothing method which approximates the primal MPSCCC by means of the ChenMangasarian cl...

2001
Didier Arquès Venceslas Biri Sylvain Michelin

Combining animation and global illumination constitutes a real challenge in computer graphics, especially when light sources move in a complex scene because the entire illumination has to be recomputed. This paper introduces a new algorithm, based on the Galerkin method, which efficiently computes animation sequence with any moving surface -even light source. For each new frame, we take into ac...

2005
Erwin Schmid Franz Sinabell

In agricultural economics, several calibration and aggregation approaches have evolved in mathematical programming models. This article combines in a linear programming model features of the Positive Mathematical Programming method with an aggregation approach that is constrained to the production possibility set spanned by a convex combination of observed production activities. The combination...

2001
Pascal Garcia Bertrand Coüasnon

We present in this paper how to apply to mathematical formulae a generic recognition method already used for musical scores, table structure and old forms recognition. We propose to use this method to recognize the structure of formulae and also to recognize some symbols made of line segments. This offers two possibilities: improving the symbol recognition when there is a lot of symbols like in...

2000
Toshihiro Kanahori K. Tabata W. Cong Fumikazu Tamari Masakazu Suzuki

This paper describes our system of on-line recognition of mathematical expressions. Users can input mathematical expressions by handwriting. As soon as a character is written, it is rewritten by neat strokes in an appropriate position and size automatically. This Automatic Rewriting Method improves the accuracy of the structure analysis of the written mathematical expressions. The written mathe...

2004
K. Abdel-Malek W. Yu

K. Abdel-Malek and W. Yu Department of Mechanical Engineering The University of Iowa Iowa City, IA 52242 Tel. 319-335-5676 [email protected] Abstract A rigorous mathematical formulation for ergonomic design based on obtaining and visualizing the workspace of human limbs is herein presented. The methodology and formulation presented in this paper are aimed at placing the human with re...

2006
A. F. Izmailov M. V. Solodov

For mathematical programs with complementarity constraints (MPCC), we propose an active set Newton method which has the property of local quadratic convergence under the MPCC linear independence constraint qualification (MPCC-LICQ) and the standard second-order sufficient condition for optimality (SOSC). Under MPCC-LICQ, this SOSC is equivalent to the piecewise SOSC on branches of MPCC, which i...

2006
Shaoqiang Tang Thomas Y. Hou Wing Kam Liu

In this paper, we present a mathematical framework of the bridging scale method (BSM), recently proposed by Liu et al. Under certain conditions, it had been designed for accurately and efficiently simulating complex dynamics with different spatial scales. From a clear and consistent derivation, we identify two error sources in this method. First, we use a linear finite element interpolation, an...

1997
Folkmar A. Bornemann Christof Schütte

The Car-Parrinello method for ab-initio molecular dynamics avoids the explicit minimization of energy functionals given by functional density theory in the context of the quantum adiabatic approximation (time-dependent BornOppenheimer approximation). Instead, it introduces a fictitious classical dynamics for the electronic orbitals. For many realistic systems this concept allowed firstprinciple...

2005
Gui-Hua Lin Masao Fukushima

In this paper, we consider a class of stochastic mathematical programs with equilibrium constraints (SMPECs) that has been discussed by Lin and Fukushima (2003). Based on a reformulation given therein, we propose a regularization method for solving the problems. We show that, under a weak condition, an accumulation point of the generated sequence is a feasible point of the original problem. We ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید