Search NASA⌕ Search

SEARCH · Search NASA

Results for “discretization methods”

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,513 records · Page 84
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Enhanced realization identification of physical modes

Physical structures are often sufficiently complicated to preclude constructing an accurate mathematical model of the system dynamics from simple analysis using the laws of physics. Consequently, determination of an accurate model requires utilization of (generally noisy) output measurements from dynamic tests. In this paper, a robust method for constructing accurate, structural-dynamic models from discrete time-domain measurements is presented. The method processes the measurements in order to determine the number of modes present, the damping and frequency of each mode, and the mode shape. The structure may be highly damped. Although the mode-shape identification is more sensitive to measurement noise than the order, frequency, and damping identification, the method is considerably less sensitive to noise than other leading methods. Accurate detection of the modal parameters and mode shapes is demonstrated for modes with damping ratios exceeding 15 percent.

Roemer, Michael J.↗
DOE OSTI2013

Extended forward sensitivity analysis of one-dimensional isothermal flow

Sensitivity analysis and uncertainty quantification is an important part of nuclear safety analysis. In this work, forward sensitivity analysis is used to compute solution sensitivities on 1-D fluid flow equations typical of those found in system level codes. Time step sensitivity analysis is included as a method for determining the accumulated error from time discretization. The ability to quantify numerical error arising from the time discretization is a unique and important feature of this method. By knowing the relative sensitivity of time step with other physical parameters, the simulation is allowed to run at optimized time steps without affecting the confidence of the physical parameter sensitivity results. The time step forward sensitivity analysis method can also replace the traditional time step convergence studies that are a key part of code verification with much less computational cost. One well-defined benchmark problem with manufactured solutions is utilized to verify the method; another test isothermal flow problem is used to demonstrate the extended forward sensitivity analysis process. Through these sample problems, the paper shows the feasibility and potential of using the forward sensitivity analysis method to quantify uncertainty in input parameters and time step size for a 1-D system-level thermal-hydraulic safety code. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Segmental Refinement: A Multigrid Technique for Data Locality

We investigate a technique - segmental refinement (SR) - proposed by Brandt in the 1970s as a low memory multigrid method. The technique is attractive for modern computer architectures because it provides high data locality, minimizes network communication, is amenable to loop fusion, and is naturally highly parallel and asynchronous. The network communication minimization property was recognized by Brandt and Diskin in 1994; we continue this work by developing a segmental refinement method for a finite volume discretization of the 3D Laplacian on massively parallel computers. An understanding of the asymptotic complexities, required to maintain textbook multigrid efficiency, are explored experimentally with a simple SR method. A two-level memory model is developed to compare the asymptotic communication complexity of a proposed SR method with traditional parallel multigrid. Performance and scalability are evaluated with a Cray XC30 with up to 64K cores. We achieve modest improvement in scalability from traditional parallel multigrid with a simple SR implementation.

3D Laplacian↗
DOE OSTI2016

A high-order staggered finite-element vertical discretization for non-hydrostatic atmospheric models

Abstract. Atmospheric modeling systems require economical methods to solve the non-hydrostatic Euler equations. Two major differences between hydrostatic models and a full non-hydrostatic description lies in the vertical velocity tendency and numerical stiffness associated with sound waves. In this work we introduce a new arbitrary-order vertical discretization entitled the staggered nodal finite-element method (SNFEM). Our method uses a generalized discrete derivative that consistently combines the discontinuous Galerkin and spectral element methods on a staggered grid. Our combined method leverages the accurate wave propagation and conservation properties of spectral elements with staggered methods that eliminate stationary (2Δx) modes. Furthermore, high-order accuracy also eliminates the need for a reference state to maintain hydrostatic balance. In this work we demonstrate the use of high vertical order as a means of improving simulation quality at relatively coarse resolution. We choose a test case suite that spans the range of atmospheric flows from predominantly hydrostatic to nonlinear in the large-eddy regime. Our results show that there is a distinct benefit in using the high-order vertical coordinate at low resolutions with the same robust properties as the low-order alternative.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Parameter Reduction of Composite Load Model Using Active Subspace Method

Over the past decades, the increasing penetration of distributed energy resources (DERs) has dramatically changed the power load composition in the distribution networks. The traditional static and dynamic load models can hardly capture the dynamic behavior of modern loads especially for fault-induced delayed voltage recovery (FIDVR) events. Thus, a more comprehensive composite load model with combination of static load, different types of induction motors, single-phase A/C motor, electronic load and DERs has been proposed by Western Electricity Coordinating Council (WECC). However, due to the large number of parameters and model complexity, the WECC composite load model (WECC CMLD) raises new challenges to power system studies. To overcome these challenges, in this paper, a cutting-edge parameter reduction (PR) approach for WECC CMLD based on active subspace method (ASM) is proposed. Firstly, the WECC CMLD is parameterized in a discrete-time manner for the application of the proposed method. Then, parameter sensitivities are calculated by discovering the active subspace, which is a lower-dimensional linear subspace of the parameter space of WECC CMLD in which the dynamic response is most sensitive. The interdependency among parameters can be taken into consideration by our approach. Finally, the numerical experiments validate the effectiveness and advantages of the proposed approach for WECC CMLD model.

active subspace↗
NASA NTRS1986

Preconditioning matrices for Chebyshev derivative operators

The problem of preconditioning the matrices arising from pseudo-spectral Chebyshev approximations of first order operators is considered in both one and two dimensions. In one dimension a preconditioner represented by a full matrix which leads to preconditioned eigenvalues that are real, positive, and lie between 1 and pi/2, is already available. Since there are cases in which it is not computationally convenient to work with such a preconditioner, a large number of preconditioners were studied which were more sparse (in particular three and four diagonal matrices). The eigenvalues of such preconditioned matrices are compared. The results were applied to the problem of finding the steady state solution to an equation of the type u sub t = u sub x + f, where the Chebyshev collocation is used for the spatial variable and time discretization is performed by the Richardson method. In two dimensions different preconditioners are proposed for the matrix which arises from the pseudo-spectral discretization of the steady state problem. Results are given for the CPU time and the number of iterations using a Richardson iteration method for the unpreconditioned and preconditioned cases.

Rothman, Ernest E.↗
DOE OSTI2022

Binary optimal control by trust-region steepest descent

Abstract We present a trust-region steepest descent method for dynamic optimal control problems with binary-valued integrable control functions. Our method interprets the control function as an indicator function of a measurable set and makes set-valued adjustments derived from the sublevel sets of a topological gradient function. By combining this type of update with a trust-region framework, we are able to show by theoretical argument that our method achieves asymptotic stationarity despite possible discretization errors and truncation errors during step determination. To demonstrate the practical applicability of our method, we solve two optimal control problems constrained by ordinary and partial differential equations, respectively, and one topological optimization problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Bernstein dual-Petrov–Galerkin method: application to 2D time fractional diffusion equation

In this paper, we develop a Bernstein dual-Petrov–Galerkin method for the numerical simulation of a two-dimensional fractional diffusion equation. A spectral discretization is applied by introducing suitable combinations of dual Bernstein polynomials as the test functions and the Bernstein polynomials as the trial ones. We derive the exact sparse operational matrix of differentiation for the dual Bernstein basis which provides a matrix-based approach for the spatial discretization. It is shown that the method leads to banded linear systems that can be solved efficiently. The stability and convergence of the proposed method is discussed. Finally, some numerical examples are provided to support the theoretical claims and to show the accuracy and efficiency of the method.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2002

A Multifunctional Interface Method for Coupling Finite Element and Finite Difference Methods: Two-Dimensional Scalar-Field Problems

A multifunctional interface method with capabilities for variable-fidelity modeling and multiple method analysis is presented. The methodology provides an effective capability by which domains with diverse idealizations can be modeled independently to exploit the advantages of one approach over another. The multifunctional method is used to couple independently discretized subdomains, and it is used to couple the finite element and the finite difference methods. The method is based on a weighted residual variational method and is presented for two-dimensional scalar-field problems. A verification test problem and a benchmark application are presented, and the computational implications are discussed.

Ransom, Jonathan B.↗
NASA NTRS1991

Surface albedo from bidirectional reflectance

The validity of integrating over discrete wavelength bands is examined to estimate total shortwave bidirectional reflectance of vegetated and bare soil surfaces. Methods for estimating albedo from multiple angle, discrete wavelength band radiometer measurements are studied. These methods include a numerical integration technique and the integration of an empirically derived equation for bidirectional reflectance. It is concluded that shortwave albedos estimated through both techniques agree favorably with the independent pyranometer measurements. Absolute rms errors are found to be 0.5 percent or less for both grass sod and bare soil surfaces.

Ranson, K. J.↗
DOE OSTI2016

A radial basis function Galerkin method for inhomogeneous nonlocal diffusion

We introduce a discretization for a nonlocal diffusion problem using a localized basis of radial basis functions. The stiffness matrix entries are assembled by a special quadrature routine unique to the localized basis. Combining the quadrature method with the localized basis produces a well-conditioned, sparse, symmetric positive definite stiffness matrix. We demonstrate that both the continuum and discrete problems are well-posed and present numerical results for the convergence behavior of the radial basis function method. As a result, we explore approximating the solution to anisotropic differential equations by solving anisotropic nonlocal integral equations using the radial basis function method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Smoothed Particle Hydrodynamics and its applications for multiphase flow and reactive transport in porous media

Smoothed Particle Hydrodynamics (SPH) is a Lagrangian method based on a meshless discretization of partial differential equations. In this review, we present SPH discretization of the Navier-Stokes and Advection-Diffusion-Reaction equations, implementation of various boundary conditions, and time integration of the SPH equations, and we discuss applications of the SPH method for modeling pore-scale multiphase flows and reactive transport in porous and fractured media.

Tartakovsky, Alexandre M.↗
DOE OSTI2022

Dark Energy Survey Year 3 results: marginalization over redshift distribution uncertainties using ranking of discrete realizations

ABSTRACT Cosmological information from weak lensing surveys is maximized by sorting source galaxies into tomographic redshift subsamples. Any uncertainties on these redshift distributions must be correctly propagated into the cosmological results. We present hyperrank, a new method for marginalizing over redshift distribution uncertainties, using discrete samples from the space of all possible redshift distributions, improving over simple parametrized models. In hyperrank, the set of proposed redshift distributions is ranked according to a small (between one and four) number of summary values, which are then sampled, along with other nuisance parameters and cosmological parameters in the Monte Carlo chain used for inference. This approach can be regarded as a general method for marginalizing over discrete realizations of data vector variation with nuisance parameters, which can consequently be sampled separately from the main parameters of interest, allowing for increased computational efficiency. We focus on the case of weak lensing cosmic shear analyses and demonstrate our method using simulations made for the Dark Energy Survey (DES). We show that the method can correctly and efficiently marginalize over a wide range of models for the redshift distribution uncertainty. Finally, we compare hyperrank to the common mean-shifting method of marginalizing over redshift uncertainty, validating that this simpler model is sufficient for use in the DES Year 3 cosmology results presented in companion papers.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1985

Interpolation Methods for GTD Analysis of Shaped Reflectors

The finding of smooth analytic representations for antenna reflector surfaces which are prescribed only by discretized data obtained by various synthesis methods is examined. Frequently the data are distributed in a nonuniform grid and contain noise. The smoothness required is to C sub 1 for physical optics diffraction analysis and to C sub 2 for geometrical theory of diffraction (GTD) analysis. The GTD analysis approach requires a surface description which returns data very rapidly. Two methods of interpolation, the global and the local methods, are discussed. They each have advantages and disadvantages; characteristics are discussed and examples are presented.

Galindo-Israel, V.↗
DOE OSTI2018

Convergence and Efficiency of Adaptive Importance Sampling Techniques with Partial Biasing

We propose a new Monte Carlo method to efficiently sample a multimodal distribution (known up to a normalization constant). We consider a generalization of the discrete-time Self Healing Umbrella Sampling method, which can also be seen as a generalization of well-tempered metadynamics. The dynamics is based on an adaptive importance technique. The importance function relies on the weights (namely the relative probabilities) of disjoint sets which form a partition of the space. These weights are unknown but are learnt on the fly yielding an adaptive algorithm. In the context of computational statistical physics, the logarithm of these weights is, up to an additive constant, the free-energy, and the discrete valued function defining the partition is called the collective variable. The algorithm falls into the general class of Wang–Landau type methods, and is a generalization of the original Self Healing Umbrella Sampling method in two ways: (i) the updating strategy leads to a larger penalization strength of already visited sets in order to escape more quickly from metastable states, and (ii) the target distribution is biased using only a fraction of the free-energy, in order to increase the effective sample size and reduce the variance of importance sampling estimators. We prove the convergence of the algorithm and analyze numerically its efficiency on a toy example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Application of Jacobian-free Newton–Krylov method in implicitly solving two-fluid six-equation two-phase flow problems: Implementation, validation and benchmark

This work represents a first-of-its-kind successful application to employ advanced numerical methods in solving realistic two-phase flow problems with two-fluid six-equation two-phase flow model. These advanced numerical methods include high-resolution spatial discretization scheme with staggered grids (high-order) fully implicit time integration schemes, and Jacobian-free Newton–Krylov (JFNK) method as the nonlinear solver. The computer code developed in this work has been extensively validated with existing experimental flow boiling data in vertical pipes and rod bundles, which cover wide ranges of experimental conditions, such as pressure, inlet mass flux, wall heat flux and exit void fraction. Additional code-to-code benchmark with the RELAP5-3D code further verifies the correct code implementation. The combined methods employed in this work exhibit strong robustness in solving two-phase flow problems even when phase appearance (boiling) and realistic discrete flow regimes are considered. Transitional flow regimes used in existing system analysis codes, normally introduced to overcome numerical difficulty, were completely removed in this work. As a result, this in turn provides the possibility to utilize more sophisticated flow regime maps in the future to further improve simulation accuracy.

42 ENGINEERING↗
NASA NTRS1991

Comparison of four stable numerical methods for Abel's integral equation

The 3-D image reconstruction from cone-beam projections in computerized tomography leads naturally, in the case of radial symmetry, to the study of Abel-type integral equations. If the experimental information is obtained from measured data, on a discrete set of points, special methods are needed in order to restore continuity with respect to the data. A new combined Regularized-Adjoint-Conjugate Gradient algorithm, together with two different implementations of the Mollification Method (one based on a data filtering technique and the other on the mollification of the kernal function) and a regularization by truncation method (initially proposed for 2-D ray sample schemes and more recently extended to 3-D cone-beam image reconstruction) are extensively tested and compared for accuracy and numerical stability as functions of the level of noise in the data.

Murio, Diego A.↗
NASA NTRS1995

Adaptive Finite Element Methods for Continuum Damage Modeling

The paper presents an application of adaptive finite element methods to the modeling of low-cycle continuum damage and life prediction of high-temperature components. The major objective is to provide automated and accurate modeling of damaged zones through adaptive mesh refinement and adaptive time-stepping methods. The damage modeling methodology is implemented in an usual way by embedding damage evolution in the transient nonlinear solution of elasto-viscoplastic deformation problems. This nonlinear boundary-value problem is discretized by adaptive finite element methods. The automated h-adaptive mesh refinements are driven by error indicators, based on selected principal variables in the problem (stresses, non-elastic strains, damage, etc.). In the time domain, adaptive time-stepping is used, combined with a predictor-corrector time marching algorithm. The time selection is controlled by required time accuracy. In order to take into account strong temperature dependency of material parameters, the nonlinear structural solution a coupled with thermal analyses (one-way coupling). Several test examples illustrate the importance and benefits of adaptive mesh refinements in accurate prediction of damage levels and failure time.

Min, J. B.↗