학술논문

Symbolic and numeric computation of symmetries for a class of Schrödinger Equations
Document Type
Conference
Source
2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) SYNASC Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2023 25th International Symposium on. :68-75 Sep, 2023
Subject
Computing and Processing
Scientific computing
Partial differential equations
Computational modeling
Approximation algorithms
Mathematical models
Data models
Numerical models
numerical analysis
partial differential equations
symmetry
algebraic geometry
computer algebra
Schrödinger equations
Language
ISSN
2470-881X
Abstract
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.