检索结果-内蒙古大学图书馆

Topological Classification of Insulators: II. Quasi-Two-Dimensional Locality

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chung, Jui-Hui Shapiro, Jacob Program in Applied and Computational Mathematics Princeton University United States Department of Mathematics Princeton University United States

We provide an alternative characterization of two-dimensional locality (necessary e.g. to define the Hall conductivity of a Fermi projection) using the spectral projections of the Laughlin flux operator. Using this abstract characterization, we define generalizations of this locality, which we term quasi-2D. We go on to calculate the path-connected components of spaces of unitaries or orthogonal projections which are quasi-2D-local and find a starkly different behavior compared with the actual 2D column of the Kitaev table, exhibiting e.g., in the unitary chiral case, infinitely many Z-valued indices. Copyright © 2024, The Authors. All rights reserved.

关键词：

An Ant Colony Algorithm Approach to the Vehicle Routing Problem and Variants

学校读者我要写书评

暂无评论

An Ant Colony Algorithm Approach to the Vehicle Routing Prob...

IEEE Symposium on Systems and Information Engineering Design, SIEDS

作者： Tulio Tablada Cleon Davis Neil Palumbo Applied and Computational Mathematics Program Johns Hopkins University Electrical and Computer Engineering Program Johns Hopkins University

ISBN: (数字)9798350385144

ISBN: (纸本)9798350385151

In the basic vehicle routing problem (VRP), a vehicle must deliver goods from one centralized warehouse to multiple customers efficiently. Several VRP variants and constraints exist, including different product types, specific delivery times, multiple warehouses, vehicle fuel constraints, and pick-up from one location and delivery to another. This work proposes and demonstrates a flexible algorithm for solving the VRP via ant colony optimization (ACO) that can address many of the variants discussed above. ACO algorithms mimic the behavior of ants, learning optimal paths to a food source and back to the nest based on stigmergic behavior. This work compares a proposed, more flexible ACO algorithm to a traditional optimization algorithm that is implemented in the Google VRP solver. Readily available data were used to test and demonstrate results. Several VRP variants were implemented in both the (proposed) flexible ACO algorithm and the Google VRP solver. The flexible ACO algorithm performed better in terms of distance traveled versus the Google VRP solver for two variants and worse for three other cases. However, the Google VRP solver was not able to solve some of the VRP variant combinations considered here and failed when solving some backhaul datasets. Because the flexible ACO algorithm was able to better handle many case variations, it may be an attractive alternative optimization tool.

关键词： Ant colony optimization Vehicle routing Symbols Internet Fuels Optimization Backhaul networks

Ordered and disordered stealthy hyperuniform point patterns across spatial dimensions

学校读者我要写书评

暂无评论

Physical Review Research 2024年第3期6卷 033260页

作者： Peter K. Morse Paul J. Steinhardt Salvatore Torquato Department of Chemistry Department of Physics Princeton Institute of Materials Princeton Center for Theoretical Science Program in Applied and Computational Mathematics

In previous work [Phys. Rev. X 5, 021020 (2015)] it was shown that stealthy hyperuniform systems can be regarded as hard spheres in Fourier space in the sense that the structure factor is exactly zero in a spherical region around the origin in analogy with the pair-correlation function of real-space hard spheres. While this earlier work focused on spatial dimensions d=1–4, here we extend the analysis to higher dimensions in order to make connections to high-dimensional sphere packings and the mean-field theory of glasses. We exploit this correspondence to confirm that the densest Fourier-space hard-sphere system is that of a Bravais lattice in contrast to real-space hard spheres, whose densest configuration is conjectured to be disordered. In passing, we give a concise form for the position of the first Bragg peak. We also extend the virial series previously suggested for disordered stealthy hyperuniform systems to higher dimensions in order to predict spatial decorrelation as a function of dimension. This prediction is then borne out by numerical simulations of disordered stealthy hyperuniform ground states in dimensions d=2–8, which have only recently been made possible due to a highly parallelized algorithm.

关键词： Classical statistical mechanics Disordered systems

INTERACTING PARTICLE SYSTEMS ON SPARSE W-RANDOM GRAPHS

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Crucianelli, Carla Tangpi, Ludovic Operations Research and Financial Engineering Princeton UniversityProgram in Applied and Computational Mathematics Princeton University

We consider a general interacting particle system with interactions on a random graph, and study the large population limit of this system. When the sequence of underlying graphs converges to a graphon, we show convergence of the interacting particle system to a so called graphon stochastic differential equation. This is a system of uncountable many SDEs of McKean-Vlasov type driven by a continuum of Brownian motions. We make sense of this equation in a way that retains joint measurability and essentially pairwise independence of the driving Brownian motions of the system by using the framework of Fubini extension. The convergence results are general enough to cover nonlinear interactions, as well as various examples of sparse graphs. A crucial idea is to work with unbounded graphons and use the Lp theory of sparse graph *** Codes 60H10 (Primary) 05C80 (Secondary) Copyright © 2024, The Authors. All rights reserved.

关键词： Brownian movement

A Qualitative Study of the Dynamic Behavior for Adaptive Gradient Algorithms 2

学校读者我要写书评

暂无评论

A Qualitative Study of the Dynamic Behavior for Adaptive Gra...

2nd Mathematical and Scientific Machine Learning Conference, MSML 2021

作者： Ma, Chao Wu, Lei Weinan, E. Department of Mathematics Stanford University United States Program in Applied and Computational Mathematics Princeton University United States Program in Applied and Computational Mathematics Department of Mathematics Princeton University United States

The dynamic behavior of RMSprop and Adam algorithms is studied through a combination of careful numerical experiments and theoretical explanations. Three types of qualitative features are observed in the training loss curve: fast initial convergence, oscillations, and large spikes in the late phase. The sign gradient descent (signGD) flow, which is the limit of Adam when taking the learning rate to 0 while keeping the momentum parameters fixed, is used to explain the fast initial convergence. For the late phase of Adam, three different types of qualitative patterns are observed depending on the choice of the hyper-parameters: oscillations, spikes, and divergence. In particular, Adam converges much smoother and even faster when the values of the two momentum factors are close to each other. This observation is particularly important for scientific computing tasks, for which the training process usually proceeds into the high precision regime. © 2021 C. Ma, L. Wu & W. E.

关键词： Gradient methods

LATTICE-VALUED BOTTLENECK DUALITY

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ghrist, Robert Gould, Julian Lopez, Miguel Department of Mathematics Department of Electrical & Systems Engineering and Program in Applied Mathematics & Computational Science University of Pennsylvania United States

This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive lattice. For posets, we generalize a bottleneck version of Dilworth’s theorem, again weighted in a distributive lattice. These results are applicable to a wide array of non-numerical network flow problems, as shown. All results, proofs, and applications were created in collaboration with AI language models. An appendix documents their role and *** Codes 06D05, 90C35, 06A07 © 2024, CC BY.

关键词： Combinatorial optimization

Semi-analytical finite element method applied for characterizing micropolar fibrous composites

学校读者我要写书评

暂无评论

applied mathematics and Mechanics(English Edition) 2024年第12期45卷 2147-2164页

作者： J.A.OTERO Y.ESPINOSA-ALMEYDA R.RODRIGUEZ-RAMOS J.MERODIO School of Engineering and Sciences Monterrey Institute of TechnologyEstado de Mexico 52926Mexico Institute of Engineering and Technology Autonomous University of Ciudad JuarezCiudad JuarezChihuahua 32310Mexico Postgraduate Program in Computational Modeling in Science and Technology Federal Fluminense UniversityRıo de Janeiro 27255-125Brazil Faculty of Mathematics and Computer Science University of HavanaLa Habana 10400Cuba Department of Mathematics Applied to ICT School of Informatics Systems EngineeringTechnical University of MadridMadrid 28031Spain

A semi-analytical finite element method(SAFEM),based on the two-scale asymptotic homogenization method(AHM)and the finite element method(FEM),is implemented to obtain the effective properties of two-phase fiber-reinforced composites(FRCs).The fibers are periodically distributed and unidirectionally aligned in a homogeneous *** framework addresses the static linear elastic micropolar problem through partial differential equations,subject to boundary conditions and perfect interface contact *** mathematical formulation of the local problems and the effective coefficients are presented by the *** local problems obtained from the AHM are solved by the FEM,which is denoted as the *** numerical results are provided,and the accuracy of the solutions is analyzed,indicating that the formulas and results obtained with the SAFEM may serve as the reference points for validating the outcomes of experimental and numerical computations.

关键词： semi-analytical approach fiber-reinforced composite(FRC) effective property finite element method(FEM) asymptotic homogenization method(AHM) micropolar elasticity

DeePKS + ABACUS as a Bridge between Expensive Quantum Mechanical Models and Machine Learning Potentials

学校读者我要写书评

暂无评论

Journal of Physical Chemistry A 2022年第49期126卷 9154-9164页

作者： Li, Wenfei Ou, Qi Chen, Yixiao Cao, Yu Liu, Renxi Zhang, Chunyi Zheng, Daye Cai, Chun Wu, Xifan Wang, Han Chen, Mohan Zhang, Linfeng AI for Science Institute Beijing100080 China Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States HEDPS CAPT College of Engineering School of Physics Peking University Beijing100871 China Department of Physics Temple University PhiladelphiaPA19122 United States Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics Huayuan Road 6 Beijing100088 China DP Technology Beijing100080 China

Recently, the development of machine learning (ML) potentials has made it possible to perform large-scale and long-time molecular simulations with the accuracy of quantum mechanical (QM) models. However, for different levels of QM methods, such as density functional theory (DFT) at the meta-GGA level and/or with exact exchange, quantum Monte Carlo, etc., generating a sufficient amount of data for training an ML potential has remained computationally challenging due to their high cost. In this work, we demonstrate that this issue can be largely alleviated with Deep Kohn-Sham (DeePKS), an ML-based DFT model. DeePKS employs a computationally efficient neural network-based functional model to construct a correction term added upon a cheap DFT model. Upon training, DeePKS offers closely matched energies and forces compared with high-level QM method, but the number of training data required is orders of magnitude less than that required for training a reliable ML potential. As such, DeePKS can serve as a bridge between expensive QM models and ML potentials: one can generate a decent amount of high-accuracy QM data to train a DeePKS model and then use the DeePKS model to label a much larger amount of configurations to train an ML potential. This scheme for periodic systems is implemented in a DFT package ABACUS, which is open source and ready for use in various applications. © 2022 The Journal of Physical Chemistry A. All right reserved.

关键词： Density functional theory

MEAN FIELD GAMES WITH COMMON NOISE VIA MALLIAVIN CALCULUS

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Tangpi, Ludovic Wang, Shichun Princeton University Department of Operations Research and Financial Engineering and Program in Computational and Applied Mathematics United States

We present a simpler proof of the existence of equilibria for a class of mean field games with common noise, where players interact through the conditional law given the current value of the common noise rather than its entire path. By extending a compactness criterion for Malliavin-differentiable random variables to processes, we establish existence of strong equilibria, where the conditional law and optimal control are adapted to the common noise filtration and defined on the original probability space. Notably, our approach only requires measurability of the drift and cost functionals with respect to the state *** Codes 91A16, 60H07 Copyright © 2024, The Authors. All rights reserved.

关键词： Cost functions