Skip to content

Nonnegative Low-Rank Matrix Correction under an Orthogonality Constraint in Conservative Vlasov Simulations

Jul 2026 · arXiv.org · Vol abs/2607.26272 · 0 citations · 36 references
Mathematics Computer Science

Abstract

In low-rank numerical methods for Vlasov dynamics, the SVD-type truncation procedure may introduce negative entries into the numerical solution. Such negative values are unphysical because the solution is a probability distribution function. We design optimization-based post-processing algorithms to recover nonnegativity while preserving the macroscopic quantities (density, momentum, and energy) pointwise. The preservation of the macroscopic quantities is written as an orthogonality constraint on the correction term. For a convex formulation based on squared nuclear norm minimization, we show that the proximal operator with the orthogonality constraint is characterized by an implicit singular value thresholding equation, and the threshold can be computed efficiently by bisection. Based on this result, we develop five algorithms for the convex formulation: Douglas--Rachford splitting, restarted dual FISTA, restarted dual accelerated gradient descent, dual PR+ conjugate gradient, and dual L-BFGS. We also consider a non-convex formulation with an explicit rank constraint and develop a tangent-space accelerated alternating projection algorithm that only requires a \(2r \times 2r\) SVD per iteration. Numerical results for a Landau damping test case show that the proposed algorithms give comparable correction quality. Among them, the tangent-space accelerated alternating projection is the most cost-efficient, increasingly so as the problem size grows. We further demonstrate the correction as a positivity limiter inside a time-dependent conservative low-rank Vlasov solver, where it removes the negativity introduced by the SVD-type truncation while preserving the conserved mass, momentum, and energy.

View source

Similar papers

Global convergence of a coderivative-based regularized Newton method with damping for nonsmooth optimization

A globally convergent regularized Newton method with positive definite regularization for solving nonsmooth optimization problems that replaces the identity matrix in traditional algorithms with a general positive-definite symmetric matrix to regularize the generalized Hessian.

Wei Ouyang, Zhenghong Tan, JiangxingZhu · 0 citations
Preprint Sep 2026

Preconditioned Three-Term Conjugate Gradient Framework for Nonconvex Finite Minimax Problems

A hyperbolic-majorization preconditioned three-term nonlinear conjugate-gradient framework for nonconvex finite minimax optimization that yields a Dai--Liao-type conjugacy relation, enhanced sufficient descent, a smoothing-parameter-uniform Armijo lower bound, fixed-smoothing global first-order convergence and complexi...

Wen-Zhe Zhao · 0 citations
Preprint Aug 2026

A Globally Convergent Algorithm for Total Scaled-Gradient Variation via Cone-Constrained Bilinear Decomposition

The proposed reformulation of the total scaled-gradient variation regularizer achieves PSNR and SSIM competitive with or superior to representative variational methods, especially at high noise levels, and improves the structural reconstruction under dense and sparse scanning.

Hai-Bin Su, Chunlin Wu, Huibin Chang et al. · 0 citations
Preprint Sep 2026

The Projected Hessian Quantification Theorem: Exact Duality For Constrained Eigenvalues

The classical Projected Hessian Lemma, originating from Finsler's theorem, characterizes definiteness over a constraint null space through quadratic penalties. However, it does not quantify the corresponding constrained eigenvalues or the associated eigenvalue penalty path. This work develops a quantitative penalty the...

Mei-Ling Wang, Yong Xia · 0 citations
Preprint Sep 2026

PDNQP: A GPU-based Factorization-free Method for Large-scale Nonconvex Quadratic Programming

PDNQP is presented, a factorization-free first-order solver for finding stationary points of large-scale nonconvex quadratic programs and its key ingredients are a residual-form reformulation that avoids penalty-dependent normal matrices and preserves a fixed sparse constraint operator across outer iterations, and an a...

Zi-Xi Chen, Hai-Hao Lu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.