Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.20234

A conservative adaptive rank method for the Wigner-Poisson system

Andrew Christlieb·Sining Gong·F. Alejandro Padilla-Gomez·Jing-Mei Qiu
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a conservative adaptive rank method for the 1D1V Wigner-Poisson system. The method targets a central challenge in deterministic quantum kinetic simulations: reducing the cost of phase-space evolution while preserving the macroscopic invariants needed for physical fidelity. The scheme combines a sampling-based adaptive rank Wigner-Poisson update [7] with a conservative macroscopic correction. A conservative density-momentum solve provides local macroscopic updates, a Fermi-Dirac-type reconstruction transfers them to the kinetic solution, and a global quadratic moment correction enforces the discrete total energy constraint at the kinetic level. Unlike Maxwell-Boltzmann-type corrections commonly used in classical kinetic settings, the reconstruction uses a Fermi-Dirac-type form motivated by the model's quantum-statistical structure. The corrected state is incorporated into an ACA SVD representation, allowing the numerical rank to adapt to the phase-space complexity generated by the nonlocal Wigner operator and self-consistent Poisson field. Numerical experiments for the two-stream instability, strong Landau damping, and bump-on tail instability show that the method captures benchmark Wigner-Poisson dynamics for several values of the quantum parameter H, maintains bounded adaptive ranks, and preserves the specified global discrete invariants with conservation errors near machine precision. We also compare this formulation, which uses local density-momentum correction plus global total energy correction, with a related globally conservative formulation for mass, momentum, and energy [8]. The two approaches produce nearly identical phase-space and diagnostic results for the periodic benchmark test considered here, indicating that both correction strategies are compatible with adaptive rank compression for Wigner-Poisson dynamics in the tested 1D1V periodic setting.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrew Christlieb, Sining Gong, F. Alejandro Padilla-Gomez, Jing-Mei Qiu. 2026-06-18. A conservative adaptive rank method for the Wigner-Poisson system. https://arxiv.org/abs/2606.20234

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗