Search NASA⌕ Search

SEARCH · Search NASA

Results for “Point 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 721 records · Page 40

Bias Impact Analysis and Calibration of UAV-Based Mobile LiDAR System with Spinning Multi-Beam Laser Scanner

Light Detection and Ranging (LiDAR) is a technology that uses laser beams to measure ranges and generates precise 3D information about the scanned area. It is rapidly gaining popularity due to its contribution to a variety of applications such as Digital Building Model (DBM) generation, telecommunications, infrastructure monitoring, transportation corridor asset management and crash/accident scene reconstruction. To derive point clouds with high positional accuracy, estimation of mounting parameters relating the laser scanners to the onboard Global Navigation Satellite System/Inertial Navigation System (GNSS/INS) unit, i.e., the lever-arm and boresight angles, is the foremost and necessary step. This paper proposes a LiDAR system calibration strategy for a Unmanned Aerial Vehicle (UAV)-based mobile mapping system that can directly estimate the mounting parameters for spinning multi-beam laser scanners through an outdoor calibration procedure. This approach is based on the use of conjugate planar/linear features in overlapping point clouds derived from different flight lines. Designing an optimal configuration for calibration is the first and foremost step in order to ensure the most accurate estimates of mounting parameters. This is achieved by conducting a rigorous theoretical analysis of the potential impact of bias in mounting parameters of a LiDAR unit on the resultant point cloud. The dependency of the impact on the orientation of target primitives and relative flight line configuration would help in deducing the configuration that would maximize as well as decouple the impact of bias in each mounting parameter so as to ensure their accurate estimation. Finally, the proposed analysis and calibration strategy are validated by calibrating a UAV-based LiDAR system using two different datasets—one acquired with flight lines at a single flying height and the other with flight lines at two different flying heights. With this being said, the calibration performance is evaluated by analyzing correlation between the estimated system parameters, the a-posteriori variance factor of the Least Squares Adjustment (LSA) procedure and the quality of fit of the adjusted point cloud to planar/linear features before and after the calibration process.

3D point clouds↗

THE ADJOINT METHOD APPLIED TO TIME-DISTANCE HELIOSEISMOLOGY

For a given misfit function, a specified optimality measure of a model, its gradient describes the manner in which one may alter properties of the system to march toward a stationary point. The adjoint method, arising from partial-differential-equation-constrained optimization, describes a means of extracting derivatives of a misfit function with respect to model parameters through finite computation. It relies on the accurate calculation of wavefields that are driven by two types of sources, namely, the average wave-excitation spectrum, resulting in the forward wavefield, and differences between predictions and observations, resulting in an adjoint wavefield. All sensitivity kernels relevant to a given measurement emerge directly from the evaluation of an interaction integral involving these wavefields. The technique facilitates computation of sensitivity kernels (Frechet derivatives) relative to three-dimensional heterogeneous background models, thereby paving the way for nonlinear iterative inversions. An algorithm to perform such inversions using as many observations as desired is discussed.

79 ASTRONOMY AND ASTROPHYSICS↗

Characteristics of miniature electronic brachytherapy x-ray sources based on TG-43U1 formalism using Monte Carlo simulation techniques

Purpose: The goal of this study is to determine a method for Monte Carlo (MC) characterization of the miniature electronic brachytherapy x-ray sources (MEBXS) and to set dosimetric parameters according to TG-43U1 formalism. TG-43U1 parameters were used to get optimal designs of MEBXS. Parameters that affect the dose distribution such as anode shapes, target thickness, target angles, and electron beam source characteristics were evaluated. Optimized MEBXS designs were obtained and used to determine radial dose functions and 2D anisotropy functions in the electron energy range of 25-80 keV. Methods: Tungsten anode material was considered in two different geometries, hemispherical and conical-hemisphere. These configurations were analyzed by the 4C MC code with several different optimization techniques. The first optimization compared target thickness layers versus electron energy. These optimized thicknesses were compared with published results by Ihsan et al.[Nucl. Instrum. Methods Phys. Res. B 264, 371-377 (2007)]. The second optimization evaluated electron source characteristics by changing the cathode shapes and electron energies. Electron sources studied included; (1) point sources, (2) uniform cylinders, and (3) nonuniform cylindrical shell geometries. The third optimization was used to assess the apex angle of the conical-hemisphere target. The goal of these optimizations was to produce 2D-dose anisotropy functions closer to unity. An overall optimized MEBXS was developed from this analysis. The results obtained from this model were compared to known characteristics of HDR {sup 125}I, LDR {sup 103}Pd, and Xoft Axxent electronic brachytherapy source (XAEBS) [Med. Phys. 33, 4020-4032 (2006)]. Results: The optimized anode thicknesses as a function of electron energy is fitted by the linear equation Y ({mu}m) = 0.0459X (keV)-0.7342. The optimized electron source geometry is obtained for a disk-shaped parallel beam (uniform cylinder) with 0.9 mm radius. The TG-43 distribution is less sensitive to the shape of the conical-hemisphere anode than the hemispherical anode. However, the optimized apex angle of conical-hemisphere anode was determined to be 60 deg. For the hemispherical targets, calculated radial dose function values at a distance of 5 cm were 0.137, 0.191, 0.247, and 0.331 for 40, 50, 60, and 80 keV electrons, respectively. These values for the conical-hemisphere targets are 0.165, 0.239, 0.305, and 0.412, respectively. Calculated 2D anisotropy functions values for the hemispherical target shape were F(1 cm, 0 deg.) = 1.438 and F(1 cm, 0 deg.) = 1.465 for 30 and 80 keV electrons, respectively. The corresponding values for conical-hemisphere targets are 1.091 and 1.241, respectively. Conclusions: A method for the characterizations of MEBXS using TG-43U1 dosimetric data using the MC MCNP4C has been presented. The effects of target geometry, thicknesses, and electron source geometry have been investigated. The final choices of MEBXS design are conical-hemisphere target shapes having an apex angle of 60 deg. Tungsten material having an optimized thickness versus electron energy and a 0.9 mm radius of uniform cylinder as a cathode produces optimal electron source characteristics.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Formal methods approach to the charging facility location problem for battery electric vehicles

Battery electric vehicles (BEVs) are becoming more prevalent as improvements in battery technology and energy management continue to be made. As the number of electric vehicles grows, the demand for fast-charging stations is expected to increase dramatically. Thus, building new charging station infrastructure efficiently will be key to reducing upfront costs while meeting consumer demands. In this work, we propose a method for choosing a set of charging station locations that are optimized based on a set of given common vehicle demand points. As part of this solution, we also offer a novel abstraction of the road network on which energy-efficient paths that account for charge-time delays may be found. The current algorithm chooses the optimal charging locations for a single agent which has a route objective specified using temporal logic. To demonstrate the proposed method, the running example shows how a charging station could be chosen for an electric delivery vehicle. Simulations were run on sample road networks with a given set of demand points to service and potential charging station locations to compare. The method is shown to successfully rank potential charging stations in terms of their expected average charging time cost.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

11-th order of accuracy for numerical solution of 3-D Poisson equation with irregular interfaces on unfitted Cartesian meshes

For the first time the optimal local truncation error method (OLTEM) with 125-point stencils and unfitted Cartesian meshes has been developed in the general 3-D case for the Poisson equation for heterogeneous materials with smooth irregular interfaces. The 125-point stencils equations that are similar to those for quadratic finite elements are used for OLTEM. The interface conditions for OLTEM are imposed as constraints at a small number of interface points and do not require the introduction of additional unknowns, i.e., the sparse structure of global discrete equations of OLTEM is the same for homogeneous and heterogeneous materials. The stencils coefficients of OLTEM are calculated by the minimization of the local truncation error of the stencil equations. These derivations include the use of the Poisson equation for the relationship between the different spatial derivatives. Such a procedure provides the maximum possible accuracy of the discrete equations of OLTEM. In contrast to known numerical techniques with quadratic elements and third order of accuracy on conforming and unfitted meshes, OLTEM with the 125-point stencils provides 11-th order of accuracy, i.e., an extremely large increase in accuracy by 8 orders for similar stencils. The numerical results show that OLTEM yields much more accurate results than high-order finite elements with much wider stencils. The increased numerical accuracy of OLTEM leads to an extremely large increase in computational efficiency. Additionally, a new post-processing procedure with the 125-point stencil has been developed for the calculation of the spatial derivatives of the primary function. The post-processing procedure includes the minimization of the local truncation error and the use of the Poisson equation. It is demonstrated that the use of the partial differential equation (PDE) for the 125-point stencils improves the accuracy of the spatial derivatives by 6 orders compared to post-processing without the use of PDE as in existing numerical techniques. At an accuracy of 0.1% for the spatial derivatives, OLTEM reduces the number of degrees of freedom by 900 - 4∙10 6 times compared to quadratic finite elements. The developed post-processing procedure can be easily extended to unstructured meshes and can be independently used with existing post-processing techniques (e.g., with finite elements).

97 MATHEMATICS AND COMPUTING↗

POINT: Partially Observable Imitation Network for Traffic Signal Control

Smart traffic signals bring together transportation infrastructure and advance technologies to improve the mobility and efficiency of urban transportation network. Adaptive traffic signal control studies can be categorized into modeling-based approaches and learning-based approaches. In order to take advantages of these two systems, this study developed an offline-online combined Partial Observable Imitation Network for Traffic signal control (POINT). In the offline system, the traffic signal timing optimization problem was formulated as a Mixed Integer Nonlinear Programming (MINLP) given complete traffic information, i.e., second-by-second speeds and locations of all vehicles. Furthermore, the objective of MINLP is to minimize total travel delays considering individual vehicle trajectories under Connected Vehicle (CV) environment. The calculated optimal solutions under various traffic conditions were considered as the ”expert” decisions. In the online system, an imitation neural network model was developed to learn the ”expert” signal plans generated from offline system. Given partial observable traffic conditions in real time, e.g., the aggregate-level of traffic volume, the POINT model can compute the signal timing parameters in the online system. The numerical results demonstrated that the proposed method outperformed other state-of-the-art signal control method under high and unbalanced traffic demand levels in terms of reducing travel delays and queue length.

33 ADVANCED PROPULSION SYSTEMS↗

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗

Investigations on the heat flux and impurity for the HL-2M divertor

The controllability of the heat load and impurity in the divertor is very important, which could be one of the critical problems to be solved in order to ensure the success for a steady state tokamak. HL-2M has the advantage of the poloidal field (PF) coils placed inside the demountable toroidal field (TF) coils and close to the main plasma. As a result, it is possible to make highly accurate configuration control of the advanced divertor for HL-2M. The divertor target geometry of HL-2M has been designed to be compatible with different divertor configurations to study the divertor physics and support the high performance plasma operations. In this paper, the heat loads and impurities with different divertor configurations, including the standard X-point divertor, the snowflake-minus divertor and two tripod divertor configurations for HL-2M, are investigated by numerical simulations with the SOLPS5.0 code under the current design of the HL-2M divertor geometry. The plasmas with different conditions, such as the low discharge parameters with ${{I}_{\text{p}}}$ = 0.5 MA at the first stage of HL-2M and the high parameters with ${{I}_{\text{p}}}$ = 2.0 MA during the normal operations, are simulated. The heat load profiles and the impurity distributions are obtained, and the control of the peak heat load and the effect of impurity on the core plasma are discussed. The compatibility of different divertor configurations for HL-2M is also evaluated. It is seen that the excellent compatibility of different divertor configurations with the current divertor geometry has been verified. Here, the results show that the snowflake-minus divertor and the tripod divertor with ${{d}_{x}}=30\,\text{cm}$ present good performance in terms of the heat load profiles and the impurity distributions under different conditions, which may not have a big effect on the core plasma. In addition, it is possible to optimize the distance between the two X-points, ${{d}_{x}}$ , to achieve a better performance in terms of the parameters of discharges.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods

We explore novel approaches for solving nonlinear optimization problems with unrelaxable bound constraints, which must be satisfied before the objective function can be evaluated. Our method reformulates the unrelaxable bound-constrained problem as an unconstrained optimization problem that is amenable to existing unconstrained optimization methods. The reformulation relies on a domain warping to form a merit function; the choice of the warping determines the level of exactness with which the unconstrained problem can be used to find solutions to the bound-constrained problem, as well as key properties of the unconstrained formulation such as smoothness. We develop theory when the domain warping is a multioutput sigmoidal warping, and we explore the practical elements of applying unconstrained optimization methods to the formulation. Here, we develop an algorithm that exploits the structure of the sigmoidal warping to guarantee that unconstrained optimization algorithms applied to the merit function will find a stationary point to the desired tolerance.

97 MATHEMATICS AND COMPUTING↗

TH-A-9A-02: BEST IN PHYSICS (THERAPY) - 4D IMRT Planning Using Highly- Parallelizable Particle Swarm Optimization

Purpose: We present a particle swarm optimization (PSO)-based 4D IMRT planning technique designed for dynamic MLC tracking delivery to lung tumors. The key idea is to utilize the temporal dimension as an additional degree of freedom rather than a constraint in order to achieve improved sparing of organs at risk (OARs). Methods: The target and normal structures were manually contoured on each of the ten phases of a 4DCT scan acquired from a lung SBRT patient who exhibited 1.5cm tumor motion despite the use of abdominal compression. Corresponding ten IMRT plans were generated using the Eclipse treatment planning system. These plans served as initial guess solutions for the PSO algorithm. Fluence weights were optimized over the entire solution space i.e., 10 phases × 12 beams × 166 control points. The size of the solution space motivated our choice of PSO, which is a highly parallelizable stochastic global optimization technique that is well-suited for such large problems. A summed fluence map was created using an in-house B-spline deformable image registration. Each plan was compared with a corresponding, internal target volume (ITV)-based IMRT plan. Results: The PSO 4D IMRT plan yielded comparable PTV coverage and significantly higher dose—sparing for parallel and serial OARs compared to the ITV-based plan. The dose-sparing achieved via PSO-4DIMRT was: lung Dmean = 28%; lung V20 = 90%; spinal cord Dmax = 23%; esophagus Dmax = 31%; heart Dmax = 51%; heart Dmean = 64%. Conclusion: Truly 4D IMRT that uses the temporal dimension as an additional degree of freedom can achieve significant dose sparing of serial and parallel OARs. Given the large solution space, PSO represents an attractive, parallelizable tool to achieve globally optimal solutions for such problems. This work was supported through funding from the National Institutes of Health and Varian Medical Systems. Amit Sawant has research funding from Varian Medical Systems, VisionRT Ltd. and Elekta.

60 APPLIED LIFE SCIENCES↗

Enhanced understanding of non-axisymmetric intrinsic and controlled field impacts in tokamaks

Here, an extensive study of intrinsic and controlled non-axisymmetric field (δB) impacts in KSTAR has enhanced the understanding about non-axisymmetric field physics and its implications, in particular, on resonant magnetic perturbation (RMP) physics and power threshold (P th ) for L–H transition. The n=1 intrinsic non-axisymmetric field in KSTAR was measured to remain as low as δB/B 0 ~ 4×10 –5 even at high-beta plasmas (β N ~ 2), which corresponds to approximately 20% below the targeted ITER tolerance level. As for the RMP edge-localized-modes (ELM) control, robust n=1 RMP ELM-crash-suppression has been not only sustained for more than ~90 τ E , but also confirmed to be compatible with rotating RMP. An optimal window of radial position of lower X-point (i.e. R x = $1.44\pm 0.02\,$ m) proved to be quite critical to reach full n=1 RMP-driven ELM-crash-suppression, while a constraint of the safety factor could be relaxed (q 95 = 5 $\pm $ 0.25). A more encouraging finding was that even when R x cannot be positioned in the optimal window, another systematic scan in the vicinity of the previously optimal R x allows for a new optimal window with relatively small variations of plasma parameters. Also, we have addressed the importance of optimal phasing (i.e. toroidal phase difference between adjacent rows) for n=1 RMP-driven ELM control, consistent with an ideal plasma response modeling which could predict phasing-dependent ELM suppression windows. In support of ITER RMP study, intentionally misaligned RMPs have been found to be quite effective during ELM-mitigation stage in lowering the peaks of divertor heat flux, as well as in broadening the 'wet' areas. Besides, a systematic survey of P th dependence on non-axisymmetric field has revealed the potential limit of the merit of low intrinsic non-axisymmetry. Considering that the ITER RMP coils are composed of 3-rows, just like in KSTAR, further 3D physics study in KSTAR is expected to help us minimize the uncertainties of the ITER RMP coils, as well as establish an optimal 3D configuration for ITER and future reactors.

3D physics↗

Thermal power plant upgrade via a rotating detonation combustor and retrofitted turbine with optimized endwalls

Over the past decade, pressure gain combustion research has promised over 10 percentage-points of increase in power plant thermal efficiency. Alas, to realize such potential gain, one must effectively couple the turbine with the detonation combustor, whose exhaust conditions differ substantially from current state of the art gas turbines. This paper presents a modeling approach that enables a superior thermodynamic cycle with a rotating detonation combustor and a retrofitted gas turbine by including a diffuser downstream of the combustor and by contouring the turbine endwall, while preserving the airfoil geometry. We propose a multi-step optimization strategy, parametrizing the endwall geometry with a few control points, without altering the airfoil geometry, and with the stage turbine efficiency as objective function. In a first step the turbine performance is assessed with steady inlet conditions by solving the steady three-dimensional Reynolds-Averaged Navier-Stokes equations. In a second step, the inlet conditions are unsteady, as predicted from a detonation combustor and a diffuser, and three-dimensional full unsteady simulations are performed with an unsteady Reynolds-Averaged Navier-Stokes solver. By altering the vane endwall, the steady optimization yielded an efficiency increase of 12% relative to the baseline, while the unsteady optimization resulted in 21% increase compared to the datum turbine. Finally, a full engine analysis demonstrated the superiority of pressure gain combustion which included a realistic thermodynamic cycle of the combustor, the diffuser and the optimized turbine components.

42 ENGINEERING↗

CFD-Guided Combustion System Optimization of a Gasoline Range Fuel in a Heavy-Duty Compression Ignition Engine Using Automatic Piston Geometry Generation and a Supercomputer

A computational fluid dynamics (CFD) guided combustion system optimization was conducted for a heavy-duty diesel engine running with a gasoline fuel that has a research octane number (RON) of 80. The goal was to optimize the gasoline compression ignition (GCI) combustion recipe (piston bowl geometry, injector spray pattern, in-cylinder swirl motion, and thermal boundary conditions) for improved fuel efficiency while maintaining engine-out NO x within a 1-1.5 g/kW-hr window. The numerical model was developed using the multi-dimensional CFD software CONVERGE. A two-stage design of experiments (DoE) approach was employed with the first stage focusing on the piston bowl shape optimization and the second addressing refinement of the combustion recipe. For optimizing the piston bowl geometry, a software tool, CAESES, was utilized to automatically perturb key bowl design parameters. This led to the generation of 256 combustion chamber designs evaluated at several engine operating conditions. The second DoE campaign was conducted to optimize injector spray patterns, fuel injection strategies and in-cylinder swirl motion for the best performing piston bowl designs from the first DoE campaign. This comprehensive optimization study was performed on a supercomputer, Mira, to accelerate the development of an optimized fuel-efficiency focused design. Compared to the production combustion system in the baseline engine, the new combustion recipe from this study showed significantly improved closed-cycle fuel efficiency across key engine operating points while meeting the engine-out NO x targets. Optimized piston bowl designs and injector spray patterns were predicted to provide enhanced in-cylinder air utilization and more rapid mixing-controlled combustion, thereby leading to a fuel efficiency improvement. In addition, shifting the engine thermal boundary conditions toward leaner operation was also key to the improved fuel efficiency.

33 ADVANCED PROPULSION SYSTEMS↗

Multi-core and many-core shared-memory parallel raycasting volume rendering optimization and tuning

Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. In addition, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

97 MATHEMATICS AND COMPUTING↗

Multi-core and Many-core Shared-memory Parallel Raycasting Volume Rendering Optimization and Tuning

Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. And, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

97 MATHEMATICS AND COMPUTING↗

Spectral properties of three-dimensional Anderson model

The three-dimensional Anderson model represents a paradigmatic model to understand the Anderson localization transition. In this work we first review some key results obtained for this model in the past 50 years, and then study its properties from the perspective of modern numerical approaches. Our main focus is on the quantitative comparison between the level sensitivity statistics and the level statistics. While the former studies the sensitivity of Hamiltonian eigenlevels upon inserting a magnetic flux, the latter studies the properties of unperturbed eigenlevels. We define two versions of dimensionless conductance, the first corresponding to the width of the level curvature distribution relative to the mean level spacing, and the second corresponding to the ratio of the Heisenberg time and the Thouless time obtained from the spectral form factor. We show that both conductances look remarkably similar around the localization transition, in particular, they predict a nearly identical critical point consistent with other well-established measures of the transition. We then study some further properties of those quantities: for level curvatures, we discuss particular similarities and differences between the width of the level curvature distribution and the characteristic energy studied by Edwards and Thouless (1972) in their pioneering work, in which the hopping at one lattice edge is changed from periodic to antiperiodic boundary conditions. In the context of the spectral form factor, we show that at the critical point it enters a broad time-independent regime, in which its value is consistent with the level compressibility obtained from the level variance. Finally, we test the scaling solution of the average level spacing ratio in the crossover regime using the cost function minimization approach introduced recently in Šuntajs et al. (2020). The latter approach seeks for the optimal scaling solution in the vicinity of the crossing point, while at the same time it allows for the crossing point to drift due to finite-size corrections. We find that the extracted transition point and the scaling coefficient agree with those from the literature to high numerical accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sequential linear integer programming for integer optimal control with total variation regularization

We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.

97 MATHEMATICS AND COMPUTING↗