Related papers: An efficient algorithm for solving elliptic proble…
In order to find analytically the travelling waves of partially integrable autonomous nonlinear partial differential equations, many methods have been proposed over the ages: "projective Riccati method", "tanh-method", "exponential method",…
We consider the internal diffusion limited aggregation (IDLA) process on the infinite cluster in supercritical Bernoulli bond percolation on Euclidean lattices. It is shown that the process on the cluster behaves like it does on the…
In this paper, we introduce a new numerical algorithm for solving the Dirichlet problem for the real Monge--Ampere equation. The idea is to represent the non-linear Monge--Ampere operator as an infimum of a class of linear elliptic…
In this paper we present novel algorithms for several multidimensional data processing problems. We consider problems related to the computation of restricted clusters and of the diameter of a set of points using a new distance function. We…
We consider the densities of clusters, at the percolation point of a two-dimensional system, which are anchored in various ways to an edge. These quantities are calculated by use of conformal field theory and computer simulations. We find…
We consider isoperimetric sets, i.e., sets with minimal vertex boundary for a prescribed volume, of the infinite cluster of supercritical site percolation on the triangular lattice. Let $p$ be the percolation parameter and let $p_c$ be the…
In this paper we use a natural iteration technique to prove existence of solutions to nonlinear Dirichlet problems. Among the examples included is the prescribed mean curvature equation. The nature of the technique allows applications to…
The aim of this paper is to find the numerical solutions of the second order linear and nonlinear differential equations with Dirichlet, Neumann and Robin boundary conditions. We use the Bernoulli polynomials as linear combination to the…
We prove that for Bernoulli percolation on a graph $\mathbb{Z}^2\times\{0,\dots,k\}$ ($k\ge 0$), there is no infinite cluster at criticality, almost surely. The proof extends to finite range Bernoulli percolation models on $\mathbb{Z}^2$…
Solving two-variable linear Diophantine equations has applications in many cryptographic protocols such as RSA and Elliptic curve cryptography. The Extended Euclid's algorithm is a well known algorithm to solve these equations. We revisit…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
This paper presents algorithms for hierarchical, agglomerative clustering which perform most efficiently in the general-purpose setup that is given in modern standard software. Requirements are: (1) the input data is given by pairwise…
In this paper, we prove that there exists a unique solution to the Dirichlet boundary value problem for a general class of semilinear second order elliptic partial differential equations. Our approach is probabilistic. The theory of…
The upper estimate of the percolation threshold of the Bernoulli random field on the hexagonal lattice is found. It is done on the basis of the cluster decomposition. Each term of the decomposition is estimated using the number estimate of…
Iteratively reweighted $\ell_1$ algorithm is a popular algorithm for solving a large class of optimization problems whose objective is the sum of a Lipschitz differentiable loss function and a possibly nonconvex sparsity inducing…
Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and numerically tested. The methods combine advantages of the two-grid algorithm, two-space method, the shifted inverse power method, and the polynomial…
We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…
We propose very efficient algorithms for the bootstrap percolation and the diffusion percolation models by extending the Newman-Ziff algorithm of the classical percolation [M. E. J. Newman and R. M. Ziff, Phys. Rev. Lett. 85 (2000) 4104].…
The technique of complex scaling for time harmonic wave type equations relies on a complex coordinate stretching to generate exponentially decaying solutions. In this work, we use a Galerkin method with ansatz functions with infinite…
We establish the regularity in 2 dimensions of $L^2$ solutions to critical elliptic systems in divergence form involving involution operators of finite $W^{1,2}$-energy.