相关论文: Symbolic computation of weighted Moore-Penrose inv…
We propose an inertial forward-backward splitting algorithm to compute the zero of a sum of two monotone operators allowing for stochastic errors in the computation of the operators. More precisely, we establish almost sure convergence in…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…
The article presents a matrix differential operator and a pseudoinverse matrix differential operator for finding a particular solution to nonhomogeneous linear ordinary differential equations (ODE) with constant coefficients with special…
In this paper, we find the roots of lightlike quaternions. By introducing the concept of the Moore-Penrose inverse in split quaternions, we solve the linear equations $axb=d$, $xa=bx$ and $xa=b\bar{x}$. Also we obtain necessary and…
In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. We extend its application to the case of formal power series over a field of arbitrary characteristic and illustrate the proposed approach…
In this article, we discuss how a kind of hybrid computation, which employs symbolic, numeric, classic, and quantum algorithms, allows us to conduct Hartree-Fock electronic structure computation of molecules. In the proposed algorithm, we…
Multivariate polynomials arise in many different disciplines. Representing such a polynomial as a vector of univariate polynomials can offer useful insight, as well as more intuitive understanding. For this, techniques based on tensor…
The last decade has seen the parallel emergence in computational neuroscience and machine learning of neural network structures which spread the input signal randomly to a higher dimensional space; perform a nonlinear activation; and then…
The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
We present an extension of two policy-iteration based algorithms on weighted graphs (viz., Markov Decision Problems and Max-Plus Algebras). This extension allows us to solve the following inverse problem: considering the weights of the…
We introduce matrix-valued weight functions of arbitrary size, which are analogues of the weight function for the Gegenbauer or ultraspherical polynomials for the parameter $\nu>0$. The LDU-decomposition of the weight is explicitly given in…
In this paper, we first give an expression for the Moore-Penrose inverse of the product of two tensors via the Einstein product. We then introduce a new generalized inverse of a tensor called product Moore-Penrose inverse. A necessary and…
We have designed a new symbolic-numeric strategy to compute efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over an algebraic number field. In essence, computations modulo a well chosen prime $p$…
Recently, Malik and Ferreyra introduced the $m$-weak core inverse for complex square matrices which generalizes the core-EP inverse, the WC inverse, and therefore the core inverse. The main aim of this paper is to extend the concept of…
We construct a pathwise calculus for functionals of integer-valued measures and use it to derive an martingale representation formula with respect to a large class of integer-valued random measures. Using these results, we extend the…
In this paper, we describe a reliable symbolic computational algorithm for inverting general cyclic heptadiagonal matrices by using parallel computing along with recursion. The algorithm is implementable to the Computer Algebra System(CAS)…
In this paper we focus on the solution of shifted quasiseparable systems and of more general parameter dependent matrix equations with quasiseparable representations. We propose an efficient algorithm exploiting the invariance of the…
We present a coarse-graining (or model order reduction) procedure for stochastic matrices by clustering. The method is consistent with the natural structure of Markov theory, preserving positivity and mass, and does not rely on any tools…
It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…