
A detailed geometric and algorithmic analysis of a recent method for calculating a center of a polytope (the intersection of a hyperplane with the non-negative orthant) is given. The algorithm is readily adopted for sequential or parallel computer implementation.
Numerical solutions to overdetermined systems, pseudoinverses, algorithm, Linear inequalities of matrices, Other matrix algorithms, linear inequalities, linear programming, Parallel numerical computation, nonnegative solution, consistency check, Moore-Penrose inverse, parallel computer implementation, Numerical mathematical programming methods, QA1-939, initial feasible solution, Euclidean distance, center of a polytope, Mathematics, parallel computation.
Numerical solutions to overdetermined systems, pseudoinverses, algorithm, Linear inequalities of matrices, Other matrix algorithms, linear inequalities, linear programming, Parallel numerical computation, nonnegative solution, consistency check, Moore-Penrose inverse, parallel computer implementation, Numerical mathematical programming methods, QA1-939, initial feasible solution, Euclidean distance, center of a polytope, Mathematics, parallel computation.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
