A Non-Triviality Certificate for Scalars and its application to Linear Systems
Computational Complexity
2012-04-10 v1 Algebraic Geometry
Abstract
We present an approach of taking a linear weighted Average of N given scalars, such that this Average is zero, if and only if, all N scalars are zero. The weights for the scalars in this Average vary asymptotically with respect to a large positive real. We use this approach with a previous result on Asymptotic Linear Programming, to develop an O(M^4) Algorithm that decides whether or not a system of M Linear Inequalities is feasible, and, whether or not any desired subset of the variables in this system, is permitted to have a non-trivial solution.
Keywords
Cite
@article{arxiv.1204.1764,
title = {A Non-Triviality Certificate for Scalars and its application to Linear Systems},
author = {Deepak Ponvel Chermakani},
journal= {arXiv preprint arXiv:1204.1764},
year = {2012}
}
Comments
6 pages, 10 figures, 1 Theorem on the non-triviality Certificate for Scalars