A general inverse matrix series relation and associated polynomials – II

We propose a matrix analogue of a general inverse series relation with an objective to introduce the generalized Humbert matrix polynomial, Wilson matrix polynomial, and the Rach matrix polynomial together with their inverse series representations. The matrix polynomials of Kiney, Pincherle, Gegenbauer, Hahn, Meixner-Pollaczek etc. occur as the special cases. It is also shown that the general inverse matrix pair provides the extension to several inverse pairs due to John Riordan [An Introduction to Combinatorial Identities, Wiley, 1968].

Clustering effects on the diffusion of patchy colloids in disordered porous media

Enskog theory is extended for the description of the self-diffusion coefficient of patchy colloidal fluid in disordered porous media. The theory includes the contact values of fluid-fluid and fluid-matrix pair distribution functions that are modified to include the dependence from the so-called probe particle porosity, φ, in order to correctly describe the effects of trapping the fluid particles by a matrix. The proposed expressions for the modified contact values of fluid-fluid and fluid-matrix pair distribution functions include three terms. Namely, a hard sphere contribution obtained by us in the previous work [Holovko M. F., Korvatska M. Ya., Condens. Matter Phys., 2020, 23, 23605], the depletion contribution connected with the cluster-cluster and cluster-matrix repulsion and the intramolecular correlation inside the cluster. It is shown that the last term leads to a remarkable decrease of the self-diffusion coefficient at a low fluid density. With a decreasing matrix porosity, this effect becomes weaker. For intermediate fluid densities, the depletion contribution leads to an increase of the self-diffusion coefficient in comparison with the hard sphere fluid. For a sufficiently dense fluid, the self-diffusion coefficient strongly decreases due to a hard sphere effect. The influence of the cluster size and the type of clusters as well as of the parameters of porous media is investigated and discussed in detail.

Implicit Hari–Zimmermann algorithm for the generalized SVD on the GPUs

A parallel, blocked, one-sided Hari–Zimmermann algorithm for the generalized singular value decomposition (GSVD) of a real or a complex matrix pair [Formula: see text] is here proposed, where F and G have the same number of columns, and are both of the full column rank. The algorithm targets either a single graphics processing unit (GPU), or a cluster of those, performs all non-trivial computation exclusively on the GPUs, requires the minimal amount of memory to be reasonably expected, scales acceptably with the increase of the number of GPUs available, and guarantees the reproducible, bitwise identical output of the runs repeated over the same input and with the same number of GPUs.

On the Existence and Uniqueness of the Solution of Linear Fractional Differential-Algebraic System

The existence and uniqueness of the solution of a new kind of system—linear fractional differential-algebraic equations (LFDAE)—are investigated. Fractional derivatives involved are under the Caputo definition. By using the tool of matrix pair, the LFDAE in which coefficients matrices are both square matrices have unique solution under the condition that coefficients matrices make up a regular matrix pair. With the help of equivalent transformation and Kronecker canonical form of the coefficients matrices, the sufficient condition for existence and uniqueness of the solution of the LFDAE in which coefficients matrices are both not square matrices is proposed later. Two examples are given to justify the obtained theorems in the end.

An iterative algorithm for the best approximate (P, Q)-orthogonal symmetric and skew-symmetric solution pair of coupled matrix equations

This paper deals with developing a robust iterative algorithm to find the least-squares ( P, Q)-orthogonal symmetric and skew-symmetric solution sets of the generalized coupled matrix equations. To this end, first, some properties of these type of matrices are established. Furthermore, an approach is offered to determine the optimal approximate ( P, Q)-orthogonal (skew-)symmetric solution pair corresponding to a given arbitrary matrix pair. Some numerical experiments are reported to confirm the validity of the theoretical results and to illustrate the effectiveness of the proposed algorithm.