Common Factors in Fraction-Free Matrix Decompositions

Johannes Middeke, David J. Jeffrey, Christoph Koutschan

发表信息：: Mathematics in Computer Science 15(4), pp. 589-608, 2021
DOI：: 10.1007/s11786-020-00495-9

英文摘要：

We consider LU and QR matrix decompositions using exact computations. We show that fraction-free Gauss--Bareiss reduction leads to triangular matrices having a non-trivial number of common row factors. We identify two types of common factors: systematic and statistical. Systematic factors depend on the reduction process, independent of the data, while statistical factors depend on the specific data. We relate the existence of row factors in the LU decomposition to factors appearing in the Smith--Jacobson normal form of the matrix. For statistical factors, we identify some of the mechanisms that create them and give estimates of the frequency of their occurrence. Similar observations apply to the common factors in a fraction-free QR decomposition. Our conclusions are tested experimentally.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Towards computing vector partition functions by iterated partial fraction decomposition

We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an algorithm to compute the numerators in their partial fraction decomposition "formally," i.e., as a formal expression in the parameter. We also analyze the type of generalized rational functions that appear during the execution of an algorithm based on iterated partial fraction decomposition and explain how to handle these objects.

2009-12-06math.CO

The LU-decomposition of Lehmer's tridiagonal matrix

The LU-decomposition of Lehmer's tridiagonal matrix is first guessed, then proved, which leads to an evaluation of the determinant.

2018-08-23math.CO

Computing DM-decomposition of a partitioned matrix with rank-1 blocks

In this paper, we develop a polynomial time algorithm to compute a Dulmage-Mendelsohn-type decomposition of a matrix partitioned into submatrices of rank at most $1$.

2018-02-17math.CO

Leinartas's partial fraction decomposition

These notes describe Leinartas's algorithm for multivariate partial fraction decompositions and employ an implementation thereof in Sage.

2012-06-25math.ACmath.CO

A matrix with sums of Catalan numbers -- LU-decomposition and determinant

Following Benjamin et al., a matrix with entries being sums of two neighbouring Catalan numbers is considered. Its LU-decomposition is given, by guessing the results and later prove it by computer algebra, with lots of human help. Specializing a parameter, the determinant turns out to be a Fibonacci number with odd index, confirming earlier results, obtained back then by combinatorial methods.

2021-06-13math.CO

A Fast Algorithm for Partial Fraction Decompositions

We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the rational function. The new algorithms use less storage space, and are suitable for parallel programming. We also discuss full partial fraction decompositions.

2004-08-14math.ACmath.CO

更多相关论文收起更多论文

Partial-Fraction Decompositions and Harmonic Number Identities

By means of partial fraction method, we investigate the decomposition of rational functions. Several striking identities on harmonic numbers and generalized Apery numbers will be established, including the binomial-harmonic number identity associated with Beukers' conjecture on Apery numbers.

2005-03-10math.COmath.NT

Decomposition of complete tripartite graphs into 5-cycles using the graph adjacency matrix

The problem of decomposing a complete tripartite graph into 5-cycles was first proposed in 1995 by Mahmoodian and Mirzakhani and since then many attempts have been made to decompose such graphs into 5-cycles. Such attempts were partially successful but parts of the problem still remain open. In this paper, we investigate the problem deeper, decompose more tripartite graphs into 5-cycles, and introduce the Graph Adjacency Matrix (GAM) method for cycle decomposition in general. GAM method transforms the cycle decomposition problem to covering squares with certain polygons. This new formulation i…

2021-05-30math.CO

General Equitable Decompositions for Graphs with Symmetries

Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues of the original matrix $M$. This is done by decomposing the matrix over a graph symmetry. Previously it was shown that a matrix can be equitably decomposed over any uniform, basic, or separable automorphism. Here we extend this theory to show that it is possible to equitably decompose a matrix over any automorphism of a graph, without restriction. Moreover, w…

2018-09-21math.CO

单位分数分解为无穷多个单位分数的渐近分析

Asymptotic Analysis of Infinite Decompositions of a Unit Fraction into Unit Fractions

本文指出Paul Erdős提出的将1分解为无穷多个单位分数之和的渐近估计问题，可沿用有限情形的方法求解。

2025-03-04math.COmath.NT

Extensions and Applications of Equitable Decompositions for Graphs with Symmetries

We extend the theory of equitable decompositions, in which, if a graph has a particular type of symmetry, i.e. a uniform or basic automorphism $ϕ$, it is possible to use $ϕ$ to decompose a matrix $M$ appropriately associated with the graph. The result is a number of strictly smaller matrices whose collective eigenvalues are the same as the eigenvalues of the original matrix $M$. We show here that a large class of automorphisms, which we refer to as \emph{separable}, can be realized as a sequence of basic automorphisms, allowing us to equitably decompose $M$ over any such automorphism. We also …

2017-07-29math.CO

Extending CSR Decomposition to Tropical Inhomogeneous Matrix Products

This article presents an attempt to extend the CSR decomposition, previously introduced for tropical matrix powers, to tropical inhomogeneous matrix products. The CSR terms for inhomogeneous matrix products are introduced, then a case is described where an inhomogeneous product admits such CSR decomposition after some length and give a bound on this length. In the last part of the paper a number of counterexamples are presented to show that inhomogeneous products do not admit CSR decomposition under more general conditions.

2020-09-16math.COmath.RA