Related papers: A proposal for factorization using Kerr nonlineari…
We have developed a simple method to solve anharmonic oscillators equations. The idea of our method is mainly based on the partitioning of the potential curve into (n+1) small intervals, solving the Schr\"odinger equation in each…
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…
Prime factorization on quantum processors is typically implemented either via circuit-based approaches such as Shor's algorithm or through Hamiltonian optimization methods based on adiabatic, annealing, or variational techniques. While…
Boolean matrix factorization (BMF) approximates a given binary input matrix as the product of two smaller binary factors. As opposed to binary matrix factorization which uses standard arithmetic, BMF uses the Boolean OR and Boolean AND…
Computationally efficient numerical methods for high-order approximations of convolution integrals involving weakly singular kernels find many practical applications including those in the development of fast quadrature methods for…
We study numerically the Casimir interaction between dielectrics in both two and three dimensions. We demonstrate how sparse matrix factorizations enable one to study torsional interactions in three dimensions. In two dimensions we study…
For trigonometric and modified trigonometric integrators applied to oscillatory Hamiltonian differential equations with one or several constant high frequencies, near-conservation of the total and oscillatory energies are shown over time…
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…
In the age of big data and interpretable machine learning, approaches need to work at scale and at the same time allow for a clear mathematical understanding of the method's inner workings. While there exist inherently interpretable…
A convergent algorithm for nonnegative matrix factorization with orthogonality constraints imposed on both factors is proposed in this paper. This factorization concept was first introduced by Ding et al. with intent to further improve…
We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…
Standard numerical integrators suffer from an order reduction when applied to nonlinear Schr\"{o}dinger equations with low-regularity initial data. For example, standard Strang splitting requires the boundedness of the solution in $H^{r+4}$…
In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a…
When considered as orthogonal bases in distinct vector spaces, the unit vectors of polarization directions and the Laguerre-Gaussian modes of polarization amplitude are inseparable, constituting a so-called classical entangled light beam.…
The model of coupled oscillators plays an important role in modern physics. It is used for description of various processes: from vibrations atoms in solid states to electromagnetic oscillations in slow-wave structures. The model with…
We discuss factorization of the hypergeometric-type difference equations on the uniform lattices and show how one can construct a dynamical algebra, which corresponds to each of these equations. Some examples are exhibited, in particular,…
We report a quantum-classical hybrid scheme for factorization of bi-prime numbers (which are odd and square-free) using IBM's quantum processors. The hybrid scheme proposed here involves both classical optimization techniques and adiabatic…
We study the decomposition of the Coulomb integrals of periodic systems into a tensor contraction of six matrices of which only two are distinct. We find that the Coulomb integrals can be well approximated in this form already with small…
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…
Triangular factorizations are an important tool for solving integral equations and partial differential equations with hierarchical matrices ($\mathcal{H}$-matrices). Experiments show that using an $\mathcal{H}$-matrix LR factorization to…