Related papers: Wiener-Hopf matrix factorization using ordinary di…
Invariant linearization criteria of square systems of second-order quadratically semi-linear ordinary differential equations (ODEs) that can be represented as geodesic equations are extended to square systems of ODEs cubically nonlinear in…
We present a variational approach to a general Lienard-type equation in order to linearize it and, as an example, the Van der Pol oscillator is discussed. The new equation which is almost linear is factorized. The point symmetries of the…
In this paper, we develop a new regularized version of the Factorization Method for positive operators mapping a complex Hilbert Space into it's dual space. The Factorization Method uses Picard's Criteria to define an indicator function to…
The joint approximate diagonalization of non-commuting symmetric matrices is an important process in independent component analysis. This problem can be formulated as an optimization problem on the Stiefel manifold that can be solved using…
Can the behavior of a random matrix be improved by modifying a small fraction of its entries? Consider a random matrix $A$ with i.i.d. entries. We show that the operator norm of $A$ can be reduced to the optimal order $O(\sqrt{n})$ by…
A finite element methodology for large classes of variational boundary value problems is defined which involves discretizing two linear operators: (1) the differential operator defining the spatial boundary value problem; and (2) a Riesz…
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 consider the factorisation problem for bialgebras: when a bialgebra $K$ factorises as $K=HL$, where $H$ and $L$ are algebras and coalgebras (but not necessarly bialgebras). Given two maps $R: H\ot L\to L\ot H$ and $W:L\ot H\to H\ot L$,…
In this paper, a new method to compute a B\'ezier curve of degree n = 2m-1 is introduced, here formulated as a set of points whose coordinates are calculated from two Hankel forms in $\C^m$. From Vandermonde factorizations of the two…
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…
These lectures introduce the method of nonlinear steepest descent for Riemann-Hilbert problems. This method finds use in studying asymptotics associated to a variety of special functions such as the Painlev\'{e} equations and orthogonal…
We generalize the Wiener-Hopf factorization of Laurent series to more general commutative coefficient rings, and we give explicit formulas for the decomposition. We emphasize the algebraic nature of this factorization.
A systematic algorithm for building integrating factors of the form mu(x,y') or mu(y,y') for non-linear second order ODEs is presented. When such an integrating factor exists, the algorithm determines it without solving any differential…
High-order methods gain more and more attention in computational fluid dynamics. However, the potential advantage of these methods depends critically on the availability of efficient elliptic solvers. With spectral-element methods, static…
A new matrix modified Korteweg-de Vries (mmKdV) equation with a $p\times q$ complex-valued potential matrix function is first studied via Riemann-Hilbert approach, which can be reduced to the well-known coupled modified Korteweg-de Vries…
We apply general difference calculus in order to obtain solutions to the functional equations of the second order. We show that factorization method can be successfully applied to the functional case. This method is equivariant under the…
Motivated by orthogonal dictionary learning problems, we propose a novel method for matrix factorization, where the data matrix $\mathbf{Y}$ is a product of a Householder matrix $\mathbf{H}$ and a binary matrix $\mathbf{X}$. First, we show…
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…
In this paper, we develop a factorization method to reconstruct cavities in a heat conductor by knowing the Neumann-to-Dirichlet map at the boundary of this conductor. The factorization method is a very well known reconstruction method for…
We consider optimization problems involving the multiplication of variable matrices to be selected from a given family, which might be a discrete set, a continuous set or a combination of both. Such nonlinear, and possibly discrete,…