OPTi’s Algorithm for Drawing the Limit Set
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولNumerical Determination of the Forming Limit Diagram for 304 Stainless Steel Based on Phase Change in Deep Drawing Process
Up to now a large number of models have been developed to measure or predict the damage in equipments. Some of these models have been implemented in ABAQUS software. To implement damage parameters in the software, it is necessary to perform complex and expensive practical tests. One of these damage models is Forming Limit Diagram (FLD).The purpose of this research is deriving required parameter...
متن کاملA New Robust Bootstrap Algorithm for the Assessment of Common Set of Weights in Performance Analysis
The performance of the units is defined as the ratio of the weighted sum of outputs to the weighted sum of inputs. These weights can be determined by data envelopment analysis (DEA) models. The inputs and outputs of the related (Decision Making Unit) DMU are assessed by a set of the weights obtained via DEA for each DMU. In addition, the weights are not generally common, but rather, they are ve...
متن کاملOpen pit limit optimization using dijkstra’s algorithm
In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies. The extraction of minerals in open mining methods needs a lot of capital investment, which may take several decades. Before the extraction, the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interdisciplinary Information Sciences
سال: 2003
ISSN: 1347-6157,1340-9050
DOI: 10.4036/iis.2003.183