相关论文: A note on the error analysis of classical Gram-Sch…

We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =…

For a given matrix, we are interested in computing GR decompositions $A=GR$, where $G$ is an isometry with respect to given scalar products. The orthogonal QR decomposition is the representative for the Euclidian scalar product. For a…

Correlation matrices are the sub-class of positive definite real matrices with all entries on the diagonal equal to unity. Earlier work has exhibited a parametrisation of the corresponding Cholesky factorisation in terms of partial…

We review known factorization results in quaternion matrices. Specifically, we derive the Jordan canonical form, polar decomposition, singular value decomposition, the QR factorization. We prove there is a Schur factorization for commuting…

It is well known that matrices with low Hessenberg-structured displacement rank enjoy fast algorithms for certain matrix factorizations. We show how $n\times n$ principal finite sections of the Gram matrix for the orthogonal polynomial…

We construct a class of representations of the quadratic R-matrix algebra, given by the reflection equation with the spectral parameter, in terms of certain ordinary difference operators. These operators turn out to act as parameter…

This paper is concerned with the squared F(robenius)-norm regularized factorization form for noisy low-rank matrix recovery problems. Under a suitable assumption on the restricted condition number of the Hessian for the loss function, we…

We prove a generalization of Orlov's theorem for matrix factorizations with $n$ steps. Let $X$ be a regular scheme, $W\colon X\to \mathbb{A}^1$ a flat morphism and $D:=W^{-1}(0)$ its central fiber. We construct an appropriate triangulated…

This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith…

The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem.…

We introduce a quadratic form $Q$ on the space of functions on the gap poset $G$ of the numerical semigroup $\langle a,b\rangle$. We prove combinatorially that when evaluated on the indicator function of an upward closed subset $D$, this…

This work is about rounding error analysis of randomized CholeskyQR-type algorithms for sparse matrices. We often encounter QR factorization of the sparse matrices in many real problems. In this work, we focus on some typical…

The definition for the Slater-type orbitals is generalized. Transformation between an orthonormal basis function and the Slater-type orbital with non-integer principal quantum numbers is investigated. Analytical expressions for the linear…

In this paper an approach for finding a sparse incomplete Cholesky factor through an incomplete orthogonal factorization with Givens rotations is discussed and applied to Gaussian Markov random fields (GMRFs). The incomplete Cholesky factor…

Triangular factorizations are an important tool for solving integral equations and partial differential equations with hierarchical matrices ($\mathcal{H}$-matrices). Experiments show that using an $\mathcal{H}$-matrix LR factorization to…

This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…

For certain types of quantum graphs we show that the random-matrix form factor can be recovered to at least third order in the scaled time $\tau$ from periodic-orbit theory. We consider the contributions from pairs of periodic orbits…

A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…

LU and Cholesky matrix factorization algorithms are core subroutines used to solve systems of linear equations (SLEs) encountered while solving an optimization problem. Standard factorization algorithms are highly efficient but remain…

This work is about an improved error analysis of CholeskyQR with the randomized model for the tall-skinny $X \in \mathbb{R}^{m\times n}$. Due to the structure of CholeskyQR, we utilize the randomized model in the first step of CholeskyQR…