Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solution regularity”

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 145 records · Page 8

Partitioning of regular computation on multiprocessor systems

Problem partitioning of regular computation over two dimensional meshes on multiprocessor systems is examined. The regular computation model considered involves repetitive evaluation of values at each mesh point with local communication. The computational workload and the communication pattern are the same at each mesh point. The regular computation model arises in numerical solutions of partial differential equations and simulations of cellular automata. Given a communication pattern, a systematic way to generate a family of partitions is presented. The influence of various partitioning schemes on performance is compared on the basis of computation to communication ratio.

Lee, Fung F.↗

Vertical Profile of Cloud Optical Parameters Derived from Airborne Measurements Above, Inside and Below Clouds

Past strategies for retrieving cloud optical properties from remote sensing assumed significant limits for desired parameters such as semi-infinite optical thickness, single scattering albedo equaling unity (non-absorbing scattering), absence of spectral dependence of the optical thickness, etc., and only one optical parameter could be retrieved (either optical thickness or single scattering albedo). Here, we demonstrate a new method based on asymptotic theory for thick atmospheres, and the presence of a diffusion domain within the clouds that does not put restrictions and makes it possible to get two or even three optical parameters (optical thickness, single scattering albedo and phase function asymmetry parameter) for every wavelength independently. We applied this method to measurements of angular distribution of solar radiation above, inside and below clouds, obtained with NASA's Cloud Absorption Radiometer (CAR) over two cases of marine stratocumulus clouds; first case, offshore of Namibia and the second case, offshore of California. The observational and retrieval errors are accounted for by regularization, which allows stable and smooth solutions. Results show good potential for parameterization of the shortwave radiative properties (reflection, transmission, radiative divergence and heating rate) of water clouds.

airborne observations↗

Where did the tumor start? An inverse solver with sparse localization for tumor growth models

In this work, we present a numerical scheme for solving an inverse problem for parameter estimation in tumor growth models for glioblastomas, a form of aggressive primary brain tumor. The growth model is a reaction–diffusion partial differential equation (PDE) for the tumor concentration. We use a PDE-constrained optimization formulation for the inverse problem. The unknown parameters are the reaction coefficient (proliferation), the diffusion coefficient (infiltration), and the initial condition field for the tumor PDE. Segmentation of magnetic resonance imaging (MRI) scans drive the inverse problem where segmented tumor regions serve as partial observations of the tumor concentration. Like most cases in clinical practice, we use data from a single time snapshot. Moreover, the precise time relative to the initiation of the tumor is unknown, which poses an additional difficulty for inversion. We perform a frozen-coefficient spectral analysis and show that the inverse problem is severely ill-posed. We introduce a biophysically motivated regularization on the structure and magnitude of the tumor initial condition. In particular, we assume that the tumor starts at a few locations (enforced with a sparsity constraint on the initial condition of the tumor) and that the initial condition magnitude in the maximum norm is equal to one. We solve the resulting optimization problem using an inexact quasi-Newton method combined with a compressive sampling algorithm for the sparsity constraint. Our implementation uses PETSc and AccFFT libraries. We conduct numerical experiments on synthetic and clinical images to highlight the improved performance of our solver over a previously existing solver that uses standard two-norm regularization for the calibration parameters. The existing solver is unable to localize the initial condition. Our new solver can localize the initial condition and recover infiltration and proliferation. In clinical datasets (for which the ground truth is unknown), our solver results in qualitatively different solutions compared to the two-norm regularized solver.

97 MATHEMATICS AND COMPUTING↗

A Particle Method for the Multispecies Landau Equation

Abstract The multispecies Landau collision operator describes the two-particle, small scattering angle or grazing collisions in a plasma made up of different species of particles such as electrons and ions. Recently, a structure preserving deterministic particle method (Carrillo et al. in J. Comput. Phys. 7:100066, 2020) has been developed for the single species spatially homogeneous Landau equation. This method relies on a regularization of the Landau collision operator so that an approximate solution, which is a linear combination of Dirac delta distributions, is well-defined. Based on a weak form of the regularized Landau equation, the time dependent locations of the Dirac delta functions satisfy a system of ordinary differential equations. In this work, we extend this particle method to the multispecies case, and examine its conservation of mass, momentum, and energy, and decay of entropy properties. We show that the equilibrium distribution of the regularized multispecies Landau equation is a Maxwellian distribution, and state a critical condition on the regularization parameters that guarantees a species independent equilibrium temperature. A convergence study comparing an exact multispecies Bobylev-Krook-Wu (BKW) solution to the particle solution shows approximately 2nd order accuracy. Important physical properties such as conservation, decay of entropy, and equilibrium distribution of the particle method are demonstrated with several numerical examples.

Mathematics↗

Time-dependent relaxation of observables in complex quantum systems

Abstract We consider time-dependent relaxation of observables in quantum systems of chaotic and regular type. Using statistical arguments and exact numerical solutions we show that the spread of the initial wave function in the Hilbert space and the main characteristics of evolution of observables have certain generic features. The study compares examples of regular dynamics, a completely chaotic case of the Gaussian orthogonal ensemble, a bosonic system with random interactions, and a fully realistic case of the time evolution of various initial non-stationary states in the nuclear shell model. In the case of the Gaussian orthogonal ensemble we show that the survival probability obtained analytically also fully defines the relaxation timescale of observables. This is not the case in general. Using the realistic nuclear shell model and the quadrupole moment as an observable we demonstrate that the relaxation time is significantly longer than defined by the survival probability of the initial state. The full analysis does not show the presence of an analog of the Lyapunov exponent characteristic for examples of classical chaos.

Volya, Alexander (ORCID:0000000217656466)↗

Topological Regularization via Persistence-Sensitive Optimization

Optimization, a key tool in machine learning and statistics, relies on regularization to reduce overfitting. Traditional regularization methods control a norm of the solution to ensure its smoothness. Recently, topological methods have emerged as a way to provide a more precise and expressive control over the solution, relying on persistent homology to quantify and reduce its roughness. All such existing techniques back-propagate gradients through the persistence diagram, which is a summary of the topological features of a function. Their downside is that they provide information only at the critical points of the function. We propose a method that instead builds on persistence-sensitive simplification and translates the required changes to the persistence diagram into changes on large subsets of the domain, including both critical and regular points. This approach enables a faster and more precise topological regularization, the benefits of which we illustrate with experimental evidence.

Nigmetov, Arnur↗

Efficient Solution of Three-Dimensional Problems of Acoustic and Electromagnetic Scattering by Open Surfaces

We present a computational methodology (a novel Nystrom approach based on use of a non-overlapping patch technique and Chebyshev discretizations) for efficient solution of problems of acoustic and electromagnetic scattering by open surfaces. Our integral equation formulations (1) Incorporate, as ansatz, the singular nature of open-surface integral-equation solutions, and (2) For the Electric Field Integral Equation (EFIE), use analytical regularizes that effectively reduce the number of iterations required by iterative linear-algebra solution based on Krylov-subspace iterative solvers.

sound-soft acoustic scattering↗

Semi-Supervised Learning of Lift Optimization of Multi-Element Three-Segment Variable Camber Airfoil

This chapter describes a new intelligent platform for learning optimal designs of morphing wings based on Variable Camber Continuous Trailing Edge Flaps (VCCTEF) in conjunction with a leading edge flap called the Variable Camber Krueger (VCK). The new platform consists of a Computational Fluid Dynamics (CFD) methodology coupled with a semi-supervised learning methodology. The CFD component of the intelligent platform comprises of a full Navier-Stokes solution capability (NASA OVERFLOW solver with Spalart-Allmaras turbulence model) that computes flow over a tri-element inboard NASA Generic Transport Model (GTM) wing section. Various VCCTEF/VCK settings and configurations were considered to explore optimal design for high-lift flight during take-off and landing. To determine globally optimal design of such a system, an extremely large set of CFD simulations is needed. This is not feasible to achieve in practice. To alleviate this problem, a recourse was taken to a semi-supervised learning (SSL) methodology, which is based on manifold regularization techniques. A reasonable space of CFD solutions was populated and then the SSL methodology was used to fit this manifold in its entirety, including the gaps in the manifold where there were no CFD solutions available. The SSL methodology in conjunction with an elastodynamic solver (FiDDLE) was demonstrated in an earlier study involving structural health monitoring. These CFD-SSL methodologies define the new intelligent platform that forms the basis for our search for optimal design of wings. Although the present platform can be used in various other design and operational problems in engineering, this chapter focuses on the high-lift study of the VCK-VCCTEF system. Top few candidate design configurations were identified by solving the CFD problem in a small subset of the design space. The SSL component was trained on the design space, and was then used in a predictive mode to populate a selected set of test points outside of the given design space. The new design test space thus populated was evaluated by using the CFD component by determining the error between the SSL predictions and the true (CFD) solutions, which was found to be small. This demonstrates the proposed CFD-SSL methodologies for isolating the best design of the VCK-VCCTEF system, and it holds promise for quantitatively identifying best designs of flight systems, in general.

Intelligent Systems↗

Thermomechanical coupling in fatigue fracture of viscoelastic materials

Subcritical crack growth in a linear viscoelastic material subjected to cyclic loading is investigated starting with the thermodynamic power balance. Physically, it is supposed that the subcritical slow crack growth is due to local weakening of the material in the neighborhood of the crack tip. Under fatigue loading it is assumed that all energy dissipation goes into heat and that this heat build-up is the dominant irreversible process governing crack growth. The cycle averaged temperature distribution around the crack tip is obtained from local application of the first law of thermodynamics (i.e., conservation of energy). The analysis leads to the solution of a nonlinear integro-differential equation for crack length as a function of time which is coupled with the local energy equation. A regular perturbation technique is used to obtain an analytical solution which compares very well with experimental results.

Hufferd, W. L.↗

A neural network‐enhanced reproducing kernel particle method for modeling strain localization

Abstract Modeling the localized intensive deformation in a damaged solid requires highly refined discretization for accurate prediction, which significantly increases the computational cost. Although adaptive model refinement can be employed for enhanced effectiveness, it is cumbersome for the traditional mesh‐based methods to perform while modeling the evolving localizations. In this work, neural network‐enhanced reproducing kernel particle method (NN‐RKPM) is proposed, where the location, orientation, and shape of the solution transition near a localization is automatically captured by the NN approximation via a block‐level neural network (NN) optimization. The weights and biases in the blocked parameterization network control the location and orientation of the localization. The designed basic four‐kernel NN block is capable of capturing a triple junction or a quadruple junction topological pattern, while more complicated localization topological patters are captured by the superposition of multiple four‐kernel NN blocks. The standard RK approximation is then utilized to approximate the smooth part of the solution, which permits a much coarser discretization than the high‐resolution discretization needed to capture sharp solution transitions with the conventional methods. A regularization of the NN approximation is additionally introduced for discretization‐independent material responses. The effectiveness of the proposed NN‐RKPM is verified by a series of numerical verifications.

Baek, Jonghyuk↗

Non-intrusive reduced-order modeling for dynamical systems with spatially localized features

This work presents a non-intrusive reduced-order modeling framework for dynamical systems with spatially localized features characterized by slow singular value decay. The proposed approach builds upon two existing methodologies for reduced and full-order non-intrusive modeling, namely Operator Inference (OpInf) and sparse Full-Order Model (sFOM) inference. We decompose the domain into two complementary subdomains that exhibit fast and slow singular value decay. The dynamics of the subdomain exhibiting slow singular value decay are learned with sFOM while the dynamics with intrinsically low dimensionality on the complementary subdomain are learned with OpInf. The resulting, coupled OpInf-sFOM formulation leverages the computational efficiency of OpInf and the high resolution of sFOM, and thus enables fast non-intrusive predictions for conditions beyond those sampled in the training data set. A novel regularization technique with a closed-form solution based on the Gershgorin disk theorem is introduced to promote stable sFOM and OpInf models. We also provide a data-driven indicator for subdomain selection and ensure solution smoothness over the interface via a post-processing interpolation step. We evaluate the efficiency of the approach in terms of offline and online speedup through a quantitative, parametric computational cost analysis. We demonstrate the coupled OpInf-sFOM formulation for two test cases: a one-dimensional Burgers’ model for which accurate predictions beyond the span of the training snapshots are presented, and a two-dimensional parametric model for the Pine Island Glacier ice thickness dynamics, for which the OpInf-sFOM model achieves an average prediction error on the order of 1% with an online speedup factor of approximately 8$\times$ compared to the numerical simulation.

42 ENGINEERING↗

One-dimensional phase retrieval: Regularization, box relaxation and uniqueness

Recovering a signal from its Fourier magnitude is referred to as phase retrieval, which occurs in different fields of engineering and applied physics. This paper gives a new characterization of the phase retrieval problem. Particularly useful is the analysis revealing that the common gradient-based regularization does not restrict the set of solutions to a smaller set. Specifically focusing on binary signals, we show that a box relaxation is equivalent to the binary constraint for Fourier-types of phase retrieval. Here, we further prove that binary signals can be recovered uniquely up to trivial ambiguities under certain conditions. Finally, we use the characterization theorem to develop an efficient denoising algorithm.

97 MATHEMATICS AND COMPUTING↗

Average reflected power from a one-dimensional slab of discrete scatterers

Reflection from a one-dimensional random medium of discrete scatterers is considered. The discrete scattering medium is modeled by a Poisson impulse process with concentration lambda. By employing the Markov property of the Poisson impulse process, an exact functional integro-differential equation of the Kolmogorov-Feller type is found for the average reflected power. Approximate solutions to this equation are obtained by regular perturbation and two variable expansion techniques in the limit of small lambda. The regular perturbation results is valid for small slab thicknesses, while the two-variable result is uniformly valid for any thickness. The two-variable result shows that as the slab size becomes infinite all of the incident power is reflected on the average.

Saatchi, Sasan S.↗

Quadrature-Free Implementation of the Discontinuous Galerkin Method for Hyperbolic Equations

A discontinuous Galerkin formulation that avoids the use of discrete quadrature formulas is described and applied to linear and nonlinear test problems in one and two space dimensions. This approach requires less computational time and storage than conventional implementations but preserves the compactness and robustness inherent to the discontinuous Galerkin method. Test problems include both linear and nonlinear one-dimensional scalar advection of botH smooth and discontinuous initial value problems, two-dimensional scalar advection of smooth initial value problems discretized by using unstructured grids with varying degrees of smoothness and regularity, and two-dimensional linear Euler solutions on unstructured grids.

Atkins, H. L.↗

Entry, Descent, and Landing Analysis for the OSIRIS-REx Sample Return Capsule

The Origins, Spectral Interpretation, Resource Identification, and Security – Regolith Explorer (OSIRIS-REx) sample return capsule (SRC) returned to Earth on September 24, 2023, safely landing in the Utah Test and Training Range (UTTR). To ensure a safe and successful landing, a pair of high-fidelity EDL simulations, based on the Program to Optimize Simulated Trajectories (POST) architecture, were used to regularly assess the latest orbit determination (OD) solution from the navigation team, making predictions on Entry, Descent, and Landing (EDL) performance and SRC landing location. The results from these analyses fed into the decision processes for the final trajectory correction maneuvers (TCM’s) and SRC release. The models and methods of analysis will be discussed and a comparison of the final pre-entry landing prediction against the observed landing location will be presented along with an assessment of the best estimates of day-of-entry environmental conditions.

Scott R Francis↗

HomPINNs: Homotopy physics-informed neural networks for learning multiple solutions of nonlinear elliptic differential equations

Physics-informed neural networks (PINNs) based machine learning is an emerging framework for solving nonlinear differential equations. However, due to the implicit regularity of neural network structure, PINNs can only find the flattest solution in most cases by minimizing the loss functions. In this paper, we combine PINNs with the homotopy continuation method, a classical numerical method to compute isolated roots of polynomial systems, and propose a new deep learning framework, named homotopy physics-informed neural networks (HomPINNs), for solving multiple solutions of nonlinear elliptic differential equations. The implementation of an HomPINN is a homotopy process that is composed of the training of a fully connected neural network, named the starting neural network, and training processes of several PINNs with different tracking parameters. The starting neural network is to approximate a starting function constructed by the trivial solutions, while other PINNs are to minimize the loss functions defined by boundary condition and homotopy functions, varying with different tracking parameters. These training processes are regraded as different steps of a homotopy process, and a PINN is initialized by the well-trained neural network of the previous step, while the first starting neural network is initialized using the default initialization method. Finally, several numerical examples are presented to show the efficiency of our proposed HomPINNs, including reaction-diffusion equations with a heart-shaped domain.

97 MATHEMATICS AND COMPUTING↗

Application of a distributed network in computational fluid dynamic simulations

A general-purpose 3-D, incompressible Navier-Stokes algorithm is implemented on a network of concurrently operating workstations using parallel virtual machine (PVM) and compared with its performance on a CRAY Y-MP and on an Intel iPSC/860. The problem is relatively computationally intensive, and has a communication structure based primarily on nearest-neighbor communication, making it ideally suited to message passing. Such problems are frequently encountered in computational fluid dynamics (CDF), and their solution is increasingly in demand. The communication structure is explicitly coded in the implementation to fully exploit the regularity in message passing in order to produce a near-optimal solution. Results are presented for various grid sizes using up to eight processors.

Deshpande, Manish↗

Coordination Chemistry of Solvated Metal Ions in Soft Donor Solvents

The structures of hexaammine solvated indium(III) and thallium(III) ions in liquid ammonia solution are determined by EXAFS. Both complexes have regular octahedral coordination geometry with mean In-N and Tl-N bond distances of 2.23(1) and 2.29(2) Å, respectively. Ammine solvated thallium(III) in liquid ammonia is characterized with 205Tl NMR measurements. Solvents such as liquid ammonia, N,N-dimethylthioformamide (DMTF), trialkyl and triphenyl phosphite and phosphine are strong electron pair donors and thereby able to form bonds with a large covalent contribution with strong electron pair acceptors. A survey of reported structures of ammine, DMTF, trialkyl and triphenyl phosphite and phosphine solvated metal ions in the solid state and solution is presented. The M-N and M-S bond distances in ammine and DMTF solvated metal ions are compared with the M-O bond distance in the corresponding metal ion hydrates, expected to form mainly electrostatic interactions with metal ions. The d10 metal ions have high ability to form bonds with a high degree of covalency with increasing ability down the group and with decreasing charge of the metal ion. The difference in M-N and M-O bond distances between ammine solvated and hydrated metal ions with the same coordination geometry decreases significantly with the increasing ability of the metal ion to form bonds with a large covalent contribution. This difference correlates well with the covalent bonding index, γM2*r.

Biochemistry & Molecular Biology↗