Computational Methods for Sparse Solution of Linear Inverse Problems Joel A

Total Page:16

File Type:pdf, Size:1020Kb

Computational Methods for Sparse Solution of Linear Inverse Problems Joel A PROCEEDINGS OF THE IEEE. SPECIAL ISSUE ON APPLICATIONS OF SPARSE REPRESENTATION AND COMPRESSIVE SENSING, VOL. XX, NO. YY, MONTH 20091 Computational Methods for Sparse Solution of Linear Inverse Problems Joel A. Tropp, Member, IEEE and Stephen J. Wright Abstract—The goal of the sparse approximation problem is find good solutions to large sparse approximation problems in to approximate a target signal using a linear combination of a reasonable time. few elementary signals drawn from a fixed collection. This paper In this paper, we give an overview of algorithms for sparse surveys the major practical algorithms for sparse approximation. Specific attention is paid to computational issues, to the circum- approximation, describing their computational requirements stances in which individual methods tend to perform well, and to and the relationships between them. We also discuss the the theoretical guarantees available. Many fundamental questions types of problems for which each method is most effective in electrical engineering, statistics, and applied mathematics in practice. Finally, we sketch the theoretical results that can be posed as sparse approximation problems, making these justify the application of these algorithms. Although low- algorithms versatile and relevant to a plethora of applications. rank regularization also falls within the sparse approximation Index Terms—Sparse Approximation, Compressed Sensing, framework, the algorithms we describe do not apply directly Matching Pursuit, Convex Optimization to this class of problems. Subsection I-A describes “ideal” formulations of sparse I. INTRODUCTION approximation problems and some common features of algo- INEAR inverse problems arise throughout engineering rithms that attempt to solve these problems. Section II provides L and the mathematical sciences. In most applications, additional detail about greedy pursuit methods. Section III these problems are ill-conditioned or underdetermined, so one presents formulations based on convex programming and must apply additional regularizing constraints in order to ob- algorithms for solving these optimization problems. tain interesting or useful solutions. Over the last two decades, sparsity constraints have emerged as a fundamental type of A. Formulations regularizer. This approach seeks an approximate solution to m×N a linear system while requiring that the unknown has few Suppose that Φ 2 R is a real matrix whose columns nonzero entries relative to its dimension: have unit Euclidean norm: k'jk2 = 1 for j = 1; 2;:::;N. (The normalization does not compromise generality.) This Find sparse x such that Φx ≈ u; matrix is often referred to as a dictionary. The columns of the where u is a target signal and Φ is a known matrix. matrix are “entries” in the dictionary, and a column submatrix sparse approx- is called a subdictionary. Generically, this formulation is referred to as N imation [1]. These problems arise in many areas, including The counting function k · k0 : R ! R returns the number statistics, signal processing, machine learning, coding theory, of nonzero components in its argument. We say that a vector x and approximation theory. Compressive sampling refers to a is s-sparse when kxk0 ≤ s. When u = Φx, we refer to x as specific type of sparse approximation problem first studied a representation of the signal u with respect to the dictionary. in [2], [3]. In practice, signals tend to be compressible, rather than Tykhonov regularization, the classical device for solving sparse. Mathematically, a compressible signal has a repre- linear inverse problems, controls the energy (i.e., the Euclidean sentation whose entries decay rapidly when sorted in order norm) of the unknown vector. This approach leads to a linear of decreasing magnitude. Compressible signals are well ap- least-squares problem whose solution is generally nonsparse. proximated by sparse signals, so the sparse approximation To obtain sparse solutions, we must develop more sophisti- framework applies to this class. In practice, it is usually cated algorithms and—often—commit more computational re- more challenging to identify approximate representations of sources. The effort pays off. Recent research has demonstrated compressible signals than of sparse signals. that, in many cases of interest, there are algorithms that can The most basic problem we consider is to produce a maximally sparse representation of an observed signal u: JAT is with Applied & Computational Mathematics, Firestone Laboratories MC 217-50, California Institute of Technology, 1200 E. California Blvd., min kxk0 subject to Φx = u: (1) Pasadena, CA 91125-5000 USA. E-mail: [email protected]. x SJW is with the Computer Sciences Department, University of Wis- consin, 1210 W. Dayton St., Madison, WI 53706 USA. E-mail: One natural variation is to relax the equality constraint to allow [email protected] some error tolerance " ≥ 0, in case the observed signal is JAT was supported by ONR N00014-08-1-2065. SJW was supported by contaminated with noise: NSF CCF-0430504, DMS-0427689, CTS-0456694, CNS-0540147, and DMS- 0914524. min kxk0 subject to kΦx − uk2 ≤ ": (2) Manuscript received March 15, 2009. Revised February 17, 2010. x PROCEEDINGS OF THE IEEE. SPECIAL ISSUE ON APPLICATIONS OF SPARSE REPRESENTATION AND COMPRESSIVE SENSING, VOL. XX, NO. YY, MONTH 20092 It is most common to measure the prediction–observation a maximum a posteriori estimator that incorporates the discrepancy with the Euclidean norm, but other loss functions observation. Identify a region of significant posterior may also be appropriate. mass [8] or average over most-probable models [9]. The elements of (2) can be combined in several ways to 4) Nonconvex optimization. Relax the `0 problem to a obtain related problems. For example, we can seek the minimal related nonconvex problem and attempt to identify a error possible at a given level of sparsity s ≥ 1: stationary point [10]. 5) Brute force. Search through all possible support sets, min kΦx − uk2 subject to kxk0 ≤ s: (3) x possibly using cutting-plane methods to reduce the num- We can also use a parameter λ > 0 to balance the twin ber of possibilities [11, Sec. 3.7–3.8]. objectives of minimizing both error and sparsity: This article focuses on greedy pursuits and convex optimiza- tion. These two approaches are computationally practical and 1 2 min kΦx − uk2 + λkxk0: (4) lead to provably correct solutions under well-defined condi- x 2 tions. Bayesian methods and nonconvex optimization are based If there are no restrictions on the dictionary Φ and the on sound principles, but they do not currently offer theoretical signal u, then sparse approximation is at least as hard as guarantees. Brute force is, of course, algorithmically correct, a general constraint satisfaction problem. Indeed, for fixed but it remains plausible only for small-scale problems. constants C; K ≥ 1, it is NP-hard to produce a (Cs)-sparse Recently, we have also seen interest in heuristic algorithms approximation whose error lies within a factor K of the based on belief-propagation and message-passing techniques minimal s-term approximation error [4, Sec. 0.8.2]. developed in the graphical models and coding theory commu- Nevertheless, over the past decade, researchers have identi- nities [12], [13]. fied many interesting classes of sparse approximation prob- lems that submit to computationally tractable algorithms. C. Verifying Correctness These striking results help to explain why sparse approxima- tion has been such an important and popular topic of research Researchers have identified several tools that can be used in recent years. to prove that sparse approximation algorithms produce optimal In practice, sparse approximation algorithms tend to be solutions to sparse approximation problems. These tools also slow unless the dictionary Φ admits a fast matrix–vector provide insight into the efficiency of computational algorithms, multiply. Let us mention two classes of sparse approximation so the theoretical background merits a summary. problems where this property holds. First, many naturally The uniqueness of sparse representations is equivalent to an occurring signals are compressible with respect to dictionaries algebraic condition on submatrices of Φ. Suppose a signal u constructed using principles of harmonic analysis [5] (e.g., has two different s-sparse representations x1 and x2. Clearly, wavelet coefficients of natural images). This type of structured u = Φx = Φx =) Φ(x − x ) = 0: dictionary often comes with a fast transformation algorithm. 1 2 1 2 Second, in compressive sampling, we typically view Φ as In words, Φ maps a nontrivial (2s)-sparse signal to zero. It the product of a random observation matrix and a fixed follows that each s-sparse representation is unique if and only orthogonal matrix that determines a basis in which the signal if each (2s)-column submatrix of Φ is injective. is sparse. Again, fast multiplication is possible when both the To ensure that sparse approximation is computationally observation matrix and sparsity basis are structured. tractable, we need stronger assumptions on Φ. Not only should Recently, there have been substantial efforts to incorporate sparse signals be uniquely determined, but they should be sta- more sophisticated signal constraints into sparsity models. In bly determined. Consider a signal perturbation ∆u and an s- particular, Baraniuk et al. have studied model-based compress- sparse coefficient perturbation ∆x, related by ∆u = Φ(∆x). ive sampling algorithms, which
Recommended publications
  • Anna C. Gilbert
    Anna C. Gilbert Dept. of Mathematics University of Michigan 530 Church Street Ann Arbor, MI 48109-1109 [email protected] 734-763-5728 (phone) http://www.math.lsa.umich.edu/~annacg 734-763-0937 (fax) Revision date: 30 October, 2017. Research • General interests: analysis, probability, signal processing, and algorithms. • Specialization: randomized algorithms with applications to massive datasets and signal processing. Education • Ph.D., Mathematics, Princeton University, June 1997, Multiresolution homogenization schemes for differential equations and applications, Professor Ingrid Daubechies, advisor. • S.B., Mathematics (with honors), University of Chicago, June 1993. Positions Held • Herman H. Goldstine Collegiate Professor. Department of Mathematics, University of Michigan, 2014{ present. • Full Professor (Courtesy appointment). Division of Electrical and Computer Engineering, University of Michigan, 2010{present. • Full Professor. Department of Mathematics, University of Michigan, 2010{present. • Associate Professor (Courtesy appointment). Division of Electrical and Computer Engineering, Uni- versity of Michigan, 2008{2010. • Associate Professor. Department of Mathematics, University of Michigan, 2007{2010. • Assistant Professor. Department of Mathematics, University of Michigan, 2004{2007. • Principal technical staff member. Internet and Network Systems Research Center, AT&T Labs-Research, 2002{2004. • Senior technical staff member. Information Sciences Research Center, AT&T Labs-Research, 1998{ 2002. • Visiting instructor. Department of Mathematics, Stanford University, Winter quarter 2000. • Postdoctoral research associate. Yale University and AT&T Labs-Research, 1997{1998. • Intern. Lucent Technologies Bell Laboratories, summer 1996. • Research assistant. Princeton University, 1994{1995. • Intern. AT&T Bell Laboratories, summers 1993{1995. Publications Refereed Journal Publications • F. J. Chung, A. C. Gilbert, J. G. Hoskins, and J. C. Schotland, \Optical tomography on graphs", Inverse Problems, Volume 33, Number 5, 2017.
    [Show full text]
  • Martin J. Strauss April 22, 2015
    Martin J. Strauss April 22, 2015 Work Address: Dept. of Mathematics University of Michigan Ann Arbor, MI 48109-1043 [email protected] http://www.eecs.umich.edu/~martinjs/ +1-734-717-9874 (cell) Research Interests • Sustainable Energy. • Fundamental algorithms, especially randomized and approximation algorithms. • Algorithms for massive data sets. • Signal processing and and computational harmonic analysis. • Computer security and cryptography. • Complexity theory. Pedagogical Interests • Manipulative Mathematics (teaching via pipe cleaners, paper folding and other mutilation, etc.) • Kinesthetic Mathematics (teaching through movement, including acting out algorithms, per- mutations, and other transformations). Education • Ph.D., Mathematics, Rutgers University, October 1995. Thesis title: Measure in Feasible Complexity Classes. Advisor: Prof. E. Allender, Dept. of Computer Science. • A.B. summa cum laude, Mathematics, Columbia University, May 1989. Minor in Computer Science. Employment History • Professor, Dept. of Mathematics and Dept. of Electrical Engineering and Computer Science (jointly appointed), University of Michigan, 2011{present. • Associate Professor, Dept. of Mathematics and Dept. of Electrical Engineering and Computer Science (jointly appointed), University of Michigan, 2008{2011. • Assistant Professor, Dept. of Mathematics and Dept. of Electrical Engineering and Computer Science (jointly appointed), University of Michigan, 2004{2008. • Visiting Associate Research Scholar, Program in Applied and Computational Mathematics, Princeton University, Sept. 2006{Feb. 2007. Page 1 of 17 • Principal investigator, AT&T Laboratories|Research, 1997{2004. Most recent position: Principal Technical Staff Member, Internet and Network Systems Research Center. • Consultant, Network Services Research Center, AT&T Laboratories, 1996. • Post-Doctoral Research Associate, Department of Computer Science, Iowa State University, September 1995{May 1996. • Intern. Speech recognition group, IBM Watson Research Center, summers, 1989{1990.
    [Show full text]
  • Focm 2017 Foundations of Computational Mathematics Barcelona, July 10Th-19Th, 2017 Organized in Partnership With
    FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th-19th, 2017 http://www.ub.edu/focm2017 Organized in partnership with Workshops Approximation Theory Computational Algebraic Geometry Computational Dynamics Computational Harmonic Analysis and Compressive Sensing Computational Mathematical Biology with emphasis on the Genome Computational Number Theory Computational Geometry and Topology Continuous Optimization Foundations of Numerical PDEs Geometric Integration and Computational Mechanics Graph Theory and Combinatorics Information-Based Complexity Learning Theory Plenary Speakers Mathematical Foundations of Data Assimilation and Inverse Problems Multiresolution and Adaptivity in Numerical PDEs Numerical Linear Algebra Karim Adiprasito Random Matrices Jean-David Benamou Real-Number Complexity Alexei Borodin Special Functions and Orthogonal Polynomials Mireille Bousquet-Mélou Stochastic Computation Symbolic Analysis Mark Braverman Claudio Canuto Martin Hairer Pierre Lairez Monique Laurent Melvin Leok Lek-Heng Lim Gábor Lugosi Bruno Salvy Sylvia Serfaty Steve Smale Andrew Stuart Joel Tropp Sponsors Shmuel Weinberger 2 FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th{19th, 2017 Books of abstracts 4 FoCM 2017 Contents Presentation . .7 Governance of FoCM . .9 Local Organizing Committee . .9 Administrative and logistic support . .9 Technical support . 10 Volunteers . 10 Workshops Committee . 10 Plenary Speakers Committee . 10 Smale Prize Committee . 11 Funding Committee . 11 Plenary talks . 13 Workshops . 21 A1 { Approximation Theory Organizers: Albert Cohen { Ron Devore { Peter Binev . 21 A2 { Computational Algebraic Geometry Organizers: Marta Casanellas { Agnes Szanto { Thorsten Theobald . 36 A3 { Computational Number Theory Organizers: Christophe Ritzenhaler { Enric Nart { Tanja Lange . 50 A4 { Computational Geometry and Topology Organizers: Joel Hass { Herbert Edelsbrunner { Gunnar Carlsson . 56 A5 { Geometric Integration and Computational Mechanics Organizers: Fernando Casas { Elena Celledoni { David Martin de Diego .
    [Show full text]
  • Focm 2017 Foundations of Computational Mathematics Barcelona, July 10Th-19Th, 2017 Organized in Partnership With
    FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th-19th, 2017 http://www.ub.edu/focm2017 Organized in partnership with Workshops Approximation Theory Computational Algebraic Geometry Computational Dynamics Computational Harmonic Analysis and Compressive Sensing Computational Mathematical Biology with emphasis on the Genome Computational Number Theory Computational Geometry and Topology Continuous Optimization Foundations of Numerical PDEs Geometric Integration and Computational Mechanics Graph Theory and Combinatorics Information-Based Complexity Learning Theory Plenary Speakers Mathematical Foundations of Data Assimilation and Inverse Problems Multiresolution and Adaptivity in Numerical PDEs Numerical Linear Algebra Karim Adiprasito Random Matrices Jean-David Benamou Real-Number Complexity Alexei Borodin Special Functions and Orthogonal Polynomials Mireille Bousquet-Mélou Stochastic Computation Symbolic Analysis Mark Braverman Claudio Canuto Martin Hairer Pierre Lairez Monique Laurent Melvin Leok Lek-Heng Lim Gábor Lugosi Bruno Salvy Sylvia Serfaty Steve Smale Andrew Stuart Joel Tropp Sponsors Shmuel Weinberger Wifi access Network: wifi.ub.edu Open a Web browser At the UB authentication page put Identifier: aghnmr.tmp Password: aqoy96 Venue FoCM 2017 will take place in the Historical Building of the University of Barcelona, located at Gran Via de les Corts Catalanes 585. Mapa The plenary lectures will be held in the Paraninf (1st day of each period) and Aula Magna (2nd and 3rd day of each period). Both auditorium are located in the first floor. The poster sessions (2nd and 3rd day of each period) will be at the courtyard of the Faculty of Mathematics, at the ground floor. Workshops will be held in the lecture rooms B1, B2, B3, B5, B6, B7 and 111 in the ground floor, and T1 in the second floor.
    [Show full text]
  • 40 IS10 Abstracts
    40 IS10 Abstracts IP1 age and video restoration. I will present the framework Approximate Inference in Graphical Models: The and provide numerous examples showing state-of-the-art Fenchel Duality Perspective results. I will then briefly show how to extend this to im- age classification, deriving energies and optimization pro- Quite a number of problems involving inference from data, cedures that lead to learning non-parametric dictionaries whether visual data or otherwise, can be set as a prob- for sparse representations optimized for classification. I lem of finding the most likely setting of variables of a will conclude by showing results on the extension of this to joint distribution over locally interacting variables. These sensing and the learning of incoherent dictionaries. Models include stereopsis, figure-ground segmentation, model-to- derived from universal coding are presented as well. The image matching, super-resolution, and so forth. Inference work I present in this talk is the result of great collabo- over locally interacting variables can be naturally repre- rations with J. Mairal, F. Rodriguez, J. Martin-Duarte, I. sented by a graphical model, however exact inference over Ramirez, F. Lecumberry, F. Bach, M. Elad, J. Ponce, and general graphs is computationally unwieldy. In the context A. Zisserman. of approximate inference, I will describe a general scheme for message passing update rules based on the framework Guillermo Sapiro of Fenchel duality. Using the framework we derive all University of Minnesota past inference algorithms like the Belief Propagation sum- Dept Electrical & Computer Engineering product and max-product, the Tree-Re-Weighted (TRW) [email protected] model as well as new convergent algorithms for maximum- a-posteriori (MAP) and marginal estimation using ”convex free energies”.
    [Show full text]
  • Future Directions in Compressed Sensing and the Integration of Sensing and Processing What Can and Should We Know by 2030?
    Future Directions in Compressed Sensing and the Integration of Sensing and Processing What Can and Should We Know by 2030? Robert Calderbank, Duke University Guillermo Sapiro, Duke University Workshop funded by the Basic Research Office, Office of the Assistant Prepared by Brian Hider and Jeremy Zeigler Secretary of Defense for Research & Engineering. This report does not Virginia Tech Applied Research Corporation necessarily reflect the policies or positions of the US Department of Defense Preface OVER THE PAST CENTURY, SCIENCE AND TECHNOLOGY HAS BROUGHT REMARKABLE NEW CAPABILITIES TO ALL SECTORS of the economy; from telecommunications, energy, and electronics to medicine, transportation and defense. Technologies that were fantasy decades ago, such as the internet and mobile devices, now inform the way we live, work, and interact with our environment. Key to this technological progress is the capacity of the global basic research community to create new knowledge and to develop new insights in science, technology, and engineering. Understanding the trajectories of this fundamental research, within the context of global challenges, empowers stakeholders to identify and seize potential opportunities. The Future Directions Workshop series, sponsored by the Basic Research Office of the Office of the Assistant Secretary of Defense for Research and Engineering, seeks to examine emerging research and engineering areas that are most likely to transform future technology capabilities. These workshops gather distinguished academic and industry researchers from the world’s top research institutions to engage in an interactive dialogue about the promises and challenges of these emerging basic research areas and how they could impact future capabilities. Chaired by leaders in the field, these workshops encourage unfettered considerations of the prospects of fundamental science areas from the most talented minds in the research community.
    [Show full text]
  • Computational Methods for Sparse Solution of Linear Inverse Problems Joel A
    PROCEEDINGS OF THE IEEE. SPECIAL ISSUE ON APPLICATIONS OF SPARSE REPRESENTATION AND COMPRESSIVE SENSING, VOL. XX, NO. YY, MONTH 20091 Computational Methods for Sparse Solution of Linear Inverse Problems Joel A. Tropp, Member, IEEE and Stephen J. Wright Abstract—The goal of the sparse approximation problem is find good solutions to large sparse approximation problems in to approximate a target signal using a linear combination of a reasonable time. few elementary signals drawn from a fixed collection. This paper In this paper, we give an overview of algorithms for sparse surveys the major practical algorithms for sparse approximation. Specific attention is paid to computational issues, to the circum- approximation, describing their computational requirements stances in which individual methods tend to perform well, and to and the relationships between them. We also discuss the the theoretical guarantees available. Many fundamental questions types of problems for which each method is most effective in electrical engineering, statistics, and applied mathematics in practice. Finally, we sketch the theoretical results that can be posed as sparse approximation problems, making these justify the application of these algorithms. Although low- algorithms versatile and relevant to a plethora of applications. rank regularization also falls within the sparse approximation Index Terms—Sparse Approximation, Compressed Sensing, framework, the algorithms we describe do not apply directly Matching Pursuit, Convex Optimization to this class of problems. Subsection I-A describes “ideal” formulations of sparse I. INTRODUCTION approximation problems and some common features of algo- INEAR inverse problems arise throughout engineering rithms that attempt to solve these problems. Section II provides L and the mathematical sciences.
    [Show full text]
  • Anna C. Gilbert
    Anna C. Gilbert Dept. of Mathematics University of Michigan 530 Church Street Ann Arbor, MI 48109-1109 [email protected] 734-763-5728 (phone) http://www.math.lsa.umich.edu/~annacg 734-763-0937 (fax) Revision date: 10 August, 2017. Research • General interests: analysis, probability, signal processing, and algorithms. • Specialization: randomized algorithms with applications to massive datasets and signal processing. Education • Ph.D., Mathematics, Princeton University, June 1997, Multiresolution homogenization schemes for differential equations and applications, Professor Ingrid Daubechies, advisor. • S.B., Mathematics (with honors), University of Chicago, June 1993. Positions Held • Herman H. Goldstine Collegiate Professor. Department of Mathematics, University of Michigan, 2014{ present. • Full Professor (Courtesy appointment). Division of Electrical and Computer Engineering, University of Michigan, 2010{present. • Full Professor. Department of Mathematics, University of Michigan, 2010{present. • Associate Professor (Courtesy appointment). Division of Electrical and Computer Engineering, Uni- versity of Michigan, 2008{2010. • Associate Professor. Department of Mathematics, University of Michigan, 2007{2010. • Assistant Professor. Department of Mathematics, University of Michigan, 2004{2007. • Principal technical staff member. Internet and Network Systems Research Center, AT&T Labs-Research, 2002{2004. • Senior technical staff member. Information Sciences Research Center, AT&T Labs-Research, 1998{ 2002. • Visiting instructor. Department of Mathematics, Stanford University, Winter quarter 2000. • Postdoctoral research associate. Yale University and AT&T Labs-Research, 1997{1998. • Intern. Lucent Technologies Bell Laboratories, summer 1996. • Research assistant. Princeton University, 1994{1995. • Intern. AT&T Bell Laboratories, summers 1993{1995. Publications Refereed Journal Publications • F. J. Chung, A. C. Gilbert, J. G. Hoskins, and J. C. Schotland, \Optical tomography on graphs", Inverse Problems, Volume 33, Number 5, 2017.
    [Show full text]
  • 32 IS06 Abstracts
    32 IS06 Abstracts CP1 lem from Surface Measurements Adaptive Finite Element Methods for Inverse Imaging Problems Assuming that the heat capacity of a body is negligible outside certain inclusions the heat equation degenerates to In many realistic 3d imaging problems, such as biomedical a parabolic-elliptic interface problem. For the case that the tumor diagnostics or underground imaging, the resolution heat conductivity is higher inside the inclusions we show by requested by practitioners is unachiavable using globally an adaptation of the so-called Factorization Method that refined meshes. However, while now the leading paradigm the locations of the interfaces are uniquely determined by in PDE solvers, adaptivity has not been widely used for thermal measurements on the surface of the body. We also inverse problems. We will present a mathematical frame- present some numerical results for this inverse problem. work for imaging applications using automatically adapted meshes, and present results obtained in optical tomography Otmar Scherzer for tumor detection and sound wave imaging applications. University Innsbruck [email protected] Wolfgang Bangerth Texas A&M University Bastian Gebauer [email protected] Institut f¨ur Mathematik, Joh. Gutenberg-Universit¨at Mainz, Germany [email protected] CP1 A New Approach to Inverse Problem Solving Using Florian Fr¨uhauf Radon-Based Representations Department of Computer Science, University of Innsbruck, Austria We carry out image deconvolution by transforming the fl[email protected] data into a new general discrete Radon domain that can handle any assumed boundary condition for the associ- ated matrix inversion problem. For each associated angular CP1 segment, one can apply deconvolution routines to smaller A Threshold-Based Method for Inverse Solutions (and possibly better) conditioned matrix inversion prob- to Reconstruct Complex Obstacles, with Applica- lems than the matrix inversion problem for the entire im- tion to the Inverse Problem of Electrocardiography age.
    [Show full text]
  • The Sixth Vasil Popov Prize Awarded to Joel A. Tropp of California Institute of Technology
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Appl. Comput. Harmon. Anal. 29 (2010) 1 Contents lists available at ScienceDirect Applied and Computational Harmonic Analysis www.elsevier.com/locate/acha Announcement The Sixth Vasil Popov Prize awarded to Joel A. Tropp of California Institute of Technology Thirteenth International Conference in Approximation Theory San Antonio, Texas, March 8, 2010 The Popov Prize honors the memory of Vasil A. Popov (1942–1990), the Bulgarian analyst best known for his work in Nonlinear Approximation. The Prize is awarded every third year to a young mathematician (less than six years removed from the Ph.D.) for outstanding research contributions to Approximation Theory and/or related ar- eas. Previous Popov Prize winners are Albert Cohen (Paris), Arno Kuijlaars (The Netherlands), Emmanuel Candes (Stan- ford), Serguei Denissov (Wisconsin–Madison), and Mauro Maggioni (Duke). Joel Tropp was recognized for his outstanding contribu- tions to the development of sparse reconstruction methods in the context of approximation from redundant systems, greedy algorithms, and most recently compressed sens- ing. In particular, he has shown that greedy algorithms will with high probability exactly recover sparse vectors from random measurements, e.g., based on Gaussian or Bernoulli distributions. This was a cornerstone result in showing the efficacy of greedy algorithms for decoding in compressed sensing. Another impressive result by Joel Tropp is the now famous COSAMP algorithm of Needell and Tropp, which were the first to establish the opti- mal performance of greedy decoding in 2. Tropp’s work has significantly advanced the understanding of greedy al- Joel Tropp is an Assistant Professor of Applied and Computational Math- ematics at the California Institute of Technology.
    [Show full text]
  • Randomized Algorithms for Scientific Computing (RASC)
    Randomized Algorithms for Scientific Computing (RASC) Report from the DOE ASCR Workshop held December 2–3, 2020, and January 6–7, 2021 Prepared for U.S. Department of Energy Office of Science Advanced Scientific Computing Research Program RASC Report Authors Aydın Bulu¸c(co-chair), Lawrence Berkeley National Laboratory Tamara G. Kolda (co-chair), Sandia National Laboratories Stefan M. Wild (co-chair), Argonne National Laboratory Mihai Anitescu, Argonne National Laboratory Anthony DeGennaro, Brookhaven National Laboratory John Jakeman, Sandia National Laboratories Chandrika Kamath, Lawrence Livermore National Laboratory Ramakrishnan (Ramki) Kannan, Oak Ridge National Laboratory Miles E. Lopes, University of California, Davis Per-Gunnar Martinsson, University of Texas, Austin Kary Myers, Los Alamos National Laboratory Jelani Nelson, University of California, Berkeley Juan M. Restrepo, Oak Ridge National Laboratory C. Seshadhri, University of California, Santa Cruz Draguna Vrabie, Pacific Northwest National Laboratory Brendt Wohlberg, Los Alamos National Laboratory Stephen J. Wright, University of Wisconsin, Madison Chao Yang, Lawrence Berkeley National Laboratory Peter Zwart, Lawrence Berkeley National Laboratory arXiv:2104.11079v1 [cs.AI] 19 Apr 2021 DOE/ASCR Point of Contact Steven Lee Randomized Algorithms for Scientific Computing i Additional Report Authors This report was a community effort, collecting inputs in a variety formats. We have taken many of the ideas in this report from the thesis statements collected from registrants of “Part 2” of the workshop. We further solicited input from community members with specific expertise. Much of the input came from discussions at the workshop, so we must credit the entire set of participants listed in full in AppendixB. Although we cannot do justice to the origination of every idea contained herein, we highlight those whose contributions were explicitly solicited or whose submissions were used nearly verbatim.
    [Show full text]
  • Anthony Bloch Named Chair Ate, and Post Doctoral Programs
    ContinuUM Newsletter of the Department of Mathematics at the University of Michigan 2005 also in our healthy undergraduate, gradu- Anthony Bloch Named Chair ate, and post doctoral programs. These outstanding programs allow our faculty In July 2005, Trevor Wooley stepped down as Department Chair after a three-year term. much valued personal contact with stu- Anthony Bloch assumed the Chair’s role. Tony expresses his hopes for the department dents and with emerging young mathema- here, while Trevor’s reflections on the past year are on page 2. ticians who contribute to the liveliness of our research atmosphere. Our faculty I feel honored to be succeeding Trevor offerings ranging from basic required members are dedicated teachers, and we Wooley as Chair of the Department of Math- courses for non-math majors to highly ad- are fortunate that our high-quality graduate ematics. I look forward to working with my vanced specialized graduate courses. Also, students who are offered positions as colleagues, with the staff in the Department, visiting professors and exciting seminars are instructors use their strong teaching skills with Dean Terry part of an enjoyable in the service of our programs. We are McDonald, and with and stimulating aca- involved in various new initiatives in the University com- demic environment. teaching, and we are pursuing joint pro- munity at large. In addition, there is a grams in finance, information sciences and Trevor Wooley pervasive spirit of economics. cooperation and col- was a strong leader Our graduate program has continued to who really cared legiality. This creates a pleasant atmo- thrive.
    [Show full text]