Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nonlinear optimization”

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 685 records · Page 38

Fusing time-varying mosquito data and continuous mosquito population dynamics models

Climate change is arguably one of the most pressing issues affecting the world today and requires the fusion of disparate data streams to accurately model its impacts. Mosquito populations respond to temperature and precipitation in a nonlinear way, making predicting climate impacts on mosquito-borne diseases an ongoing challenge. Data-driven approaches for accurately modeling mosquito populations are needed for predicting mosquito-borne disease risk under climate change scenarios. Many current models for disease transmission are continuous and autonomous, while mosquito data is discrete and varies both within and between seasons. This study uses an optimization framework to fit a non-autonomous logistic model with periodic net growth rate and carrying capacity parameters for 15 years of daily mosquito time-series data from the Greater Toronto Area of Canada. The resulting parameters accurately capture the inter-annual and intra-seasonal variability of mosquito populations within a single geographic region, and a variance-based sensitivity analysis highlights the influence each parameter has on the peak magnitude and timing of the mosquito season. This method can easily extend to other geographic regions and be integrated into a larger disease transmission model. This method addresses the ongoing challenges of data and model fusion by serving as a link between discrete time-series data and continuous differential equations for mosquito-borne epidemiology models.

97 MATHEMATICS AND COMPUTING↗

An Anisotropic Yield and Damage Material Model to Improve the Contact Pressure Analysis in a Biomass Shredding System

Size reduction systems used in biomass processing break biomass into smaller pieces by utilizing the kinetic energy from the sharp rotating blades. Abrasive and/or erosive wear caused by biomass comminution results in blade wear of the sharp edged cutters, deteriorating the process efficiency. Here, this study aims to optimize the blade design and improve the system efficiency by attempting to understand the interactions between the blades and biomass particles. Since real-time monitoring of these interactions is impractical during operation, mechanical simulations offer a viable alternative for investigating the shredding process. Yet, the irregular geometry and complex mechanical properties of biomass—such as the anisotropic nature of woodchips and their nonlinear fracture behavior—pose significant challenges for accurately simulating contact pressure. In this work an anisotropic yield material model, along with a damage initiation and evolution function, is applied to the woodchip particle to study the contact pressure on shredder blade, offering a scientific basis for improved blade design and process efficiency. This approach can be extended to other biomass processing systems with similar anisotropic feedstocks, making it a valuable tool for advancing sustainable biomass utilization.

09 - BIOMASS FUELS↗

Partitioned exponential methods for coupled multiphysics systems

Multiphysics problems involving two or more coupled physical phenomena are ubiquitous in science and engineering. This work develops a new partitioned exponential approach for the time integration of multiphysics problems. After a possible semi-discretization in space, the class of problems under consideration is modeled by a system of ordinary differential equations where the right-hand side is a summation of two component functions, each corresponding to a given set of physical processes. The partitioned-exponential methods proposed herein evolve each component of the system via an exponential integrator, and information between partitions is exchanged via coupling terms. Here, the traditional approach to constructing exponential methods, based on the variation-of-constants formula, is not directly applicable to partitioned systems. Rather, our approach to developing new partitioned-exponential families is based on a general-structure additive formulation of the schemes. Two method formulations are considered, one based on a linear-nonlinear splitting of the right hand component functions, and another based on approximate Jacobians. The paper develops classical (non-stiff) order conditions theory for partitioned exponential schemes based on particular families of T-trees and B-series theory. Several practical methods of third order are constructed that extend the Rosenbrock-type and EPIRK families of exponential integrators. Several implementation optimizations specific to the application of these methods to reaction-diffusion systems are also discussed. Numerical experiments reveal that the new partitioned-exponential methods can perform better than traditional unpartitioned exponential methods on some problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Active operator learning with predictive uncertainty quantification for partial differential equations

With the increased prevalence of neural operators being used to provide rapid solutions to partial differential equations (PDEs), understanding the accuracy of model predictions and the associated error levels is necessary for deploying reliable surrogate models in scientific applications. Existing uncertainty quantification (UQ) frameworks employ ensembles or Bayesian methods, which can incur substantial computational costs during both training and inference. Here, we propose a lightweight predictive UQ method tailored for Deep operator networks (DeepONets) that also generalizes to other operator networks. Numerical experiments on linear and nonlinear PDEs demonstrate that the framework’s uncertainty estimates are unbiased and provide accurate out-of-distribution uncertainty predictions with a sufficiently large training dataset. Our framework provides fast inference and uncertainty estimates that can efficiently drive outer-loop analyses that would be prohibitively expensive with conventional solvers. We demonstrate how predictive uncertainties can be used in the context of Bayesian optimization and active learning problems to yield improvements in accuracy and data-efficiency for outer-loop optimization procedures. In the active learning setup, we extend the framework to Fourier Neural Operators (FNO) and describe a generalized method for other operator networks. To enable real-time deployment, we introduce an inference strategy based on precomputed trunk outputs and a sparse placement matrix, reducing evaluation time by more than a factor of five. Our method provides a practical route to uncertainty-aware operator learning in time-sensitive settings.

97 MATHEMATICS AND COMPUTING↗

Equation-Free Coarse Control of Distributed Parameter Systems via Local Neural Operators

The control of high-dimensional distributed parameter systems (DPS) remains a challenge when explicit coarse-grained equations are unavailable. Classical equation-free (EF) approaches rely on fine-scale simulators treated as black-box timesteppers. However, repeated simulations for steady-state computation, linearization, and control design are often computationally prohibitive, or the microscopic timestepper may not even be available, leaving us with data as the only resource. We propose a data-driven alternative that uses local neural operators, trained on spatiotemporal microscopic/mesoscopic data, to obtain efficient short-time solution operators. These surrogates are employed within Krylov subspace methods to compute coarse steady and unsteady-states, while also providing Jacobian information in a matrix-free manner. Krylov-Arnoldi iterations then approximate the dominant eigenspectrum, yielding reduced models that capture the open-loop slow dynamics without explicit Jacobian assembly. Both discrete-time Linear Quadratic Regulator (dLQR) and pole-placement (PP) controllers are based on this reduced system and lifted back to the full nonlinear dynamics, thereby closing the feedback loop.

93B52, 93C20, 47N70, 65J15, 65M32, 68T07, 68T20, 6↗

Process Optimization of Carbon Electrode Materials Manufacturing by Experimental Study and Machine Learning Techniques

Electrospun carbon fibers from coal have been investigated as electrodes for batteries and supercapacitors. Despite the excellent properties of coal-derived carbon fibers (CCNF) for energy storage devices, there still lacks systematic understanding on how various process parameters affect final electrode performances, which poses challenges to scale from pilot to high volume manufacturing. The goals of this project are twofold. First, we focuse on process optimization for converting a new precursor from powder river basin (PRB) coal, referred to as coal-based polyurethane (CPU) to CCNF using electrospinning. Second, different machine learning techniques will be examined using experimental data from this work and open literature. Specifically, for CPU the following process parameters need to be characterized and optimized in order to produce CCNFs with desirable mechanical integrity and physiochemical properties: precursor composition and viscosity, operating voltage and distance, oxidation and carbonization temperature and duration. Consequently, physiochemical properties of the fibers were characterized to correlate these process parameters with desirable electrochemical performance. Given the complex nature of the fiber production process, ML models are assessed for their ability to capture the nonlinear relationship between process parameters and the electrochemical properties in applications including supercapacitors. As such, we applied various machine learning techniques, to determine which technique produces a model that best predicts device function.

Cincotta, Robert E.F.↗

Interpretable and flexible non-intrusive reduced-order models using reproducing kernel Hilbert spaces

This paper develops an interpretable, non-intrusive reduced-order modeling technique using regularized kernel interpolation. Existing non-intrusive approaches approximate the dynamics of a reduced-order model (ROM) by solving a data-driven least-squares regression problem for low-dimensional matrix operators. Our approach instead leverages regularized kernel interpolation, which yields an optimal approximation of the ROM dynamics from a user-defined reproducing kernel Hilbert space. We show that our kernel-based approach can produce interpretable ROMs whose structure mirrors full-order model structure by embedding judiciously chosen feature maps into the kernel. The approach is flexible and allows a combination of informed structure through feature maps and closure terms via more general nonlinear terms in the kernel. We also derive a computable a posteriori error bound that combines standard error estimates for intrusive projection-based ROMs and kernel interpolants. In conclusion, the approach is demonstrated in several numerical experiments that include comparisons to operator inference using both proper orthogonal decomposition and quadratic manifold dimension reduction.

Data-driven model reduction↗

Basin-scale biogeography of marine phytoplankton reflects cellular-scale optimization of metabolism and physiology

Extensive microdiversity within Prochlorococcus, the most abundant marine cyanobacterium, occurs at scales from a single droplet of seawater to ocean basins. To interpret the structuring role of variations in genetic potential, as well as metabolic and physiological acclimation, we developed a mechanistic constraint-based modeling framework that incorporates the full suite of genes, proteins, metabolic reactions, pigments, and biochemical compositions of 69 sequenced isolates spanning the Prochlorococcus pangenome. Optimizing each strain to the local, observed physical and chemical environment along an Atlantic Ocean transect, we predicted variations in strain-specific patterns of growth rate, metabolic configuration, and physiological state, defining subtle niche subspaces directly attributable to differences in their encoded metabolic potential. Predicted growth rates covaried with observed ecotype abundances, affirming their significance as a measure of fitness and inferring a nonlinear density dependence of mortality. Our study demonstrates the potential to interpret global-scale ecosystem organization in terms of cellular-scale processes.

59 BASIC BIOLOGICAL SCIENCES↗

Technical Routes to Achieve High Circular Polarized Luminescence in Chiral Perovskites: A Mini‐Review

Chiral hybrid organic-inorganic perovskites (HOIPs) have emerged as promising materials for optoelectronic and spintronic applications, leveraging unique properties such as circularly polarized luminescence (CPL), circularly polarized nonlinear optical (NLO) emission, and chiral-induced spin selectivity (CISS). However, challenges remain in stabilizing these materials under environmental stresses and precisely controlling chirality for scalable use. This review summarizes five main strategies to induce chirality in HOIPs, i.e., direct incorporation of chiral cations, surface modification with chiral ligands, ion doping, template-induced chirality, and chiral metasurfaces. Each approach offers distinct advantages for optimizing CPL efficiency and device stability, paving the way for next-generation applications in CPL detectors, information encryption, spintronic devices, etc.

14 SOLAR ENERGY↗

Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems

Anderson acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson–Picard (AAP) method. Furthermore, despite introducing more “slow” Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP and a multisecant-GMRES method that uses GMRES to solve a multisecant linear system at each iteration. From this perspective, we show that AAP “converges” to the Newton-GMRES method. Specifically, as the residual approaches zero, the multisecant matrix, the approximate Jacobian inverse, the search direction, and the optimization gain of AAP converge to their counterparts in the Newton-GMRES method. These connections provide insights for analyzing the asymptotic convergence properties of AAP. Consequently, we show that AAP is locally 𝑞-linear convergent and provide an upper bound for the convergence factor of AAP. To validate the theoretical results, numerical examples are provided.

Anderson acceleration↗

PETSc/TAO Users Manual (Rev. 3.19)

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and opti mization that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than packages such as MATLAB or a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or lldb, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself. For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. There are several packages, built on PETSc, that may satisfy your needs without requiring directly using PETSc. We recommend reviewing these packages functionality before starting to code directly with PETSc. PETSc can be used to provide a “MPI parallel linear solver” in an otherwise sequential, or OpenMP parallel code. This approach cannot provide extremely large improvements in the application time by utilizing large numbers of MPI processes but can still improve the performance. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect true scalability to large numbers of MPI processes. See PCMPI for details on how to utilize the PETSc MPI linear solver server. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc has been supported for twenty-five years; see mailing list information on our website for information on contacting support.

97 MATHEMATICS AND COMPUTING↗

Control of Fractional Diffusion Problems via Dynamic Programming Equations

In this study, we explore the approximation of feedback control of integro-differential equations containing a fractional Laplacian term. To obtain feedback control for the state variable of this nonlocal equation, we use the Hamilton–Jacobi–Bellman equation. It is well known that this approach suffers from the curse of dimensionality, and to mitigate this problem we couple semi-Lagrangian schemes for the discretization of the dynamic programming principle with the use of Shepard approximation. This coupling enables approximation of high-dimensional problems. Numerical convergence toward the solution of the continuous problem is provided together with linear and nonlinear examples. The robustness of the method with respect to disturbances of the system is illustrated by comparisons with an open-loop control approach.

97 MATHEMATICS AND COMPUTING↗

Recent advances in computational mathematics and applications

We are honored to bring you this special issue dedicated to recent advances in computational mathematics and applications in science and engineering. The papers in this special issue were presented in ”Conference on Computational Mathematics and Applications (CCMA)” held at the University of Nevada Las Vegas (UNLV) during October 25–27, 2019. The conference has attracted about 90 attendees from six countries. The 15 papers in the special issue comprise a diverse collection of theoretical numerical analysis as well as applications in various subjects. Topics cover optimal control of PDEs, discontinuous Galerkin methods, fluid flow in porous media, turbulence flow, static and moving interface problems, complex fluids composed by the mixture of Newtonian fluid and nematic (liquid crystal) flows, modeling of ocean–atmosphere system, image segmentation algorithm, uncertainty quantification problems for turbulence model and Maxwell’s equations, iterative solver for systems resulting from mixed methods, and novel methods for solving systems of nonlinear equations. As the Guest Editors we would like to thank Dr. Leland Jameson at NSF (National Science Foundation) for kindly supporting our conference proposal which made this conference possible. We would also like to thank Darren Sugrue from Elsevier who provided partial support for our conference, and Thennarasu Gunasekaran and his production team from Elsevier who produced this nice special issue. We are grateful to many people (Dr. Zhijian Wu, Lori Ornelas, Elsa Juarez, and many Ph.D. students) at the Department of Mathematical Sciences of UNLV who provided tremendous support for the conference. Finally, we very much appreciate all authors who contributed their precious results to this special issue.

97 MATHEMATICS AND COMPUTING↗

Quantum Information for Fusion Energy Sciences (Final Technical Report)

The simulation of plasma dynamics is a critical area of Fusion Energy Sciences (FES) due to it’s usefulness in predicting, controlling, and confining plasmas in the context of potential fusion reactors. The simulation of plasmas is a computationally difficult problem in both classical and quantum physics, motivating investigation into the potential of quantum computers to simulate these systems. This project took several concrete steps towards this goal by developing tools for improving the control, characterization, and calibration of quantum gates on a superconducting quantum computer, developing error suppression and mitigation tools to reduce errors on the quantum computer, and utilizing these advancements to simulate reduced models of plasma dynamics on the quantum computer. In order to efficiently simulate plasma physics, an optimal control method which synthesizes, directly at the pulse level, any quantum gate on qubit and qutrit systems was developed. Using four superconducting transmon quantum processors at Rigetti and LLNL, it was demonstrated that any arbitrary quantum gate on qubits and qutrits could be implemented with high fidelity, leading to a significantly reduced length of a gate sequence. A problem of interest in FES is the nonlinear optical process of laser pulse compression within a plasma. Since quantum physics is linear, simulating nonlinear operations is not naturally feasible on a quantum computer, however it is possible to simulated a quantized version of the nonlinear process. A quantization approach to convert nonlinear wave-wave interaction problems to Hamiltonian simulation problems was developed and demonstrated using two qubits on a Rigetti device. In this experiment, a number of error suppression and mitigation techniques were investigated to determine how best to utilize the finite quantum resources. This study provides an example of how plasma problems may be solved on near-term, noisy quantum computing platforms and identified a promising set of techniques. Building on the insights of these experiments, the investigation turned to linear electron-plasma wave physics. A connection was identified between a local one-dimensional lattice spin model and linear wave phenomena, allowing a plasma physics problem to be efficiently mapped to the quantum computer. In this framework, reflection and transmission of plasma waves at a sharp boundary was studied, as well as the propagation of waves through an inhomogeneous plasma medium. In addition to the suite of error suppression and mitigation techniques developed, this experiment introduced the use of a digital-analog gate scheme designed to efficiently simulate the plasma Hamiltonian. With hardware available at the conclusion of the project, simulation at the scale of 9 qubits and 15 timesteps (60 entangling layers) was achieved.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Core performance predictions in projected SPARC first-campaign plasmas with nonlinear CGYRO

This work characterizes the core transport physics of SPARC early-campaign plasmas using the PORTALS-CGYRO framework. Empirical modeling of SPARC plasmas with L-mode confinement indicates an ample window of breakeven (Q > 1) without the need of H-mode operation. Extensive modeling of multi-channel (electron energy, ion energy, and electron particle) flux-matched conditions with the nonlinear CGYRO code for turbulent transport coupled to the macroscopic plasma evolution using PORTALS reveals that the maximum fusion performance to be attained will be highly dependent on the near-edge pressure. Stiff core transport conditions are found, particularly when fusion gain approaches unity, and predicted density peaking is found to be in line with empirical databases of particle source-free H-modes. Impurity optimization is identified as a potential avenue to increase fusion performance while enabling core-edge integration. Extensive validation of the quasilinear TGLF model builds confidence in reduced-model predictions. The implications of projecting L-mode performance to high-performance and burning-plasma devices is discussed, together with the importance of predicting edge conditions.

Rodriguez-Fernandez, P. (ORCID:0000000273611131)↗

Distributed Aerodynamic Control using Active Trailing-Edge Flaps for Large Wind Turbines

This work presents a numerical framework to investigate distributed aerodynamic control devices for application in large wind turbines. Tool capabilities were extended to facilitate multiple aerodynamic polar tables. The airfoil aerodynamics characteristics were automatically determined, and blade-pitch, generator-torque, and trailing-edge-flap controllers were tuned in-the-loop according to a specific blade design. This automated workflow allows analysis and optimization of trailing-edge flaps, enabling codesign studies. Results targeted reductions of root-flap-bending moment derivatives. The applied trailing-edge-flap control reduced the standard deviation of root-flap-bending moments by more than 6% and benefit related parameters, e.g., reduce blade-tip deflections, by up to 8%. Because of varying thrust distributions along the blade span, different flap designs have nonlinear characteristics in terms of the control objective and show best performance when located at the radial position with maximum thrust. In general, larger flaps provide a greater influence to reduce the target control objective.

17 WIND ENERGY↗