相关论文: Erd\"{o}s-Szekeres Partitioning Problem

Partitioning large machine learning models across distributed accelerator systems is a complex process, requiring a series of interdependent decisions that are further complicated by internal sharding ambiguities. Consequently, existing…

In this paper, we develop a numerical resolution of the space-time fractional advection-dispersion equation. After time discretization, we utilize collocation technique and implement a product integration method in order to simplify the…

On computers, discrete problems are solved instead of continuous ones. One must be sure that the solutions of the former problems, obtained in real time (i.e., when the stepsize h is not infinitesimal) are good approximations of the…

We consider the problem of inferring latent stochastic differential equations (SDEs) with a time and memory cost that scales independently with the amount of data, the total length of the time series, and the stiffness of the approximate…

We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…

We demonstrate the systematic derivation of a class of discretizations of nonlinear Schr{\"o}dinger (NLS) equations for general polynomial nonlinearity whose stationary solutions can be found from a reduced two-point algebraic condition. We…

We are concerned with the well-posedness of linear elliptic systems posed on $\mathbb{R}^d$. The concrete problem of interest, for which we require this theory, arises from the linearization of the equations of anisotropic finite…

In recent years, SPDEs have become a well-studied field in mathematics. With their increase in popularity, it becomes important to efficiently approximate their solutions. Thus, our goal is a contribution towards the development of…

This paper introduces a new method of partitioning the solution space of a multi-objective optimisation problem for parallel processing, called Efficient Projection Partitioning. This method projects solutions down into a single dimension,…

The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…

We prove a sharp stability estimate for Schur iterates of contractive analytic functions in the open unit disk. We then apply this result in the setting of the inverse scattering approach and obtain a fast algorithm for solving the discrete…

We present a new strategy to approximate the global solution of the Fokker-Planck equation efficiently in higher dimensions and show its convergence. The main ingredients are the Euler scheme to solve the associated stochastic differential…

This paper is an extension program of the notion of circle of partition developed in our first paper \cite{CoP}. As an application we prove the Erd\H{o}s-Tur\'{a}n additive base conjecture.

We give a relatively easy proof of the Erd\H os-Kac theorem via computing moments. We show how this proof extends naturally in a sieve theory context, and how it leads to several related results in the literature.

This article is an extensive study of partitions with fixed number of odd and even-indexed odd parts. We use these partitions to generalize recent results of C. Savage and A. Sills. Moreover, we derive explicit formulas for generating…

The Schr\"odinger eigenvalue problem is solved with the imaginary time propagation technique. The separability of the Hamiltonian makes the problem suitable for the application of splitting methods. High order fractional time steps of order…

For conventional smoothed particle hydrodynamics (SPH), obtaining the static solution of a problem is time-consuming. To address this drawback, we propose an efficient dynamic relaxation method by adding large artificial-viscosity-based…

The indefinite least squares (ILS) problem is a generalization of the famous linear least squares problem. It minimizes an indefinite quadratic form with respect to a signature matrix. For this problem, we first propose an impressively…

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…

In this paper, we introduce a technique to enhance the computational efficiency of solution algorithms for high-dimensional discrete simulation-based optimization problems. The technique is based on innovative adaptive partitioning…