GLOBAL OPTIMIZATION IN COMPUTATIONAL CHEMISTRY USING INTERVAL ARITHMETIC

Award Information
Agency:
National Science Foundation
Branch
n/a
Amount:
$49,770.00
Award Year:
1992
Program:
SBIR
Phase:
Phase I
Contract:
n/a
Agency Tracking Number:
17410
Solicitation Year:
n/a
Solicitation Topic Code:
n/a
Solicitation Number:
n/a
Small Business Information
Scientific Computing Asso
One Century Tower, 265 Church St, New Haven, CT, 06510
Hubzone Owned:
N
Socially and Economically Disadvantaged:
N
Woman Owned:
N
Duns:
n/a
Principal Investigator:
Dr. Andrew H. Sherman
Dir Of Technology Development
(203) 777-7442
Business Contact:
() -
Research Institution:
n/a
Abstract
GLOBAL OPTIMIZATION PLAYS A KEY ROLE IN MOLECULAR COMPUTATIONS IN COMPUTATIONAL CHEMISTRY. DUE TO THE LARGE SIZE OF EVEN MODEST MOLECULES, THESE METHODS MUST CONTEND WITH COUNTLESS LOCAL MINIMA. CLEVER ALGORITHMS HAVE BEEN DEVELOPED THAT SAMPLE PARAMETER SPACE TO REDUCE TRAPPING IN LOCAL MINIMA, BUT THESE FAIL BY PROVIDING STATISTICAL RATHERTHAN GUARANTEED SOLUTIONS. THERE IS A CLASS OF ALGORITHMS THAT FOR CERTAIN FUNCTIONS GUARANTEE THAT A GLOBAL MINIMUM HAS BEEN FOUND. THESE METHODS ACHIEVE THIS REMARKABLE RESULT USING INTERVAL ARITHMETIC. INTERVAL GLOBAL OPTIMIZATION HAS BEEN KNOWN FORSOME TIME, BUT HAS NEVER BEEN APPLIED TO SYSTEMS AS LARGE ASTHOSE ENCOUNTERED IN COMPUTATIONAL CHEMISTRY. THE PROPOSED RESEARCH WILL IDENTIFY HOW TO MODIFY THE FUNCTIONS ENCOUNTERED IN COMPUTATIONAL CHEMISTRY SUCH THAT INTERVAL GLOBAL ANALYSIS APPLIES. WE WILL ALSO EXPLORE THE PARALLEL PROGRAMMING TECHNIQUES NECESSARY TO SCALE THE CALCULATIONS UP TO THE HUGE SIZES DEMANDED BY MOLECULAR MECHANICS CALCULATIONS.

* information listed above is at the time of submission.

Agency Micro-sites

US Flag An Official Website of the United States Government