Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit method”

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 1,171 records · Page 65

Non-Intrusive Inference Reduced Order Model for Fluids Using Deep Multistep Neural Network

In this effort we propose a data-driven learning framework for reduced order modeling of fluid dynamics. Designing accurate and efficient reduced order models for nonlinear fluid dynamic problems is challenging for many practical engineering applications. Classical projection-based model reduction methods generate reduced systems by projecting full-order differential operators into low-dimensional subspaces. However, these techniques usually lead to severe instabilities in the presence of highly nonlinear dynamics, which dramatically deteriorates the accuracy of the reduced-order models. In contrast, our new framework exploits linear multistep networks, based on implicit Adams–Moulton schemes, to construct the reduced system. The advantage is that the method optimally approximates the full order model in the low-dimensional space with a given supervised learning task. Moreover, our approach is non-intrusive, such that it can be applied to other complex nonlinear dynamical systems with sophisticated legacy codes. We demonstrate the performance of our method through the numerical simulation of a two-dimensional flow past a circular cylinder with Reynolds number Re = 100. The results reveal that the new data-driven model is significantly more accurate than standard projection-based approaches.

97 MATHEMATICS AND COMPUTING↗

Implicit Kalman filtering

For an implicitly defined discrete system, a new algorithm for Kalman filtering is developed and an efficient numerical implementation scheme is proposed. Unlike the traditional explicit approach, the implicit filter can be readily applied to ill-conditioned systems and allows for generalization to descriptor systems. The implementation of the implicit filter depends on the solution of the congruence matrix equation (A1)(Px)(AT1) = Py. We develop a general iterative method for the solution of this equation, and prove necessary and sufficient conditions for convergence. It is shown that when the system matrices of an implicit system are sparse, the implicit Kalman filter requires significantly less computer time and storage to implement as compared to the traditional explicit Kalman filter. Simulation results are presented to illustrate and substantiate the theoretical developments.

Non-NASA Center↗

A Navier-Stokes Solution of Hull-Ring Wing-Thruster Interaction

Navier-Stokes simulations of high Reynolds number flow around an axisymmetric body supported in a water tunnel were made. The numerical method is based on a finite-differencing high resolution second-order accurate implicit upwind scheme. Four different configurations were investigated, these are: (1) barebody; (2) body with an operating propeller; (3) body with a ring wing; and (4) body with a ring wing and an operating propeller. Pressure and velocity components near the stern region were obtained computationally and are shown to compare favorably with the experimental data. The method correctly predicts the existence and extent of stern flow separation for the barebody and the absence of flow separation for the three other configurations with ring wing and/or propeller.

Yang, C.-I.↗

SU-E-J-130: Automating Liver Segmentation Via Combined Global and Local Optimization

Purpose: The aim of this work is to develop a robust algorithm for accurate segmentation of liver with special attention paid to the problems with fuzzy edges and tumor. Methods: 200 CT images were collected from radiotherapy treatment planning system. 150 datasets are selected as the panel data for shape dictionary and parameters estimation. The remaining 50 datasets were used as test images. In our study liver segmentation was formulated as optimization process of implicit function. The liver region was optimized via local and global optimization during iterations. Our method consists five steps: 1)The livers from the panel data were segmented manually by physicians, and then We estimated the parameters of GMM (Gaussian mixture model) and MRF (Markov random field). Shape dictionary was built by utilizing the 3D liver shapes. 2)The outlines of chest and abdomen were located according to rib structure in the input images, and the liver region was initialized based on GMM. 3)The liver shape for each 2D slice was adjusted using MRF within the neighborhood of liver edge for local optimization. 4)The 3D liver shape was corrected by employing SSR (sparse shape representation) based on liver shape dictionary for global optimization. Furthermore, H-PSO(Hybrid Particle Swarm Optimization) was employed to solve the SSR equation. 5)The corrected 3D liver was divided into 2D slices as input data of the third step. The iteration was repeated within the local optimization and global optimization until it satisfied the suspension conditions (maximum iterations and changing rate). Results: The experiments indicated that our method performed well even for the CT images with fuzzy edge and tumors. Comparing with physician delineated results, the segmentation accuracy with the 50 test datasets (VOE, volume overlap percentage) was on average 91%–95%. Conclusion: The proposed automatic segmentation method provides a sensible technique for segmentation of CT images. This work is supported by NIH/NIBIB (1R01-EB016777), National Natural Science Foundation of China (No.61471226 and No.61201441), Research funding from Shandong Province (No.BS2012DX038 and No.J12LN23), and Research funding from Jinan City (No.201401221 and No.20120109)

60 APPLIED LIFE SCIENCES↗

A fourth-order adaptive mesh refinement algorithm for the multicomponent, reacting compressible Navier–Stokes equations

In this study, we present a fourth-order in space and time block-structured adaptive mesh refinement algorithm for the compressible multicomponent reacting Navier–Stokes equations. The algorithm uses a finite-volume approach that incorporates a fourth-order discretisation of the convective terms. The time-stepping algorithm is based on a multi-level spectral deferred corrections method that enables explicit treatment of advection and diffusion coupled with an implicit treatment of reactions. The temporal scheme is embedded in a block-structured adaptive mesh refinement algorithm that includes subcycling in time with spectral deferred correction sweeps applied on levels. Here we present the details of the multi-level scheme paying particular attention to the treatment of coarse–fine boundaries required to maintain fourth-order accuracy in time. We then demonstrate the convergence properties of the algorithm on several test cases including both non-reacting and reacting flows. Finally we present simulations of a vitiated dimethyl ether jet in 2D and a turbulent hydrogen jet in 3D, both with detailed kinetics and transport.

97 MATHEMATICS AND COMPUTING↗

Multiscale two-stage solver for Biot’s poroelasticity equations in subsurface media

In this paper, we propose a two-stage preconditioner for accelerating the iterative solution by a Krylov subspace method of Biot’s poroelasticity equations based on a displacement-pressure formulation. The spatial discretization combines a finite element method for mechanics and a finite volume approach for flow. The fully implicit backward Euler scheme is used for time integration. The result is a 2 × 2 block linear system for each timestep. The preconditioning operator is obtained by applying a two-stage scheme. The first stage is a global preconditioner that employs multiscale basis functions to construct coarse-scale coupled systems using a Galerkin projection. This global stage is effective at damping low-frequency error modes associated with long-range coupling of the unknowns. The second stage is a local block-triangular smoothing preconditioner, which is aimed at high-frequency error modes associated with short-range coupling of the variables. Lastly, various numerical experiments are used to demonstrate the robustness of the proposed solver.

58 GEOSCIENCES↗

On performance of Krylov smoothing for fully-coupled AMG preconditioners for VMS resistive MHD

Here, this study explores the performance and scaling of a GMRES Krylov method employed as a smoother for an algebraic multigrid (AMG) preconditioned Newton- Krylov solution approach applied to a fully-implicit variational multiscale (VMS) nite element (FE) resistive magnetohydrodynamics (MHD) formulation. In this context a Newton iteration is used for the nonlinear system and a Krylov (GMRES) method is employed for the linear subsystems. The efficiency of this approach is critically dependent on the scalability and performance of the AMG preconditioner for the linear solutions and the performance of the smoothers play a critical role. Krylov smoothers are considered in an attempt to reduce the time and memory requirements of existing robust smoothers based on additive Schwarz domain decomposition (DD) with incomplete LU factorization solves on each subdomain. Three time dependent resistive MHD test cases are considered to evaluate the method. The results demonstrate that the GMRES smoother can be faster due to a decrease in the preconditioner setup time and a reduction in outer GMRESR solver iterations, and requires less memory (typically 35% less memory for global GMRES smoother) than the DD ILU smoother.

97 MATHEMATICS AND COMPUTING↗

Developments in the simulation of separated flows using finite difference methods

Compressible viscous flow simulation using finite difference Navier-Stokes and viscous-inviscid interaction methods is described. Recent developments are reviewed that significantly improve the computational efficiency of approximately factored implicit Navier-Stokes algorithms. Compared to Navier-Stokes codes, modern viscous-inviscid interaction codes are more computationally efficient, but have restricted application and are more complicated to program. Therefore, less efficient but more general viscous-inviscid interaction methods are investigated that use forcing functions instead of boundary condition matching, and a simple, direct/inverse, three-dimensional, finite-difference, boundary layer code is presented.

Steger, J. L.↗

Adjoint Formulation for an Embedded-Boundary Cartesian Method

Many problems in aerodynamic design can be characterized by smooth and convex objective functions. This motivates the use of gradient-based algorithms, particularly for problems with a large number of design variables, to efficiently determine optimal shapes and configurations that maximize aerodynamic performance. Accurate and efficient computation of the gradient, however, remains a challenging task. In optimization problems where the number of design variables dominates the number of objectives and flow- dependent constraints, the cost of gradient computations can be significantly reduced by the use of the adjoint method. The problem of aerodynamic optimization using the adjoint method has been analyzed and validated for both structured and unstructured grids. The method has been applied to design problems governed by the potential, Euler, and Navier-Stokes equations and can be subdivided into the continuous and discrete formulations. Giles and Pierce provide a detailed review of both approaches. Most implementations rely on grid-perturbation or mapping procedures during the gradient computation that explicitly couple changes in the surface shape to the volume grid. The solution of the adjoint equation is usually accomplished using the same scheme that solves the governing flow equations. Examples of such code reuse include multistage Runge-Kutta schemes coupled with multigrid, approximate-factorization, line-implicit Gauss-Seidel, and also preconditioned GMRES. The development of the adjoint method for aerodynamic optimization problems on Cartesian grids has been limited. In contrast to implementations on structured and unstructured grids, Cartesian grid methods decouple the surface discretization from the volume grid. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin e t al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation.

Nemec, Marian↗

Application of the implicit MacCormack scheme to the parabolized Navier-Stokes equations

MacCormack's implicit finite-difference scheme was used to solve the two-dimensional parabolized Navier-Stokes (PNS) equations. This method for solving the PNS equations does not require the inversion of block tridiagonal systems of algebraic equations and permits the original explicit MacCormack scheme to be employed in those regions where implicit treatment is not needed. The advantages and disadvantages of the present adaptation are discussed in relation to those of the conventional Beam-Warming scheme for a flat plate boundary layer test case. Comparisons are made for accuracy, stability, computer time, computer storage, and ease of implementation. The present method was also applied to a second test case of hypersonic laminar flow over a 15% compression corner. The computed results compare favorably with experiment and a numerical solution of the complete Navier-Stokes equations.

Lawrence, J. L.↗

A Numerical Method of Calculating Propeller Noise Including Acoustic Nonlinear Effects

Using the transonic flow fields(s) generated by the NASPROP-E computer code for an eight blade SR3-series propeller, a theoretical method is investigated to calculate the total noise values and frequency content in the acoustic near and far field without using the Ffowcs Williams - Hawkings equation. The flow field is numerically generated using an implicit three dimensional Euler equation solver in weak conservation law form. Numerical damping is required by the differencing method for stability in three dimensions, and the influence of the damping on the calculated acoustic values is investigated. The acoustic near field is solved by integrating with respect to time the pressure oscillations induced at a stationary observer location. The acoustic far field is calculated from the near field primitive variables as generated by NASPROP-E computer code using a method involving a perturbation velocity potential as suggested by Hawkings in the calculation of the acoustic pressure time-history at a specified far field observed location. the methodologies described are valid for calculating total noise levels and are applicable to any propeller geometry for which a flow field solution is available.

Korkan, K. D.↗

Implicit TVD schemes for hyperbolic conservation laws in curvilinear coordinates

The Harten (1983, 1984) total variation-diminishing (TVD) schemes, constituting a one-parameter explicit and implicit, second-order-accurate family, have the property of not generating spurious oscillations when applied to one-dimensional, nonlinear scalar hyperbolic conservation laws and constant coefficient hyperbolic systems. These methods are presently extended to the multidimensional hyperbolic conservation laws in curvilinear coordinates. Means by which to linearize the implicit operator and solution strategies, in order to improve the computation efficiency of the implicit algorithm, are discussed. Numerical experiments with steady state airfoil calculations indicate that the proposed linearized implicit TVD schemes are accurate and robust.

Yee, H. C.↗

Unsteady transonic Navier-Stokes computations for an oscillating wing using single and multiple zones

Modern jet transports and maneuvering tactical fighters operating in the transonic regime often give rise to time-dependent fluid physics that interact with flexible structural components, e.g., vortical flow, shocks, and separation. Efficient computational fluid dynamic (CFD) methods are required to study such computationally intensive problems. In this work a numerical method is presented to address this problem. Time-dependent, compressible, Navier-Stokes equations are used to simulate unsteady transonic flow about a three-dimensional rigid wing undergoing a forced periodic motion in angle of attack. An efficient, implicit, diagonal algorithm is utilized because of its low operation count per time step compared to other methods that solve systems of block matrix equations. The formal time accuracy is addressed theoretically and demonstrated numerically by comparison of computational results with experimental data. A zonal grid approach, capable of treating complex geometries, is presented and its time accuracy is demonstrated by comparing a zonal computation with a single grid computation and experimental data.

Chaderjian, Neal M.↗

Convergence speeding up in the calculation of the viscous flow about an airfoil

A finite volume method to solve the three dimensional Navier-Stokes equations was developed. It is based on a cell-vertex scheme with central differences and explicit Runge-Kutta time steps. A good convergence for a stationary solution was obtained by the use of local time steps, implicit smoothing of the residues, a multigrid algorithm, and a carefully controlled artificial dissipative term. The method is illustrated by results for transonic profiles and airfoils. The method allows a routine solution of the Navier-Stokes equations.

Radespiel, R.↗

A numerical method for phase-change problems

A highly accurate and efficient finite-difference method for phase-change problems with multiple moving boundaries of irregular shape is developed by employing a coordinate transformation that immobilizes moving boundaries and preserves the conservative forms of the original governing equations. The numerical method is first presented for one-dimensional phase-change problems (involving large density variation between phases, heat generation, and multiple moving boundaries) and then extended to solve two-dimensional problems (without change of densities between phases). Numerical solutions are obtained non-iteratively using an explicit treatment of the interfacial mass and energy balances and an implicit treatment of the temperature field equations. The accuracy and flexibility of the present numerical method are verified by solving some phase-change problems and comparing the results with existing analytical, semi-analytical and numerical solutions. Results indicate that one- and two-dimensional phase-change problems can be handled easily with excellent accuracies.

Kim, Charn-Jung↗

$\mathrm{IH}$-$\mathrm{GAN}$: A conditional generative model for implicit surface-based inverse design of cellular structures

Variable-density cellular structures can overcome connectivity and manufacturability issues of topologically optimized structures, particularly those represented as discrete density maps. However, the optimization of such cellular structures is challenging due to the multiscale design problem. Past work addressing this problem generally either only optimizes the volume fraction of single-type unit cells but ignoring the effects of unit cell geometry on properties, or considers the geometry–property relation but builds this relation via heuristics. In contrast, we propose a simple yet more principled way to accurately model the property to geometry mapping using a conditional deep generative model, named Inverse Homogenization Generative Adversarial Network (IH-GAN). It learns the conditional distribution of unit cell geometries given properties and can realize the one-to-many mapping from properties to geometries. Here we further reduce the complexity of IH-GAN by using the implicit function parameterization to represent unit cell geometries. Results show that our method can 1) generate various unit cells that satisfy given material properties with high accuracy (R 2 -scores between target properties and properties of generated unit cells >98%) and 2) improve the optimized structural performance over the conventional variable-density single-type structure. In the minimum compliance example, our IH-GAN generated structure achieves a 79.7% reduction in concentrated stress and an extra 3.03% reduction in displacement. In the target deformation examples, our IH-GAN generated structure reduces the target matching error by 86.4% and 79.6% for two test cases, respectively. We also demonstrated that the connectivity issue for multi-type unit cells can be solved by transition layer blending.

42 ENGINEERING↗

Impact of solvation on the GW quasiparticle spectra of molecules

First-principles calculations for electrochemistry require accurate treatment of both electronic structure and solvation. The perturbative GW approximation starting from density functional theory (DFT) calculations accurately models materials systems with varying dimensionality. Continuum solvation models enable efficient treatment of solvation effects in DFT calculations, but their applications with beyond-DFT electronic structure methods such as GW have been limited. Here, we introduce the frequency-dependent liquid polarizability from a nonlocal continuum solvation model in the screened Coulomb interaction of full-frequency GW calculations with a solvated DFT starting point. In this study, we show that the liquid screening contributions substantially reduce the HOMO–LUMO gap of molecules by 3–5 eV, while solvent effects on the DFT starting point negligibly impact the GW gap. The resulting framework facilitates the simultaneous electronic and solvation accuracy needed for first-principles electrochemistry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗