Recursive formulation of force method programmed in logic

Koumousis, VK

dc.contributor.author	Koumousis, VK	en
dc.date.accessioned	2014-03-01T01:14:06Z
dc.date.available	2014-03-01T01:14:06Z
dc.date.issued	1998	en
dc.identifier.issn	0887-3801	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12871
dc.subject.classification	Computer Science, Interdisciplinary Applications	en
dc.subject.classification	Engineering, Civil	en
dc.subject.other	Computational methods	en
dc.subject.other	Computer programming languages	en
dc.subject.other	Data structures	en
dc.subject.other	Logic programming	en
dc.subject.other	Problem solving	en
dc.subject.other	Statistical methods	en
dc.subject.other	Recursive force methods	en
dc.subject.other	Structural analysis	en
dc.subject.other	algorithmic programming	en
dc.subject.other	structural analysis	en
dc.title	Recursive formulation of force method programmed in logic	en
heal.type	journalArticle	en
heal.identifier.primary	10.1061/(ASCE)0887-3801(1998)12:1(19)	en
heal.identifier.secondary	http://dx.doi.org/10.1061/(ASCE)0887-3801(1998)12:1(19)	en
heal.language	English	en
heal.publicationDate	1998	en
heal.abstract	Although classical methods of structrual analysis are important in understanding the behavior of structure, they are not suitable for algorithmic programming. Modern computer languages that accommodate advanced data structures and recursion can be employed to bridge this gap. This may improve teaching of these methods and can lead to more transparent analysis and design systems. The recursive formulation of the force method is presented, which is based on the concept of the (n - 1) structure. The conditions of compatibility are enforced recursively on the (n - 1) redundant structure, until the (n - 1) structure becomes a statically determinate one. The method solves for all the structures of reduced indeterminacy for a given list of redundants. The identification of the structure, i.e., the degree of indeterminacy and the selection of a list of redundants, together with the steps of the recursive force method, are established on the basis of logic programming, and the basic predicates are presented. The relation of the recursive force method with the standard redundant force method is established together with a comparison of the number of arithmetic operations involved in the two methods.	en
heal.publisher	ASCE-AMER SOC CIVIL ENGINEERS	en
heal.journalName	Journal of Computing in Civil Engineering	en
dc.identifier.doi	10.1061/(ASCE)0887-3801(1998)12:1(19)	en
dc.identifier.isi	ISI:A1998YL44300005	en
dc.identifier.volume	12	en
dc.identifier.issue	1	en
dc.identifier.spage	19	en
dc.identifier.epage	29	en