Related papers: Cramer's rules for the solution to the two-sided r…
We proposed in this paper a new method, which we named the W4 method, to solve nonlinear equation systems. It may be regarded as an extension of the Newton-Raphson~(NR) method to be used when the method fails. Indeed our method can be…
The Wentzel-Kramers-Brillouin (WKB) perturbative series, a widely used technique for solving linear waves, is typically divergent and at best, asymptotic, thus impeding predictions beyond the first few leading-order effects. Here, we report…
We introduce an algebraic model, based on the determinantal expansion of the product of two matrices, to test combinatorial reductions of set functions. Each term of the determinantal expansion is deformed through a monomial factor in d…
The paper introduce a new type of generalized inverse, called Bott-Duffin drazin inverse (or, in short, BDD-inverse) of a complex square matrix, and give some of its properties, characterizations and representations. Furthermore, We discuss…
We write down and solve a closed set of Schwinger-Dyson equations for the two-matrix model in the large $N$ limit. Our elementary method yields exact solutions for correlation functions involving angular degrees of freedom whose calculation…
Low-rank matrix approximation, which aims to construct a low-rank matrix from an observation, has received much attention recently. An efficient method to solve this problem is to convert the problem of rank minimization into a nuclear norm…
In this paper,we study the constrained matrix approximation problem in the Frobenius norm by using the core inverse:\begin{align}\nonumber \left\|{Mx - b} \right\|_F=\min\ \ {\rm subject\ to} \ \ {x\in\mathcal{R}(M)} ,\end{align} where…
The object of this paper is to introduce a new and fascinating method of solving large linear equations, based on Cramer's rule or Gaussian elimination but employing Sylvester's determinant identity in its computation process. In addition,…
The ELM method has become widely used for classification and regressions problems as a result of its accuracy, simplicity and ease of use. The solution of the hidden layer weights by means of a matrix pseudoinverse operation is a…
A systematic theory is introduced for calculating the derivatives of quaternion matrix function with respect to quaternion matrix variables. The proposed methodology is equipped with the matrix product rule and chain rule and it is able to…
A common optimization problem is the minimization of a symmetric positive definite quadratic form $< x,Tx >$ under linear constrains. The solution to this problem may be given using the Moore-Penrose inverse matrix. In this work we extend…
In this paper we develop constructive invertibility conditions for the twisted convolution. Our approach is based on splitting the twisted convolution with rational parameters into a finite number of weighted convolutions, which can be…
We develop quaternionic analysis using as a guiding principle representation theory of various real forms of the conformal group. We first review the Cauchy-Fueter and Poisson formulas and explain their representation theoretic meaning. The…
This is the fourth article in a series where we succeed in enlarging the class of exactly solvable quantum systems. We do that by working in a complete set of square integrable basis that carries a tridiagonal matrix representation for the…
We propose a method and algorithm for computing the weighted Moore-Penrose inverse of one-variable rational matrices. Continuing this idea, we develop an algorithm for computing the weighted Moore-Penrose inverse of one-variable polynomial…
We derive necessary and sufficient conditions for the existence of the exact solution to the Sylvester-type quaternion tensor system $ \mathcal{A}_i\ast_{N}\mathcal{X}_i+ \mathcal{Y}_i\ast_{M}\mathcal{B}_i+\mathcal{C}_i\ast_{N}…
We review the general problem of finding a global rotation that transforms a given set of points and/or coordinate frames (the "test" data) into the best possible alignment with a corresponding set (the "reference" data). For 3D point data,…
We present a generalisation of the pseudoinverse operation to pairs of matrices, as opposed to single matrices alone. We note the fact that the Singular Value Decomposition can be used to compute the ordinary Moore-Penrose pseudoinverse. We…
A new algorithm to compute the restricted singular value decomposition of dense matrices is presented. Like Zha's method \cite{Zha92}, the new algorithm uses an implicit Kogbetliantz iteration, but with four major innovations. The first…
Starting from a general relativistic kinetic equation, a self-consistent mean-field equation for fermions is derived within a covariant density matrix approach of QED plasmas in strong external fields. A Schr\"odinger picture formulation on…