A Refinement of some Overrelaxation Algorithms for Solving a System of Linear Equations

In this paper we propose a refinement of some successive overrelaxation methods based on the reverse Gauss–Seidel method for solving a system of linear equations Ax = b by the decomposition A = Tm − Em − Fm, where Tm is a banded matrix of bandwidth 2m + 1. We study the convergence of the methods and give software implementation of algorithms in Mathematica package with numerical examples. ACM Computing Classification System (1998): G.1.3.

On the Operational Solution of a System of Fractional Differential Equations

MSC 2010: 26A33, 44A45, 44A40, 65J10

On the Generation of Heronian Triangles

We describe several algorithms for the generation of integer Heronian triangles with diameter at most n. Two of them have running time O(n^(2+ε)). We enumerate all integer Heronian triangles for n ≤ 600000 and apply the complete list on some related problems.

Stability and Instability of Solitary Wave Solutions of a Nonlinear Dispersive System of Benjamin-Bona-Mahony Type

2000 Mathematics Subject Classification: 35B35, 35B40, 35Q35, 76B25, 76E30.

Solvability of an Infinite System of Singular Integral Equations

2000 Mathematics Subject Classification: 45G15, 26A33, 32A55, 46E15.

On some Modifications of the Nekrassov Method for Numerical Solution of Linear Systems of Equations

A modification of the Nekrassov method for finding a solution of a linear system of algebraic equations is given and a numerical example is shown.