Author Description

<p>This textbook presents a special solution to underdetermined linear systems where the number of nonzero entries in the solution is very small compared to the total number of entries. This is called a sparse solution. Since underdetermined linear systems can be very different, the authors explain how to compute a sparse solution using many approaches. </p><p>Sparse Solutions of Underdetermined Linear Systems and Their Applications contains 64 algorithms for finding sparse solutions of underdetermined linear systems and their applications for matrix completion, graph clustering, and phase retrieval and provides a detailed explanation of these algorithms including derivations and convergence analysis. Exercises for each chapter help readers understand the material.</p><p>This textbook is appropriate for graduate students in math and applied math, computer science, statistics, data science, and engineering. Advisors and postdoctoral scholars will also find the book interesting and useful. </p>