Sparse Solutions of Underdetermined Linear Systems and Their Applications

Sparse Solutions of Underdetermined Linear Systems and Their Applications
Author: Ming-Jun Lai
Publisher: SIAM
Total Pages:
Release: 2021-06-25
Genre: Mathematics
ISBN: 1611976510

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.

Direct Methods for Sparse Linear Systems

Direct Methods for Sparse Linear Systems
Author: Timothy A. Davis
Publisher: SIAM
Total Pages: 228
Release: 2006-09-01
Genre: Computers
ISBN: 0898716136

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.

Sparse Optimization Theory and Methods

Sparse Optimization Theory and Methods
Author: Yun-Bin Zhao
Publisher: CRC Press
Total Pages: 297
Release: 2018-07-04
Genre: Business & Economics
ISBN: 1351624156

Seeking sparse solutions of underdetermined linear systems is required in many areas of engineering and science such as signal and image processing. The efficient sparse representation becomes central in various big or high-dimensional data processing, yielding fruitful theoretical and realistic results in these fields. The mathematical optimization plays a fundamentally important role in the development of these results and acts as the mainstream numerical algorithms for the sparsity-seeking problems arising from big-data processing, compressed sensing, statistical learning, computer vision, and so on. This has attracted the interest of many researchers at the interface of engineering, mathematics and computer science. Sparse Optimization Theory and Methods presents the state of the art in theory and algorithms for signal recovery under the sparsity assumption. The up-to-date uniqueness conditions for the sparsest solution of underdertemined linear systems are described. The results for sparse signal recovery under the matrix property called range space property (RSP) are introduced, which is a deep and mild condition for the sparse signal to be recovered by convex optimization methods. This framework is generalized to 1-bit compressed sensing, leading to a novel sign recovery theory in this area. Two efficient sparsity-seeking algorithms, reweighted l1-minimization in primal space and the algorithm based on complementary slackness property, are presented. The theoretical efficiency of these algorithms is rigorously analysed in this book. Under the RSP assumption, the author also provides a novel and unified stability analysis for several popular optimization methods for sparse signal recovery, including l1-mininization, Dantzig selector and LASSO. This book incorporates recent development and the author’s latest research in the field that have not appeared in other books.

Scientific Data Analysis

Scientific Data Analysis
Author: Richard L. Jr. Branham
Publisher: Springer Science & Business Media
Total Pages: 246
Release: 2012-12-06
Genre: Mathematics
ISBN: 1461233623

This monograph is concerned with overdetermined systems, inconsistent systems with more equations than unknowns, in scientific data reduction. It is not a text on statistics, numerical methods, or matrix cOmputations, although elements of all three, especially the latter, enter into the discussion. The reader I have in mind is a scientist or engineer who has gathered data that he or she wants to model by a mathematical system, perhaps linear, perhaps nonlinear, and solve to obtain the best estimates, in some sense of the term "best," of various parameters. Because the calculations will be performed on a digital computer, the first chapter discusses floating-point numbers and their effect on mathematical operations. The chapter ends with some methods for accurately summing floating-point numbers, an operation frequently required in numerical work and one often done by the worst possible method, recursive summation. Chapter 2 gives a brief review of linear algebra and includes vector and matrix norms and condition numbers of matrices and linear systems. ' Chapter 3 presents some ideas for manipulating sparse matrices. Frequently, time or memory can be saved by use of sparse matrix techniques. The subject is extensive and the chapter is only indicative of the many techniques available. Although Chapter 3 is somewhat extraneous to the rest of the book, Chapter 5, on linear least squares, makes use of the compressed storage mode for the symmetric matrices discussed in Chapter 3.

A Mathematical Introduction to Compressive Sensing

A Mathematical Introduction to Compressive Sensing
Author: Simon Foucart
Publisher: Springer Science & Business Media
Total Pages: 634
Release: 2013-08-13
Genre: Computers
ISBN: 0817649484

At the intersection of mathematics, engineering, and computer science sits the thriving field of compressive sensing. Based on the premise that data acquisition and compression can be performed simultaneously, compressive sensing finds applications in imaging, signal processing, and many other domains. In the areas of applied mathematics, electrical engineering, and theoretical computer science, an explosion of research activity has already followed the theoretical results that highlighted the efficiency of the basic principles. The elegant ideas behind these principles are also of independent interest to pure mathematicians. A Mathematical Introduction to Compressive Sensing gives a detailed account of the core theory upon which the field is build. With only moderate prerequisites, it is an excellent textbook for graduate courses in mathematics, engineering, and computer science. It also serves as a reliable resource for practitioners and researchers in these disciplines who want to acquire a careful understanding of the subject. A Mathematical Introduction to Compressive Sensing uses a mathematical perspective to present the core of the theory underlying compressive sensing.

Sparsity Methods for Systems and Control

Sparsity Methods for Systems and Control
Author: Masaaki Nagahara
Publisher:
Total Pages: 220
Release: 2020-09-30
Genre:
ISBN: 9781680837247

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.

Applied Numerical Linear Algebra

Applied Numerical Linear Algebra
Author: James W. Demmel
Publisher: SIAM
Total Pages: 426
Release: 1997-08-01
Genre: Mathematics
ISBN: 0898713897

This comprehensive textbook is designed for first-year graduate students from a variety of engineering and scientific disciplines.