Related papers: Canonical factorization and diagonalization of Bax…
Multidimensional factorization method is formulated in arbitrary curvilinear coordinates. Particular cases of polar and spherical coordinates are considered and matrix potentials with separating variables are constructed. A new class of…
We calculate and analize the ${\cal{O}}(\alpha_s)$ one-particle inclusive cross section in polarized deep inelastic lepton-hadron scattering, using dimensional regularization and the HVBM prescription for $\gamma_5$. We discuss the…
The dynamical symmetries of the Kratzer-type molecular potentials (generalized Kratzer molecular potentials) are studied by using the factorization method. The creation and annihilation (ladder) operators for the radial eigenfunctions…
Matrix spectral factorization is traditionally described as finding spectral factors having a fixed analytic pole configuration. The classification of spectral factors then involves studying the solutions of a certain algebraic Riccati…
We analyze effective approximation of unitary matrices. In our formulation, a unitary matrix is represented as a product of rotations in two-dimensional subspaces, so-called Givens rotations. Instead of the quadratic dimension dependence…
We introduce a Generalized Randomized QR-decomposition that may be applied to arbitrary products of matrices and their inverses, without needing to explicitly compute the products or inverses. This factorization is a critical part of a…
The hierarchical matrix framework partitions matrices into subblocks that are either small or of low numerical rank, enabling linear storage complexity and efficient matrix-vector multiplication. This work focuses on the $H^2$-matrix format…
Since an old observation by Beenakker et al, the evaluation of QCD processes in dimensional reduction has repeatedly led to terms that seem to violate the QCD factorization theorem. We reconsider the example of the process gg->ttbar and…
This paper is concerned with a refinement of the Stein factorization, and with applications to the study of deformations of surjective morphisms. We show that every surjective morphism f:X->Y between normal projective varieties factors…
In this paper we establish affinizations and R-matrices in the language of pro-objects, and as an application, we construct reflection functors over the localizations of quiver Hecke algebras of arbitrary finite types. This reflection…
Numerical computations involving rational matrices often benefit from preserving underlying matrix structures such as symmetry, Hermitian properties, or sparsity that reflect physical, geometric, or algebraic characteristics of the system.…
Here we discuss a regularized version of the factorization method for positive operators acting on a Hilbert Space. The factorization method is a qualitative reconstruction method that has been used to solve many inverse shape problems. In…
Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…
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…
Tensor decompositions, which represent an $N$-order tensor using approximately $N$ factors of much smaller dimensions, can significantly reduce the number of parameters. This is particularly beneficial for high-order tensors, as the number…
Boolean matrix factorization is a natural and a popular technique for summarizing binary matrices. In this paper, we study a problem of Boolean matrix factorization where we additionally require that the factor matrices have consecutive…
This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…
One of the features of Baxter's Q-operators for many closed spin chain models is that all transfer matrices arise as products of two Q-operators with shifts in the spectral parameter. In the representation-theoretical approach to…
Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an…
The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…