Oscar Smith

Dr. Oscar Smith

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
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.

13 June 2025
Verified
Conference Paper
Open access
LALuis Eduardo de Souza Amorim
Luis Eduardo de Souza Amorim
YLYi Lin
Yi Lin
SBStephen M. Blackburn
Stephen M. Blackburn
DNDiogo Netto
Diogo Netto
GBGabriel Baraldi
Gabriel Baraldi
OSOscar Smith
Oscar Smith

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.