From mgu at math.berkeley.edu Mon Sep 6 13:14:13 2010 From: mgu at math.berkeley.edu (Ming Gu) Date: Mon Sep 6 13:18:26 2010 Subject: [BANANA] Reminder: LAPACK seminar on Sept. 8, 2010 Message-ID: <201009062014.o86KED80031145@panda.math.berkeley.edu> Math 290, Section 29, CS 298, Section 6, Fall 2010 (Matrix Computations and Scientific Computing) We meet WEDNESDAYS 11:10 - noon in Room 380 Soda Hall, Berkeley campus. The coordinators are Profs. J. Demmel (demmel@cs.berkeley.edu) and M. Gu (mgu@math.berkeley.edu). The program will be a mixture of research talks and tutorials. The tutorials will provide a partial sequel to Math 221. For the schedule and other details about the seminar, please see math.berkeley.edu/~mgu/LAPACKSeminar.htm Date: Sept. 8 Speaker: Joseph Grcar Title The History of "Gaussian" Elimination Date: Sept. 15 Speaker: Benjamin Stamm Title: Reduced Order Modeling for Electromagnetic Scattering Problems From mgu at math.berkeley.edu Thu Sep 9 12:37:59 2010 From: mgu at math.berkeley.edu (Ming Gu) Date: Thu Sep 9 12:42:09 2010 Subject: [BANANA] LAPACK seminar on Sept. 15, 2010 Message-ID: <201009091937.o89Jbx5t019515@panda.math.berkeley.edu> Math 290, Section 29, CS 298, Section 6, Fall 2010 (Matrix Computations and Scientific Computing) We meet WEDNESDAYS 11:10 - noon in Room 380 Soda Hall, Berkeley campus. The coordinators are Profs. J. Demmel (demmel@cs.berkeley.edu) and M. Gu (mgu@math.berkeley.edu). The program will be a mixture of research talks and tutorials. The tutorials will provide a partial sequel to Math 221. For the schedule and other details about the seminar, please see math.berkeley.edu/~mgu/LAPACKSeminar.htm Date: Sept. 15 Speaker: Benjamin Stamm, UC Berkeley Title: Reduced Order Modeling for Electromagnetic Scattering Problems Abstract: This talk gives an overview of the Reduced Basis Method applied to parametrized scattering problems. Parametrized problems appear in many applications of engineering. We give a mathematical background of the model reduction by the reduced basis method. The subsequent discretization of the Electric Field Integral Equation (EFIE) is a common approach to solve scattering problems on unbounded domains which is known as the Boundary Element Method (BEM) or Method of Moments (Mom). In many applications solving the Boundary Element Method for each new parameter value is too expensive (and unnecessary). The Reduced Basis Method is an accurate, efficient and trustable algorithm in the framework of parametrized problems and in a many-query context. We will present how the Reduced Basis Method is applied to parametrized scattering problems. The novelty is that for the first time the Reduced Basis Method is applied to an integral equation. We will discuss the challenges and present numerical examples. In the second part of the talk, we will present first numerical results for multi-object scattering problems where the the parameters consist not only of the wave number, the angle and polarization of the incident plane wave but also the location of the different particles. Date: Sept. 22 Speaker: Beresford Parlett, UC Berkeley Title: Highlights from the thesis of Paul Willems on computing eigenvectors of symmetric tridiagonals From mgu at math.berkeley.edu Mon Sep 13 19:38:46 2010 From: mgu at math.berkeley.edu (Ming Gu) Date: Mon Sep 13 19:43:02 2010 Subject: [BANANA] Reminder: LAPACK seminar on Sept. 15, 2010 Message-ID: <201009140238.o8E2ckiS012076@panda.math.berkeley.edu> Math 290, Section 29, CS 298, Section 6, Fall 2010 (Matrix Computations and Scientific Computing) We meet WEDNESDAYS 11:10 - noon in Room 380 Soda Hall, Berkeley campus. The coordinators are Profs. J. Demmel (demmel@cs.berkeley.edu) and M. Gu (mgu@math.berkeley.edu). The program will be a mixture of research talks and tutorials. The tutorials will provide a partial sequel to Math 221. For the schedule and other details about the seminar, please see math.berkeley.edu/~mgu/LAPACKSeminar.htm Date: Sept. 15 Speaker: Benjamin Stamm, UC Berkeley Title: Reduced Order Modeling for Electromagnetic Scattering Problems Date: Sept. 22 Speaker: Beresford Parlett, UC Berkeley Title: Highlights from the thesis of Paul Willems on computing eigenvectors of symmetric tridiagonals From mgu at math.berkeley.edu Thu Sep 16 09:34:40 2010 From: mgu at math.berkeley.edu (Ming Gu) Date: Thu Sep 16 09:38:59 2010 Subject: [BANANA] LAPACK seminar on Sept. 22, 2010 Message-ID: <201009161634.o8GGYeTU014545@panda.math.berkeley.edu> Math 290, Section 29, CS 298, Section 6, Fall 2010 (Matrix Computations and Scientific Computing) We meet WEDNESDAYS 11:10 - noon in Room 380 Soda Hall, Berkeley campus. The coordinators are Profs. J. Demmel (demmel@cs.berkeley.edu) and M. Gu (mgu@math.berkeley.edu). The program will be a mixture of research talks and tutorials. The tutorials will provide a partial sequel to Math 221. For the schedule and other details about the seminar, please see math.berkeley.edu/~mgu/LAPACKSeminar.htm Date: Sept. 22 Speaker: Beresford Parlett, UC Berkeley Title: Highlights from the thesis of Paul Willems on computing eigenvectors of symmetric tridiagonals Abstract: This excellent thesis was filed in Wuppertal in 2010. It contains an elegant and deep analysis of triangular factorization on a symmetric tridiagonal, especially the case when 2x2 blocks occur among the pivots. Date: Sept. 29 Speaker: W. Kahan, UC Berkeley Title: A tutorial of matrix and vector norms From mgu at math.berkeley.edu Mon Sep 20 22:22:37 2010 From: mgu at math.berkeley.edu (Ming Gu) Date: Mon Sep 20 22:26:55 2010 Subject: [BANANA] Reminder: LAPACK seminar on Sept. 22, 2010 In-Reply-To: <201009161634.o8GGYeTU014545@panda.math.berkeley.edu> References: <201009161634.o8GGYeTU014545@panda.math.berkeley.edu> Message-ID: Math 290, Section 29, CS 298, Section 6, Fall 2010 (Matrix Computations and Scientific Computing) We meet WEDNESDAYS 11:10 - noon in Room 380 Soda Hall, Berkeley campus. The coordinators are Profs. J. Demmel (demmel@cs.berkeley.edu) and M. Gu (mgu@math.berkeley.edu). The program will be a mixture of research talks and tutorials. The tutorials will provide a partial sequel to Math 221. For the schedule and other details about the seminar, please see math.berkeley.edu/~mgu/LAPACKSeminar.htm Date: Sept. 22 Speaker: Beresford Parlett, UC Berkeley Title: Highlights from the thesis of Paul Willems on computing eigenvectors of symmetric tridiagonals Date: Sept. 29 Speaker: W. Kahan, UC Berkeley Title: A tutorial of matrix and vector norms From mgu at math.berkeley.edu Fri Sep 24 21:23:15 2010 From: mgu at math.berkeley.edu (Ming Gu) Date: Fri Sep 24 21:27:37 2010 Subject: [BANANA] LAPACK seminar on Sept. 29, 2010 Message-ID: <201009250423.o8P4NFwg017381@panda.math.berkeley.edu> Math 290, Section 29, CS 298, Section 6, Fall 2010 (Matrix Computations and Scientific Computing) We meet WEDNESDAYS 11:10 - noon in Room 380 Soda Hall, Berkeley campus. The coordinators are Profs. J. Demmel (demmel@cs.berkeley.edu) and M. Gu (mgu@math.berkeley.edu). The program will be a mixture of research talks and tutorials. The tutorials will provide a partial sequel to Math 221. For schedule and other details about the seminar, please visit math.berkeley.edu/~mgu/LAPACKSeminar.htm The talk by Prof. W. Kahan next week is aimed at graduate students who are starting their studies in scientific computing. Please note that you probably would benefit more from this tutorial if you could read some of the notes included in the abstract before coming to the talk. Date: Sept. 29, 2010 Speaker: Prof. W. Kahan, UC Berkeley Title: A Tutorial Overview of Vector and Matrix Norms Abstract: Intended for new graduate students whose experience as undergraduates may have prepared them inadequately to apply norms to numerical error-analysis and proofs of convergence, this tutorial surveys norms for finite-dimensional spaces in a way that may ease a transition to the infinite-dimensional spaces of Functional Analysis. The tutorial's notation is mostly standard but interpreted in ways not always taught to undergraduates, so attendees may prepare for it by reading just two of my lecture notes for Math. H110 posted at and .../pts.pdf> in that order, and then .../GEO.pdf> and .../GEOS.pdf> skimmed lightly. The tutorial will omit proofs; almost all can be found in .../NORMlite.pdf> and .../GIlite.pdf>. The tutorial's text will be posted at .../29Sept10.pdf>. Date: Oct. 06, 2010 Speaker: Prof. Jim Demmel, UC Berkeley Title: Recent Progress in Communication Avoiding Algorithm for Linear Algebra From saunders at stanford.edu Mon Sep 27 14:57:51 2010 From: saunders at stanford.edu (Michael A. Saunders) Date: Mon Sep 27 15:03:11 2010 Subject: [BANANA] LA/Opt seminar Thursday Sep 30 (Ofer Levi) Message-ID: Linear Algebra and Optimization Seminar (CME 510) iCME, Stanford University http://icme.stanford.edu/seminars/seminar.php?seminar_id=2¤t=true 4:15pm Thursday Sep 30, 2010 Y2E2 101 (NOTE NEW ROOM) http://campus-map.stanford.edu/index.cfm?ID=04-070 See small square part of Y2E2 across the road from Cypress Hall. Parking Structure 2 has free parking after 4pm. SPARSE REPRESENTATION OF ECG SIGNALS FOR PAIN ASSESSMENT Dr Ofer Levi Dept of Industrial Engineering Ben Gurion University of the Negev, Israel levio@bgu.ac.il Physiological signals such as ECG consist of mixtures of patterns and phenomena occurring at different times. Traditional signal processing and analysis methods are optimized to handle signals that include a single class of patterns, such as Fourier Representation for pure harmonics or Wavelets Representation for piece-wise smooth functions. In simplified and unreal scenarios, simple operations such as thresholding or filtering in the appropriate space can be very effective for separation of signal and noise. However, using a single representation method usually yields mediocre results on real-life signals. Matching Pursuit and Basis Pursuit use the idea of merging several different representation methods to create a so-called over-complete dictionary. These methods can decompose a signal into relatively few meaningful components by searching for the sparsest possible representation, given the right choice of dictionary. We show that such tools can provide much better insight into a heart-beat signal's basic components and their relation to different physiological states in general, and pain in particular, than traditional analysis methods based on a single dictionary. We have analyzed the inter-beat time series (known as R-R signals) measured during a controlled pain-related experiment. A simultaneous Wavelet and Fourier analysis was applied using both Orthogonal Matching Pursuit and Basis Pursuit to project all wavelet-like features into the wavelet domain and Fourier-like features into the frequency domain. The analysis clearly reveals pain-related events, and our proposed method outperforms traditional spectral analysis methods with respect to both sensitivity and time delay. Joint work with Tobias Moeller and Shai Tejman-Yarden (UC San Diego) Michael Saunders (Stanford University) If time allows I may also present the application of finding sparse solutions to the 2D inverse problem in NMR scans of materials. Joint work with the Zeev Weisman group (Ben-Gurion University). ----------------------------------------------------------------- NOTE: This is the first LA/Opt seminar of fall quarter. Seminars are usually announced a few days ahead with a reminder on the day. Some weeks there will be no seminar. From mgu at math.berkeley.edu Tue Sep 28 08:53:46 2010 From: mgu at math.berkeley.edu (Ming Gu) Date: Tue Sep 28 09:27:07 2010 Subject: [BANANA] Reminder: [lapackers] LAPACK seminar on Sept. 29, 2010 In-Reply-To: <201009250423.o8P4NFwg017381@panda.math.berkeley.edu> References: <201009250423.o8P4NFwg017381@panda.math.berkeley.edu> Message-ID: Math 290, Section 29, CS 298, Section 6, Fall 2010 (Matrix Computations and Scientific Computing) We meet WEDNESDAYS 11:10 - noon in Room 380 Soda Hall, Berkeley campus. The coordinators are Profs. J. Demmel (demmel@cs.berkeley.edu) and M. Gu (mgu@math.berkeley.edu). The program will be a mixture of research talks and tutorials. The tutorials will provide a partial sequel to Math 221. For schedule and other details about the seminar, please visit math.berkeley.edu/~mgu/LAPACKSeminar.htm The talk by Prof. W. Kahan next week is aimed at graduate students who are starting their studies in scientific computing. Please note that you probably would benefit more from this tutorial if you could read some of the notes included in the abstract before coming to the talk. Date: Sept. 29, 2010 Speaker: Prof. W. Kahan, UC Berkeley Title: A Tutorial Overview of Vector and Matrix Norms Date: Oct. 06, 2010 Speaker: Prof. Jim Demmel, UC Berkeley Title: Recent Progress in Communication Avoiding Algorithm for Linear Algebra From mgu at math.berkeley.edu Wed Sep 29 23:35:31 2010 From: mgu at math.berkeley.edu (Ming Gu) Date: Wed Sep 29 23:40:19 2010 Subject: [BANANA] LAPACK seminar on Oct. 6, 2010 Message-ID: <201009300635.o8U6ZV6Y029010@panda.math.berkeley.edu> Math 290, Section 29, CS 298, Section 6, Fall 2010 (Matrix Computations and Scientific Computing) We meet WEDNESDAYS 11:10 - noon in Room 380 Soda Hall, Berkeley campus. The coordinators are Profs. J. Demmel (demmel@cs.berkeley.edu) and M. Gu (mgu@math.berkeley.edu). The program will be a mixture of research talks and tutorials. The tutorials will provide a partial sequel to Math 221. For the schedule and other details about the seminar, please see math.berkeley.edu/~mgu/LAPACKSeminar.htm Date: Oct. 6, 2010 Speaker: Prof. Jim Demmel, UC Berkeley Title: Recent Progress in Communication Avoiding Algorithm for Linear Algebra Abstract: We discuss recent progress, and obstacles, in both lower bounds and upper bounds for various problems in numerical linear algebra. Date: Oct. 13, 2010 Speaker: Erich Strohmaier, Lawrence Berkeley Lab From saunders at stanford.edu Thu Sep 30 14:00:22 2010 From: saunders at stanford.edu (Michael A. Saunders) Date: Thu Sep 30 14:00:52 2010 Subject: [BANANA] LA/Opt seminar TODAY (Ofer Levi) Message-ID: Reminder: Linear Algebra and Optimization Seminar (CME 510) iCME, Stanford University http://icme.stanford.edu/seminars/seminar.php?seminar_id=2¤t=true 4:15pm Thursday Sep 30, 2010 Y2E2 101 (NOTE NEW ROOM) http://campus-map.stanford.edu/index.cfm?ID=04-070 See small square part of Y2E2 across the road from Cypress Hall. Parking Structure 2 has free parking after 4pm. SPARSE REPRESENTATION OF ECG SIGNALS FOR PAIN ASSESSMENT Dr Ofer Levi Dept of Industrial Engineering Ben Gurion University of the Negev, Israel levio@bgu.ac.il Physiological signals such as ECG consist of mixtures of patterns and phenomena occurring at different times. Traditional signal processing and analysis methods are optimized to handle signals that include a single class of patterns, such as Fourier Representation for pure harmonics or Wavelets Representation for piece-wise smooth functions. In simplified and unreal scenarios, simple operations such as thresholding or filtering in the appropriate space can be very effective for separation of signal and noise. However, using a single representation method usually yields mediocre results on real-life signals. Matching Pursuit and Basis Pursuit use the idea of merging several different representation methods to create a so-called over-complete dictionary. These methods can decompose a signal into relatively few meaningful components by searching for the sparsest possible representation, given the right choice of dictionary. We show that such tools can provide much better insight into a heart-beat signal's basic components and their relation to different physiological states in general, and pain in particular, than traditional analysis methods based on a single dictionary. We have analyzed the inter-beat time series (known as R-R signals) measured during a controlled pain-related experiment. A simultaneous Wavelet and Fourier analysis was applied using both Orthogonal Matching Pursuit and Basis Pursuit to project all wavelet-like features into the wavelet domain and Fourier-like features into the frequency domain. The analysis clearly reveals pain-related events, and our proposed method outperforms traditional spectral analysis methods with respect to both sensitivity and time delay. Joint work with Tobias Moeller and Shai Tejman-Yarden (UC San Diego) Michael Saunders (Stanford University) If time allows I may also present the application of finding sparse solutions to the 2D inverse problem in NMR scans of materials. Joint work with the Zeev Weisman group (Ben-Gurion University). ----------------------------------------------------------------- NOTE: This is the first LA/Opt seminar of fall quarter. Seminars are usually announced a few days ahead with a reminder on the day. Some weeks there will be no seminar.