Related papers: An Explicit Construction of Gauss-Jordan Eliminati…
In this paper we revisit the greatest common right divisor (GCRD) extraction from a set of polynomial matrices $P_i(\lambda)\in \F[\la]^{m_i\times n}$, $i=1,\ldots,k$ with coefficients in a generic field $\F$, and with common column…
After analyzing the 4x4 determinant of a matrix, a shortcut was obtained to find such a determinant. Similarly to the Sarrus method for 2x2 or 3x3 determinants, the method consists of laying 19 columns of size 4 each and adding and…
A novel algorithm for the recovery of low-rank matrices acquired via compressive linear measurements is proposed and analyzed. The algorithm, a variation on the iterative hard thresholding algorithm for low-rank recovery, is designed to…
This paper considers the problem of matrix completion when some number of the columns are completely and arbitrarily corrupted, potentially by a malicious adversary. It is well-known that standard algorithms for matrix completion can return…
The use of complex networks as a modern approach to understanding the world and its dynamics is well-established in literature. The adjacency matrix, which provides a one-to-one representation of a complex network, can also yield several…
Matrix factorization exploits the idea that, in complex high-dimensional data, the actual signal typically lies in lower-dimensional structures. These lower dimensional objects provide useful insight, with interpretability favored by sparse…
A Euclidean Distance Matrix (EDM) is a table of distance-square between points on a k- dimensional Euclidean space, with applications in many fields (e.g. engineering, geodesy, economics, genetics, biochemistry, psychology). A problem that…
We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on the eigenvector, or several eigenvectors (or their corresponding invariant subspace). The algorithms are derived from an implicit…
A modified Gibbs's rotation matrix is derived and the connection with the Euler angles, quaternions, and Cayley$-$Klein parameters is established. As particular cases, the Rodrigues and Gibbs parameterizations of the rotation are obtained.…
This paper introduces a new preconditioning technique that is suitable for matrices arising from the discretization of a system of PDEs on unstructured grids. The preconditioner satisfies a so-called filtering property, which ensures that…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
In practical computations, the (preconditioned) conjugate gradient (P)CG method is the iterative method of choice for solving systems of linear algebraic equations $Ax=b$ with a real symmetric positive definite matrix $A$. During the…
By using the Hadamard matrix product concept, this paper introduces two generalized matrix formulation forms of numerical analogue of nonlinear differential operators. The SJT matrix-vector product approach is found to be a simple,…
We study the Riemannian optimization methods on the embedded manifold of low rank matrices for the problem of matrix completion, which is about recovering a low rank matrix from its partial entries. Assume $m$ entries of an $n\times n$ rank…
Let $A$ be a proper Riordan array with general element $a_{n,k}$. We study the one parameter family of matrices whose general elements are given by $a_{2n+r, n+k+r}$. We show that each such matrix can be factored into a product of a Riordan…
This paper proposes a data-driven model reduction approach on the basis of noisy data. Firstly, the concept of data reduction is introduced. In particular, we show that the set of reduced-order models obtained by applying a Petrov-Galerkin…
We propose a generalization of the reduction of Poisson manifolds by distributions introduced by Marsden and Ratiu. Our proposal overcomes some of the restrictions of the original procedure, and makes the reduced Poisson structure…
Aitken extrapolation normally applied to convergent fixed point iteration is extended to extrapolate the solution of a divergent iteration. In addition, higher order Aitken extrapolation is introduced that enables successive decomposition…
We describe the calculation of integrated subtraction terms in the nested soft-collinear subtraction scheme for hadron collider processes with quarks and gluons, thereby extending the results presented in Ref.$~$[1]. Although this extension…
We show that given a finitely generated standard-graded algebra of dimension $d$ over an infinite field, its graded Noether normalizations obey a certain kind of `generic exchange', allowing one to pass between any two of them in at most…