You are here

ROBUST AND FAST NUMERICAL GRID GENERATION

Award Information
Agency: National Science Foundation
Branch: N/A
Contract: N/A
Agency Tracking Number: 14306
Amount: $49,783.00
Phase: Phase I
Program: SBIR
Solicitation Topic Code: N/A
Solicitation Number: N/A
Timeline
Solicitation Year: N/A
Award Year: 1991
Award Start Date (Proposal Award Date): N/A
Award End Date (Contract End Date): N/A
Small Business Information
P.o. Box 87198
Albuquerque, NM 87198
United States
DUNS: N/A
HUBZone Owned: No
Woman Owned: No
Socially and Economically Disadvantaged: No
Principal Investigator
 Patrick M. Knupp
 Staff Scientist
 () -
Business Contact
Phone: () -
Research Institution
N/A
Abstract

NUMERICAL GRID-GENERATION ALGORITHMS ARE BECOMING MORE CRITICAL DUE TO THE NEED FOR DETAILED MODELING OF THE GEOMETRY OF THE PHYSICAL DOMAIN AND AS PART OF SOLUTION-ADAPTIVE ALGORITHMS. CURRENT PLANAR GRID GENERATION ALGORITHMS ARE NOT ROBUST BECAUSE THEY FREQUENTLY PRODUCE SKEWED OR FOLDED GRIDS. THESE PROBLEMS CAN BE CORRECTED BY TRIAL AND ERROR MODIFICATIONS (E.G., TO THE SOURCE TERM OF A POISSON EQUATION), BUT THE PROCEDURE IS FAR FROM AUTOMATIC. MATHEMATICAL ANALYSIS WILL BE USED TO CLARIFY THE LIMITATIONS OF CURRENT ALGORITHMS AND TO SUGGEST NEW ALGORITHMS. THE BEST ALGORITHMS WILL BE INCORPORATED INTO USER-FRIENDLY AUTOMATIC GRID-GENERATION CODES WHICH WILL HAVE: A COMMON INTERFACE; NAMELIST INPUT; INTERACTIVE GRAPHICS; A LIBRARY OF GEOMETRIES; AND TEST PROBLEMS. THE CODES WILL BE DESIGNED TO RUN ON PARALLEL AND VECTOR COMPUTERS. ECODYNAMICS CURRENTLY POSSESSES THE MOST ROBUST SURFACE GRID GENERATION SOFTWARE AVAILABLE AND SEEKS TO EXTEND AND IMPROVE THIS CAPABILITY AS WELL.

* Information listed above is at the time of submission. *

US Flag An Official Website of the United States Government