Related papers: Wiener-Hopf matrix factorization using ordinary di…
This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation…
We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…
This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis…
The sparse factorization of a large matrix is fundamental in modern statistical learning. In particular, the sparse singular value decomposition and its variants have been utilized in multivariate regression, factor analysis, biclustering,…
We define and study the counterpart of the Wiener algebra in the quaternionic setting, both for the discrete and continuous case. We prove a Wiener-L\'evy type theorem and a factorization theorem. We give applications to Toeplitz and…
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…
In the present work, an attempted was made to develop a numerical algorithm by the use of new orthogonal hybrid functions formed from hybrid of piecewise constant orthogonal sample-and-hold functions and piecewise linear orthogonal…
We construct a large family of ribbon quasi-Hopf algebras related to small quantum groups, with a factorizable R-matrix. Our main purpose is to obtain non-semisimple modular tensor categories for quantum groups at even roots of unity, where…
Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…
We consider matrix orthogonal polynomials related to Jacobi type matrices of weights that can be defined in terms of a given matrix Pearson equation. Stating a Riemann-Hilbert problem we can derive first and second order differential…
Matrix factorization is an important mathematical problem encountered in the context of dictionary learning, recommendation systems and machine learning. We introduce a new `decimation' scheme that maps it to neural network models of…
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…
In recent years a Hopf algebraic structure underlying the process of renormalization in quantum field theory was found. It led to a Birkhoff factorization for (regularized) Hopf algebra characters, i.e. for Feynman rules. In this work we…
Linearization of coupled second order nonlinear ordinary differential equations (SNODEs) is one of the open and challenging problems in the theory of differential equations. In this paper we describe a simple and straightforward method to…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
This paper presents an adaptive randomized algorithm for computing the butterfly factorization of a $m\times n$ matrix with $m\approx n$ provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The…
A simple yet effective numerical method using orthogonal hybrid functions consisting of piecewise constant orthogonal sample-and-hold functions and piecewise linear orthogonal triangular functions is proposed to solve numerically fractional…
We obtain closed-form solutions of several inhomogeneous Lienard equations by the factorization method. The two factorization conditions involved in the method are turned into a system of first-order differential equations containing the…
As an extension of the discrete Sommerfeld problems on lattices, the scattering of a time harmonic wave is considered on an infinite square lattice when there exists a pair of semi-infinite cracks or rigid constraints. Due to the presence…
An algorithm for matrix factorization of polynomials was proposed in \cite{fomatati2022tensor} and it was shown that this algorithm produces better results than the standard method for factoring polynomials on the class of summand-reducible…