![]() |
Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
||||||||||||||
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 75
PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL STRUCTURES TECHNOLOGY Edited by: B.H.V. Topping and Z. Bittnar
Paper 30
An Iterative Method for a Class of Nonlinear Large Scale (Near) Constrained Problems M.H.B.M. Shariff
Etisalat College of Engineering, Sharjah, United Arab Emirates Full Bibliographic Reference for this paper
M.H.B.M. Shariff, "An Iterative Method for a Class of Nonlinear Large Scale (Near) Constrained Problems", in B.H.V. Topping, Z. Bittnar, (Editors), "Proceedings of the Sixth International Conference on Computational Structures Technology", Civil-Comp Press, Stirlingshire, UK, Paper 30, 2002. doi:10.4203/ccp.75.30
Keywords: iterative, nonlinear, near-constrained, large-scale.
Summary
This paper considers a class of nonlinear problems which is of the form
(I) Minimise ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() (a) ![]() ![]() (b) ![]() ![]() ![]() (c) ![]()
and ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() (II) Minimise ![]() ![]() ![]() ![]() ![]() ![]() ![]()
In this paper we develop an algorithm for problem (II) which is a
generalization of the algorithm recently developed by Shariff [2].
The algorithm
is suitable for large scale problems in the sense that it does not
require a Hessian matrix. It is easily parallelised and suitable for both
sparse and dense systems. The developed algorithm is given below:
and
where
Convergence analyses for the proposed algorithm and several test problems are given in this paper. References
purchase the full-text of this paper (price £20)
go to the previous paper |
|||||||||||||||