3 citations · 8 across the 6 of their papers we have counts for
9 papers
On Tusi's Classification of Cubic Equations and its Connections to Cardano's Formula and Khayyam's Geometric Solution
Bahman Kalantari, Rahim Zaare-Nahandi
Omar Khayyam's studies on cubic equations inspired the 12th century Persian mathematician Sharaf al-Din Tusi to investigate the number of positive roots. According to the noted mat…
A Geometric Algorithm for Solving Linear Systems
Bahman Kalantari, Chun Lau, Yikai Zhang
Based on the geometric {\it Triangle Algorithm} for testing membership of a point in a convex set, we present a novel iterative algorithm for testing the solvability of a real line…
A Globally Convergent Newton Method for Polynomials
Bahman Kalantari
Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could ex…
Collatz polynomials: an introduction with bounds on their zeros
Matt Hohertz, Bahman Kalantari
The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural…
On the Equivalence of SDP Feasibility and a Convex Hull Relaxation for System of Quadratic Equations
Bahman Kalantari
We show {\it semidefinite programming} (SDP) feasibility problem is equivalent to solving a {\it convex hull relaxation} (CHR) for a finite system of quadratic equations. On the on…
A Spectral Generalization of Von Neumann Minimax Theorem
Bahman Kalantari
Given real symmetric matrices , the following {\it spectral minimax} property holds: $$\min_{X \in \mathbfΔ_n} \max_{y \in S_m} \sum_{i=1}^m y_iA_i \b…