An analysis of GCD and LCM matrices via the -factorization.

Ovall, Jeffrey S.

Displaying similar documents to “An analysis of GCD and LCM matrices via the $L D L^{T}$ -factorization.”

Determinant and inverse of meet and join matrices.

Altinisik, Ercan, Tuglu, Naim, Haukkanen, Pentti (2007)

International Journal of Mathematics and Mathematical Sciences

Similarity:

A contribution to Collatz's eigenvalue inclusion theorem for nonnegative irreducible matrices.

Oepomo, Tedja Santanoe (2003)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

Bounds for the spectral radius of block $H$ -matrices.

Zhang, Wei, Han, Zheng-Zhi (2006)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

The Cauchy double alternant and divided differences.

Chu, Wenchang (2006)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

Notes on the divisibility of GCD and LCM matrices.

Haukkanen, Pentti, Korkee, Ismo (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Multiple gcd-closed sets and determinants of matrices associated with arithmetic functions

Siao Hong, Shuangnian Hu, Shaofang Hong (2016)

Open Mathematics

Similarity:

Let f be an arithmetic function and S = {x1, …, xn} be a set of n distinct positive integers. By (f(xi, xj)) (resp. (f[xi, xj])) we denote the n × n matrix having f evaluated at the greatest common divisor (xi, xj) (resp. the least common multiple [xi, xj]) of x, and xj as its (i, j)-entry, respectively. The set S is said to be gcd closed if (xi, xj) ∈ S for 1 ≤ i, j ≤ n. In this paper, we give formulas for the determinants of the matrices (f(xi, xj)) and (f[xi, xj]) if S consists of...