A Non-Triviality Certificate for Scalars and its application to Linear Systems

Details A Non-Triviality Certificate for Scalars and its application to Linear Systems A Non-Triviality Certificate for Scalars and its application to Linear Systems

2012-04-08

arxiv.org/abs/1204.1764v1

Computer Science

Computational Complexity

6 pages, 10 figures, 1 Theorem on the non-triviality Certificate for Scalars

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Non-Triviality Certificate for Scalars and its application to Linear Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Non-Triviality Certificate for Scalars and its application to Linear Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Non-Triviality Certificate for Scalars and its application to Linear Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647671