Nedelcho GanchovskiProektsoft EOOD
Nedelcho Ganchovski
Master of Engineering
PhD student at the University of Architecture, Civil Engineering and Geodesy
About
5
Publications
1,555
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
1
Citation
Introduction
Development of structural design software, numerical methods and algorithms for structural analysis.
Education
September 1995 - June 2001
Publications
Publications (5)
One of the greatest problems in numerical methods is to provide high speed and stability at the same time. In this paper, we propose a new hybrid root finding algorithm, based on the appropriate combination of bisection, false position and the Anderson-Bjork’s method. In the general case, the achieved convergence is compatible to the fastest availa...
Unlike older design codes, Eurocode 2 does not provide a procedure for calculation of the capacity of axially loaded columns. For that purpose, a general algorithm is developed, using the principles of structural mechanics and mathematics: It starts with constructing the P-Δ relationship (buckling curve) for the element, accounting for initial impe...
In this paper, we propose a general method for solving structural mechanics problems by developing a “functional model”. It is implemented by defining the required geometrical and physical relationships in their general form via analytical and numerical functions. For that purpose, a special programming language Calcpad is used. The obtained data s...
Questions
Questions (2)
Hi!
Can someone please recommend a good international structural mechanics or structural engineering conference? Preferably, reputable and Scopus WoS indexed. Also, it would be nice to be in a city that is worth visiting for a few days. :)
If it is proved, where it is published?
Ostrowski has defined the efficiency index as EI = q^(1/p), where q is the order of convergence and p is the number of function evaluations for each iteration.
A. M. Ostrowski, “Solution of Equations and Systems of Equations”, Academic Press, second edition (1966).
On the other hand, Kung and Traub conjecture says that: q_opt = 2^(p – 1)
H. T. Kung and J. F. Traub, “Optimal order of one-point and multipoint iteration” Journal of
the ACM, vol. 21, no. 4, pp. 643–651, 1974.
Simple substitution shows that EI(p) = 2^(1-1/p). The limit of EI(p) for p -> ∞ is 2. Of course, in case we assume that Kung and Traub conjecture is true, which is not proven as far as I know.
