scholarly journals Factorization problem on the Hilbert-Schmidt group and the Camassa-Holm equation

2007 ◽  
Vol 61 (2) ◽  
pp. 186-209 ◽  
Author(s):  
Luen-Chau Li
Keyword(s):  
Schmidt Group ◽  
Factorization Problem ◽  
Holm Equation

scholarly journals Conservative finite difference schemes for the modified Camassa-Holm equation

JSIAM Letters ◽  
2011 ◽  
Vol 3 (0) ◽  
pp. 37-40 ◽  
Author(s):  
Yuto Miyatake ◽  
Takayasu Matsuo ◽  
Daisuke Furihata
Keyword(s):  
Finite Difference ◽  
Difference Schemes ◽  
Finite Difference Schemes ◽  
Holm Equation

Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem

2021 ◽  
Vol 31 (1) ◽  
pp. 1-4
Author(s):  
Mikhail A. Cherepnev
Keyword(s):  
Upper Bound ◽  
Polynomial Algorithm ◽  
Integer Factorization ◽  
Factorization Problem ◽  
Diffie Hellman ◽  
Integer Factorization Problem

Abstract We construct a probabilistic polynomial algorithm that solves the integer factorization problem using an oracle solving the Diffie–Hellman problem.

scholarly journals A Block Coordinate Descent-Based Projected Gradient Algorithm for Orthogonal Non-Negative Matrix Factorization

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 540
Author(s):  
Soodabeh Asadi ◽  
Janez Povh
Keyword(s):  
Matrix Factorization ◽  
Synthetic Data ◽  
Coordinate Descent ◽  
The Other ◽  
Gradient Algorithm ◽  
Block Coordinate Descent ◽  
Projected Gradient Method ◽  
Projected Gradient ◽  
Factorization Problem ◽  
Non Negative Matrix Factorization

This article uses the projected gradient method (PG) for a non-negative matrix factorization problem (NMF), where one or both matrix factors must have orthonormal columns or rows. We penalize the orthonormality constraints and apply the PG method via a block coordinate descent approach. This means that at a certain time one matrix factor is fixed and the other is updated by moving along the steepest descent direction computed from the penalized objective function and projecting onto the space of non-negative matrices. Our method is tested on two sets of synthetic data for various values of penalty parameters. The performance is compared to the well-known multiplicative update (MU) method from Ding (2006), and with a modified global convergent variant of the MU algorithm recently proposed by Mirzal (2014). We provide extensive numerical results coupled with appropriate visualizations, which demonstrate that our method is very competitive and usually outperforms the other two methods.

The Camassa–Holm equation on the half-line with linearizable boundary condition

2010 ◽  
Vol 348 (13-14) ◽  
pp. 775-780 ◽  
Author(s):  
Anne Boutet de Monvel ◽  
Dmitry Shepelsky
Keyword(s):  
Boundary Condition ◽  
Half Line ◽  
Holm Equation

scholarly journals The Cauchy problem for the generalized Camassa–Holm equation in Besov space

2014 ◽  
Vol 256 (8) ◽  
pp. 2876-2901 ◽  
Author(s):  
Wei Yan ◽  
Yongsheng Li ◽  
Yimin Zhang
Keyword(s):  
Cauchy Problem ◽  
Besov Space ◽  
Holm Equation ◽  
The Cauchy Problem
Sign in / Sign up

Export Citation Format

Share Document