Related papers: Computational Algorithm for Orbit and Mass Determi…
This paper proposes a new algorithm based on multi-scale stochastic local search with binary representation for training neural networks. In particular, we study the effects of neighborhood evaluation strategies, the effect of the number of…
We report spectroscopic observations of the nearby, 19.5 yr binary system Gls 67 AB spanning more than 35 yr. We carry out a global orbital solution combining our radial velocity measurements with others from the literature going back more…
In many applications, we need algorithms which can align partially overlapping point sets and are invariant to the corresponding transformations. In this work, a method possessing such properties is realized by minimizing the objective of…
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is chosen and a general algorithm is presented. The correctness of…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
Orbital parameters of planets are fitted directly to an appropriate set of observations. It is shown how to use the rigorous Deming method combined with a numerical integration of gravitation equations. In all, 65 parameters of the nine…
The general procedure underlying Hartree-Fock and Kohn-Sham density functional theory calculations consists in optimizing orbitals for a self-consistent solution of the Roothaan-Hall equations in an iterative process. It is often ignored…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
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…
Modeling of microlensing events poses computational challenges for the resolution of the lens equation and the high dimensionality of the parameter space. In particular, numerical noise represents a severe limitation to fast and efficient…
We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical constrained convex optimization problem, and rigorously characterize how common structural assumptions affect the numerical efficiency. Our…
This paper presents a novel algorithm to incorporate orbital parameters into radar ambiguity function expressions by extending the standard ambiguity function to match Keplerian two-body orbits. A coherent orbital matched-filter will…
One often-used approximation in the study of binary compact objects (i.e., black holes and neutron stars) in general relativity is the instantaneously circular orbit assumption. This approximation has been used extensively, from the…
The modern optical telescopes produce a huge number of asteroid observations, that are grouped into very short arcs (VSAs), each containing a few observations of the same object in one single night. To decide whether two VSAs, collected in…
We have developed a new, fast method of estimating the orbital properties of a binary or triple system using as few as two epochs of astrometric data. FOBOS (Few Observation Binary Orbit Solver) uses a flat prior brute force Monte Carlo…
Estimating the volume of a convex body is a central problem in convex geometry and can be viewed as a continuous version of counting. We present a quantum algorithm that estimates the volume of an $n$-dimensional convex body within…
We revisit the Bose-Mesner algebra of the perfect matching association scheme. Our main results are: 1. An inductive algorithm, based on solving linear equations, to compute the eigenvalues of the orbital basis elements given the central…
One of the key challenges of quantum-chemical multi-configuration methods is the necessity to manually select orbitals for the active space. This selection requires both expertise and experience and can therefore impose severe limitations…
We consider strongly-convex-strongly-concave saddle-point problems with general non-bilinear objective and different condition numbers with respect to the primal and the dual variables. First, we consider such problems with smooth composite…
This work extends our previous study from S. Shrestha et al. (2024) by introducing a new abstract framework for Variational Multiscale (VMS) methods at the discrete level. We introduce the concept of what we define as the optimal projector…