论文信息 - Experiments with The Triangle Algorithm for Linear Systems ∗

Experiments with The Triangle Algorithm for Linear Systems ∗

We present some computational experimentation for solving a linear system Ax = b by applying the Triangle Algorithm described in [3], based on converting the system to a convex hull problem as described in [4]. A comparison of the performance with classical iterative methods such as Jacobi, Gauss-Seidel, and Successive Over-Relaxation method for small size problems suggests the Triangle Algorithm is competitive, requiring no restrictions on the input matrix.

Thomas H. Gibson | Bahman Kalantari

[1] Bahman Kalantari,et al. A characterization theorem and an algorithm for a convex hull problem , 2012, Ann. Oper. Res..

[2] C. Cullen. An Introduction to Numerical Linear Algebra , 1993 .

[3] Bahman Kalantari. Finding a Lost Treasure in Convex Hull of Points From Known Distances , 2012, CCCG.

[4] Bahman Kalantari,et al. Solving Linear System of Equations Via A Convex Hull Algorithm , 2012, ArXiv.