Abstract: Optimal transport (OT) theory has attracted much attention in machine learning and signal processing applications. OT defines a notion of distance between probability distributions of source ...

The constrained least-squares n × n-matrix problem where the feasibility set is the subspace of the Toeplitz matrices is analyzed. The general, the upper and lower triangular cases are solved by ...

I find when I use large basis to perform some accuracy tests. However, sometimes I find the calculation stucks at the beginning of SCF procedure, this makes me quite confused. Later when I switch ...

The count of signatures from cosmic is 86, so this question won't be addressed. But if signatures are more than 96, the method named QP only uses 96 rows to construct a matrix, that's the reason for ...

ABSTRACT: Accurately approximating higher order derivatives is an inherently difficult problem. It is shown that a random variable shape parameter strategy can improve the accuracy of approximating ...

Presenting an algorithm that solves linear systems with sparse coefficient matrices asymptotically faster than matrix multiplication for any ω > 2. Our algorithm can be viewed as an efficient, ...

ABSTRACT: This paper discusses the necessary and sufficient conditions for the existence of Hermite positive definite solutions of the quaternion matrix equation Xm+ B*XB = C (m > 0) and its iterative ...

Abstract: We present a new direct algorithm for solving a system of linear equations with a positive definite matrix by discretizing a continuous-time dynamical system for a large sampling time. The ...