Related papers: A new algorithm to search for small nonzero |x^3 -…
For polynomials of degree two which have no zeros, the method of accompanying variables is developed and zeros of associated vector polynomials are determined. Our flexible method uses a wide variety of possible vector-valued vector…
Quantum Monte Carlo is used to investigate the possibility of d_{x^2-y^2} superconductivity in the two-dimensional repulsive Hubbard model. A small energy scale relevant to possible pairing requires a care (i.e., sufficiently small level…
We propose a new test statistic based on a score process for determining the statistical significance of a putative signal that may be a small perturbation to a noisy experimental background. We derive the reference distribution for this…
In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k^{-1/2})$ in terms of the minimal norm of the KKT residual mapping and…
The paper presents a comparative analysis of iterative numerical methods of Jacobi and Gauss-Seidel for solving systems of linear algebraic equations (SLAEs) with complex and real matrices. The ranges of convergence for both methods for…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
For each positive integer $m$, the $m$th order harmonic numbers are given by $$H_n^{(m)}=\sum_{0<k\le n}\frac1{k^m}\ \ (n=0,1,2,\ldots).$$ We discover exact values of some series involving harmonic numbers of order not exceeding four. For…
We investigate some well-known (and a few not-so-well-known) many-valued logics that have a small number (3 or 4) of truth values. For some of them we complain that they do not have any \emph{logical} use (despite their perhaps having some…
We propose a new method to find modes based on active information. We develop an algorithm that, when applied to the whole space, will say whether there are any modes present \textit{and} where they are; this algorithm will reduce the…
The z-zeros of the modified Bessel function of the third kind K_{nu}(z), also known as modified Hankel function or Macdonald function, are considered for arbitrary complex values of the order nu. Approximate expressions for the zeros,…
We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…
We present a new approach for estimating the set of bifurcation values at infinity. This yields a significant shrinking of the number of coefficients in the recent algorithm introduced by Jelonek and Kurdyka for reaching critical values at…
Given an item and a list of values of size $N$. It is required to decide if such item exists in the list. Classical computer can search for the item in O(N). The best known quantum algorithm can do the job in $O(\sqrt{N})$. In this paper, a…
We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts…
A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…
A procedure is suggested for testing the resolution and comparing the relative accuracy of numerical schemes for integration of the incompressible Euler equations.
An observation on Hall-Littlewood polynomials.
The search task is one of the most difficult when it comes to execution speed, and reducing the latter is important both when working with large data and with small samples, if they need to be processed frequently and in a limited time.…
We present an algorithm which can generate all pairwise non-isomorphic $K_2$-hypohamiltonian graphs, i.e. non-hamiltonian graphs in which the removal of any pair of adjacent vertices yields a hamiltonian graph, of a given order. We…
We develop a new approach for clustering non-spherical (i.e., arbitrary component covariances) Gaussian mixture models via a subroutine, based on the sum-of-squares method, that finds a low-dimensional separation-preserving projection of…