Related papers: An Extensible Julia Toolkit for Symmetry-Aware Dua…
We describe a framework for solving a broad class of infinite-dimensional linear equations, consisting of almost banded operators, which can be used to resepresent linear ordinary differential equations with general boundary conditions. The…
We discuss the physics of crystals with small polydispersity near the jamming transition point. For this purpose, we introduce an effective single-particle model taking into account the nearest neighbor structure of crystals. The model can…
Celeste is a procedure for inferring astronomical catalogs that attains state-of-the-art scientific results. To date, Celeste has been scaled to at most hundreds of megabytes of astronomical images: Bayesian posterior inference is…
A technique for obtaining efficient bulk second order susceptibility in non centro-symmetric Photonic Crystals (PC) made from centro-symmetric materials is discussed. The effect is based on the electric quadrupole effect, strong…
We present a new, fast, and easy to use tool for modelling light and radial velocity curves of close eclipsing binaries with built-in methods for solving an inverse problem. The main goal of ELISa (Eclipsing binary Learning and Interactive…
The Julia programming language has evolved into a modern alternative to fill existing gaps in scientific computing and data science applications. Julia leverages a unified and coordinated single-language and ecosystem paradigm and has a…
In emerging scientific computing environments, matrix computations of increasing size and complexity are increasingly becoming prevalent. However, contemporary matrix language implementations are insufficient in their support for efficient…
Pulgon-tools is an open-source software package providing building blocks for the analysis and modeling of quasi-one-dimensional (quasi-1D) periodic systems based on line-group theory. While mature libraries exist for space-group detection…
Real world combinatorial optimization problems such as scheduling are typically too complex to solve with exact methods. Additionally, the problems often have to observe vaguely specified constraints of different importance, the available…
Nonconvex mixed-integer nonlinear programs (MINLPs) represent a challenging class of optimization problems that often arise in engineering and scientific applications. Because of nonconvexities, these programs are typically solved with…
We present a computational framework for efficient optimization-based "inverse design" of large-area "metasurfaces" (subwavelength-patterned surfaces) for applications such as multi-wavelength and multi-angle optimizations, and…
This paper presents a point-wise divergence-free projection method for numerical approximations of photonic quasicrystals problems. The original three-dimensional quasiperiodic Maxwell's system is transformed into a periodic one in higher…
Diffusion probabilistic models (DPMs) have achieved impressive success in visual generation. While, they suffer from slow inference speed due to iterative sampling. Employing fewer sampling steps is an intuitive solution, but this will also…
Machine learning for phase transition has received intensive research interest in recent years. However, its application in percolation still remains challenging. We propose an auxiliary Ising mapping method for machine learning study of…
We develop a novel parallel decomposition strategy for unweighted, undirected graphs, based on growing disjoint connected clusters from batches of centers progressively selected from yet uncovered nodes. With respect to similar previous…
An approach for the crystallographic mapping of two-phase alloys on the nanoscale using a combination of scanned precession electron diffraction and open-source python libraries is introduced in this paper. This method is demonstrated using…
We propose a unified framework for dealing with matching rules of quasiperiodic patterns, relevant for both tiling models and real world quasicrystals. The approach is intended for extraction and validation of a minimal set of matching…
We present the MPS-JuliQAOA simulator, a user-friendly, open-source tool to simulate the Quantum Approximate Optimization Algorithm (QAOA) of any optimization problem that can be expressed as diagonal Hamiltonian. By leveraging…
Algorithm NCL is designed for general smooth optimization problems where first and second derivatives are available, including problems whose constraints may not be linearly independent at a solution (i.e., do not satisfy the LICQ). It is…
Compilers are indispensable for transforming code written in high-level languages into performant machine code, but their general-purpose optimizations sometimes fall short. Domain experts might be aware of certain optimizations that the…