Low-complexity approximations with least-squares formulation of the time-dependent Schr{ö}dinger equation

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Dupuy, Mi-Song, Ehrlacher, Virginie, Guillot, Clément
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911157733818368
author Dupuy, Mi-Song
Ehrlacher, Virginie
Guillot, Clément
author_facet Dupuy, Mi-Song
Ehrlacher, Virginie
Guillot, Clément
contents We propose new methods designed to numerically approximate the solution to the time dependent Schr{ö}dinger equation, based on two types of ansatz: tensors, and approximation by a linear combination of gaussian wave packets. In both cases, the method can be seen as a restricted optimization problem, which can be solved by adapting either the Alternating Least Square algorithm in the tensor case, or some greedy algorithm in the gaussian wavepacket case. We also discuss the efficiency of both approaches.
format Preprint
id arxiv_https___arxiv_org_abs_2509_13005
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Low-complexity approximations with least-squares formulation of the time-dependent Schr{ö}dinger equation
Dupuy, Mi-Song
Ehrlacher, Virginie
Guillot, Clément
Analysis of PDEs
We propose new methods designed to numerically approximate the solution to the time dependent Schr{ö}dinger equation, based on two types of ansatz: tensors, and approximation by a linear combination of gaussian wave packets. In both cases, the method can be seen as a restricted optimization problem, which can be solved by adapting either the Alternating Least Square algorithm in the tensor case, or some greedy algorithm in the gaussian wavepacket case. We also discuss the efficiency of both approaches.
title Low-complexity approximations with least-squares formulation of the time-dependent Schr{ö}dinger equation
topic Analysis of PDEs
url https://arxiv.org/abs/2509.13005