Related papers: Computing the Mittag-Leffler Function of a Matrix …
The problem of fitting experimental data to a given model function $f(t; p_1,p_2,\dots,p_N)$ is conventionally solved numerically by methods such as that of Levenberg-Marquardt, which are based on approximating the Chi-squared measure of…
In this paper, we introduce a delayed Mittag-Leffler type function. With the help of the delayed Mittag-Leffler type functions, we give an explicit formula of solutions to linear nonhomogeneous fractional time-delay Langevin equations…
This paper explores a key question in numerical linear algebra: how can we compute projectors onto the deflating subspaces of a regular matrix pencil $(A,B)$, in particular without using matrix inversion or defaulting to an expensive Schur…
We propose a method to simultaneously compute scalar basis functions with an associated functional map for a given pair of triangle meshes. Unlike previous techniques that put emphasis on smoothness with respect to the Laplace--Beltrami…
We analyze the convergence of the (algebraic) multiplicative Schwarz method applied to linear algebraic systems with matrices having a special block structure that arises, for example, when a (partial) differential equation is posed and…
The Riemann-Liouville formula for fractional derivatives and integrals (differintegration) is used to derive formulae for matrix order derivatives and integrals. That is, the parameter for integration and differentiation is allowed to…
In this paper we give an explicit solution of Dzherbashyan-Caputo-fractional Cauchy problems related to equations with derivatives of order $\nu k$, for $k$ non-negative integer and $\nu>0$. The solution is obtained by connecting the…
By observing that the fractional Caputo derivative can be expressed in terms of a multiplicative convolution operator, we introduce and study a class of such operators which also have the same self-similarity property as the Caputo…
One of the motivations for using fractional calculus in physical systems is due to fact that many times, in the space and time variables we are dealing which exhibit coarse-grained phenomena, meaning that infinitesimal quantities cannot be…
We study the problem of estimating precision matrices in Gaussian distributions that are multivariate totally positive of order two ($\mathrm{MTP}_2$). The precision matrix in such a distribution is an M-matrix. This problem can be…
Regarding quaternions as normal matrices, we first characterize the $2\times 2$ matrix-valued functions, defined on subsets of quaternions, whose values are quaternions. Then we investigate the regularity of quaternionic-valued functions,…
The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…
Matrix completion tackles the task of predicting missing values in a low-rank matrix based on a sparse set of observed entries. It is often assumed that the observation pattern is generated uniformly at random or has a very specific…
We present an efficient numerical method for computing Hamiltonian matrix elements between non-orthogonal Slater determinants, focusing on the most time-consuming component of the calculation that involves a sparse array. In the usual case…
The study of the Mittag-Leffler function and its various generalizations has become a very popular topic in mathematics and its applications. In the present paper we prove the following estimate for the $q$-Mittag-Leffler function:…
Explicit solutions of differential equations of complex fractional orders with respect to functions and with continuous variable coefficients are established. The representations of solutions are given in terms of some convergent infinite…
A strong inspiration for studying Sobolev type fractional evolution equations comes from the fact that have been verified to be useful tools in the modeling of many physical processes. We introduce a novel technique for solving Sobolev type…
In this brief, we discuss the implementation of a third order semi-implicit differentiator as a complement of the recent work by the author that proposes an interconnected semi-implicit Euler double differentiators algorithm through Taylor…
Polyhedral projection is a main operation of the polyhedron abstract domain.It can be computed via parametric linear programming (PLP), which is more efficient than the classic Fourier-Motzkin elimination method.In prior work, PLP was done…
Binary matrix factorisation is an essential tool for identifying discrete patterns in binary data. In this paper we consider the rank-k binary matrix factorisation problem (k-BMF) under Boolean arithmetic: we are given an n x m binary…