scholarly journals On Systems of Complexity One in the Primes

2016 ◽  
Vol 60 (1) ◽  
pp. 133-163 ◽  
Author(s):  
Kevin Henriot

AbstractConsider a translation-invariant system of linear equationsVx= 0 of complexity one, whereVis an integerr×tmatrix. We show that ifAis a subset of the primes up toNof density at leastC(log logN)–1/25t, there exists a solutionx∈ AttoVx= 0 with distinct coordinates. This extends a quantitative result of Helfgott and de Roton for three-term arithmetic progressions, while the qualitative result is known to hold for all translation-invariant systems of finite complexity by the work of Green and Tao.

2021 ◽  
Vol 9 ◽  
Author(s):  
Pablo A. Ferrari ◽  
Chi Nguyen ◽  
Leonardo T. Rolla ◽  
Minmin Wang

Abstract The box-ball system (BBS) was introduced by Takahashi and Satsuma as a discrete counterpart of the Korteweg-de Vries equation. Both systems exhibit solitons whose shape and speed are conserved after collision with other solitons. We introduce a slot decomposition of ball configurations, each component being an infinite vector describing the number of size k solitons in each k-slot. The dynamics of the components is linear: the kth component moves rigidly at speed k. Let $\zeta $ be a translation-invariant family of independent random vectors under a summability condition and $\eta $ be the ball configuration with components $\zeta $ . We show that the law of $\eta $ is translation invariant and invariant for the BBS. This recipe allows us to construct a large family of invariant measures, including product measures and stationary Markov chains with ball density less than $\frac {1}{2}$ . We also show that starting BBS with an ergodic measure, the position of a tagged k-soliton at time t, divided by t converges as $t\to \infty $ to an effective speed $v_k$ . The vector of speeds satisfies a system of linear equations related with the generalised Gibbs ensemble of conservative laws.


Author(s):  
David Ek ◽  
Anders Forsgren

AbstractThe focus in this paper is interior-point methods for bound-constrained nonlinear optimization, where the system of nonlinear equations that arise are solved with Newton’s method. There is a trade-off between solving Newton systems directly, which give high quality solutions, and solving many approximate Newton systems which are computationally less expensive but give lower quality solutions. We propose partial and full approximate solutions to the Newton systems. The specific approximate solution depends on estimates of the active and inactive constraints at the solution. These sets are at each iteration estimated by basic heuristics. The partial approximate solutions are computationally inexpensive, whereas a system of linear equations needs to be solved for the full approximate solution. The size of the system is determined by the estimate of the inactive constraints at the solution. In addition, we motivate and suggest two Newton-like approaches which are based on an intermediate step that consists of the partial approximate solutions. The theoretical setting is introduced and asymptotic error bounds are given. We also give numerical results to investigate the performance of the approximate solutions within and beyond the theoretical framework.


2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
A. Khalid ◽  
M. N. Naeem ◽  
P. Agarwal ◽  
A. Ghaffar ◽  
Z. Ullah ◽  
...  

AbstractIn the current paper, authors proposed a computational model based on the cubic B-spline method to solve linear 6th order BVPs arising in astrophysics. The prescribed method transforms the boundary problem to a system of linear equations. The algorithm we are going to develop in this paper is not only simply the approximation solution of the 6th order BVPs using cubic B-spline, but it also describes the estimated derivatives of 1st order to 6th order of the analytic solution at the same time. This novel technique has lesser computational cost than numerous other techniques and is second order convergent. To show the efficiency of the proposed method, four numerical examples have been tested. The results are described using error tables and graphs and are compared with the results existing in the literature.


2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mohsen Alipour ◽  
Dumitru Baleanu ◽  
Fereshteh Babaei

We introduce a new combination of Bernstein polynomials (BPs) and Block-Pulse functions (BPFs) on the interval [0, 1]. These functions are suitable for finding an approximate solution of the second kind integral equation. We call this method Hybrid Bernstein Block-Pulse Functions Method (HBBPFM). This method is very simple such that an integral equation is reduced to a system of linear equations. On the other hand, convergence analysis for this method is discussed. The method is computationally very simple and attractive so that numerical examples illustrate the efficiency and accuracy of this method.


1952 ◽  
Vol 19 (2) ◽  
pp. 141-146
Author(s):  
Chih-Bing Ling

Abstract In a previous paper by the author (1), a theoretical solution for a notched strip under longitudinal tension is given. The result demands the solution of an infinite system of linear equations. A considerable amount of labor is involved in solving such a system. It seems, however, that the labor can be diminished by adapting to the solution a process known as the promotion of rank. In this paper such a process is described and then applied to solve the problem of a notched strip under transverse bending. The solution of this problem seems also to be new. The numerical results obtained are compared graphically with the experimental results available.


Sign in / Sign up

Export Citation Format

Share Document