نتایج جستجو برای: dynamic relaxation method

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

Journal: :Proceedings of the Institution of Civil Engineers 1968

Journal: :International Journal of Solids and Structures 2021

Deployable membrane structures such as inflatable stratospheric balloons are known to be sensitive the occurrence of local instabilities wrinkles. The wrinkling phenomenon affects working performances and this has controlled numerically in order predict best means deployment during inflation aerospace balloons. To improve their reliability flight, also need sized appropriately without stress fi...

Journal: :Journal of Mathematics Research 2021

The paper presents a dynamic and feasible approach to the successive over-relaxation (SOR) method for solving large scale linear system through iteration. Based on maximal orthogonal projection technique, optimal relaxation parameter is obtained by minimizing derived merit function in terms of right-hand side vector, coefficient matrix previous step values unknown variables. At each iterative s...

Journal: :Computers & OR 2007
Lixin Tang Hua Xuan Jiyin Liu

In this paper we consider the single machine scheduling problem with precedence constraints to minimize the total weighted tardiness of jobs. This problem is known to be strongly NP-hard.A solution methodology based on Lagrangian relaxation is developed to solve it. In this approach, a hybrid backward and forward dynamic programming algorithm is designed for the Lagrangian relaxed problem, whic...

2008
Xuxin Tu José E. Andrade J. E. ANDRADE

The underlying physics of granular matter can be clearly solved using particulate mechanics methods, e.g. the discrete element method (DEM) that is inherently discontinuous and heterogeneous. To solve static problems, explicit schemes using dynamic relaxation procedures have been widely employed, in which naturally dynamic material parameters are typically adapted into pure numerical artifacts ...

2015
Lingling Fan

In this article, three economic dispatch examples will be given to show the philosophy and general steps on cutting plane methods (Bender’s decomposition and Branch and Bound (B&B) algorithm). Bender’s decomposition employs duality to generate cuts, while B&B employs linear programming (LP) relaxation to find lower bound for a minimization problem and generate subregions. We will show a continu...

Journal: :iranian journal of radiology 0
li liu department of radiology, shanghai cancer center, fudan university, shanghai, china bo yin department of radiology, huashan hospital, fudan university, shanghai, china dao ying geng department of radiology, huashan hospital, fudan university, shanghai, china yi ping lu department of radiology, huashan hospital, fudan university, shanghai, china wei jun peng department of radiology, shanghai cancer center, fudan university, shanghai, china; department of radiology, shanghai cancer center, fudan university, shanghai, china. tel: +86-13817515007

conclusion in breast cancer after nac, the lesion t2 relaxation time was reduced in the responders, and this finding is potentially useful to assess the response to nac. results in 26 cases with nac, the mean lesion t2 relaxation time before nac was 81.34 ± 13.68 ms, compared with 64.50 ± 8.71 ms after nac. significant differences in the lesion t2 relaxation times existed between the pre- and p...

2005
Benchun Duan David D. Oglesby

We perform dynamic simulations of thrust and normal faults over multiple earthquake cycles. Our goal is to explore effects of asymmetric fault geometry on the long-term seismicity and dynamics of dipping faults. A dynamic finite-element method is used to model the interseismic and coseismic processes, with a dynamic relaxation technique for the former. The faults are loaded by stable sliding al...

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

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