Nedelcho Jivkov Ganchovski

Dr. Nedelcho Jivkov Ganchovski

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2023 in IOP Conference Series: Materials Science and Engineering
Verified
Conference Paper
Open access
NGNedelcho Jivkov Ganchovski
Nedelcho Jivkov Ganchovski
ATA Traykov
A Traykov
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 available methods, while stable performance in the worst case is provided. A comparative analysis versus popular root finding algorithms is performed as well. For that purpose, the respective procedures are implemented in the C# programming language. The proposed algorithm is included into the Calcpad engineering calculations platform.

24 April 2026 in Algorithms
Verified
Journal Article
Open access
PDF file
NGNedelcho Jivkov Ganchovski
Nedelcho Jivkov Ganchovski
OSOscar Smith
Oscar Smith
CRChristopher Rackauckas
Christopher Rackauckas
LTLatchezar Tomov
Latchezar Tomov
ATAlexander Traykov
Alexander Traykov
The Modified Anderson–Björck method is a new, robust, and efficient bracketing root-finding algorithm. It combines bisection with the Anderson–Björk method to achieve both fast performance and worst-case optimality. It relies on linearity check criteria for switching methods and uses Anderson–Björk corrections to overcome the fixed endpoint issue of false-position. Initial benchmarks of this method have shown certain performance advantages compared to other methods, such as Ridders, Brent and ITP. In this paper, we propose further improvements to this method and perform some additional analysis and benchmarks of its behavior and performance.

1 February 2023 in IOP Conference Series: Materials Science and Engineering
Verified
Conference Paper
Open access
MTM. Traykova
M. Traykova
NGNedelcho Jivkov Ganchovski
Nedelcho Jivkov Ganchovski
ATA. Traykov
A. Traykov
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 imperfections, minimum eccentricity, material nonlinearity and second order effects. Then, the respective bending moments are determined from the displacements and the P-M relationship is obtained. Finally, the axial load capacity in planar domain is determined by intersecting the P-M diagram with the interaction curve for the RC section. In spacial domain, the P-Δ relationship is defined by the respective “buckling surface”. Its intersection with the interaction surface represents a spacial curve in the (P, Mx, My) coordinate system. The axial capacity is determined as the minimum of P values along the curve. The solution is performed by numerical methods.

1 February 2023 in IOP Conference Series: Materials Science and Engineering
Verified
Conference Paper
Open access
ATA. Traykov
A. Traykov
NGNedelcho Jivkov Ganchovski
Nedelcho Jivkov Ganchovski
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 structure is processed by a core engine, which generates the computer code, required for the solution. This model can be used for calculation of different partial cases, after specifying the specific input functions and parameters. In this way, the need for developing a different procedure for each separate case is eliminated. The proposed method is applied for the analysis of a column with variable, arbitrary shaped cross section, accounting for initial imperfections, geometric and material nonlinearity.

14 October 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
LTLatchezar Tomov
Latchezar Tomov
NGNedelcho Jivkov Ganchovski
Nedelcho Jivkov Ganchovski
The modified Anderson–Björck (modAB) method was first proposed in 2023 by Ganchovski and Traykov for solving nonlinear equations in structural mechanics. It was improved in 2026 with better switching criteria that account for function symmetry and a bisection fallback based on the bracket reduction rate. Although the algorithm performed well in benchmarks, it lacked formal mathematical analysis and proof of convergence. Later analysis by L. Tomov showed some inconsistencies like premature endpoint corrections on the first AB step, and the use of corrected ordinates in the symmetry factor calculation instead of the true residuals. This paper removes the above inconsistencies, provides a proof of global convergence in exact arithmetic, and adds floating-point safeguards for interpolation, method switching and convergence checks, with explicit treatment of infinite and NaN values, underflow, overflow and round-off errors. As a result, the reliability of the algorithm is improved. Performance is also enhanced by an adaptive bisection fallback when AB fails to reduce either the bracket width or the residual, keeping a finite bound on residual reducing steps. Numerical experiments were conducted for an extended set of 100 functions.

27 March 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
NGNedelcho Jivkov Ganchovski
Nedelcho Jivkov Ganchovski
OSOscar Smith
Oscar Smith
CRChristopher Rackauckas
Christopher Rackauckas
LTLatchezar Tomov
Latchezar Tomov
ATAlexander Traykov
Alexander Traykov
Modified Anderson-Björck’s method [1] is a new robust and efficient bracketing root finding algorithm. It combines bisection with Anderson-Björk’s method to achieve both fast performance and worst-case optimality. It relies on linearity check criteria for switching methods and uses Anderson-Björk corrections to overcome the fixed endpoint issue of false-position. Initial benchmarks of this method have shown certain performance advantages compared to other methods like Ridders, Brent and ITP. In this paper, we propose further improvements of the method and perform some additional analysis and benchmarks of its behavior and performance.