Related papers: Symbolic computation of weighted Moore-Penrose inv…
In this paper will be considered standard forms of generalized inverses for matrices in the shape of block representations {1, 2, 3, 4, 5, 5^k}-inverse. Especially will be considered Moore-Penrose inverse and the group inverse. Results from…
Pseudoinverses are ubiquitous tools for handling over- and under-determined systems of equations. For computational efficiency, sparse pseudoinverses are desirable. Recently, sparse left and right pseudoinverses were introduced, using…
In this article, specific definitions of the Moore-Penrose inverse, Drazin inverse of the quaternion tensor and the inverse along two quaternion tensors are introduced under the T-product. Some characterizations, representations and…
The inversion of extremely high order matrices has been a challenging task because of the limited processing and memory capacity of conventional computers. In a scenario in which the data does not fit in memory, it is worth to consider…
The space of finite games can be decomposed into three orthogonal subspaces [5], which are the subspaces of pure potential games, nonstrategic games and pure harmonic games. The orthogonal projections onto these subspaces are represented as…
We will discuss two approaches to estimating partial derivatives and the metric components; one utilizing past work describing a causal set $\Box$ operator, and one using a construction from linear algebra called the Moore-Penrose inverse.…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…
In this paper, new block representations of Moore-Penrose inverses for arbitrary complex $2\times2$ block matrices are given. The approach is based on block representations of orthogonal projection matrices.
In the present paper we investigate Moore-Penrose inverse and characteristic matrix of unbounded WCT operators on the Hilbert space $L^2(\mu)$. Also, we obtain some applications of the Moore-Penrose inverse of unbounded operators on the…
In this paper, we provide a few properties of the weighted Moore--Penrose inverse for an arbitrary order tensor via the Einstein product. We again obtain some new sufficient conditions for the reverse-order law of the weighted…
This is a pdf print of the homonymous Maple file, freely available at http://www.maplesoft.com/applications/view.aspx?SID=127621, providing procedures which are able to produce the toric data associated with a (polarized) weighted…
Inversion of operators is a fundamental concept in data processing. Inversion of linear operators is well studied, supported by established theory. When an inverse either does not exist or is not unique, generalized inverses are used. Most…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
The inverse power method is a numerical algorithm to obtain the eigenvectors of a matrix. In this work, we develop an iteration algorithm, based on the inverse power method, to numerically solve the Schr\"odinger equation that couples an…
We investigate the Moore-Penrose pseudoinverse and generalized inverse of a matrix product $A=CR$ to establish a unifying framework for generalized and randomized matrix inverses. This analysis is rooted in first principles, focusing on the…
In this paper we propose several strategies for the exact computation of the determinant of a rational matrix. First, we use the Chinese Remaindering Theorem and the rational reconstruction to recover the rational determinant from its…
In this paper, a method via sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix is proposed. The resulting factorized sparse approximate inverse is used as a…
We consider the problem of symbolic-numeric integration of symbolic functions, focusing on rational functions. Using a hybrid method allows the stable yet efficient computation of symbolic antiderivatives while avoiding issues of…