Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “nonsmooth”

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 73 records · Page 4

Relating Lexicographic Smoothness and Directed Subdifferentiability

Lexicographic derivatives developed by Nesterov and directed subdifferentials developed by Baier, Farkhi, and Roshchina are both essentially nonconvex generalized derivatives for nonsmooth nonconvex functions and satisfy strict calculus rules and mean-value theorems. This article aims to clarify the relationship between the two generalized derivatives. In particular, for scalar-valued functions that are locally Lipschitz continuous, lexicographic smoothness and directed subdifferentiability are shown to be equivalent, along with the necessary optimality conditions corresponding to each. For such functions, the visualization of the directed subdifferential-the Rubinov subdifferential-is shown to include the lexicographic subdifferential, and is also shown to be included in its closed convex hull. As a result, various implications of these results are discussed.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Optimal control of systems with discontinuous differential equations.

In this paper we discuss the problem of verifying and computing optimal controls of systems whose dynamics is governed by differential systems with a discontinuous right-hand side. In our work, we are motivated by optimal control of mechanical systems with Coulomb friction, which exhibit such a right-hand side. Notwithstanding the impressive development of nonsmooth and set-valued analysis, these systems have not been closely studied either computationally or analytically. We show that even when the solution crosses and does not stay on the discontinuity, differentiating the results of a simulation gives gradients that have errors of a size independent of the stepsize. This means that the strategy of 'optimize the discretization' will usually fail for problems of this kind. We approximate the discontinuous right-hand side for the differential equations or inclusions by a smooth right-hand side. For these smoothed approximations, we show that the resulting gradients approach the true gradients provided that the start and end points of the trajectory do not lie on the discontinuity and that Euler's method is used where the step size is 'sufficiently small' in comparison with the smoothing parameter. Numerical results are presented for a crude model of car racing that involves Coulomb friction and slip showing that this approach is practical and can handle problems of moderate complexity.

97 MATHEMATICS AND COMPUTING↗

History-Dependent Problems with Applications to Contact Models for Elastic Beams

We prove an existence and uniqueness result for a class of subdifferential inclusions which involve a history-dependent operator. Then we specialize this result in the study of a class of history-dependent hemivariational inequalities. Problems of such kind arise in a large number of mathematical models which describe quasistatic processes of contact. To provide an example we consider an elastic beam in contact with a reactive obstacle. The contact is modeled with a new and nonstandard condition which involves both the subdifferential of a nonconvex and nonsmooth function and a Volterra-type integral term. We derive a variational formulation of the problem which is in the form of a history-dependent hemivariational inequality for the displacement field. Then, we use our abstract result to prove its unique weak solvability. Finally, we consider a numerical approximation of the model, solve effectively the approximate problems and provide numerical simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗

Smoothness in the Dini Space of a Single Layer Potential for a Parabolic System in the Plane

We prove estimates in the Dini space for the second order spatial derivative of a vector parabolic single layer potential. We obtain estimates for higher order derivatives of solutions to initial-boundary-value problems for one-dimensional parabolic systems with Dini-continuous coefficients in a curvilinear domain with nonsmooth lateral boundary.

97 MATHEMATICS AND COMPUTING↗

Derivative-free optimization of a rapid-cycling synchrotron

Here, we develop and solve a constrained optimization model to identify an integrable optics rapid-cycling synchrotron lattice design that performs well in several capacities. Our model encodes the design criteria into 78 linear and nonlinear constraints, as well as a single nonsmooth objective, where the objective and some constraints are defined from the output of Synergia, an accelerator simulator. We detail the difficulties of the 23-dimensional simulation-constrained decision space and establish that the space is nonempty. We use a derivative-free manifold sampling algorithm to account for structured nondifferentiability in the objective function. Our numerical results quantify the dependence of solutions on constraint parameters and the effect of the form of objective function.

43 PARTICLE ACCELERATORS↗

Interactive Exploration of High-Dimensional Phase Diagrams

High-dimensional thermodynamic phase stability databases are becoming increasingly common due to the convergence of three recent trends: (i) the widespread interest in so-called “high-entropy” alloys, (ii) the availability of high-throughput computational assessments of phase stability in broad composition spaces and (iii) the ongoing development of ever-increasingly broad, multicomponent, multiphase CALPHAD databases. Although automated computational tools can readily process such high-dimensional data, scientists are often unable to visualize the relevant phase relations, an ability that is crucial to gaining an intuitive understanding of the stability constraints governing materials design. The present work addresses this need by providing algorithms that enable the interactive exploration of phase equilibria in high-dimensional spaces. These algorithms concentrate the complex nonlinear nonsmooth optimization needed into a preprocessing step that generates a large number of high-dimensional yet elementary graphical primitives. Furthermore, these primitives can then be cross-sectioned to yield 3-dimensional views in a computationally efficient manner that enables an interactive exploration of high-dimensional spaces. All of these operations are highly parallelizable, thus facilitating scaling of this method to large data sets.

36 MATERIALS SCIENCE↗

On the periodic solutions of the Michelson continuous and discontinuous piecewise linear differential system

Applying new results from the averaging theory for continuous and discontinuous differential systems, we study the periodic solutions of two distinct versions of the Michelson differential system: a Michelson continuous piecewise linear differential system and a Michelson discontinuous piecewise linear differential system. The tools here used can be applied to general nonsmooth differential systems.

97 MATHEMATICS AND COMPUTING↗

Stochastic DC optimal power flow with reserve saturation

We propose an optimization framework for stochastic optimal power flow with uncertain loads and renewable generator capacity. Our model follows previous work in assuming that generator outputs respond to load imbalances according to an affine control policy, but introduces a model of saturation of generator reserves by assuming that when a generator’s target level hits its limit, it abandons the affine policy and produces at that limit. This is a particularly interesting feature in models where wind power plants, which have uncertain upper generation limits, are scheduled to provide reserves to balance load fluctuations. Here, the resulting model is a nonsmooth nonconvex two-stage stochastic program, and we use a stochastic approximation method to find stationary solutions to a smooth approximation. Computational results on 6-bus and 118-bus test instances demonstrate that by considering the effects of saturation, our model can yield solutions with lower expected generation costs (at the same target line violation probability level) than those obtained from a model that enforces the affine policy to stay within generator limits with high probability.

17 WIND ENERGY↗

Nonlinear Fourier analysis for discontinuous conductivities: Computational results

Two reconstruction methods of Electrical Impedance Tomography (EIT) are numerically compared for nonsmooth conductivities in the plane based on the use of complex geometrical optics (CGO) solutions to D-bar equations involving the global uniqueness proofs for Calderón problem exposed in Nachman (1996) [43] and Astala and Päivärinta (2006) [6]: the Astala–Päivärinta theory-based low-pass transport matrix method implemented in Astala et al. (2011) [3] and the shortcut method which considers ingredients of both theories. The latter method is formally similar to the Nachman theory-based regularized EIT reconstruction algorithm studied in Knudsen et al. (2009) [34] and several references from there. New numerical results are presented using parallel computation with size parameters larger than ever, leading mainly to two conclusions as follows. First, both methods can approximate piecewise constant conductivities better and better as the cutoff frequency increases, and there seems to be a Gibbs-like phenomenon producing ringing artifacts. Second, the transport matrix method loses accuracy away from a (freely chosen) pivot point located outside of the object to be studied, whereas the shortcut method produces reconstructions with more uniform quality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Open Specy 1.0: Automated (Hyper)spectroscopy for Microplastics

Microplastic spectral analysis is one of the most time-consuming processes in studying microplastic pollution, often requiring days per sample. Researchers are transitioning to automated batch and hyperspectral image analysis techniques to enhance efficiency. Open Specy, initially aimed at manual single-spectrum analysis, has now integrated automated methods. This updated version, Open Specy 1.0, introduces several new features, including two algorithms for automated processing (smoothing and particle compression), an extensive library containing over 40,000 open-source Raman and FTIR spectra, and two machine learning classifiers (logistic regression and k medoids) developed from this library. Furthermore, it includes a revamped user interface, an R package, and a benchmark data set for testing future advancements in automated techniques. Researchers evaluated various configurations for hyperspectral smoothing, particle identification, compression, and splitting, to achieve combined recovery rates between 50 and 150% particle counts, identities, and sizes with a coefficient of variation (CV) of less than 40% (the accredited standard). Mean absorbance times the standard deviation provided a consistent particle identification. Hyperspectral smoothing led to a 96% combined recovery rate and reduced variability (CV = 38%) compared to the 86% recovery (CV = 83%) of nonsmoothed controls. Additionally, compressing spectra for particles was significantly faster (>3x) and showed similar accuracy but with reduced variability than processing each pixel individually. Key challenges persist in automating spectral analysis, particularly in refining particle splitting algorithms, and improving identification routines to minimize false positives and negatives. In conclusion, new methods in sample preparation for better stabilization and dispersion of particles could overcome some of these issues.

13 HYDRO ENERGY↗

Maintaining a Flat Li Surface during the Li Stripping Process via Interface Design

Electroplating has been the main focus in mitigating the dendrite growth on the Li-metal electrode; however, the stripping process is equally critical, since the nonsmooth Li surface during stripping will lead to nonuniform local current density, planting the seeds for dendrite growth. In this paper, density functional theory (DFT) and kinetic Monte Carlo (KMC) techniques were combined to investigate the vacancy evolution in Li interfaced with different solid–electrolyte interphase (SEI) materials. It was found that the lithiophilic interface, such as Li/Li 2 O, repels vacancies into the bulk Li, so Li atoms can quickly fill the Li vacancies near the Li/Li 2 O interface and maintain a smooth Li surface. In contrast, the lithiophobic interface, such as Li/LiF, traps Li vacancies toward the interface, and the accumulated Li vacancies form voids and roughen the surface. The predicted critical stripping current density, below which a smooth Li surface will be maintained, is therefore much faster at the lithiophilic interface than that at the lithiophobic interface. It was further revealed that the lithiophilicity at different SEI or coating materials can be ranked as Li/Li 2 O > Li/LiPON > Li/Li 2 CO 3 > Li/LiF based on the calculated interfacial adhesion and accumulation of electron density at the interface. Furthermore, this suggests that interface and coating design at nanoscale can be effective for maintaining a smooth Li surface during the stripping process, solving another challenge to achieving a dendrite-free Li-metal electrode in both liquid and solid electrolytes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Positive-Definite, WENO-Limited, High-Order Finite Volume Solver for 2-D Transport on the Cubed Sphere Using an ADER Time Discretization

Modern computer architectures reward added computation if it reduces algorithmic dependence, reduces data movement, increases accuracy/robustness, and improves memory accesses. The driving motive for this study is to develop a numerical algorithm that respects these constraints while improving accuracy and robustness. This study introduces the ADER-DT (Arbitrary DERivatives in time and space-differential transform) time discretization to positive-definite, weighted essentially nonoscillatory (WENO)-limited, finite volume transport on the cubed sphere in lieu of semidiscrete integrators. The cost of the ADER-DT algorithm is significantly improved from previous implementations without affecting accuracy. A new function-based WENO implementation is also detailed for use with the ADER-DT time discretization. While ADER-DT costs about 1.5 times more than a fourth-order, five-stage strong stability preserving Runge-Kutta (SSPRK4) method, it is far more computationally dense (which is advantageous on accelerators such as graphics processing units), and it has a larger effective maximum stable time step. ADER-DT errors converge more quickly with grid refinement than SSPRK4, giving 6.5 times less error in the L ∞ norm than SSPRK4 at the highest refinement level for smooth data. For nonsmooth data, ADER-DT resolves C 0 discontinuities more sharply. For a complex flow field, ADER exhibits less phase error than SSPRK4. In conclusion, improving both accuracy and robustness as well as better respecting modern computational efficiency requirements, we believe the method presented herein is competitive for efficiently transporting tracers over the sphere for applications targeting modern computing architectures.

97 MATHEMATICS AND COMPUTING↗

Genetic algorithm-based geometry calibration for dynamic compression x-ray diffraction experiments

An important component of dynamic compression x-ray diffraction (XRD) experiment analysis is geometry calibration: proper data interpretation requires knowledge of the precise detector position and orientation and, if the experiment involves a single-crystal sample, knowledge of the lattice orientation. The determination of these parameters in the arbitrary three-dimensional (3D) scattering geometries often present in dynamic compression facilities is challenging, as the associated optimization problem can be highly nonlinear, nonsmooth, and discontinuous. We present a genetic algorithm-based approach for performing dynamic compression XRD calibrations that overcomes these obstacles. We provide details regarding the image processing, algorithm implementation, and open-source software deployment and demonstrate the capability of the approach to calibrate the detector and crystal parameters in 3D geometries. Notably, we demonstrate the solver’s capacity to find the crystal orientation without a priori rotation constraints.

Brown, Nathan P. [Sandia National Laboratories (SN↗

Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems

We present an algorithm to compute the pseudospectral abscissa for a nonlinear eigenvalue problem. The algorithm relies on global under-estimator and over-estimator functions for the eigenvalue and singular value functions involved. These global models follow from eigenvalue perturbation theory. The algorithm has three particular features. First, it converges to the globally rightmost point of the pseudospectrum, and it is immune to nonsmoothness. The global convergence assertion is under the assumption that a global lower bound is available for the second derivative of a singular value function depending on one parameter. It may not be easy to deduce such a lower bound analytically, but assigning large negative values works robustly in practice. Second, it is applicable to large-scale problems since the dominant cost per iteration stems from computing the smallest singular value and associated singular vectors, for which efficient iterative solvers can be used. Furthermore, a significant increase in computational efficiency can be obtained by subspace acceleration, that is, by restricting the domains of the linear maps associated with the matrices involved to small but suitable subspaces, and solving the resulting reduced problems. Occasional restarts of these subspaces further enhance the efficiency for large-scale problems. Finally, in contrast to existing iterative approaches based on constructing low-rank perturbations and rightmost eigenvalue computations, the algorithm relies on computing only singular values of complex matrices. Hence, the algorithm does not require solutions of nonlinear eigenvalue problems, thereby further increasing efficiency and reliability. This work is accompanied by a robust implementation of the algorithm that is publicly available.

97 MATHEMATICS AND COMPUTING↗

Efficient and accurate numerical integration of exchange-correlation density functionals

We present a method for efficient calculation of exchange correlation in a density-functional theory calculation with Gaussian basis functions. It seamlessly combines the treatments of smooth (low-energy cutoff) and nonsmooth parts of the electron density such that computational performance can be maximized without approximation. Benchmark calculations show that the scheme can speed up the calculation of the exchange-correlation by as much as ten times or more without error.

74 ATOMIC AND MOLECULAR PHYSICS↗

Gravitational wave production after inflation with cuspy potentials

We investigate the effect of the cuspiness of scalar potentials on the production of gravitational waves during oscillon formation after inflation. We consider a more general form of potentials with a mass parameter M, which reproduce cuspy potentials for fields much larger than M and smooth potentials in the opposite limit. For cuspy potentials, nonsmooth oscillations of the inflaton induce an amplification of the inflaton fluctuations at the bottom of the potential, so that oscillons copiously form, which leads to a significant stochastic gravitational wave background with a double-peak spectrum. By varying the parameter M, we find that cuspy potentials yield stronger signals of gravitational waves and the generation of gravitational waves disappears for smooth potentials. Furthermore, we calculate the equation of state after inflation and find the presence of a quasimatter-dominated stage right before the transition to the radiation-dominated stage.

79 ASTRONOMY AND ASTROPHYSICS↗

Giant Graviton Expansion from Bubbling Geometry: Discreteness from Quantized Geometry

The superconformal index of half-BPS states in N = 4 supersymmetric Yang-Mills with gauge group U⁡(N) admits an expansion in terms of giant gravitons, J N (q) = J ∞ ⁡(q)⁢Σ$^{∞}_{m=0}$ q m⁢N ⁢ J^ m ⁡(q), where m is the number of giant gravitons and J ∞ ⁡(q) is the graviton index. The expansion can be viewed as the implementation of trace relations for finite N. We derive this expansion directly in supergravity from the class of half-BPS solutions due to Lin, Lunin, and Maldacena in type IIB supergravity. The moduli space of these configurations can be quantized using covariant quantization methods. We show how this quantization leads to the precise expression for the expansion in terms of giant gravitons. Our proposal provides a derivation of the giant graviton expansion directly in terms of quantized supergravity degrees of freedom, and it recovers discrete data via quantum geometries that are classically nonsmooth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗