Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Engineering science”

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 541 records · Page 30

The ATTO-Campina site: A new observatory for tropical convection and gas-aerosol-cloud-precipitation interactions in the Amazon

We present results from ATTO-Campina, a new permanent observational site in central Amazon, about 4 km from the ATTO towers. Operational since 2020, ATTO-Campina characterizes atmospheric, cloud and rainfall properties through remote sensing. The goal is to provide continuous, complementary measurements to the ATTO towers, addressing the rainforest’s complex gas-aerosol-cloud-precipitation dynamics. Using a 3.5-year dataset, we classified convective clouds into three types: shallow cumulus (ShCu), congestus (Con) or (Deep) clouds. The shallow-to-deep transition takes about three hours, starting with ShCu formation at 11:00 local time. The accumulated rainfall peak follows at about 16:00. Only weak downdrafts are present in the upper troposphere where previous studies indicate new particle formation (NPF) occurrence. Strong downdrafts are mostly limited to heights below 5 km. Con and Deep convective days have higher concentrations of ultrafine aerosol and lower concentrations of accumulation-mode particles compared to ShCu. Convective clouds also significantly modify gas mixing ratios. Deep convective clouds are associated with high near-surface O3, consistent with downward transport from the midtroposphere. Our results showcase the added detail achieved by integrating data from the ATTO towers and ATTO-Campina sites. Together, these sites support better understanding of interconnected gas-aerosol-cloud-precipitation processes in the Amazon and their evolution under climate change.

54 ENVIRONMENTAL SCIENCES↗

Solving Large‐Scale Linear Systems of Equations by a Quantum Hybrid Algorithm

Abstract Today's intermediate‐scale quantum computers, although imperfect, already perform computational tasks that are manifestly beyond the capabilities of modern classical supercomputers. However, so far, quantum‐enabled large‐scale solutions have been realized only for limited set of problems. Here a hybrid algorithm based on phase estimation and classical optimization of the circuit width and depth is employed for solving a specific class of large linear systems of equations ubiquitous to many areas of science and engineering. A classification of linear systems based on the entanglement properties of the associated phase‐estimation unitary operation is introduced, enabling a highly efficient search for solutions that is facilitated by a straightforward matrix‐to‐circuit map. A 2 17 ‐dimensional problem is implemented on several IBM quantum computer superconducting quantum processors, a record‐breaking result for a linear system solved by a quantum computer. Demonstrated realisation sets a clear benchmark in the quest for the future quantum speedup in the linear systems of equations solution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cobalt–Nickel Exchange in Exfoliated Battery Layered Cathode Sheets with Application to Recycling

With the emerging dominance of electric vehicles (EV) in the transportation sector, recycling or upcycling spent battery materials will be required to reduce EV costs, lessen waste, and ease critical material supply chain issues for EV batteries. Here, motivated by work in the literature describing the exfoliation of layered oxides, first‐principles calculations are performed to show that Li x CoO 2 , if exfoliated into nanosheets, can readily undergo transition metal cation exchange in aqueous media. The substitution of Co 3+ or Co 4+ cations inside the sheet by Ni 2+ is associated with modest reaction barriers (Δ G* ≈ 0.3–0.7 eV) and is at most mildly endothermic (Δ G ≈ 0.2–0.3 eV). In contrast, previous battery degradation studies have shown that Co 3+ diffusion is strongly inhibited inside bulk layered oxides. This suggests that processing spent layered oxides as nanosheets can provide a potentially low‐energy‐cost pathway to altering the transition metal and/or dopant stoichiometry, which can be used toward developing new room‐temperature upcycling routes for cathodes from end‐of‐life batteries.

battery recycling↗

Biobased Poly(dodecylene Furanoate) with Inherent Advantages in Performance and Circularity

Biobased polymers are gaining traction toward more sustainable flexible-film packaging, yet overcoming trade-offs between their performance properties and end-of-life (EoL) options still remains a challenge. Here, it is shown that biobased poly(dodecylene 2,5-furanoate) (PDDF), synthesized via both step-growth polycondensation and chain-growth ring-opening polymerization methods, exhibits advantages not only in gas barrier properties but also in EoL options due to its biodegradability and closed-loop chemical circularity. Specifically, PDDF displays significantly lower oxygen and carbon dioxide permeability than commercial poly(butylene adipate-co-terephthalate) (PBAT) and linear low-density polyethylene , alongside a markedly higher modulus (by ≈3 ×) and reduced water vapor transmission rate compared to PBAT. This superior performance is attributed to the inherently rigid, polar, H-bonding furan rings that enhance chain interaction, packing and crystallinity and thus reduce free volume impeding gas diffusion, while the long hydrophobic dodecylene segments inhibit water permeation. Furthermore, PDDF can be recycled back to its cyclic monomer by base-catalyzed depolymerization or diester and diol monomers by simple methanolysis. These superior barrier properties, coupled with biodegradation and closed-loop circularity, highlight the potential of the biobased PDDF as a more sustainable alternative for packaging.

Poly(dodecylene 2,5-furanoate) (PDDF)↗

Quantum Fourier transform revisited

Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.

Camps, Daan↗

Smoky Mountain Data Challenge 2020: An Open Call to Solve Data Problems in the Areas of Neutron Science, Material Science, Urban Modeling and Dynamics, Geophysics, and Biomedical Informatics

The 2020 Smoky Mountains Computational Sciences and Engineering Conference enlists research scientists from across Oak Ridge National Laboratory (ORNL) to be data sponsors and help create data analytics challenges for eminent data sets at the laboratory. This work describes the significance of each of the seven data sets and their as- sociated challenge questions. The challenge questions for each data set were required to cover multiple difficulty levels. An international call for participation was sent to students, and researchers asking them to form teams of up to four people to apply novel data analytics techniques to these data sets.

Parete-Koon, Suzanne↗

Smoky Mountain Data Challenge 2021: An Open Call to Solve Scientific Data Challenges Using Advanced Data Analytics and Edge Computing

The 2021 Smoky Mountains Computational Sciences and Engineering Conference enlists scientists from across Oak Ridge National Laboratory (ORNL) and industry to be data sponsors and help create data analytics and edge computing challenges for eminent datasets in a variety of scientific domains. This work describes the significance of each of the eight datasets and their associated challenge questions. The challenge questions for each dataset were required to cover multiple difficulty levels. An international call for participation was sent to students, asking them to form teams of up to six people and apply novel data analytics and edge computing methods to solve these challenges.

Devineni, Pravallika↗

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗

Enhancing scalability and accuracy of quantum poisson solver

The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far either suffer from lack of accuracy and/or are limited to very small sizes of the problem and thus have no practical usage. In this regard, our previous work showed a proof-of-concept demonstration in advancing quantum Poisson solver algorithm and validated preliminary results for a simple case of 3 x 3 problem. In this work, we delve into comprehensive research details, presenting the results on up to 15 x 15 problems that include step-by-step improvements in Poisson equation solutions, scaling performance, and experimental exploration. In particular, we demonstrate the implementation of eigenvalue amplification by a factor of up to 2 8 , achieving a significant improvement in the accuracy of our quantum Poisson solver and comparing that to the exact solution. Additionally, we present success probability results, highlighting the reliability of our quantum Poisson solver. Moreover, we explore the scaling performance of our algorithm against the circuit depth and width, demonstrating how our approach scales with larger problem sizes and thus further solidifies the practicality of easy adaptation of this algorithm in real-world applications. We also discuss a multilevel strategy for how this algorithm might be further improved to explore much larger problems with greater performance. Finally, through our experiments on the IBM quantum hardware, we conclude that though overall results on the existing NISQ hardware are dominated by the error in the CNOT gates, this work opens a path to realizing a multidimensional Poisson solver on near-term quantum hardware.

97 MATHEMATICS AND COMPUTING↗