相关论文: Enhancing the Computational Efficiency of the DoNO…
In previous research, quantum resources were concretely estimated for solving Elliptic Curve Discrete Logarithm Problem(ECDLP). In [1], the quantum algorithm was optimized for the binary elliptic curves and the main optimization target was…
We present a natural orbital-based implementation of the intermediate Hamiltonian Fock space coupled-cluster method for (1,1) sector of Fock space. The use of natural orbital significantly reduces the computational cost and can…
The goal of this paper is to study approaches to bridge the gap between first-order and second-order type methods for composite convex programs. Our key observations are: i) Many well-known operator splitting methods, such as…
A modification of the standard Boris algorithm, called filtered Boris algorithm, is proposed for the numerical integration of the equations of motion of charged particles in a strong non-uniform magnetic field in the asymptotic scaling…
We present an efficient orbital optimization procedure that combines the highly GPU accelerated, spin-adapted density matrix renormalization group (DMRG) method with the complete active space self-consistent field (CAS-SCF) approach for…
Scaling deep neural network (DNN) training to more devices can reduce time-to-solution. However, it is impractical for users with limited computing resources. FOSI, as a hybrid order optimizer, converges faster than conventional optimizers…
We present an algorithm for the rapid numerical integration of smooth, time-periodic differential equations with small nonlinearity, particularly suited to problems with small dissipation. The emphasis is on speed without compromising…
In computer science, sorting algorithms are crucial for data processing and machine learning. Large datasets and high efficiency requirements provide challenges for comparison-based algorithms like Quicksort and Merge sort, which achieve…
The problem of task scheduling with communication delays is strongly NP-hard. State-space search algorithms such as A* have been shown to be a promising approach to solving small to medium sized instances optimally. A recently proposed…
Operator-splitting methods are widely used to solve differential equations, especially those that arise from multi-scale or multi-physics models, because a monolithic (single-method) approach may be inefficient or even infeasible. The most…
The analytic energy gradients in the atomic orbital representation have recently been published (J. Chem. Phys. 146, 014102, 2017) within the framework of the natural orbital functional theory (NOFT). We provide here an alternative…
Accurate propagation of orbital uncertainty is essential for a range of applications within space domain awareness. Adaptive Gaussian mixture-based approaches offer tractable nonlinear uncertainty propagation through splitting mixands to…
The massive integration of distributed energy resources changes the operational demands of the electric power distribution system, motivating optimization-based approaches. The added computational complexities of the resulting optimal power…
Nuclear quantum phenomena beyond the Born-Oppenheimer approximation are known to play an important role in a growing number of chemical and biological processes. While there exists no unique consensus on a rigorous and efficient…
Distributed optimization is fundamental to modern machine learning applications like federated learning, but existing methods often struggle with ill-conditioned problems and face stability-versus-speed tradeoffs. We introduce fractional…
We present an alternative algorithm to global fitting procedures to construct Parton Distribution Functions (PDFs) parametrizations. The proposed algorithm uses Self-Organizing Maps (SOMs) which at variance with the standard Neural…
In this paper we present a random shuffling scheme to apply with adaptive sorting algorithms. Adaptive sorting algorithms utilize the presortedness present in a given sequence. We have probabilistically increased the amount of presortedness…
We develop and analyze algorithms for distributionally robust optimization (DRO) of convex losses. In particular, we consider group-structured and bounded $f$-divergence uncertainty sets. Our approach relies on an accelerated method that…
The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use…
Shell-wise orbital slotting in Low Earth Orbit (LEO) can improve space safety, simplify space traffic coordination and management, and optimize orbital capacity. This paper describes two methods to generate 2D Lattice Flower Constellations…