On Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions

Details On Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions On Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions

2011-12-30

arxiv.org/abs/1201.0073v1

Computer Science

Data Structures and Algorithms

7 pages

Scientific paper

We describe two algorithms for computing a sparse solution to a least-squares
problem where the coefficient matrix can have arbitrary dimensions. We show
that the solution vector obtained by our algorithms is close to the solution
vector obtained via the truncated SVD approach.

Affiliated with

Also associated with

No associations

Rating

On Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions 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 On Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-334807