
NSF Org: |
CCF Division of Computing and Communication Foundations |
Recipient: |
|
Initial Amendment Date: | May 19, 2017 |
Latest Amendment Date: | May 19, 2017 |
Award Number: | 1735572 |
Award Instrument: | Standard Grant |
Program Manager: |
Balasubramanian Kalyanasundaram
CCF Division of Computing and Communication Foundations CSE Directorate for Computer and Information Science and Engineering |
Start Date: | June 1, 2017 |
End Date: | May 31, 2018 (Estimated) |
Total Intended Award Amount: | $15,000.00 |
Total Awarded Amount to Date: | $15,000.00 |
Funds Obligated to Date: |
|
History of Investigator: |
|
Recipient Sponsored Research Office: |
2221 UNIVERSITY AVE SE STE 100 MINNEAPOLIS MN US 55414-3074 (612)624-5599 |
Sponsor Congressional District: |
|
Primary Place of Performance: |
200 Oak st SE Minneapolos MN US 55455-2070 |
Primary Place of
Performance Congressional District: |
|
Unique Entity Identifier (UEI): |
|
Parent UEI: |
|
NSF Program(s): |
COMPUTATIONAL MATHEMATICS, Information Technology Researc, Algorithmic Foundations |
Primary Program Source: |
|
Program Reference Code(s): |
|
Program Element Code(s): |
|
Award Agency Code: | 4900 |
Fund Agency Code: | 4900 |
Assistance Listing Number(s): | 47.070 |
ABSTRACT
This award supports travel and participation for 15 US-based students and postdoctoral scholars to the 10th International Conference on Preconditioning Techniques for Scientific and Industrial Applications, which will be held July 31st to August 2nd, 2017 at the University of British Columbia in Vancouver, Canada. The conference itself has support from the Pacific Institute for Mathematical Sciences (PIMS); this award is co-funded by NSF CISE CCF and MPS DMS.
Scientific and engineering analysis and simulation tasks are often modeled as large systems of equations to be solved; increasingly, these are solved by iterative methods that refine initial guesses. Preconditioning techniques bias the refinements for faster convergence -- they can use quite deep mathematical connections to the sparsity and structure of the matrices that represent the equations.
These Preconditioning meetings gather participants from academia, research labs, and industry. (E.g., due to location and topic, a large group are expected from Boeing in Washington.) The resulting mix of participants leads to a healthy exchange of ideas ? with practitioners bringing new, harder, problems to the fore as well as specialized algorithms for handling them, while the algorithms developers and theory researchers emphasize analysis and rigor in what they present. This interaction benefits students who may consider careers in any of these areas.
PROJECT OUTCOMES REPORT
Disclaimer
This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.
Many scientific and engineering calculations require solving very large systems of linear equations. For example, fluid flow equations such as those encountered in standard three dimensional aerodynamics simulations lead to systems that typically have tens of millions of unknowns. These systems are sparse in that each equation involves a small number of unknowns. A traditional, and generally robust, way to solve such systems is to rely on direct factorization but this approach becomes prohibitively expensive as the problem increases in size. The consensus now is that iterative methods, i.e., methods that approximate the solution by an iterative process, are mandatory when dealing with large systems such as those that arise from 3-D simulations. Among standard iterative methods, those based on a combination of preconditioning and projection on Krylov subspaces are quite popular due to their excellent compromise betweeng enerality and efficiency. A preconditioner is any inexpensive process to obtain an approximate solution to the original system. For example, common preconditining techniques are those based on Incomplete LU (ILU) factorizations that approximately factor the original matrix into the product of a lower triangular matrix L and an upper triangular matrix U. Preconditioning is the most important ingredient of an iterative solution method and research on developing effective preconditioners has been consistently active and flourishing for several decades now. Its themes vary from preconditioners for specific applications, to highly parallel techniques, divide-and-conquer type methods, and theoretical aspects on convergence analysis.
The `Preconditioning' series of conferences which started in the Twin cities, MN, in 1999, address all these themes and many more. The conference takes place every other year and attracts around 100 delegates worldwide on average. The 10th of these meetings, `Preconditioning 2017' was held at the University of British Columbia (Vancouver) from July 31 to August 2, 2017. The goal of the NSF funding was to provide financial support for a few US-based participants to this conference, giving priority to junior and under-represented groups. Of the 10 participants supported, three were female (two students and a post-doc), two were from under-represented groups (one African American, one Hispanic), and one came from a community college. In addition, nine out of these ten participants satisfied our definition of 'junior' participant, that is a researcher who is still a graduate student or obtained her/his doctorate no more than 6 years prior to the meeting. Finally, three of the ten were invited speakers. The positive impact of this support on the careers of these individuals, especially the students, and the junior awardees, is clear. Indeed, without financial support, most of them would not have been able to attend this important gathering. The grant also had an excellent impact on the conference itself by boosting participation, even if slightly, and by improving the diversity of the participants.
Last Modified: 04/18/2018
Modified by: Yousef Saad
Please report errors in award information by writing to: awardsearch@nsf.gov.