Random Search Algorithms for the Sparse Null Vector Problem

Details Random Search Algorithms for the Sparse Null Vector Problem Random Search Algorithms for the Sparse Null Vector Problem

2008-04-21

arxiv.org/abs/0804.3411v1

Mathematics

Numerical Analysis

Scientific paper

We consider the following problem: Given a matrix A, find minimal subsets of columns of A with cardinality no larger than a given bound that are linear dependent or nearly so. This problem arises in various forms in optimization, electrical engineering, and statistics. In its full generality, the problem is known to be NP-complete. We present a Monte Carlo method that finds such subsets with high confidence. We also give a deterministic method that is capable of proving that no subsets of linearly dependent columns up to a certain cardinality exist. The performance of both methods is analyzed and illustrated with numerical experiments.

Affiliated with

Also associated with

No associations

Rating

Random Search Algorithms for the Sparse Null Vector Problem 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 Random Search Algorithms for the Sparse Null Vector Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Search Algorithms for the Sparse Null Vector Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-674439