Related papers: Bidiagonal Factorization of Banded Recursion Matri…
In this paper, we discuss a systematic and self consistent procedure to factorize a rather general class of coupled nonlinear ordinary differential equations (ODEs), namely coupled quadratic and mixed Li\'enard type equations, which include…
We propose a novel factorization algorithm that leverages the theory underlying the SQUFOF method, including reduced quadratic forms, infrastructural distance, and Gauss composition. We also present an analysis of our method, which has a…
We introduce a large class of Sobolev bi-orthogonal polynomial sequences arising from a $LU$-factorizable moment matrix and associated with a suitable measure matrix that characterizes the Sobolev bilinear form. A theory of deformations of…
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 consider the design of an orthogonal symmetric/antisymmetric multiwavelet from its matrix product filter by matrix spectral factorization (MSF). As a test problem, we construct a simple matrix product filter with desirable properties,…
Factorization of an $n\times n$ unitary matrix as a product of $n$ diagonal matrices containing only phases interlaced with $n-1$ orthogonal matrices each one generated by a real vector as well as an explicit form for the Weyl factorization…
Recently, \cite{Cao:2025hio} demonstrated the $2$-split for form factor under specific kinematic constraints. This factorization is analogous to that observed in scattering amplitudes. A key consequence of this structure is the presence of…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…
This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix factorization algorithms with robust convergence proofs. We design the algorithms based on the work of Lee and Seung [1], and derive the converged versions by utilizing…
For a bilinear form obtained by adding a Dirac mass to a positive definite moment functional in several variables, explicit formulas of orthogonal polynomials are derived from the orthogonal polynomials associated with the moment…
Uvarov-type perturbations for mixed-type multiple orthogonal polynomials on the step line are investigated within a matrix-analytic framework. The transformations considered involve both rational and additive modifications of a rectangular…
Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and…
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…
We study categories of matrix factorizations. These categories are defined for any regular function on a suitable regular scheme. Our paper has two parts. In the first part we develop the foundations; for example we discuss derived direct…
We introduce efficient $(1+\varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}$, a rank parameter $k>0$, as well as an accuracy parameter…
In Disquisitiones Arithmeticae, Gauss studied binary quadratic forms and introduced a very general version of a composition operator that allows composing even forms of different discriminants and imprimitive forms. Section V of…
This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…
Following the works by Lin et al. (Circuits Syst. Signal Process. 20(6): 601-618, 2001) and Liu et al. (Circuits Syst. Signal Process. 30(3): 553-566, 2011), we investigate how to factorize a class of multivariate polynomial matrices. The…
A new reorthogonalized block classical Gram--Schmidt algorithm is proposed that factorizes a full column rank matrix $A$ into $A=QR$ where $Q$ is left orthogonal (has orthonormal columns) and $R$ is upper triangular and nonsingular. With…