Symbolic and numeric computation of symmetries for a class of Schrödinger Equations

An important and challenging computational problem is to identify and include the missing compatibility (integrability) conditions for general systems of partial differential equations. The inclusion of such missing conditions is executed by the application of differential-elimination algorithms. Di...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings (International Symposium on Symbolic and Numeric Algorithms for Scientific Computing) pp. 68 - 75
Main Authors: Deng, Siyuan, Reid, Gregory
Format: Conference Proceeding
Language:English
Published: IEEE 11.09.2023
Subjects:
algebraic geometry
computer algebra
numerical analysis
partial differential equations
Schrödinger equations
symmetry
ISSN:2470-881X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An important and challenging computational problem is to identify and include the missing compatibility (integrability) conditions for general systems of partial differential equations. The inclusion of such missing conditions is executed by the application of differential-elimination algorithms. Differential equations arising during modeling generally contain both exactly known coefficients and coefficients known approximately from data. We focus on our recent work on approximate differential-elimination methods and in particular their application to the determination of approximate symmetries. We illustrate this with applications to a class of Schrödinger equations.
ISSN:2470-881X
DOI:10.1109/SYNASC61333.2023.00016