Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear programming problem”

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 235 records · Page 13

A fast and accurate domain decomposition nonlinear manifold reduced order model

Here, this paper integrates nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD). NM ROMs approximate the full order model (FOM) state in a nonlinear-manifold by training a shallow, sparse autoencoder using FOM snapshot data. These NM-ROMs can be advantageous over linear-subspace ROMs (LS-ROMs) for problems with slowly decaying Kolmogorov n-width. However, the number of NM-ROM parameters that need to be trained scales with the size of the FOM. Moreover, for “extreme-scale” problems, the storage of high-dimensional FOM snapshots alone can make ROM training expensive. To alleviate the training cost, this paper applies DD to the FOM, computes NM-ROMs on each subdomain, and couples them to obtain a global NM-ROM. This approach has several advantages: Subdomain NM-ROMs can be trained in parallel, involve fewer parameters to be trained than global NM-ROMs, require smaller subdomain FOM dimensional training data, and can be tailored to subdomain specific features of the FOM. The shallow, sparse architecture of the autoencoder used in each subdomain NM-ROM allows application of hyper-reduction (HR), reducing the complexity caused by nonlinearity and yielding computational speedup of the NM-ROM. This paper provides the first application of NM-ROM (with HR) to a DD problem. In particular, this paper details an algebraic DD reformulation of the FOM, training a NM-ROM with HR for each sub domain, and a sequential quadratic programming (SQP) solver to evaluate the coupled global NM-ROM. Theoretical convergence results for the SQP method and a priori and a posteriori error estimates for the DD NM-ROM with HR are provided. The proposed DD NM-ROM with HR approach is numerically compared to a DD LS-ROM with HR on the 2D steady-state Burgers’ equation, showing an order of magnitude improvement in accuracy of the proposed DD NM-ROM over the DD LS-ROM.

97 MATHEMATICS AND COMPUTING↗

Stability analysis of an approximate scheme for moving horizon estimation.

We analyze the stability properties of an approximate algorithm for moving horizon estimation (MHE). The strategy provides instantaneous state estimates and is thus suitable for large-scale feedback control. In particular, we study the interplay between numerical approximation errors and the convergence of the estimator error. In addition, we establish connections between the numerical properties of the Hessian of the MHE problem and traditional observability definitions. We demonstrate the developments through a simulation case study.

99 GENERAL AND MISCELLANEOUS↗

Application of 2D-Nonlinear Shallow Water Model of Tsunami by using Adomian Decomposition Method

One of the most important questions in tsunami modeling is the estimation of tsunami run-up heights at different points along a coastline. Methods for numerical simulation of tsunami wave propagation in deep and shallow seas are well developed and have been widely used by many scientists (2001-2008). In this paper, we consider a two-dimensional nonlinear shallow water model of tsunami given by Tivon Jacobson is work [1]. u{sub t}+uu{sub x}+{nu}u{sub y} -c{sup 2}(h{sub x}+(h{sub b}){sub x}) {nu}{sub t}+u{nu}{sub x}+{nu}{nu}{sub y} = -c{sup 2}(h{sub y}+(h{sub b}){sub y}) h{sub t}+(hu){sub x}+(h{nu}){sub y} = 0 g-shore, h is surface elevation and s, t is time, u is velocity of cross-shore, {nu} is velocity of along-shore, h is surface elevation and h{sub b} is function of shore. This is a nondimensionalized model with the gravity g and constant reference depth H factored into c = {radical}(gH). We apply the Adomian Decompostion Method (ADM) to solve the tsunami model. This powerful method has been used to obtain explicit and numerical solutions of three types of diffusion-convection-reaction (DECR) equations. The ADM results for the tsunami model yield analytical solutions in terms of a rapidly convergent infinite power series. Symbolic computation, numerical results and graphs of solutions are obtained by Maple program.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments

The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Robust trajectory-constrained frequency control for microgrids considering model linearization error

Grid supportive modes integrated within inverter-based resources can improve the frequency response of renewable-rich microgrids. The synthesis of grid supportive modes to guarantee frequency trajectory constraints under a predefined disturbance set is challenging but essential. To tackle this challenge, a numerical optimal control (NOC)-based control synthesis methodology is proposed. Without loss of generality, a wind-diesel fed microgrid is studied, where we aim to design grid supportive functions in the wind turbine. In the control design, linearized models are used, and the linearization-induced errors are quantitatively analyzed by reachability and interval arithmetics and represented in the form of interval uncertainties. Then, the NOC problem can be formulated into a robust mixed-integer linear program. The control structure is strategically configured into two levels to realize online deployment. The proposed control is verified on the modified 33-node microgrid with a full-order three-phase nonlinear model in Simulink. In conclusion, the simulation results show the effectiveness of the proposed control paradigm and the necessity of considering linearization-induced uncertainty.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures

Here, we investigate how to port the standard interior-point method to new exascale architectures for block-structured nonlinear programs with state equations. Computationally, we decompose the interior-point algorithm into two successive operations: the evaluation of the derivatives and the solution of the associated Karush-Kuhn-Tucker (KKT) linear system. Our method accelerates both operations using two levels of parallelism. First, we distribute the computations on multiple processes using coarse parallelism. Second, each process uses SIMD/GPU accelerators locally to accelerate the operations using fine-grained parallelism. The KKT system is reduced by eliminating the inequalities and the state variables from the corresponding equations. We demonstrate our method's capability on the supercomputer Polaris, a testbed for the future exascale Aurora system. Each node is equipped with four GPUs, a setup amenable to our two-level approach. Our experiments on the stochastic optimal power flow problem show that the reduction method is 50x faster than the sparse linear solver HSL MA57 running in serial on the CPU, and 6x faster than Pardiso running in parallel on CPU on the same number of processes.

97 MATHEMATICS AND COMPUTING↗

The Center for Momentum Transport and Flow Organization in Plasmas - Final Scientific Report

Overview of University of Colorado Efforts: The University of Colorado group has focused on two primary fronts during the grant period: development of a variety of multi-point diagnostic and/or imaging analysis techniques, and momentum-transport related experiments on a variety of devices (NSTX at PPPL, CSDX at UCSD, LAPD at UCLA, DIII-D at GA). Experimental work has taken advantage of several diagnostic instruments, including fast-framing cameras for imaging of electron density fluctuations (either directly or using injected gas puffs), ECEI for imaging of electron temperature fluctuations, and multi-tipped Langmuir and magnetic probes for corroborating measurements of Reynolds and Maxwell stresses. Mode Characterization in CSDX: We have performed a series of experiments at the CSDX linear device at UCSD, in collaboration with Center PI G. Tynan's group. The experiments included a detailed study of velocity estimation techniques, including direct comparisons between Langmuir probes and image-based velocimetry from fast-framing camera data. We used the camera data in a second set of studies to identify the spatial and spectral structure of coherent modes, which illuminates wave behavior to a level of detail previously unavailable, and enables direct comparison of dispersion curves to theoretical estimates. In another CSDX study, similar techniques were used to demonstrate a controlled transition from nonlinearly coupled discrete eigenmodes to fully developed broadband turbulence. The axial magnetic field was varied from 40-240 mT, which drove the transition. At low magnetic fields, the plasma is dominated by drift waves. As the magnetic field is increased, a strong potential gradient at the edge introduces an ExB shear-driven instability. At the transition, another mode with signatures of a rotation-induced Rayleigh–Taylor instability appears at the central plasma region. Concurrently, large axial velocities were found in the plasma core. For larger magnetic fields, all of the instabilities co-exist, leading to rich plasma dynamics and fully developed broadband turbulence. Edge-Turbulence and Flow Experiments in NSTX: A series of Gas Puff Imaging (GPI) observations on NSTX revealed a quasi-periodic oscillation in the plasma edge preceding the L-H transition in a limited set of neutral beam heated plasmas. These ~3 kHz flow oscillations exhibit both long wavelength and long correlation lengths, suggesting they are zonal-flow-like. The flow oscillations are strongly correlated with modulations of the level of edge turbulence, thus the system appears to undergo a predator--prey-type limit-cycle preceding the L-H transition. However, a clear trigger for the L-H transition was not observed. Reynolds stress profiles were obtained directly from image velocimetry for L-mode periods ELM-Precursor Studies in NSTX: A separate study based on NSTX-GPI data captured the two-dimensional evolution of edge-localized mode (ELM) precursors. Precursor events were observed preceding ELMs and ELM-induced H–L back-transitions in radio-frequency heated H-mode plasmas, and the growth of the precursor mode through the ELM filamentation was imaged in the plane perpendicular to the local B-field. Strong edge intensity modulations appeared to propagate in the electron diamagnetic direction while steadily drifting radially outwards. Intensity fluctuations were observed at frequencies around 20 kHz and wavenumbers of 0.05-0.2 cm -1 . Upon growing to a trigger point, precursor fluctuations were seen to form filamentary structures and move into the scrape-off layer (SOL) explosively with radial velocities peaking at 8 km/s. Once in the SOL, filaments reverse their propagation direction and travel in the ion diamagnetic direction. Edge intensity fluctuations were strongly correlated with magnetic signals from Mirnov coils, and toroidally distributed coils estimated toroidal mode numbers of n=5-10. Quantitatively similar precursors have been observed in ohmic H-mode plasmas as well, though significantly fewer events are seen in the ohmic cases and none were observed in the near-threshold NBI H-modes studied. Development of Velocimetry and Image Analysis Techniques: Along with the experiments listed above, the Colorado group has continued to explore various velocimetry techniques and their range of validity. We have developed a “linear optical flow” code, which calculates smooth velocity maps while accurately assessing local regions of high curl. This is critical for separating spatial scales of velocity behavior, and thus transport. This code has recently come on-line, and we are currently using it to revisit a number of older datasets. Additionally, we have worked on developing pattern-recognition techniques for imaging diagnostics, based on established digital image compression algorithms. This has the potential to open the analysis of turbulent plasma behavior beyond the well-trodden Fourier and wavelet approaches. Finally, we have extended several of these image-analysis routines to multiple other diagnostic sets, including GPI datasets in NSTX and ECEI imaging on DIII-D. In one study, correlation maps were used to measure the full 2-D mode structure of drift-wave level structures using ECEI for the first time. This enabled direct comparison to gyrokinetic simulations using the GEM code, from which is was determined that TEM modes were being measured in DIII-D.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Real-time control of connected vehicles in signalized corridors using pseudospectral convex optimization

Recent advances in Connected and Automated Vehicle (CAV) technologies have opened up new opportunities to enable safe, efficient, and sustainable transportation systems. However, developing reliable and rapid speed control algorithms in highly dynamic environments with complex inter-vehicle interactions and nonlinear vehicle dynamics is still a daunting task. In this paper, we develop a novel speed control method for CAVs to produce optimal speed profiles that minimize the fuel consumption and avoid idling at signalized intersections. To this end, an optimal control problem is formulated using the information of the upcoming traffic signal to adapt vehicles' speeds to avoid frequent stop-and-go driving patterns. Here, by applying the pseudospectral discretization method and the sequential convex programming method, the computational efficiency is greatly improved, enabling potential real-time on-vehicle applications. In addition, the algorithm is implemented under a model predictive control framework to ensure online control with instant response for collision avoidance and robust vehicle coordination. The proposed algorithm is verified through numerical simulations of three different traffic scenarios. The convergence and accuracy of the proposed approach are demonstrated by comparing with a popular nonlinear solver. Furthermore, the benefit of the proposed method in both traffic mobility and fuel efficiency is validated using the speed profile determined from a traffic following model in a simulation software as the baseline.

42 ENGINEERING↗

An efficient MILP framework for integrating nonlinear process dynamics and control in optimal production scheduling calculations

The emphasis currently placed on enterprise-wide decision making and optimization has led to an increased need for methods of integrating nonlinear process dynamics and control information in scheduling calculations. The inevitable high dimensionality and nonlinearity of first-principles dynamic process models makes incorporating them in scheduling calculations challenging. In this work, we describe a general framework for deriving data-driven surrogate models of the closed-loop process dynamics. Focusing on Hammerstein–Wiener and finite step response (FSR) model forms, we show that these models can be (exactly) linearized and embedded in production scheduling calculations. The resulting scheduling problems are mixed-integer linear programs with a special structure, which we exploit in a novel and efficient solution strategy. A polymerization reactor case study is utilized to demonstrate the merits of this method. Finally, our framework compares favorably to existing approaches that embed dynamics in scheduling calculations, showing considerable reductions in computational effort.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A trust-region algorithm for the optimization of PSA processes using reduced-order modeling

The last few decades have seen a considerable increase in the applications of adsorptive gas separation technologies, such as pressure swing adsorption (PSA); the applications range from bulk separations to trace contaminant removal. PSA processes are based on solid-gas equilibrium and operate under periodic transient conditions [1]. Bed models for these processes are therefore defined by coupled nonlinear partial differential and algebraic equations (PDAEs) distributed in space and time with periodic boundary conditions that connect the processing steps together and high nonlinearities arising from non-isothermal effects and nonlinear adsorption isotherms. As a result, the optimization of such systems for either design or operation represents a significant computational challenge to current nonlinear programming algorithms. Model reduction is a powerful methodology that permits systematic generation of cost-efficient low-order representations of large-scale systems that result from discretization of such PDAEs. In particular, low-dimensional approximations can be obtained from reduced order modeling (ROM) techniques based on proper orthogonal decomposition (POD) and can be used as surrogate models in the optimization problems. In this approach, a representative ensemble of solutions of the dynamic PDAE system is constructed by solving a higher-order discretization of the model using the method of lines, followed by the application of Karhunen-Loeve expansion to derive a small set of empirical eigenfunctions (POD modes). These modes are used as basis functions within a Galerkin's projection framework to derive a low-order DAE system that accurately describes the dominant dynamics of the PDAE system. This approach leads to a DAE system of significantly lower order, thus replacing the one obtained from spatial discretization before and making optimization problem computationally efficient [2]. The ROM methodology has been successfully applied to a 2-bed 4-step PSA process used for separating a hydrogen-methane mixture in [3]. The reduced order model developed was successfully used to optimize this process to maximize hydrogen recovery within a trust-region. We extend this approach in this work to develop a rigorous trust-region algorithm for ROM-based optimization of PSA processes. The trust-region update rules and sufficient decrease condition for the objective is used to determine the size of the trust-region. Based on the decrease in the objective function and error in the ROM, a ROM updation strategy is designed [4, 5]. The inequalities and bounds are handled in the algorithm using exact penalty formulation, and a non-smooth trust-region algorithm by Conn et al. [6] is used to handle non-differentiability. To ensure that the first order consistency condition is met and the optimum obtained from ROM-based optimization corresponds to the optimum of the original problem, a scaling function, such as one proposed by Alexandrov et al. [7], is incorporated in the objective function. Such error control mechanism is also capable of handling numerical inconsistencies such as unphysical oscillations in the state variable profiles. The proposed methodology is applied to optimize a PSA process to concentrate CO{sub 2} from a nitrogen-carbon dioxide mixture. As in [3], separate ROMs are developed for each operating step with different POD modes for each state variable. Numerical results will be presented for optimization case studies which involve maximizing CO{sub 2} recovery, feed throughput or minimizing overall power consumption.

97 MATHEMATICS AND COMPUTING↗

Performance Improvements of the Griffin Solvers in FY24

The Griffin code is a MOOSE-based reactor physics application jointly developed by Idaho National Laboratory and Argonne National Laboratory under the Department of Energy Office of Nuclear Energy Nuclear Energy Advanced Modeling and Simulation Program. This fiscal year, we have made significant efforts to improve the performance of transport solver options and cross-section generation for the efficient use of Griffin in advanced reactor applications. For the HFEM-PN solver, the residual evaluations of HFEM kernels were optimized by utilizing the pre- computed averaged cross sections for individual elements. Numerical integration involving the evaluation of basis functions at quadrature points was bypassed by facilitating precomputed element mass matrices for response matrices. Red-black iterations were improved by introducing a new generalized minimum residual based solver. The memory usage of response matrix storage was significantly reduced by applying basis function rotations on interfaces and calculating volumetric odd-parity moments on the fly. Additionally, the adjoint flux and transient calculation capabilities of the HFEM-PN solver were successfully implemented and verified using the TWIGL benchmark problem. For the DFEM-SN solver, memory footprint and computation time were significantly reduced by not treating angular flux vectors as the MOOSE nonlinear system vectors. Specifically for IQS, scalar adjoint weighting was introduced to further eliminate angular adjoint flux storage in the MOOSE auxiliary system. It was demonstrated through the three-dimensional Advanced Burner Test Reactor core problem that the memory usage for transient calculations with the IQS method was reduced by over 7.5× compared to before the optimizations. For the self-shielding application programming interface, a new double-heterogeneity treatment method, named the Bell Function-Based Analytic Two-Region Slowing Down Method, was developed to efficiently flux-volume homogenize TRISO particles with the matrix. Additionally, optimizations were made to hyper- fine group (HFG) slowing down calculations by pretabulating collision probability coefficients and grouping isotopes, significantly reducing the computational time for calculating scattering sources per HFG. Lastly, the pin power reconstruction module was extended to account for temporal behavior in a microreactor analysis problem, specifically for a control drum transient. Verification tests for each of these improvements demonstrated significant performance enhancements and memory reduction.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Data-driven optimization of mixed-integer bi-level multi-follower integrated planning and scheduling problems under demand uncertainty

The coordination of interconnected elements across the different layers of the supply chain is essential for all industrial processes and the key to optimal decision-making. Yet, the modeling and optimization of such interdependent systems are still burdensome. Here we address the simultaneous modeling and optimization of medium-term planning and short-term scheduling problems under demand uncertainty using mixed-integer bi-level multi-follower programming and data-driven optimization. Bi-level multi-follower programs model the natural hierarchy between different layers of supply chain management holistically, while scenario analysis and data-driven optimization allow us to retrieve the guaranteed feasible solutions of the integrated formulation under various demand considerations. We address the data-driven optimization of this challenging class of problems using the DOMINO framework, which was initially developed to solve single-leader single-follower bi-level optimization problems to guaranteed feasibility. This framework is extended to solve single-leader multi-follower stochastic formulations and its performance is characterized by well-known single and multi-product process scheduling case studies. Through our data-driven algorithmic approach, we present guaranteed feasible solutions to linear and nonlinear mixed-integer bi-level formulations of simultaneous planning and scheduling problems and further characterize the effects of the scheduling level complexity on the solution performance, which spans over several hundred continuous and binary variables, and thousands of constraints.

42 ENGINEERING↗

Convex Optimization of Integrated Power-Gas Energy Flow Model With Applications to Probabilistic Energy Flow

Energy flow calculation is a fundamental problem of the integrated power and gas system (IPGS) operation and planning. However, the nonlinear gas flow model introduces major challenges to the energy flow calculation. In this paper, we propose a tractably convex optimization model to solve the energy flow problem in IPGSs. It is demonstrated that the proposed optimization model has the same optimal solution as the original nonlinear steady energy flow model. Also, piecewise linearization is adopted to tightly linearize the nonlinear objective function of the model, which transforms the formulated convex optimization into a linear program one. Thus, the computation complexity of the proposed energy flow model is significantly reduced as compared with the existing methods. In addition, the proposed model can be extended to probabilistic energy flow estimation. Extensive case studies are conducted to validate the effectiveness of the proposed energy flow model using three IPGSs.

42 ENGINEERING↗

Domain-decomposition nonlinear manifold reduced order model

This software combines nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD) techniques. NM-ROMs, which utilize a shallow, sparse autoencoder trained with full order model (FOM) snapshot data, approximate the FOM state on a nonlinear manifold. These models offer advantages over linear-subspace ROMs (LS-ROMs) particularly in scenarios with slowly decaying Kolmogorov n-width. However, the training of NM-ROMs involves a number of parameters that scale with the size of the FOM, and storing high-dimensional FOM snapshots can significantly increase the cost of ROM training for extreme-scale problems. To mitigate these costs, the software employs DD to partition the FOM into smaller subdomains, computes NM-ROMs for each, and then integrates these to form a global NM-ROM. This strategy offers multiple benefits: it enables parallel training of subdomain NM-ROMs, reduces the number of parameters needed, decreases the dimensional requirements of subdomain FOM training data, and allows for customization to the unique characteristics of each FOM subdomain. The use of a shallow, sparse autoencoder architecture in each subdomain NM-ROM facilitates the application of hyper-reduction (HR), simplifying the nonlinear complexities and enhancing computational speed. This software marks the inaugural application of NM-ROM combined with HR to a DD problem. It features an algebraic DD reformulation of the FOM, training of NM-ROMs with HR for each subdomain, and employs a sequential quadratic programming (SQP) solver for the evaluation of the coupled global NMROM. The effectiveness of the DD NM-ROM with HR is numerically demonstrated on the 2D steady-state Burgers' equation, showing an order of magnitude improvement in accuracy over the DD LS-ROM with HR.

Diaz, AlejandroN↗

Computation of the Seismic Stability of Earth Retaining Structures Final Report CRADA No. TSB-954-94

The purpose of this CRADA project was to evaluate the seismic stability of block retaining wall systems. Retaining wall systems are used extensively in private and commercial developments. This study was designed to develop and demonstrate a computer modeling technology to be used to predict the seismic stability of any block wall system design. The nonlinear finite element computer programs developed at LLNL and employed in the Computational Earthquake Initiative were utilized in this small business CRADA to analyze the seismic stability of the block retaining walls. The unique capability of the LLNL programs to rigorously model frictional contact in a dynamic analysis problem were used in a computer simulation of the dynamic interaction the block waiVsoil systems under seismic excitation.

58 GEOSCIENCES↗

Modeling design and control problems involving neural network surrogates

Here, we consider nonlinear optimization problems that involve surrogate models represented by neural networks. We demonstrate first how to directly embed neural network evaluation into optimization models, highlight a difficulty with this approach that can prevent convergence, and then characterize stationarity of such models. We then present two alternative formulations of these problems in the specific case of feedforward neural networks with ReLU activation: as a mixed-integer optimization problem and as a mathematical program with complementarity constraints. For the latter formulation we prove that stationarity at a point for this problem corresponds to stationarity of the embedded formulation. Each of these formulations may be solved with state-of-the-art optimization methods, and we show how to obtain good initial feasible solutions for these methods. We compare our formulations on three practical applications arising in the design and control of combustion engines, in the generation of adversarial attacks on classifier networks, and in the determination of optimal flows in an oil well network.

97 MATHEMATICS AND COMPUTING↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

A preliminary prediction of the (ν{sub 2} + ν{sub 4}) combination band of {sup 34}SF{sub 6}

Sulfur hexafluoride appears to be a species of growing importance in the field of atmospheric physics and chemistry as a pollutant that can contribute to the greenhouse effect. The infrared spectroscopy of SF6 is essential for quantitative measurements in the atmosphere, is still insufficiently known. In this work, we present a new contribution to this topic concerning (ν{sub 2}+ν{sub 4}) combination band. The prediction of this band is based on the tensorial formalism and vibrational extrapolation methods developed in Dijon. The effective Hamiltonian contains contribution from the ground state level GS, ν{sub 2} and ν{sub 4} witch are known from previous studies. The analysis has been performed using nonlinear least squares fit procedure included in the XTDS program to Jup=95.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗