Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational complexity”

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 793 records · Page 44

Numerical optimization for symmetric tensor decomposition

We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on real-valued decompositions, both unconstrained and nonnegative. We discuss when solutions exist and how to formulate the mathematical program. Numerical results show the properties of the proposed formulations (including one that ignores symmetry) on a set of test problems and illustrate that these straightforward formulations can be effective even though the problem is nonconvex.

97 MATHEMATICS AND COMPUTING↗

On the benefit of using both hand calculation methods and computer experiments algorithms to solve complex nuclear criticality safety problems - 14299

A companion paper shows the 'anomalies', and even the safety issues, that may be raised by the very usual problem of making safe a fissile mass inside a controlled geometry. These anomalies mainly come from the solving of such problems which belong to the mathematical family of 'robust inversion' including two inversion parameters (the fissile mass and the geometry) and one nuisance parameter (the moderation ratio of the fissile material). Since a 'brute force' method of resolution requires a lot of calculations and since a 'smart' method of resolution requires a lot of engineer time, it is tempting to solve these problems by a 'custom made' approach rather than to achieve a 'whole' resolution. The present paper shows how one can use a hand calculation method (derivation of the one-speed diffusion theory) to perform the whole resolution of such kind of problems with a minimum calculations and human efforts. The powerful capability of predicting the 'anomalies' highlighted in the companion paper is shown. Then the limitations of such a method are discussed: limitation in the geometry of the problem and bias in absolute values prediction. Finally, new algorithms of computer experiments design, dedicated to solve robust inversion problems and based on Kriging surrogates, are tested to solve these problems with limiting calculations and human efforts. The performance of these new algorithms may supplement the one-speed diffusion theory limitations. (authors)

42 ENGINEERING↗

Quantization of a symplectic manifold associated to a manifold with projective structure

Let X be a complex manifold equipped with a projective structure P. There is a holomorphic principal C*-bundle L{sub P}{sup '} over X associated with P. We show that the holomorphic cotangent bundle of the total space of L{sub P}{sup '} equipped with the Liouville symplectic form has a canonical deformation quantization. This generalizes the construction in the work of and Ben-Zvi and Biswas [''A quantization on Riemann surfaces with projective structure,'' Lett. Math. Phys. 54, 73 (2000)] done under the assumption that dim{sub C} X=1.

97 MATHEMATICS AND COMPUTING↗

Generation and application of multivariate polynomial quadrature rules

The search for multivariate quadrature rules of minimal size with a specified polynomial accuracy has been the topic of many years of research. Finding such a rule allows accurate integration of moments, which play a central role in many aspects of scientific computing with complex models. The contribution of this paper is twofold. First, we provide novel mathematical analysis of the polynomial quadrature problem that provides a lower bound for the minimal possible number of nodes in a polynomial rule with specified accuracy. We give concrete but simplistic multivariate examples where a minimal quadrature rule can be designed that achieves this lower bound, along with situations that showcase when it is not possible to achieve this lower bound. Our second contribution is the formulation of an algorithm that is able to efficiently generate multivariate quadrature rules with positive weights on non-tensorial domains. Our tests show success of this procedure in up to 20 dimensions. We test our method on applications to dimension reduction and chemical kinetics problems, including comparisons against popular alternatives such as sparse grids, Monte Carlo and quasi Monte Carlo sequences, and Stroud rules. The quadrature rules computed in this paper outperform these alternatives in almost all scenarios.

97 MATHEMATICS AND COMPUTING↗

Generation and application of multivariate polynomial quadrature rules

The search for multivariate quadrature rules of minimal size with a specified polynomial accuracy has been the topic of many years of research. Finding such a rule allows accurate integration of moments, which play a central role in many aspects of scientific computing with complex models. The contribution of this paper is twofold. First, we provide novel mathematical analysis of the polynomial quadrature problem that provides a lower bound for the minimal possible number of nodes in a polynomial rule with specified accuracy. We give concrete but simplistic multivariate examples where a minimal quadrature rule can be designed that achieves this lower bound, along with situations that showcase when it is not possible to achieve this lower bound. Our second main contribution comes in the formulation of an algorithm that is able to efficiently generate multivariate quadrature rules with positive weights on non-tensorial domains. Our tests show success of this procedure in up to 20 dimensions. We test our method on applications to dimension reduction and chemical kinetics problems, including comparisons against popular alternatives such as sparse grids, Monte Carlo and quasi Monte Carlo sequences, and Stroud rules. The quadrature rules computed in this paper outperform these alternatives in almost all scenarios.

97 MATHEMATICS AND COMPUTING↗

Optimal bounds for the Schur index and the realizability of representations

An optimal bound is given for the Schur index of an irreducible complex representation over the field of rational numbers on the class of finite groups of a chosen order or of a chosen exponent. We obtain a sufficient condition for the realizability of an irreducible complex character χ of a finite group G of exponent n with Schur index m, which is either an odd number or has 2-part no smaller than 4, over the field of rational numbers in a field L which is a subfield of Q({sup n}√1 ) and (L:Q(χ))=m. This condition generalizes the well-known Fein condition obtained by him in the case of n=p{sup α}q{sup β}. The formulation of the Grunwald-Wang problem on the realizability of representations is generalized, and some sufficient conditions are obtained. Bibliography: 10 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

Concurrent implicit spectral deferred correction scheme for low-Mach number combustion with detailed chemistry

We present a parallel multi-implicit time integration scheme for the advection-diffusion-reaction systems arising from the equations governing low-Mach number combustion with complex chemistry. Here, our strategy employs parallelisation across the method to accelerate the serial Multi-Implicit Spectral Deferred Correction (MISDC) scheme used to couple the advection, diffusion, and reaction processes. In our approach, the diffusion solves and the reaction solves are performed concurrently by different processors. Our analysis shows that the proposed parallel scheme is stable for stiff problems and that the sweeps converge to the fixed-point solution at a faster rate than with serial MISDC. We present numerical examples to demonstrate that the new algorithm is high-order accurate in time, and achieves a parallel speedup compared to serial MISDC.

97 MATHEMATICS AND COMPUTING↗

Monitoring and prediction of porosity in laser powder bed fusion using physics-informed meltpool signatures and machine learning

In this work we accomplished the monitoring and prediction of porosity in laser powder bed fusion (LPBF) additive manufacturing process. This objective was realized by extracting physics-informed meltpool signatures from an in-situ dual-wavelength imaging pyrometer, and subsequently, analyzing these signatures via computationally tractable machine learning approaches. Porosity in LPBF occurs despite extensive optimization of processing conditions due to stochastic causes. Hence, it is essential to continually monitor the process with in-situ sensors for detecting and mitigating incipient pore formation. In this work a tall cuboid-shaped part (10 mm × 10 mm × 137 mm, material ATI 718Plus) was built with controlled porosity by varying laser power and scanning speed. This test caused various types of porosity, such as lack-of-fusion and keyhole formation, with varying degrees of severity in the part. The meltpool was continuously monitored using a dual-wavelength imaging pyrometer installed in the machine. Physically intuitive process signatures, such as meltpool length, temperature distribution, and ejecta (spatter) characteristics, were extracted from the meltpool images. Subsequently, relatively simple machine learning models, e.g., K-Nearest Neighbors, were trained to predict both the severity and type of porosity as a function of these physics-informed meltpool signatures. These models resulted in a prediction accuracy exceeding 95% (statistical F1-score). The same analysis was carried out with a complex, black-box deep learning convolutional neural network which directly used the meltpool images instead of physics-informed features. The convolutional neural network produced a comparable F1-score in the range of 89–97%. Finally, these results demonstrate that using pragmatic, physics-informed meltpool signatures within a simple machine learning model is as effective for flaw prediction in LPBF as using a complex and computationally demanding black-box deep learning model.

36 MATERIALS SCIENCE↗

Scalable multiscale modeling of platelets with 100 million particles

Here, we developed the core components of the AI-aided multiple time stepping algorithm for multiscale modeling of cell dynamics. This algorithm was implemented and analyzed on two supercomputer architectures with an application of simulating the aggregation of 250 platelets, or 102 million particles. To scale on these computers with complex memory and network architectures with GPUs, we devised a biomechanics-informed task mapping scheme to optimize load imbalance, communications, and memory utilization. Our simulations, scaling well up to 192 nodes on a Summit-like supercomputer with a peak speed of 11 petaflops, achieved a rate of 423 μs/day which is 500 times faster than the conventional algorithm using static time step and this has enabled studies of record size blood clots at record spatial–temporal resolutions. Additionally, we discovered the sensitive dependence of the scalability and execution time on the methods of decomposition, CPU–GPU coupling, and task mapping.

97 MATHEMATICS AND COMPUTING↗

Surface-supported cluster catalysis: Ensembles of metastable states run the show

It has recently been demonstrated that the dynamic behaviour of surface-supported nanocluster catalysts in realistic reaction conditions defies conventional models used in catalysis. This opens new doors in catalysis by giving more leverage in catalyst design, but also requires a major revision of the understanding of how dynamic heterogeneous catalytic interfaces operate, as well as of the computational approaches of catalyst modelling, and experimental methods of catalyst characterization. Key aspects of the new paradigm include the collective action of many catalyst states that form a statistical ensemble in reacting conditions, the catalytic activity and selectivity being driven by rare and metastable catalyst states, reaction thermodynamics and kinetics being controlled by different states of the catalyst, broken scaling relationships, non-Arrhenius behaviours, and catalyst dynamic restructuring being an essential part of the reaction mechanism. For computation, this complexity means the departure from the standard DFT calculations of reaction mechanisms on a single catalyst structure. For experiment, it calls for the development of operando characterization tools with the per-site resolution and the ability to find the minority sites that govern the catalytic activity. For catalyst design, the goal becomes the creation of the catalyst state (geometric and electronic) that might not be present in the as-prepared catalyst, but would develop in the reaction conditions and would have the desired activity then. While cluster catalysts are the most dramatic in their dynamic fluxionality, other amorphous interfaces also exhibit some of it, and thus are also subject to similar paradigm revision.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Riemann surface approach to bound and resonant states for a nonlocal potential

The Riemann surface approach to bound and resonant states is extended to the case of a separable nonlocal potential that is constant on a certain domain of the inner region and vanishes in the rest of the domain. The approach consists in the construction of the Riemann surface R{sub g} of the S-matrix pole function k=k(g) over the g-plane, where g is the strength of the complex nonlocal potential. On the Riemann surface R{sub g} the pole function k=k(g) is single-valued and analytic. The branch points of the pole function k=k(g) and their k-plane images are determined and analyzed as a function of the position of the region of nonlocality. The Riemann surface of the S-matrix pole function is constructed. According to the Riemann surface approach to each bound or resonant state a sheet of the Riemann surface R{sub g} is associated. All the natural modes (bound and resonant states) of the system are identified and treated in a unified way. The nonlocal potential generates narrow resonant states that cannot be produced by a local potential.

97 MATHEMATICS AND COMPUTING↗

Simple spatial scaling rules behind complex cities

Although most of wealth and innovation have been the result of human interaction and cooperation, we are not yet able to quantitatively predict the spatial distributions of three main elements of cities: population, roads, and socioeconomic interactions. By a simple model mainly based on spatial attraction and matching growth mechanisms, we reveal that the spatial scaling rules of these three elements are in a consistent framework, which allows us to use any single observation to infer the others. All numerical and theoretical results are consistent with empirical data from ten representative cities. In addition, our model can also provide a general explanation of the origins of the universal super- and sub-linear aggregate scaling laws and accurately predict kilometre-level socioeconomic activity. Our work opens a new avenue for uncovering the evolution of cities in terms of the interplay among urban elements, and it has a broad range of applications.

97 MATHEMATICS AND COMPUTING↗

Lowering tomography costs in quantum simulation with a symmetry projected operator basis

Measurement in quantum simulations provides a means for extracting meaningful information from a complex quantum state, and for quantum computing, reducing the complexity of measurement will be vital for near-term applications. For most quantum simulations, the targeted state will obey several symmetries inherent to the system Hamiltonian. Here, we obtain an alternative symmetry projected basis of measurement that reduces the number of measurements needed by a constant factor. Our scheme can be implemented at no additional cost on a quantum computer, can be implemented under various measurement or tomography schemes, and is reasonably resilient under noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimizing the performance of reactive molecular dynamics simulations for many-core architectures

Reactive molecular dynamics simulations are computationally demanding. Reaching spatial and temporal scales where interesting scientific phenomena can be observed requires efficient and scalable implementations on modern hardware. In this article, we focus on optimizing the performance of the widely used LAMMPS/ReaxC package for many-core architectures. As hybrid parallelism allows better leverage of the increasing on-node parallelism, we adopt thread parallelism in the construction of bonded and nonbonded lists and in the computation of complex ReaxFF interactions. To mitigate the I/O overheads due to large volumes of trajectory data produced and to save users the burden of post-processing, we also develop a novel in situ tool for molecular species analysis. We analyze the performance of the resulting ReaxC-OMP package on two different architectures: (i) Mira, an IBM Blue Gene/Q system and (ii) Cori-II, a Cray XC-40 sytem with Knights Landing processors. For Pentaerythritol tetranitrate (PETN) systems of sizes ranging from 32 thousand to 16.6 million particles, we observe speedups in the range of 1.5-4.5x. We observe sustained performance improvements for up to 262,144 cores (1,048,576 processes) of Mira and a weak scaling efficiency of 91.5% in large simulations containing 16.6 million particles. Finally, the in situ molecular species analysis tool incurs only insignificant overheads across various system sizes and runs configurations.

97 MATHEMATICS AND COMPUTING↗

Dynamical Complexity of Non-Gaussian Many-Body Systems with Dissipation

We characterize the dynamical state of many-body bosonic and fermionic many-body models with intersite Gaussian couplings, on-site non-Gaussian interactions, and local dissipation comprising incoherent particle loss, particle gain, and dephasing. We first establish that, for fermionic systems, if the dephasing noise is larger than the non-Gaussian interactions, irrespective of the Gaussian coupling strength, the system state is a convex combination of Gaussian states at all times. Furthermore, for bosonic systems, we show that if the particle loss and particle gain rates are larger than the Gaussian intersite couplings, the system remains in a separable state at all times. Building on this characterization, we establish that at noise rates above a threshold, there exists a classical algorithm that can efficiently sample from the system state of both the fermionic and bosonic models. Finally, we show that, unlike fermionic systems, bosonic systems can evolve into states that are not convex Gaussian even when the dissipation is much higher than the on-site non-Gaussianity. Similarly, unlike bosonic systems, fermionic systems can generate entanglement even with noise rates much larger than the intersite couplings.

Computational complexity↗

A Simple Criterion for Feasibility of Heat Integration between Distillation Streams Based on Relative Volatilities

In a multicomponent distillation configuration, there are numerous sources and sinks of heat, and a potential way to reduce the heat duty requirement is to perform heat integration. Unfortunately, an algorithmic search of the optimal heat integration opportunities is intractable when the required temperatures of intermediate streams are computed via complex models. Instead, in this work, we introduce pressure-scaled pseudo relative volatility, a new metric to compare stream temperatures. Here, we justify the use of pseudo relative volatility by proving that this variable is a monotonically increasing function of the liquid fraction in a saturated mixture stream. Using this metric, we derive a shortcut criterion to check the feasibility of various heat integration opportunities, such as thermal coupling via heat transfer (TCH). The advantage of this approach is that it circumvents the need for explicit temperatures and instead relies on composition, component relative volatilities, and pressure—quantities that are readily available in shortcut models for optimization of distillation configurations. Leveraging this fact, we propose a new optimization framework that identifies feasible TCHs that we consider within the formulation while minimizing the total heat duty of a distillation configuration. We demonstrate, on a few examples, that our formulation can identify heat duty efficient configurations, some of which are multieffect configurations. Using this methodology, we discover configurations that are not only simpler than the fully thermally coupled (FTC) configuration but also have a much lower heat duty.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Covalency of M–N Bonds in Isomorphous Lanthanide and Actinide 5-(2-Pyridyl)-1H-tetrazolate Complexes

Experimental and computational analyses of [M(pdtz) 3 (H 2 O) 3 ]·3.5H 2 O (M 3+ = Pu 3+ −Cm 3+ , La 3+ −Nd 3+ , and Sm 3+ −Ho 3+ , pdtz− = 5-(2-pyridyl)-1H-tetrazolate) were conducted to understand potential differences in bonding between lanthanide and actinide complexes with a N-donor ligand. Structural analyses show that the An−N bond distances in the Pu 3+ , Am 3+ , and Cm 3+ complexes are within error of one another. Whereas in the lanthanide series, there is a nearly linear decrease in the Ln−N bond lengths from La 3+ to Ho 3+ (excluding Pm 3+ ). The An−N bond lengths are ∼0.015 Å shorter than their similarly-sized lanthanide analogs, in agreement with computational results that suggest greater covalent character in these bonds versus those with lanthanides. QTAIM analysis indicates that the An−N orbital mixing remains essentially unchanged from Pu 3+ to Cm 3+ , consistent with the nearly identical An−N bond lengths. However, upon deconvolution of the NLMOs into orbital compositions, the metal orbital contributions to An−N bonding decreases slightly overall wherein the 6d involvement remains constant, 7s involvement slightly increases, and 5f participation decreases. The molecular orbital energy diagram indicates that energy degeneracy between the 5f metal and 2p ligand orbitals increases from Pu 3+ to Cm 3+ and counteracts the contraction of the 5f orbtials. Together with prior reports of decreasing energy degeneracy between 5f and 3p orbitals from Np 3+ to Cf 3+ , these observations provide guidance on understanding how chemical bonding evolves in the actinide series.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Factorizations of hyperpower family of iterative methods via least squares approach

A new method for finding proper factorizations of the hyperpower family of iterative methods for computing generalized inverses is proposed. The method is based on numerical optimization of an appropriate least squares problem. An iterative method in a non-normalized form for finding the generalized outer inverses with prescribed range and null space of any given complex matrix is proposed and considered. Computational complexity and convergence of the method are studied. Several numerical experiments are also presented.

97 MATHEMATICS AND COMPUTING↗