Decio Levi

MATH-PH
3papers
26citations
Novelty20%
AI Score15

3 Papers

MATH-PHJul 15, 2014
Lie-point symmetries of the discrete Liouville equation

Decio Levi, Luigi Martina, Pavel Winternitz

The Liouville equation is well known to be linearizable by a point transformation. It has an infinite dimensional Lie point symmetry algebra isomorphic to a direct sum of two Virasoro algebras. We show that it is not possible to discretize the equation keeping the entire symmetry algebra as point symmetries. We do however construct a difference system approximating the Liouville equation that is invariant under the maximal finite subalgebra $ SL_x \lf 2 , \mathbb{R} \rg \otimes SL_y \lf 2 , \mathbb{R} \rg $. The invariant scheme is an explicit one and provides a much better approximation of exact solutions than comparable standard (non invariant) schemes.

SINov 10, 2017
Conformally invariant elliptic Liouville equation and its symmetry preserving discretization

Decio Levi, Luigi Martina, Pavel Winternitz

The symmetry algebra of the real elliptic Liouville equation is an infinite-dimensional loop algebra with the simple Lie algebra $o(3,1)$ as its maximal finite-dimensional subalgebra. The entire algebra generates the conformal group of the Euclidean plane $E_2$. This infinite-dimensional algebra distinguishes the elliptic Liouville equation from the hyperbolic one with its symmetry algebra that is the direct sum of two Virasoro algebras. Following a discretisation procedure developed earlier, we present a difference scheme that is invariant under the group $O(3,1)$ and has the elliptic Liouville equation in polar coordinates as its continuous limit. The lattice is a solution of an equation invariant under $O(3,1)$ and is itself invariant under a subgroup of $O(3,1)$, namely the $O(2)$ rotations of the Euclidean plane.

MATH-PHApr 26, 2016
On the construction of partial difference schemes II: discrete variables and Schwarzian lattices

Decio Levi, Miguel A. Rodriguez

In the process of constructing invariant difference schemes which approximate partial differential equations we write down a procedure for discretizing an arbitrary partial differential equation on an arbitrary lattice. An open problem is the meaning of a lattice which does not satisfy the Clairaut--Schwarz--Young theorem. To analyze it we apply the procedure on a simple example, the potential Burgers equation with two different lattices, an orthogonal lattice which is invariant under the symmetries of the equation and satisfies the commutativity of the partial difference operators and an exponential lattice which is not invariant and does not satisfy the Clairaut--Schwarz--Young theorem. A discussion on the numerical results is also presented showing the different behavior of both schemes for two different exact solutions and their numerical approximations.