WorksMathematics
Dynamical low-rank methods for the Wigner equation I: separable difference potential
Abstract
Recent advances in dynamical low-rank approximation (DLRA) have demonstrated its effectiveness in high-dimensional simulations. However, existing DLRA algorithms still face significant challenges when handling systems that involve complex collision terms, including the pseudo-differential operator () in the Wigner equation, a representative operator characterized by nonlocality. It is deserving to carry out a series of works to develop the DLRA algorithms for solving the Wigner equation. As the first step in this series of works, we propose an efficient DLRA algorithm for the Wigner equation, using a separable decomposition of the difference potential. We combine this separable assumption with two often-used truncations of , namely -truncation and -truncation, to obtain a kind of separated representation of . Complexity analysis and several challenging experiments, including harmonic oscillators, Gaussian barrier scattering, electron-electron scattering, and a Helium-like system, all of which satisfy the separable assumption, confirm that the proposed DLRA algorithm has significant advantages, achieving a reduction in computational effort by one to two orders of magnitude in both runtime and memory requirements compared to the full-grid approach. It is worth noting that, even in the absence of a predetermined low-rank structure for the solution, DLRA can still serve as a numerical scheme that balances efficiency and accuracy.
Funding. This research was supported by the National Natural Science Foundation of China (Nos. 12325112, 12288101) and the High-performance Computing Platform of Peking University.
Introduction
Since its introduction in 1932 [44], the Wigner equation provides a convenient way to characterize fundamental phase-space formulation of quantum mechanics, analogous to the Boltzmann equation in classical kinetic theory. Although the Wigner function may exhibit negative values, this quasi-distribution function remains an important way to understand and forecast quantum phenomena in many fields, such as nanoelectronics [43, 20], high energy density physics [21], quantum optics [38], quantum transport [28, 27], etc.
The Wigner equation
The Wigner equation with a time-independent potential considered in this paper is
where is the spatial variable, is the Fourier conjugated wave vector, is the dimension, is the mass, is the reduced Planck constant and the nonlocal pseudodifferential operator (DO) is defined as
Here is central difference of potential function , the Wigner kernel is Fourier transformation of and is the convolution of and . We can obtain another form of DO by changing the order of integration
The DO is the most complex and important component in the Wigner equation, representing the fundamental distinction between the classical Vlasov equation and the Wigner equation. This equation evolves in a -dimensional phase space, thus confronting the severe challenge of the curse of dimensionality (CoD) along with the nonlocality.
Despite the long history and broad application of the Wigner equation, its numerical solution continues to present significant challenges nowadays. Over the past three decades, significant progress has been made in developing Wigner equation solvers, which can be roughly classified into particle-based stochastic and grid-based deterministic approaches. The particle-based stochastic approaches such as Monte Carlo method [32, 39] and stochastic particle method [42] typically achieve only convergence due to their inherent statistical nature, where is the number of samples. In contrast, the grid-based deterministic approaches exhibit superior convergence rates because of their concise mathematical principle, including the finite difference method [19], operator splitting method [37, 2], spectral element method (SEM) [40, 45, 7, 46], moment method [34], weighted essentially non-oscillatory (WENO) method [13], etc. While CoD confined deterministic methods to low-dimensional problems, rapid advances in high-performance computing, alongside techniques such as tensor approximations that mitigate CoD, have enabled deterministic methods to tackle 5D and 6D problems. The dynamical low-rank approximation (DLRA) method we consider next serves as one such approach for mitigating CoD.
DLRA: the projector-splitting integrator
Emerging from the Dirac-Frenkel time-dependent variational principle [12], the DLRA method [30] has evolved into a powerful class of numerical integrators. This method has been widely used in kinetic theory, including the Vlasov equation [18, 17], Boltzmann equation [16, 24] and radiation transfer equation [36, 15]. The main idea is to constrain the unknown function to a low-rank manifold, then deriving evolution equations of basis functions through tangent space projection. This approach reduces the original -dimensional problem to several -dimensional subproblems, effectively alleviating CoD in traditional grid-based methods.
The DLRA method begins by assuming that the Wigner function admits a separable low-rank representation of the following form
where is the rank, the coefficient matrix is invertible, the basis function and are orthonormal
with and being the standard inner products on and , respectively, and denotes the Kronecker delta. Therefore, for fixed time , the Wigner function lies in the fixed rank- manifold
Then project in (1.1) onto the tangent space of , yielding the reduced system
where the projection operator acting on a generic function can be written as [30]
Here, and denote the vector spaces spanned by the basis functions and ,
and are the orthogonal projectors onto and , respectively,
To avoid the possible ill-conditioning of the coefficient matrix [30, 29], the projector-splitting integrator [35] substitutes (1.11) into the reduced Wigner system (1.10) and decomposes (1.10) into three subproblems:
The decomposition of the projection operator forms the basis of projector-splitting integrator. Exploiting orthogonality conditions, we can further simplify each subproblems and proceed in the following three substeps, respectively: Z-step. We can represent the low-rank assumption for in (1.7) as with , then rewrite Eq. (14) as
Making an important observation that are independent of time (see [35 Lemma 3.1]) in this substep, and using orthogonality conditions , we derive the following differential equation for as
S-step. We can argue similarly to obtain that Eq. (15) is equivalent to
During this substep, both and remain unchanged.
L-step. Similarly, we can represent (1.7) as with . By similar arguments, Eq. (16) is equivalent to
During this substep, remains unchanged.
This projector-splitting integrator has been shown to be robust to small singular values of and own first order rate [29]. For more details, we refer the reader to [18] which provides similar approach for the Vlasov-Poisson equation.
The main challenge
While (1.14)–(1.16) appear to offer a framework for applying DLRA, the efficiency relies on the separability of the right-hand side . The vast majority of problems solved using DLRA possess separability in their right-hand side terms, such as the Vlasov equation [18, 17] and the radiative transfer equation [36, 15]. Some studies utilize the steady-state properties to simplify the problem, for instance, the Maxwellian distribution is employed to reduce complexity when solving the Boltzmann-BGK equation [16]. However, this approach is not well suited for solving non-steady-state problems.
The so-called separability here refers to the fact that, under the low-rank assumption (1.7) satisfied by , can also be naturally expressed in a form that separates the variables and . Separability allows the projection to be computed directly via the low-rank components , , , without the full tensor . For example, the advection term possesses separability, since
and then the projection onto the becomes
where and dependent terms can be computed separately. In contrast, the intrinsic nonlocality of DO introduces strong coupling between the variables and , preventing it from possessing the separability. Consequently, evaluating its projection would typically necessitate reconstructing the full tensor, which undermines the efficiency aims of the low-rank approach. This strong coupling within DO represents the main difficulty to applying DLRA to the Wigner equation.
Organization
The rest of this paper is organized as follows. Section 2 introduces a separable assumption for the difference potential as shown in (22). By introducing this separable assumption, DO can be transformed into a separated form through -truncation and -truncation. The strong coupling between and in DO can be transferred to the separation rank . Regarding the applicability of this assumption, it effectively covers scenarios where the potential is real analytic, including typical potentials such as the harmonic oscillator, Gaussian barrier, and soft Coulomb discussed in subsequent numerical examples.
In Section 3, we derive the evolution equations for basis functions from the Wigner equation, detail their numerical implementation and analyze the overall complexity of the algorithm. In Section 4, we validate the efficiency of our algorithm through a series of typical numerical examples. We first choose several non-stationary and atypical low-rank numerical experiments such as harmonic oscillator and Gaussian barrier scattering. Our numerical experiments indicate that the DLRA method can still yield numerical solutions of sufficient accuracy, even when the solution lacks an obvious low-rank structure. We further validate the method through more complex numerical examples, including electron-electron scattering and Helium-like systems, successfully capturing fundamental quantum phenomena such as the Pauli exclusion principle and the Heisenberg uncertainty principle [22]. The numerical results confirm that the proposed algorithm can achieve a reduction in computational effort by one to two orders of magnitude in both runtime and memory requirements compared to the full-grid approach. These results clearly demonstrate the broad applicability and promising potential of the DLRA method in quantum dynamical simulations. Section 5 makes a summary and discusses future research directions.
Separable assumption
The intrinsic nonlocality of DO in (2) places the first obstacle for any numerical solver and some kinds of truncation have been introduced in the literature. If the potential admits a Taylor expansion in -space, then the difference potential can be written as
Substituting (20) into (3) and using the basic properties of Fourier transform yields directly the so-called Moyal expansion of DO
where is the momentum. In particular, the first term in the summation on the right-hand side is , indicating that the Wigner equation reduces to the classical Vlasov equation when tends to zero. In the early stage, one has to truncate the infinite series summation (21) to a finite number of terms [25, 26]. Obviously, the resulting scheme possesses certain separability and the primary reason is that in Eq. (2.1) for the difference potential , the variables and are separated. Based on this observation, we introduce the separable assumption for the difference potential
where denotes the separation rank, and are functions that depend only on , respectively.
Nowadays, the following two kinds of truncation, named after the truncation of the outermost infinite integral in DO, are often used [7, 8, 9, 45]:
-truncation: starting from (1.5) and (1.6), computations are performed via the intermediate variable ;
-truncation: starting from (1.2) and (1.3), computations are performed via the intermediate variable ;
After applying the separable difference potential assumption (2.3), we have a separated approximation for DO
and the resulting are listed in Table 1.
At the continuous level, two approaches yield identical results and no truncation is required. At the discrete level, two approaches require truncation of the infinite integral and exhibit almost no difference in results. However, their applicable situations differ. The -truncation requires the low-rank components to have a Fourier transform. This is typically guaranteed by the rapid decay of in the -space, which is in turn induced by the rapid decay of the function in the -space. In contrast, the -truncation requires the function to have a Fourier transform, which is not always guaranteed (for example, in the harmonic oscillator).
Dynamical low-rank approximation for the Wigner equation
In this section, we substitute (2.4) into three substep equations (1.17)-(1.19) to derive more precise forms of each part, and design their numerical scheme.
Z-step. Plugging (2.4) into (17) to obtain
Here we define time-independent coefficients
In this -step, the coefficients and are computed first, and equation (25) is then solved until the next time step. Subsequently, a standard QR decomposition is applied to to obtain new orthonormal and updated in the end. This completes the first -step.
S-step. Plugging (2.4) into (18) to obtain
Here we can use time-independent coefficients and defined in (26) and (27) combined with
In the -step, since the basis functions remain unchanged during both the -step and -step, the precomputed values of and from the previous -step can be used directly. The newly introduced coefficients and should be computed first, the -step equation (28) can then be solved to obtain the updated . This completes the second -step.
L-step. Plugging (2.4) into (19) to obtain
with coefficients and have defined in (3.5) and (3.6). Since the basis functions remain unchanged during -step, the precomputed values of and from the previous -step can be used directly to solve (31). Then apply standard QR decomposition to to get new orthonormal and updated in the end. This completes the last -step.
Remark 3.1. Coefficient matrices and are symmetric by construction, which ensures hyperbolicity of whole system.
A detailed account of first order accurate DLRA for the Wigner equation is given in Algorithm 3.1. The solutions corresponding to the -step, the -step and the -step are combined by a first order Lie splitting scheme in order to recover . The sequence of these three steps is not unique [35], but we only consider the sequence of in this work.
Algorithm 3.1 A first-order accurate dynamical low-rank algorithm for the Wigner equation
Input: , , , , such that with time step .
Output: , , such that .
Compute using and .
Compute using , , and according to Table 1.
Compute and using and .
Solve (3.1) with initial value until time to obtain .
Perform a QR decomposition of to obtain and .
Compute and using .
Solve (3.4) with initial value until time to obtain .
Compute using and .
Solve (3.7) with initial value until time to obtain .
Perform a QR decomposition of to obtain and .
We have restricted our analysis to first-order Lie splitting. In principle, extending the method to second-order Strang splitting is straightforward; further implementation details can be found in [18, 4]. Although both first-order Lie splitting and second-order Strang splitting have been observed to achieve their respective convergence orders in practice, existing theoretical analyses can only guarantee first-order accuracy [29]. This limitation arises because the projection operator lacks Lipschitz continuity [30]. To date, this phenomenon remains not fully understood theoretically [5]. The numerical results presented in this work indicate that, even when employing a first-order Lie splitting method, second-order accuracy can still be attained provided that each splitting substep itself achieves second-order accuracy. This numerical observation warrants further theoretical investigation in future work.
Discretization
For the purpose of numerical solution, we first truncate the computational domain to a bounded rectangular region , then we consider the uniform grid mesh in -space and -space, -space using grid points in every coordinate direction with the spacing and -space using grid points in every coordinate direction with the spacing . For the dual -space, we choose grid points in every coordinate direction with the spacing .
Once the grid discretization is determined, for a fixed time , we can obtain to be the matrix composed of row vectors collected from on the chosen spatial grid. It’s obvious that the resulting matrix entries depend on both the discretization performed and the ordering of the grid points. Similarly, can be defined in the same way. Then, the low-rank approximation of the Wigner function can be reconstructed at any time from the low-rank factors via the computation
However, due to its prohibitive cost, this reconstruction is unnecessary for our algorithm. We only employ it in combination with Singular Value Decomposition (SVD) [14] to obtain the initial values of the low-rank factors and to reconstruct the solution at selected critical time points. Similarly, the separable assumption (2.3) for the difference potential can be computed via SVD, and this computation is required only once during the initialization stage. In each time step, since a uniform grid is employed, can be efficiently computed via the standard Fast Fourier transform (FFT). It is also worth noting that the Poisson summation formula is often used in conjunction with truncation [7, 8, 9, 45], however, it is not required in the implementation of our DLRA algorithm.
Numerical scheme
In this subsection, we provide a detailed description of the procedure for solving (3.1), (3.4), and (3.7).
We first consider the -step (3.4). It is an ordinary differential equation and there is no source of stiffness in it. Hence, we perform its time integration by classical explicit fourth order Runge-Kutta scheme RK4.
Next, let us consider the -step (3.1) and use the vector notation , we can rewrite the evolution equation for the -step (3.1) in matrix formulation as follows:
For simplicity, we only consider the two-dimensional case here. By further splitting the -step, we obtain the following two subflows:
As we mentioned before, the coefficients matrix and are symmetric, thus equations (3.10) and (3.11) are hyperbolic. It is evident that (3.10) can be solved in time by the method of characteristics, while (3.11) can be efficiently solved via an exponential integrator (see [23] for more details).
Finally, we consider the -step (3.7). Extending the vector notation similar to to , , , , , and , we can obtain
Unlike the -step, the hyperbolicity is maintained by the coefficient matrix , hence it is necessary to examine the relationship between and and to exploit this connection in solving the -step equation.
For example, for -truncation, using the relationship provided in Table 1, apply the Fourier transform in -direction to (3.12) and define
| Truncation | |
Table 1. The resulting corresponding to truncation methods.
then the -step (3.12) turns to
Therefore, we proceed to solve equation (3.15) involving the variable , where can be regarded as a function of . When is approximately the same size as the dimension , similar to the situation in the Z-step, we can likewise exploit the symmetry of the coefficient matrix and combine a splitting method with an exponential integrator to solve the corresponding equations. Conversely, when is relatively large, the Runge–Kutta method is more suitable for (3.15). Similarly, for -truncation, utilizing the convolution property of Fourier transform and the notation in (3.13) and (3.14), we can obtain the evolution equation for as same as (3.15).
Complexity analysis
Then we considered the time complexity of the proposed Algorithm 3.1. Here, we consider the case of .
We first consider the computational complexity required for calculating . The additional storage requirements are all of order and the required time complexity is . Then consider the other steps in Algorithm 3.1, the storage cost and time complexity for computing the coefficients and solving the equations is shown in Table 2. For completeness, the time complexity of both QR decomposition and matrix multiplication can be summarized as . In summary, compared to the full-grid method, which exhibits a time and space complexity of , our DLRA method offers significant advantages.
| Steps | Storage cost | Time complexity |
| Z-step | ||
| S-step | — | |
| L-step |
Table 2. Complexity analysis of the main steps in the Algorithm 3.1.
Remark 3.2. Due to the convolution involved, -truncation requires zero-padding of factor 2 to avoid aliasing errors; however, its complexity does not differ from that of the -truncation.
Numerical experiments
In this section, we evaluate the accuracy and efficiency of the proposed DLRA method. As we mentioned in Section 2, we adopt the -truncation in the subsequent numerical experiments.
We assess the accuracy of our algorithm using a series of typical benchmark tests for the Wigner equation, including the quantum harmonic oscillator and Gaussian barrier scattering. These test cases are characterized by non-stationary and non-low-rank features, which are significant for extending the applicability of the DLRA method. Once numerical accuracy has been verified, we can investigate typical quantum systems such as the electron-electron scattering and Helium-like system, and reveal fundamental quantum effects such as the Pauli exclusion principle and the Heisenberg uncertainty principle.
The numerical performance is evaluated using the error and the error , defined as follows:
where and denote the reference and DLRA numerical solution, respectively. For 4D problem, we adopt the reduced Wigner function onto the 2D phase-space plane ,
or reduced one-body Wigner function [3]
In practice, the low-rank assumption of in (1.7) yields
so that can be obtained directly from the low-rank components , and without first recovering the full-grid numerical solution .
Quantum harmonic oscillator
In this subsection, we consider 2D quantum harmonic oscillator with . The exact solution can be obtained as , where are the characteristic lines given by
For simplicity, we still choose parameters , equip with an initial standard Gaussian wave packet (GWP)
where is the center of GWP and is the initial wave number. Then reference solution can be written as
which means that reference solution has a period of , thus we choose final time . The computational domain is with . Since we mainly focus on the convergence with respect to time step and rank , several groups of simulations under and are performed.
First, we examine the rank of the reference solution. Once the spatial discretization is fixed, the reference solution can be treated as a matrix, and its effective rank can be estimated via SVD. The norm of the error between the reference solution matrix and its best rank- approximation for is shown in Figure 1(a), which is equal to -th singular value of the error matrix. Therefore, we observe that the singular values of the solution decay in the range of machine accuracy without a distinct gap, except 4 specific times in one period, which the exact rank equal to 1. Note that the solution from our DLRA algorithm can not be more accurate than the best rank approximation obtained via SVD. Hence, this numerical test either does not exhibit a genuinely low-rank structure, or its effective rank is relatively high, a behavior that differs from typical DLRA numerical experiments.
Figure 1. (a) for best rank- approximation. (b) Convergence with respect to . (c) under and different . (d) under and different . (e) under and different . (f) under and different . Fig. 1. 2D quantum harmonic oscillator.
Second, we examine the convergence with respect to the rank . We fix time discretization parameters and variate the rank , the resulting numerical error and are shown in the Figure 1(c) and Figure 1(d), respectively. It can be observed that and behave roughly similarly. When increases from 5 to 15, the numerical error decreases significantly. However, as grows further from 15 to 30, the reduction slows down or even stops, this is because the error at this time is mainly controlled by time step .
Last, we investigate the convergence with respect to the time step . Error indicators and for a fixed rank and different time discretization are shown in the Figure 1(e) and Figure 1(f). We observe that the performances of and are basically the same, they show a clear convergence trend as we increase the time partition parameters and the convergence rate is plotted in Figure 1(b). However, Figure 1(b) reveals two distinct convergence orders. The difference stems from the numerical schemes employed for the -step (3.9) and -step (3.12): when these steps are solved with a second-order Runge–Kutta (2nd-RK) or a second-order Lawson (2nd-Lawson) method, the numerical error shows second-order convergence; when a first-order Lawson (1st-Lawson) method is used, only first-order convergence is obtained. This indicates that the projector-splitting error actually exhibits a numerical accuracy no lower than second order, even though a first-order projector-splitting algorithm is employed in this setting.
Gaussian barrier scattering
To further validate the overall performance of the DLRA for Wigner equation, we simulate the Gaussian barrier scattering [40, 41, 45] of the GWP to investigate its convergence rate. In this numerical experiment, a Gaussian potential barrier is introduced into the spatial domain, given by
where is the height of the potential barrier, is the center of the computational domain and is the dispersion of the potential barrier. We adopt the computational domain with spacing . The initial Wigner function is chosen to be the GWP (4.7) with , and . And the other parameters are: the reduced Planck constant , the effective mass , the stationary electron mass and the final time .
A quantitative observation is conducted in Figure 2. In this numerical example, the grid parameters are set as , and is estimated via SVD. For reference solution, the same spatial grid subdivision parameters $N_x,N_k,N_y and the fixed time step are adopted as before. Figure 2(a) displays the error between the reference SEM solution and its best rank- approximation for . From this we can observe that the rank of
Figure 2. (a) for best rank- approximation. (b) Convergence with respect to . (c) under and different . (d) under and different . 2D Gaussian barrier scattering.
this numerical test grows very rapidly over time, and relative to the grid size, the problem can be considered non-low-rank. For DLRA solution, we mainly focus on the convergence with respect to time step and rank , several groups of under and are performed. Figure 2(c) gives the relationship between error and rank under the same time step . When the rank , the error decreases noticeably as increase. However, the reduction of becomes much less pronounced or even ceases for . This behavior occurs because the error is now dominated by the time step size . We also examine the influence of the time step on the error, then Figure 2(d) shows the dependence of the error on for a fixed rank . We observe that errors accumulate progressively over time, and as the time step is reduced, decreases substantially while exhibiting a clear order of convergence. The behavior of the other error indicator is similar to . Moreover, the convergence rate with respect to presented in Figure 2(b), clearly exhibits second-order convergence as well.
Such Gaussian barrier scattering can be extended to the 4D situation easily. The Wigner equation with 2D potential has the form
where is 2D Wigner function corresponding to the 1D potential for . For instance, we adopt computational domain with spacing . The potential function is chosen as
where , and . The initial Wigner function is set as degenerate function
where , , , and . In this case, the Wigner function is degenerate in -direction and -direction, and the reduced Wigner function is the same as that of the previous numerical test. The remaining parameters are the same as the previous 2D case. To study the convergence rate with respect to time step , we fix and is estimated by random SVD. The order of convergence is presented in Figure 3(a), we can clearly observe the second-order convergence order as well.
Figure 3. Gaussian barrier scattering: The convergence order with respect to the time step . The left figure shows the convergence order for the case with degeneracy in the - direction, while the right figure displays the convergence order for the free advection in the - direction. In both cases, second-order numerical accuracy can be observed.
Similarly, if we choose the same potential function in (50) with initial Wigner function as
where , and are in the same way as before, , and . In this case, the reduced Wigner function is the same as that of the previous numerical test and evolves as the free convection of an initial GWP over time. The remaining parameters are the same as the previous case except the rank is chosen as , which is much larger than the previous. The convergence order, shown in Figure 3(b), also clearly exhibits second-order accuracy.
Electron-electron scattering
Now we turn to discuss a more challenging problem. Consider that two electrons interacting through the repulsive Coulomb force, the potential function is given by the soft Coulomb potential
where is the soft parameter. The initial value of the Wigner function to simulate two electronic states is chosen as a Fermion system
In the following computations, the Fermion system is taken as the initial condition, with the parameters set as , as illustrated in Figure 4(a).

Figure 4. The reduced Wigner function for two fermions and the convergence order.
The first run is to demonstrate the numerical convergence of the proposed DLRA method by setting computational domain with spacings . The number of grid points in each spatial direction is set to , and in each momentum direction to with final time . The rank is chosen sufficiently large to reveal the convergence order with respect to the time step , while is estimated by random SVD. The reference solution is computed using advective-spectral-mixed (ASM) scheme [45] with the same parameters listed above. Figure 4(b) presents the results, clearly showing that our DLRA algorithm achieves second-order convergence. However, choosing an excessively large rank leads to high computational cost, especially in the -step, which contradicts the original purpose of adopting a low-rank approach. In this nu-
merical test, a rank of is sufficient to produce an approximate solution that is visually indistinguishable from the reference.
Then, Figure 5 shows the evolution of the reduced Wigner function under the same parameters listed above, up to final time . The reduced Wigner function of the two electrons moving towards each other and decelerate before is suppressed in the region and has greater expansion in the -space due to Coulomb potential. Since then, two electrons tend to scattered and separated from each other due to repulsive interaction, which is line with our expectations. Moreover, it should be emphasized that at , a hole structure known as the Fermi hole, appears at the center between the two electrons as a direct manifestation of the Pauli exclusion principle. Furthermore, this Fermi hole persists throughout the evolution due to the strong correlation between the electrons.

Figure 5. Electron-electron scattering: at different time.
Finally, we employ this example to illustrate the advantages of the DLRA method in handling such high-dimensional problems. Table 3 compares the theoretical memory requirement and the running time per step for this problem under different ranks , using the same parameters as above, for both the reference ASM scheme and our DLRA method. It can be observed that the DLRA method outperforms the reference full-grid method in both theoretical memory requirement and computational time. For example, with being sufficient for this problem, the memory required by the DLRA algorithm is two orders of magnitude smaller, and the running time is one order of magnitude faster.
| Full grids (ASM) | |||||
| Theoretical memory requirement (GB) | 23.45 | 0.04 | 0.07 | 0.10 | 0.13 |
| Running time per step (s) | 75.76 | 2.58 | 5.34 | 8.35 | 11.34 |
Table 3. Comparison of computational cost for electron–electron scattering simulations: full-grid (ASM) vs. DLRA with different ranks .
A Helium-like system
As the final example, we consider a Helium-like system composed of two electrons. Besides the repulsive Coulomb force, they are both attracted by a Helium atom at . To describe the nucleon-electron interaction, we adopt the attractive soft-Coulomb potential [33]
with the atomic number and the soft parameter . The initial value is taken to be the same Fermion system as in the previous case, using the identical parameter set, shown in Figure 4(a). And the other parameters are: the computational domain with spacings , the number of grid points in each spatial direction is set to , and in each momentum direction to , with is estimated by random SVD, while is chosen sufficiently large.
The first run is carried out to demonstrate the numerical convergence of the proposed DLRA method. Figure 6 presents the results, clearly showing that our DLRA method achieves second-order convergence at time . Similarly, in this test case, a sufficiently large rank is required to reliably measure the convergence order; rank is sufficient to compute an approximate solution that captures the relevant physical properties.
Figure 6. The reduced Wigner function for two fermions and the convergence order.
To demonstrate the dynamics of electrons more clearly, we take snapshots of the reduced Wigner function from to , as shown Figure 7. At early times (), the reduced Wigner function remains localized in the central region because of the nucleon–electron interaction. Afterwards, both dispersion and correlation become clearly visible, producing a highly oscillatory structure in phase space. The region over which the reduced Wigner function evolves expands progressively with time, reaching the preset computational domain boundary by . It is worth noting that a region capable of taking negative values, referred to as the Fermi hole, persists around the centers of both wave packets. This is a direct consequence of the electron–electron interaction, since negative distributions are associated with areas inaccessible to experimental observation due to the constraints imposed by the uncertainty principle. The branching behavior of the Fermi hole varies at different times: for example, it exhibits two branches at , while only one branch is visible at . Nevertheless, it persists throughout, which agrees with the results from the ASM method [45] but differs from those obtained by the signed Monte Carlo method [39]. This discrepancy may stem from the limited accuracy of the signed Monte Carlo method, which is insufficient to precisely capture quantum properties such as quantum interference. This aspect warrants further investigation in the future.
Figure 7. The Helium-like system: at different times.
Conclusion and discussion
This work presents the first application of DLRA to the Wigner equation. Our key innovation lies in introducing separable assumption (2.3) and combine it with two established approaches for DO to transform DO into a separated form (2.4). Comprehensive numerical tests on challenging non-stationary systems demonstrate both the accuracy and efficiency of our approach. Even in the absence of a predetermined low-rank structure for the solution, DLRA can still serve as a numerical scheme that balances efficiency and accuracy. These findings open new possibilities for simulating high-dimensional quantum systems.
While the current framework demonstrates promising results, several advanced strategies could further enhance the algorithm’s performance. First, the second-order robust BUG integrator [5] provides stable second-order accuracy and enables feasible adaptive rank control. Second, changing the way of low-rank such as dynamical tensor approximation [31] and hierarchical low-rank approximation [1] may help reduce the required rank. Third, emerging approximate interpolation techniques [6, 10, 11] could be adopted to accelerate the computation. Finally, beyond the extension in computational efficiency, we will consider more complex potentials in subsequent work, including singular potentials, discontinuous potentials, and even pure Coulomb potentials. These directions will be explored in our future research.
References
- [1]F. Allmann-Rahn, R. Grauer, and K. Kormann, A parallel low-rank solver for the six-dimensional Vlasov-Maxwell equations, Journal of Computational Physics, 469 (2022), p. 111562.
- [2]A. Arnold and C. Ringhofer, Operator splitting methods applied to spectral discretizations of quantum transport equations, SIAM Journal on Numerical Analysis, 32 (1995), pp. 1876–1894.DOI
- [3]E. Cancellieri, P. Bordone, and C. Jacoboni, Effect of symmetry in the many-particle Wigner function, Physical Review B, 76 (2007), p. 214301.DOI
- [4]F. Cassini and L. Einkemmer, Efficient 6D Vlasov simulation using the dynamical low-rank framework, Computer Physics Communications, 280 (2022), p. 108489.DOI
- [5]G. Ceruti, L. Einkemmer, J. Kusch, and C. Lubich, A robust second-order low-rank BUG integrator based on the midpoint rule, BIT Numerical Mathematics, 64 (2024), p. 30.arxiv.org/abs/2402.08607
- [6]S. Chaturantabut and D. C. Sorensen, Nonlinear model reduction via discrete empirical interpolation, SIAM Journal on Scientific Computing, 32 (2010), pp. 2737–2764.DOI
- [7]Z. Chen, H. Jiang, and S. Shao, A higher-order accurate operator splitting spectral method for the Wigner–Poisson system, Journal of Computational Electronics, 21 (2022), pp. 756–770.
- [8]Z. Chen, S. Shao, and W. Cai, A high order efficient numerical method for 4-D Wigner equation of quantum double-slit interferences, Journal of Computational Physics, 396 (2019), pp. 54–71.DOI
- [9]Z. Chen, Y. Xiong, and S. Shao, Numerical methods for the Wigner equation with unbounded potential, Journal of Scientific Computing, 79 (2019), pp. 345–368.DOI
- [10]A. Christlieb, S. Gong, J.-M. Qiu, and N. Zheng, A sampling-based adaptive rank approach to the Wigner-Poisson system, June 2025, https://arxiv.org/abs/2506.21314.
- [11]A. Dektor and L. Einkemmer, Interpolatory dynamical rank approximation for the 3+3d Boltzmann–BGK equation, Journal of Computational Physics, (2025), p. 114515.arxiv.org/abs/2411.15990
- [12]P. A. M. Dirac, Note on exchange phenomena in the Thomas atom, in Mathematical Proceedings of the Cambridge Philosophical Society, vol. 26, Cambridge University Press, 1930, pp. 376–385.DOI
- [13]A. Dorda and F. Schürrer, A WENO-solver combined with adaptive momentum discretization for the Wigner transport equation and its application to resonant tunneling diodes, Journal of Computational Physics, 284 (2015), pp. 95–116.pubmed.ncbi.nlm.nih.gov/25892748
- [14]C. Eckart and G. Young, The approximation of one matrix by another of lower rank, Psychometrika, 1 (1936), pp. 211–218.DOI
- [15]L. Einkemmer, J. Hu, and Y. Wang, An asymptotic-preserving dynamical low-rank method for the multi-scale multi-dimensional linear transport equation, Journal of Computational Physics, 439 (2021), p. 110353.DOI
- [16]L. Einkemmer, J. Hu, and L. Ying, An efficient dynamical low-rank algorithm for the Boltzmann-BGK equation close to the compressible viscous flow regime, SIAM Journal on Scientific Computing, 43 (2021), pp. B1057–B1080.arxiv.org/abs/2101.07104
- [17]L. Einkemmer and I. Joseph, A mass, momentum, and energy conservative dynamical low-rank scheme for the Vlasov equation, Journal of Computational Physics, 443 (2021), p. 110495.DOI
- [18]L. Einkemmer and C. Lubich, A low-rank projector-splitting integrator for the Vlasov–Poisson equation, SIAM Journal on Scientific Computing, 40 (2018), pp. B1330–B1360.arxiv.org/abs/1801.01103
- [19]W. R. Frensley, Effect of inelastic processes on the self-consistent potential in the resonant-tunneling diode, Solid-State Electronics, 32 (1989), pp. 1235–1239.DOI
- [20]A. Gehring and H. Kosina, Wigner function-based simulation of quantum transport in scaled DG-MOSFETs using a Monte Carlo method, Journal of Computational Electronics, 4 (2005), pp. 67–70.DOI
- [21]F. R. Graziani, J. D. Bauer, and M. S. Murillo, Kinetic theory molecular dynamics and hot dense matter: Theoretical foundations, Physical Review E, 90 (2014), p. 033104.pubmed.ncbi.nlm.nih.gov/25314544
- [22]W. Heisenberg, Über den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik, Zeitschrift für Physik, 43 (1927), pp. 172–198.
- [23]M. Hochbruck and A. Ostermann, Exponential integrators, Acta Numerica, 19 (2010), pp. 209–286.DOI
- [24]J. Hu and Y. Wang, An adaptive dynamical low rank method for the nonlinear Boltzmann equation, Journal of Scientific Computing, 92 (2022), p. 75.arxiv.org/abs/2112.02695
- [25]M. Hug, C. Menke, and W. P. Schleich, Modified spectral method in phase space: Calculation of the Wigner function. I. Fundamentals, Physical Review A, 57 (1998), pp. 3188–3205.
- [26]M. Hug, C. Menke, and W. P. Schleich, Modified spectral method in phase space: Calculation of the Wigner function. II. Generalizations, Physical Review A, 57 (1998), pp. 3206–3224.DOI
- [27]C. Jacoboni and P. Bordone, The Wigner-function approach to non-equilibrium electron transport, Reports on Progress in Physics, 67 (2004), p. 1033.DOI
- [28]C. Jacoboni, R. Brunetti, P. Bordone, and A. Bertoni, Quantum transport and its simulation with the Wigner-function approach, International Journal of High Speed Electronics and Systems, 11 (2001), pp. 387–423.
- [29]E. Kieri, C. Lubich, and H. Walach, Discretized dynamical low-rank approximation in the presence of small singular values, SIAM Journal on Numerical Analysis, 54 (2016), pp. 1020–1038.DOI
- [30]O. Koch and C. Lubich, Dynamical low-rank approximation, SIAM Journal on Matrix Analysis and Applications, 29 (2007), pp. 434–454.DOI
- [31]O. Koch and C. Lubich, Dynamical tensor approximation, SIAM Journal on Matrix Analysis and Applications, 31 (2010), pp. 2360–2375.DOI
- [32]H. Kosina, M. Nedjalkov, and S. Selberherr, A Monte Carlo method seamlessly linking quantum and classical transport calculations, Journal of Computational Electronics, 2 (2003), pp. 147–151.DOI
- [33]M. Lein, T. K. Kreibich, E. K. U. Gross, and V. Engel, Strong-field ionization dynamics of a model H₂ molecule, Physical Review A, 65 (2002), p. 033403.DOI
- [34]R. Li, T. Lu, Y. Wang, and W. Yao, Numerical validation for high order hyperbolic moment system of Wigner equation, Communications in Computational Physics, 15 (2014), pp. 569–595.DOI
- [35]C. Lubich and I. V. Oseledets, A projector-splitting integrator for dynamical low-rank approximation, BIT Numerical Mathematics, 54 (2014), pp. 171–188.arxiv.org/abs/1301.1058
- [36]Z. Peng, R. G. McClarren, and M. F. Frank, A low-rank method for two-dimensional time-dependent radiation transport calculations, Journal of Computational Physics, 421 (2020), p. 109735.DOI
- [37]C. Ringhofer, A spectral method for the numerical simulation of quantum tunneling phenomena, SIAM Journal on Numerical Analysis, 27 (1990), pp. 32–50.DOI
- [38]W. P. Schleich, Quantum Optics in Phase Space, John Wiley & Sons, 2015.
- [39]J. M. Sellier and I. Dimov, On the simulation of indistinguishable fermions in the many-body Wigner formalism, Journal of Computational Physics, 280 (2015), pp. 287–294.DOI
- [40]S. Shao, T. Lu, and W. Cai, Adaptive conservative cell average spectral element methods for transient Wigner equation in quantum transport, Communications in Computational Physics, 9 (2011), pp. 711–739.DOI
- [41]S. Shao and J. M. Sellier, Comparison of deterministic and stochastic methods for time- dependent Wigner simulations, Journal of Computational Physics, 300 (2015), pp. 167–185.
- [42]S. SHAO AND Y. XIONG, A branching random walk method for many-body Wigner quantum dynamics, Numerical Mathematics: Theory, Methods and Applications, 12 (2019), pp. 21–71.DOI
- [43]M. L. VAN DE PUT, B. SORÉE, AND W. MAGNUS, Efficient solution of the Wigner–Liouville equation using a spectral decomposition of the force field, Journal of Computational Physics, 350 (2017), pp. 314–325.DOI
- [44]E. WIGNER, On the quantum correction for thermodynamic equilibrium, Physical Review, 40 (1932), pp. 749–759.
- [45]Y. XIONG, Z. CHEN, AND S. SHAO, An advective-spectral-mixed method for time-dependent many-body Wigner simulations, SIAM Journal on Scientific Computing, 38 (2016), pp. B491–B520.arxiv.org/abs/1602.08853
- [46]Y. XIONG, Y. ZHANG, AND S. SHAO, A characteristic-spectral-mixed scheme for six-dimensional Wigner–Coulomb dynamics, SIAM Journal on Scientific Computing, 45 (2023), pp. B906–B931.arxiv.org/abs/2205.02380




