On the Operational Solution of a System of Fractional Differential Equations

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

Fermat's Equation in Matrices

The Fermat equation is solved in integral two by two matrices of determinant one as well as in finite order integral three by three matrices.

Matricial Model for the Study of Lower Bounds

Let V be an array. The range query problem concerns the design of data structures for implementing the following operations. The operation update(j,x) has the effect vj ← vj + x, and the query operation retrieve(i,j) returns the partial sum vi + ... + vj. These tasks are to be performed on-line. We define an algebraic model – based on the use of matrices – for the study of the problem. In this paper we establish as well a lower bound for the sum of the average complexity of both kinds of operations, and demonstrate that this lower bound is near optimal – in terms of asymptotic complexity.

Boundary-Value Problems for almost Nonlinear Singularly Perturbed Systems of Ordinary Differential Equations

A boundary-value problems for almost nonlinear singularly perturbed systems of ordinary differential equations are considered. An asymptotic solution is constructed under some assumption and using boundary functions and generalized inverse matrix and projectors.

Some Properties of Mittag-Leffler Functions and Matrix-Variate Analogues: A Statistical Perspective

Mathematical Subject Classification 2010:26A33, 33E99, 15A52, 62E15.

Numerical Solution of Fractional Diffusion-Wave Equation with two Space Variables by Matrix Method

Mathematics Subject Classi¯cation 2010: 26A33, 65D25, 65M06, 65Z05.

Matrix-Variate Statistical Distributions and Fractional Calculus

MSC 2010: 15A15, 15A52, 33C60, 33E12, 44A20, 62E15 Dedicated to Professor R. Gorenflo on the occasion of his 80th birthday

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.

A general Approach to Methods with a Sparse Jacobian for Solving Nonlinear Systems of Equations

2000 Mathematics Subject Classification: 65H10.