5 citations · 34 across the 24 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.NA2020★ 1 cited
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…
math.NA2020★ 3 cited
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…
math.NT2020★ 2 cited
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…