arXiv (All)
open access
A stable rank-adaptive step-and-truncate finite volume method for Vlasov transport on domains with piecewise linear boundaries
We consider the numerical solution of the linear Vlasov transport equation on bounded spatial domains with inflow boundary conditions based on low-rank approximation. We combine a finite volume discretization with a rank-adaptive step-and-truncate scheme for the resulting matrix ODE. The spatial and
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A stable rank-adaptive step-and-truncate finite volume method for Vlasov transport on domains with piecewise linear boundaries#920623
- Hybrid-Dimensional Biot Problem with an Optimization Based Domain Decomposition Approach#1106011
- Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging#1061762
- An efficient and rigorous criterion for the admissible time step of deforming grids in generalized Lagrangian and ALE methods#1035621
- Transform before linearizing: robust Newton methods for singular $p$-Laplace and $p$-Stokes equations#1000203
Record · ID 924857
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive