Related papers: Cholesky decomposition for symmetric matrices over…
We introduce a task-parallel algorithm for sparse incomplete Cholesky factorization that utilizes a 2D sparse partitioned-block layout of a matrix. Our factorization algorithm follows the idea of algorithms-by-blocks by using the block…
The Cholesky decomposition plays an important role in finding the inverse of the correlation matrices. As it is a fast and numerically stable for linear system solving, inversion, and factorization compared to singular valued decomposition…
We study matrix integration over the classical Lie groups $U(N),Sp(2N),O(2N)$ and $O(2N+1)$, using symmetric function theory and the equivalent formulation in terms of determinants and minors of Toeplitz$\pm$Hankel matrices. We establish a…
The set of infinite upper-triangular totally positive Toeplitz matrices has a classical parametrisation proved by Edrei et al and originally conjectured by Schoenberg, that involves pairs of sequences of positive real parameters. These…
This article generalizes the correspondence between matrix factorizations and maximal Cohen-Macaulay modules over hypersurface rings due to Eisenbud and Yoshino. We consider factorizations with several factors in a purely categorical…
We construct a Hochschild-Kostant-Rosenberg-type quasi-isomorphism for the negative cyclic homology of the category of global matrix factorizations on a smooth separated scheme of finite type over a field. The map is explicit enough to…
We consider discretizations of the hyper-singular integral operator on closed surfaces and show that the inverses of the corresponding system matrices can be approximated by blockwise low-rank matrices at an exponential rate in the block…
We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…
We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…
For $n\ge 2$ and fixed $k\ge 1$, we study when a square matrix $A$ over an arbitrary field $\mathbb{F}$ can be decomposed as $T+N$ where $T$ is a torsion matrix and $N$ is a nilpotent matrix with $N^k=0$. For fields of prime characteristic,…
In this paper we present a method for matrix inversion based on Cholesky decomposition with reduced number of operations by avoiding computation of intermediate results; further, we use fixed point simulations to compare the numerical…
Convergence is a crucial issue in iterative algorithms. Damping is commonly employed to ensure the convergence of iterative algorithms. The conventional ways of damping are scalar-wise, and either heuristic or empirical. Recently, an…
Fractional powers and polynomial maps preserving structured totally positive matrices, one-sided Polya frequency functions, or totally positive kernels are treated from a unifying perspective. Besides the stark rigidity of the polynomial…
The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and \v{Z}ivkovi\'{c}. The application of this problem in chemistry, as well as its interesting theoretical aspects, made this subject very active. In this…
We define and study entanglement of continuous positive definite functions on products of compact groups. We formulate and prove an infinite-dimensional analog of Horodecki Theorem, giving a necessary and sufficient criterion for…
Mirsky proved that, for the existence of a complex matrix with given eigenvalues and diagonal entries, the obvious necessary condition is also sufficient. We generalize this theorem to matrices over any field and provide a short proof.…
We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…
We study the combinatorial description of the LDU decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU decomposition of totally positive…
A new runtime environment for the execution of recursive matrix algorithms on a supercomputer with distributed memory is proposed. It is designed both for dense and sparse matrices. The environment ensures decentralized control of the…
A linear polyomial non-negative on the non-negativity domain of finitely many linear polynomials can be expressed as their non-negative linear combination. Recently, under several additional assumptions, Helton, Klep, and McCullough…