Two Algorithms for Constructing Solvable Quantum $$N\cdot 2^k$$N·2k and $$N\cdot 3^k$$N·3k-Body Models
Sign Up to like & getrecommendations! Published in 2018 at "Few-Body Systems"
DOI: 10.1007/s00601-018-1447-y
Abstract: In this work, we provide two algorithms to construct solvable quantum many-body models of $$N\cdot 2^k$$N·2k and $$N\cdot 3^k$$N·3k particles. Each algorithm will start with a solvable model and generate a series of solvable Hamiltonians… read more here.
Keywords: solvable quantum; two algorithms; body models; cdot cdot ... See more keywords
Two algorithms for periodic extension on uniform grids
Sign Up to like & getrecommendations! Published in 2020 at "Numerical Algorithms"
DOI: 10.1007/s11075-020-00897-7
Abstract: Given function values on a uniform grid in a domain Ω in ℝ d $\mathbb {R}^{d}$ , one is often interested in extending the values to a larger grid on a box B containing Ω.… read more here.
Keywords: extension uniform; uniform grids; periodic extension; two algorithms ... See more keywords