Search NASA⌕ Search

SEARCH · Search NASA

Results for “Robust solver”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 199 records · Page 11

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗

Spectrally Stabilized Interface Capturing Formulation and Implementation in Nek5000/NekRS

This report documents the formulation of a novel level-set method for incompressible two-phase flows in the continuous Galerkin (CG) high order spectral element framework. The overall method hinges on a novel implementation of the spectral vanishing viscosity (SVV) operator for the stabilization of linear/non-linear hyperbolic problems. The multidimensional SVV convolution kernels, which in essence, have a similar effect as a high pass filter applied to the derivatives, are formulated by exploiting the tensor product form, analogous to the construction of the usual stiffness matrix system. The resulting kernels are directionally decoupled and ensure a linear, symmetric positive definite, elliptic matrix operator. The SVV formulation is demonstrated to provide a robust stabilizing mechanism through challenging linear and non-linear hyperbolic problems, including problems pertinent to the level-set formulation. The two-phase framework conceptualized herein is based on the conservative level-set (CLS) method which represents the interface between the fluids by the 0.5 iso-contour of the smoothed Heaviside function. The CLS method is augmented with a preconditioning procedure for interface normals using the signed distance function which precludes the manifestation of spurious oscillations in the vicinty of the interface. Further, the existing mixed explicit-implicit approach for the solution of Navier-Stokes equations in Nek5000, as described in Tomboulides et al, is augmented with a pressure coefficient splitting approach for the Poisson equation, which greatly accelerated the convergence of pressure solver for two-phase systems with large density ratio. The robustness and accuracy of the overall two-phase method is demonstrated through canonical challenging problems involving high density and viscosity ratios, with and without surface tension. The two-phase formulation is wholly implemented in Nek5000 and the SVV stabilization method is implemented in NekRS, which is the essential precursor to the two-phase framework, undergoing active development.

97 MATHEMATICS AND COMPUTING↗

Extension of the Time-Spectral Approach to Overset Solvers for Arbitrary Motion

Forced periodic flows arise in a broad range of aerodynamic applications such as rotorcraft, turbomachinery, and flapping wing configurations. Standard practice involves solving the unsteady flow equations forward in time until the initial transient exits the domain and a statistically stationary flow is achieved. It is often required to simulate through several periods to remove the initial transient making unsteady design optimization prohibitively expensive for most realistic problems. An effort to reduce the computational cost of these calculations led to the development of the Harmonic Balance method [1, 2] which capitalizes on the periodic nature of the solution. The approach exploits the fact that forced temporally periodic flow, while varying in the time domain, is invariant in the frequency domain. Expanding the temporal variation at each spatial node into a Fourier series transforms the unsteady governing equations into a steady set of equations in integer harmonics that can be tackled with the acceleration techniques afforded to steady-state flow solvers. Other similar approaches, such as the Nonlinear Frequency Domain [3,4,5], Reduced Frequency [6] and Time-Spectral [7, 8, 9] methods, were developed shortly thereafter. Additionally, adjoint-based optimization techniques can be applied [10, 11] as well as frequency-adaptive methods [12, 13, 14] to provide even more flexibility to the method. The Fourier temporal basis functions imply spectral convergence as the number of harmonic modes, and correspondingly number of time samples, N, is increased. Some elect to solve the equations in the frequency domain directly, while others choose to transform the equations back into the time domain to simplify the process of adding this capability to existing solvers, but each harnesses the underlying steady solution in the frequency domain. These temporal projection methods will herein be collectively referred to as Time-Spectral methods. Time-Spectral methods have demonstrated marked success in reducing the computational costs associated with simulating periodic forced flows, but have yet to be fully applied to overset or Cartesian solvers for arbitrary motion with dynamic hole-cutting. Overset and Cartesian grid methodologies are versatile techniques capable of handling complex geometry configurations in practical engineering applications, and the combination of the Time-Spectral approach with this general capability potentially provides an enabling new design and analysis tool. In an arbitrary moving-body scenario for these approaches, a Lagrangian body moves through a fixed Eulerian mesh and mesh points in the Eulerian mesh interior to the solid body are removed (cut or blanked), leaving a hole in the Eulerian mesh. During the dynamic motion some gridpoints in the domain are blanked and do not have a complete set of time-samples preventing a direct implementation of the Time-Spectral method. Murman[6] demonstrated the Time-Spectral approach for a Cartesian solver with a rigid domain motion, wherein the hole cutting remains constant. Similarly, Custer et al. [15, 16] used the NASA overset OVERFLOW solver and limited the amount of relative motion to ensure static hole-cutting and interpolation. Recently, Mavriplis and Mundis[17] demonstrated a qualitative method for applying the Time-Spectral approach to an unstructured overset solver for arbitrary motion. The goal of the current work is to develop a robust and general method for handling arbitrary motion with the Time-Spectral approach within an overset or Cartesian mesh method, while still approaching the spectral convergence rate of the original Time-Spectral approach. The viscous OVERFLOW solver will be augmented with the new Time-Spectral algorithm and the capability of the method for benchmark problems in rotorcraft and turbomachinery will be demonstrated. This abstract begins with a brief synopsis of the Time-Spectral approach for overset grids and provides details of e current approach to allow for arbitrary motion. Model problem results in one and two dimensions are included to demonstrate the viability of the method and the convergence properties. Section IV briefly outlines the implementation into the OVERFLOW solver, and the abstract closes with a description of the benchmark test cases which will be included in the final paper.

Leffell, Joshua Isaac↗

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗

Best Practices for Unstructured Grid Shock Fitting

Unstructured grid solvers have well-known issues predicting surface heat fluxes when strong shocks are present. Various efforts have been made to address the underlying numerical issues that cause the erroneous predictions. The present work addresses some of the shortcomings of unstructured grid solvers, not by addressing the numerics, but by applying structured grid best practices to unstructured grids. A methodology for robust shock detection and shock fitting is outlined and applied to production relevant cases. Results achieved by using the Loci-CHEM Computational Fluid Dynamics solver are provided.

McCloud, Peter L.↗

Grain2mesh: A Python and cubit mesh generator from unprocessed mesoscale images

Predicting bulk behavior from microscale features constitutes a key objective in multiscale modeling research, often involving numerical models composed of finite elements that capture the diversity of constituent phases, shapes, and orientations within the material. The Grain2mesh toolbox allows the user to input unprocessed mesoscopic images for automatic segmentation, pre-processing, quality control, and numerical mesh generation. The numerical mesh generation incorporates Cubit routines to generate robust multi-phase mesh structure for use in computational mechanics solvers. The python classes developed contain detailed documentation and examples to support standard usage and case-specific alternative options.

58 GEOSCIENCES↗

Gas-Kinetic Theory Based Flux Splitting Method for Ideal Magnetohydrodynamics

A gas-kinetic solver is developed for the ideal magnetohydrodynamics (MHD) equations. The new scheme is based on the direct splitting of the flux function of the MHD equations with the inclusion of "particle" collisions in the transport process. Consequently, the artificial dissipation in the new scheme is much reduced in comparison with the MHD Flux Vector Splitting Scheme. At the same time, the new scheme is compared with the well-developed Roe-type MHD solver. It is concluded that the kinetic MHD scheme is more robust and efficient than the Roe- type method, and the accuracy is competitive. In this paper the general principle of splitting the macroscopic flux function based on the gas-kinetic theory is presented. The flux construction strategy may shed some light on the possible modification of AUSM- and CUSP-type schemes for the compressible Euler equations, as well as to the development of new schemes for a non-strictly hyperbolic system.

Xu, Kun↗

A Quasi-3-D Theory for Impedance Eduction in Uniform Grazing Flow

A 2-D impedance eduction methodology is extended to quasi-3-D sound fields in uniform or shearing mean flow. We introduce a nonlocal, nonreflecting boundary condition to terminate the duct and then educe the impedance by minimizing an objective function. The introduction of a parallel, sparse, equation solver significantly reduces the wall clock time for educing the impedance when compared to that of the sequential band solver used in the 2-D methodology. The accuracy, efficiency, and robustness of the methodology is demonstrated using two examples. In the first example, we show that the method reproduces the known impedance of a ceramic tubular test liner. In the second example, we illustrate that the approach educes the impedance of a four-segment liner where the first, second, and fourth segments consist of a perforated face sheet bonded to honeycomb, and the third segment is a cut from the ceramic tubular test liner. The ability of the method to educe the impedances of multisegmented liners has the potential to significantly reduce the amount of time and cost required to determine the impedance of several uniform liners by allowing them to be placed in series in the test section and to educe the impedance of each segment using a single numerical experiment. Finally, we probe the objective function in great detail and show that it contains a single minimum. Thus, our objective function is ideal for use with local, inexpensive, gradient-based optimizers.

Watson, W. R.↗

Walking the Filament of Feasibility: Global Optimization of Highly-Constrained, Multi-Modal Interplanetary Trajectories Using a Novel Stochastic Search Technique

Interplanetary trajectory optimization problems are highly complex and are characterized by a large number of decision variables and equality and inequality constraints as well as many locally optimal solutions. Stochastic global search techniques, coupled with a large-scale NLP solver, have been shown to solve such problems but are inadequately robust when the problem constraints become very complex. In this work, we present a novel search algorithm that takes advantage of the fact that equality constraints effectively collapse the solution space to lower dimensionality. This new approach walks the filament'' of feasibility to efficiently find the global optimal solution.

Englander, Arnold C.↗

Walking the Filament of Feasibility: Global Optimization of Highly-Constrained, Multi-Modal Interplanetary Trajectories Using a Novel Stochastic Search Technique

Interplanetary trajectory optimization problems are highly complex and are characterized by a large number of decision variables and equality and inequality constraints as well as many locally optimal solutions. Stochastic global search techniques, coupled with a large-scale NLP solver, have been shown to solve such problems but are inadequately robust when the problem constraints become very complex. In this work, we present a novel search algorithm that takes advantage of the fact that equality constraints effectively collapse the solution space to lower dimensionality. This new approach walks the filament'' of feasibility to efficiently find the global optimal solution.

Englander, Arnold C.↗

Improvements in Iterative Convergence of FUN3D Solutions

This paper presents a hierarchical adaptive nonlinear iteration method (HANIM) implemented in the NASA computational fluid dynamics code, FUN3D, to improve robustness and computational efficiency. In contrast to the legacy FUN3D iterative solver that relies on an approximate Jacobian, a simple multicolor Gauss-Seidel point-implicit iteration scheme, and linear Courant-Friedrichs-Lewy number (CFL) ramping, HANIM is based upon a hierarchy of modules including preconditioner, generalized conjugate residual, realizability check, nonlinear control, and CFL adaption modules. HANIM performance is systematically compared with the performance of the legacy solver of FUN3D and a baseline solver based on a preconditioner alone. Iterative solutions are compared for three benchmark cases: a subsonic separated flow around a hemisphere cylinder, a supersonic flow through a long duct, and a subsonic flow over the NASA wing-fuselage juncture model. Two Reynolds-averaged Navier-Stokes turbulence models are used in these computations, namely, the negative variant of the linear one-equation Spalart-Allmaras model and its nonlinear extension based on quadratic constitutive relations.

CFD↗

A robust and efficient finite volume method for compressible inviscid and viscous two-phase flows [A robust and efficient finite volume method for compressible viscous two-phase flows]

A robust and efficient density-based finite volume method is developed for solving the six-equation single pressure system of two-phase flows at all speeds on hybrid unstructured grids. Unlike conventional approaches where an expensive exact Riemann solver is normally required for computing numerical fluxes at the two-phase interfaces in addition to AUSM-type fluxes for single-phase interfaces in order to maintain stability and robustness in cases involving interactions of strong pressure and void-fraction discontinuities, a volume-fraction coupling term for the AUSM + -up fluxes is introduced in this work to impart the required robustness without the need of the exact Riemann solver. The resulting method is significantly less expensive in regions where otherwise the Riemann solver would be invoked. A transformation from conservative variables to primitive variables is presented and the primitive variables are then solved in the implicit method in order for the current finite volume method to be able to solve, effectively and efficiently, low Mach number flows in traditional multiphase applications, which otherwise is a great challenge for the standard density-based algorithms. Here, a number of benchmark test cases are presented to assess the performance and robustness of the developed finite volume method for both inviscid and viscous two-phase flow problems. The numerical results indicate that the current density-based method provides an attractive and viable alternative to its pressure-based counterpart for compressible two-phase flows at all speeds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-Order Methods in NASA’s Next Generation of Computational Fluid Dynamics Tools

The missions of the National Aeronautics and Space Administration (NASA) routinely produce unique requirements and challenges for development and application of Computational Fluid Dynamics (CFD) methods. NASA presently embodies four distinct Mission Directorates: Aeronautics Research, Exploration Systems, Science, and Space Operations. These missions generate requirements for systems that operate in a wide variety of environments. They range from the high-speed flight of aerodynamically optimized vehicles operating in the earth’s atmosphere to spacecraft designed for missions that don’t favor aerodynamic optimization, some operating in the atmosphere of planets and planetary moons such as Mars and Venus or Saturn’s moon Titan. Systems supporting these vehicles, such as rocket and jet propulsion, reaction control systems, fluid and thermal transfer systems, etc. can also generate their own unique set of flow phenomena that challenge today’s CFD methodology. Through the NASA Engineering and Safety Center (NESC), NASA annually conducts state-of-the-discipline assessments in fifteen distinct engineering disciplines. These assessments are performed by the NASA Technical Fellows that lead Technical Discipline Teams (TDT) of recognized experts in these fifteen areas. In the Aerosciences discipline, three topics have been identified as the top challenges for the discipline: aero-plume interaction prediction, unsteady separated flows, and aerothermodynamic prediction. These challenge areas are defined by the Agency’s high-risk projects and problems on which the NESC is requested to perform independent testing, analysis, and assessments. When viewed as a whole, these tests, analyses, and assessments provide a clear view of the recurring technical challenges facing Agency engineers and researchers and can be used to guide future research and technology development. The present state-of-the-art in the application of CFD at NASA is the use of Reynolds-Averaged Navier- Stokes (RANS) solvers, primarily executed in a steady-state mode of operation. In isolated cases, Unsteady RANS (URANS) solvers have been employed when steady RANS solutions produce poorly converging or oscillating results or in cases, such as aeroelastic analysis, which require unsteady aerodynamic simulation. For most traditional external and internal aerodynamic flows, structured overset grids or unstructured grids are employed to minimize geometric modeling and grid generation times. Grid adaptation, primarily as a series of coarse-grain intermediate processing steps is also seeing use on particularly complex flow problems and configurations. In the case of aerothermodynamic flows, engineers have been forced to continue to employ structured grid techniques as the present unstructured grid methodology has proven inadequate in the prediction of surface heating. In the area of aero-plume interaction modeling, two-gas, frozen chemistry simulation is generally the state-of-the- art, with some production solvers capable of predicting flows with only a single gas component. Prediction of flows falling into the afore-mentioned top Aerosciences technical challenges have severely stressed the present state-of-the-art in CFD prediction and for some problems, such as unsteady separated flows and aero-plume interaction cases, engineers have begun employing Large Eddy Simulation (LES) and Hybrid RANS/LES techniques. In some isolated aero-propulsion interaction cases, chemically reacting flow simulations have been applied. These methods are highly evolutionary and engineers have little experience in their application, so they cannot be heavily relied upon in today’s application environment. Therefore, this leads one to muse over which numerical technologies will be included in the CFD tools that will be employed 30 years in the future. This presentation will describe specific technical problems that have stressed NASA’s traditional CFD methods to their breaking point and will link these issues to the Agency’s top Aerosciences technical challenges. The discussion will then shift to the characteristics of future CFD solvers that will be required to attack these challenges and how these characteristics differ from the present state-of-the- art. High-order methods certainly appear to have a place in the development of future CFD tools and some of the physical characteristics of our most challenging problems suggest that high-order methods are the only way to effectively solve them. But there are some relatively severe implementation issues that face these methods, particularly in the area of general applicability and robust operation as an engineering tool. Desired characteristics of next-generation CFD solvers will be discussed and the author’s view of which emerging numerical technologies might be employed to address these attributes will also be presented

David M Schuster↗

A Multi-Level Parallelization Concept for High-Fidelity Multi-Block Solvers

The integration of high-fidelity Computational Fluid Dynamics (CFD) analysis tools with the industrial design process benefits greatly from the robust implementations that are transportable across a wide range of computer architectures. In the present work, a hybrid domain-decomposition and parallelization concept was developed and implemented into the widely-used NASA multi-block Computational Fluid Dynamics (CFD) packages implemented in ENSAERO and OVERFLOW. The new parallel solver concept, PENS (Parallel Euler Navier-Stokes Solver), employs both fine and coarse granularity in data partitioning as well as data coalescing to obtain the desired load-balance characteristics on the available computer platforms. This multi-level parallelism implementation itself introduces no changes to the numerical results, hence the original fidelity of the packages are identically preserved. The present implementation uses the Message Passing Interface (MPI) library for interprocessor message passing and memory accessing. By choosing an appropriate combination of the available partitioning and coalescing capabilities only during the execution stage, the PENS solver becomes adaptable to different computer architectures from shared-memory to distributed-memory platforms with varying degrees of parallelism. The PENS implementation on the IBM SP2 distributed memory environment at the NASA Ames Research Center obtains 85 percent scalable parallel performance using fine-grain partitioning of single-block CFD domains using up to 128 wide computational nodes. Multi-block CFD simulations of complete aircraft simulations achieve 75 percent perfect load-balanced executions using data coalescing and the two levels of parallelism. SGI PowerChallenge, SGI Origin 2000, and a cluster of workstations are the other platforms where the robustness of the implementation is tested. The performance behavior on the other computer platforms with a variety of realistic problems will be included as this on-going study progresses.

Hatay, Ferhat F.↗

Implementing Ordinary Differential Equation Solvers in Rust Programming Language for Modeling Vehicle Powertrain Systems: Preprint

Efficient and accurate ordinary differential equation (ODE) solvers are necessary for powertrain and vehicle dynamics modeling. However, current commercial ODE solvers can be financially prohibitive, leading to a need for accessible, effective, open-source ODE solvers designed for powertrain modeling. Rust is a compiled programming language that has the potential to be used for fast and easy-to-use powertrain models, given its exceptional computational performance, robust package ecosystem, and short time required for modelers to become proficient. However, of the three commonly used (>3,000 downloads) packages in Rust with ODE solver capabilities, only one has more than four numerical methods implemented, and none are designed specifically for modeling physical systems. Therefore, the goal of the Differential Equation System Solver (DESS) was to implement accurate ODE solvers in Rust designed for the component-based problems often seen in powertrain modeling. DESS is a text-based software package that provides a flexible framework for building and solving systems of ODEs. This allows DESS to be included as a dependency for automotive powertrain models that require a variety of solvers and solver configurations. Seven explicit ODE solver methods have been implemented in DESS: Euler’s, Heun’s, midpoint, Ralston’s, classic Runge-Kutta, Bogacki-Shampine, and Cash-Karp. These represent five fixed-step methods and two adaptive-step methods. This paper shows that the solver implementations increase accuracy and computational efficiency compared to Euler's method when modeling a system of three thermal masses in Rust. DESS also includes features designed for modeling component-based physical systems. Users can define relationships between nodes in their system, which the package then translates into a system of equations, leading to simpler and more intuitive code. In the case of a three-thermal-mass system, the user can specify node thermal properties (e.g., thermal capacitance), how nodes are interconnected, and thermal conductance between nodes rather than providing a system of equations. The core contribution from this work is an open-source, text-based Rust package with ODE solvers for automotive powertrain modeling to support cost-free, fast, and accurate simulation.

ADVANCED PROPULSION SYSTEMS↗

Distributed Optimization for Nonrigid Nano-Tomography

Resolution level and reconstruction quality in nano-computed tomography (nano-CT) are in part limited by the stability of microscopes, because the magnitude of mechanical vibrations during scanning becomes comparable to the imaging resolution, and the ability of the samples to resist radiation induced deformations during data acquisition. In such cases, there is no incentive in recovering the sample state at different time steps like in time-resolved reconstruction methods, but instead the goal is to retrieve a single reconstruction at the highest possible spatial resolution and without any imaging artifacts. Here we propose a distributed optimization solver for tomographic imaging of samples at the nanoscale. Our approach solves the tomography problem jointly with projection data alignment, nonrigid sample deformation correction, and regularization. Projection data consistency is regulated by dense optical flow estimated by Farneback's algorithm, leading to sharp sample reconstructions with less artifacts. Synthetic data tests show robustness of the method to Poisson and low-frequency background noise. We accelerated the solver on multi-GPU systems and validated the method on three nano-imaging experimental data sets.

97 MATHEMATICS AND COMPUTING↗

Parallelization of a Parabolized Navier-Stokes Solver with a Design Optimizer

The design of future supersonic aircraft, such as the High Speed Civil Transport (HSCT), will rely heavily on computational methods for aircraft design and the prediction of the complex aerodynamics encountered in flight. Parabolized Navier-Stokes (PNS) equation flow solvers are recognized as efficient and accurate computational tools for the solution of supersonic and hypersonic flow-fields, while design optimizers have the potential to be valuable tools within the overall design process. Presently, however, the execution of the flow solver in conjunction with a design optimizer presents a computationally intensive and formidable problem. To meet the challenges and increasing demand for multidisciplinary numerical tools which are faster, more robust and provide greater functionality, alternative strategies are explored to increase computational throughput by coupling a design optimizer and flow solver in a parallel processing environment. To address this problem the parallel processing of a PNS flow solver with a nonlinear constraint design optimizer is investigated as an alternative computational method.

Pallis, J. M.↗