Related papers: Cholesky decomposition for symmetric matrices over…
This paper continues the research devoted to the design of numerically stable square-root implementations for the maximum correntropy criterion Kalman filtering (MCC-KF). In contrast to the previously obtained results, here we reveal the…
For the interpretation of spectra of magnetic stellar objects such as magnetic white dwarfs (WDs) highly accurate quantum chemical predictions for atoms and molecules in finite magnetic field are required. Especially the accurate…
Estimation of large sparse covariance matrices is of great importance for statistical analysis, especially in the high-dimensional settings. The traditional approach such as the sample covariance matrix performs poorly due to the high…
While existing algorithms may be used to solve a linear system over a general field in matrix-multiplication time, the complexity of constructing a symmetric triangular factorization (LDL) has received relatively little formal study. The…
This paper initiates a discrete Hodge theory for cellular sheaves taking values in a category of lattices and Galois connections. The key development is the Tarski Laplacian, an endomorphism on the cochain complex whose fixed points yield a…
We show, in one dimension, that an $hp$-Finite Element Method ($hp$-FEM) discretisation can be solved in optimal complexity because the discretisation has a special sparsity structure that ensures that the reverse Cholesky factorisation…
Motivated by several open problems in the Afham-Ferrie theory of generalized fidelity, we study polar fidelities, Holevo bases, and unitary factors on \(\Pd\), the cone of \(d\times d\) complex positive definite matrices. We prove that, for…
In this paper we consider the stability of the QR factorization in an oblique inner product. The oblique inner product is defined by a symmetric positive definite matrix A. We analyze two algorithm that are based a factorization of A and…
Sparse linear algebra routines are fundamental building blocks of a large variety of scientific applications. Direct solvers, which are methods for solving linear systems via the factorization of matrices into products of triangular…
This paper provides a theoretical explanation on the clustering aspect of nonnegative matrix factorization (NMF). We prove that even without imposing orthogonality nor sparsity constraint on the basis and/or coefficient matrix, NMF still…
Some filter relative notions of size, $\left( \mathcal{F},\mathcal{G}\right) $-syndeticity and piecewise $\mathcal{F} $-syndeticity, were defined and applied with clarity and focus by Shuungula, Zelenyuk and Zelenyuk in their paper ``The…
The generalized cluster complex was introduced by Fomin and Reading, as a natural extension of the Fomin-Zelevinsky cluster complex coming from finite type cluster algebras. In this work, to each face of this complex we associate a…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
Modern statistical learning theory and deep learning characterize generalization primarily in terms of continuous capacity control (e.g., norm-based regularization, margin maximization, low-rank bias). While highly successful in continuous…
Let $\mathcal{A}$ be an affine hyperplane arrangement, $L(\mathcal{A})$ its intersection poset, and $\chi_{\mathcal{A}}(t)$ its characteristic polynomial. This paper aims to propose combinatorial structures for the factorization of…
We describe a method for doing computations with Orlov's equivalence between the bounded derived category of certain hypersurfaces and the stable category of graded matrix factorisations of the polynomials describing these hypersurfaces. In…
The notion of partial fidelities as invented recently by A.Uhlmann for pairs of finite dimensional density matrices will be extended to the vN-algebraic context and is considered and thoroughly discussed in detail from a mathematical point…
In this paper, we consider two fundamental symmetric kernels in linear algebra: the Cholesky factorization and the symmetric rank-$k$ update (SYRK), with the classical three nested loops algorithms for these kernels. In addition, we…
The notion of a matrix factorization was introduced by Eisenbud in the commutative case in his study of bounded (periodic) free resolutions over complete intersections. In this work, we extend the notion of (homogeneous) matrix…
For a function $W\in \mathbb{C}[X]$ on a smooth algebraic variety $X$ with Morse-Bott critical locus $Y\subset X$, Kapustin, Rozansky and Saulina suggest that the associated matrix factorisation category $\mathrm{MF}(X;W)$ should be…