Sparse Solutions of Underdetermined Linear Systems and Their Applications


Book Description

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. 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. 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.







Sparse Solution of Underdetermined Linear Systems


Book Description

Next, we introduce Stagewise Orthogonal Matching Pursuit (StOMP), a rapid iterative method to find sparse approximate solutions to underdetermined linear systems. We demonstrate that StOMP is much faster than competing approaches to recover sparse solutions, and at the same time, its ability to recover the sparsest solution is comparable with that of ℓ1 minimization.




Direct Methods for Sparse Linear Systems


Book Description

The sparse backslash book. Everything you wanted to know but never dared to ask about modern direct linear solvers. Chen Greif, Assistant Professor, Department of Computer Science, University of British Columbia.Overall, the book is magnificent. It fills a long-felt need for an accessible textbook on modern sparse direct methods. Its choice of scope is excellent John Gilbert, Professor, Department of Computer Science, University of California, Santa Barbara.Computational scientists often encounter problems requiring the solution of sparse systems of linear equations. Attacking these problems efficiently requires an in-depth knowledge of the underlying theory, algorithms, and data structures found in sparse matrix software libraries. Here, Davis presents the fundamentals of sparse matrix algorithms to provide the requisite background. The book includes CSparse, a concise downloadable sparse matrix package that illustrates the algorithms and theorems presented in the book and equips readers with the tools necessary to understand larger and more complex software packages.With a strong emphasis on MATLAB and the C programming language, Direct Methods for Sparse Linear Systems equips readers with the working knowledge required to use sparse solver packages and write code to interface applications to those packages. The book also explains how MATLAB performs its sparse matrix computations.Audience This invaluable book is essential to computational scientists and software developers who want to understand the theory and algorithms behind modern techniques used to solve large sparse linear systems. The book also serves as an excellent practical resource for students with an interest in combinatorial scientific computing.Preface; Chapter 1: Introduction; Chapter 2: Basic algorithms; Chapter 3: Solving triangular systems; Chapter 4: Cholesky factorization; Chapter 5: Orthogonal methods; Chapter 6: LU factorization; Chapter 7: Fill-reducing orderings; Chapter 8: Solving sparse linear systems; Chapter 9: CSparse; Chapter 10: Sparse matrices in MATLAB; Appendix: Basics of the C programming language; Bibliography; Index.




Handbook of Geomathematics


Book Description




Sparse and Redundant Representations


Book Description

A long long time ago, echoing philosophical and aesthetic principles that existed since antiquity, William of Ockham enounced the principle of parsimony, better known today as Ockham’s razor: “Entities should not be multiplied without neces sity. ” This principle enabled scientists to select the ”best” physical laws and theories to explain the workings of the Universe and continued to guide scienti?c research, leadingtobeautifulresultsliketheminimaldescriptionlength approachtostatistical inference and the related Kolmogorov complexity approach to pattern recognition. However, notions of complexity and description length are subjective concepts anddependonthelanguage“spoken”whenpresentingideasandresults. The?eldof sparse representations, that recently underwent a Big Bang like expansion, explic itly deals with the Yin Yang interplay between the parsimony of descriptions and the “language” or “dictionary” used in them, and it became an extremely exciting area of investigation. It already yielded a rich crop of mathematically pleasing, deep and beautiful results that quickly translated into a wealth of practical engineering applications. You are holding in your hands the ?rst guide book to Sparseland, and I am sure you’ll ?nd in it both familiar and new landscapes to see and admire, as well as ex cellent pointers that will help you ?nd further valuable treasures. Enjoy the journey to Sparseland! Haifa, Israel, December 2009 Alfred M. Bruckstein vii Preface This book was originally written to serve as the material for an advanced one semester (fourteen 2 hour lectures) graduate course for engineering students at the Technion, Israel.




Introduction to Applied Linear Algebra


Book Description

A groundbreaking introduction to vectors, matrices, and least squares for engineering applications, offering a wealth of practical examples.




An Introduction to Compressed Sensing


Book Description

Compressed sensing is a relatively recent area of research that refers to the recovery of high-dimensional but low-complexity objects from a limited number of measurements. The topic has applications to signal/image processing and computer algorithms, and it draws from a variety of mathematical techniques such as graph theory, probability theory, linear algebra, and optimization. The author presents significant concepts never before discussed as well as new advances in the theory, providing an in-depth initiation to the field of compressed sensing. An Introduction to Compressed Sensing contains substantial material on graph theory and the design of binary measurement matrices, which is missing in recent texts despite being poised to play a key role in the future of compressed sensing theory. It also covers several new developments in the field and is the only book to thoroughly study the problem of matrix recovery. The book supplies relevant results alongside their proofs in a compact and streamlined presentation that is easy to navigate. The core audience for this book is engineers, computer scientists, and statisticians who are interested in compressed sensing. Professionals working in image processing, speech processing, or seismic signal processing will also find the book of interest.







Sparsity Methods for Systems and Control


Book Description

The method of sparsity has been attracting a lot of attention in the fields related not only to signal processing, machine learning, and statistics, but also systems and control. The method is known as compressed sensing, compressive sampling, sparse representation, or sparse modeling. More recently, the sparsity method has been applied to systems and control to design resource-aware control systems. This book gives a comprehensive guide to sparsity methods for systems and control, from standard sparsity methods in finite-dimensional vector spaces (Part I) to optimal control methods in infinite-dimensional function spaces (Part II). The primary objective of this book is to show how to use sparsity methods for several engineering problems. For this, the author provides MATLAB programs by which the reader can try sparsity methods for themselves. Readers will obtain a deep understanding of sparsity methods by running these MATLAB programs. Sparsity Methods for Systems and Control is suitable for graduate level university courses, though it should also be comprehendible to undergraduate students who have a basic knowledge of linear algebra and elementary calculus. Also, especially part II of the book should appeal to professional researchers and engineers who are interested in applying sparsity methods to systems and control.