Searcharxiv⌕ Search

arXiv subjects

Zachary M. Miksis

Publications and source records attributed to Zachary M. Miksis.

2 recordsLinked to original sources

A Convergent Geometry-Aware Reduction for Diffusion in Branched Tubular Networks

Diffusion through tubular networks with variable radius arises in a wide range of biological, engineering, and physical applications. The Fick-Jacobs equation is the standard one-dimensional reduction of this problem, briefly derived nearly a century ago in a classical textbook, but was shown to be unstable and inaccurate when the radial gradient is large by Zwanzig in 1992. Three decades of subsequent modifications have failed to resolve this instability because they all inherit a common structural inconsistency introduced by truncation in the original derivation - one that becomes immediately apparent from novel elementary analysis. In this work, we return to the foundations of the Fick-Jacobs derivation and treat it as a locally defined Taylor expansion, recovering a model with geometry-independent error that contrasts directly with the geometry-dependent instability of past corrections. The result is a new geometry-aware expansion of the Fick-Jacobs model, with a numerical discretization that is provably stable and convergent, and the first method known to the authors to converge spatially to the correct geometry-aware solution. Analysis shows that standard corrections from the literature cannot converge to this solution regardless of spatial refinement. We derive efficient numerical schemes for branched networks at equivalent computational cost, and demonstrate that a geometry-aware one-dimensional reduction can faithfully reproduce full three-dimensional results of a neurobiologically relevant problem that the standard reduction cannot achieve.

math.NA↗

Sparse grid implementation of a fixed-point fast sweeping WENO scheme for Eikonal equations

Fixed-point fast sweeping methods are a class of explicit iterative methods developed in the literature to efficiently solve steady state solutions of hyperbolic partial differential equations (PDEs). As other types of fast sweeping schemes, fixed-point fast sweeping methods use the Gauss-Seidel iterations and alternating sweeping strategy to cover characteristics of hyperbolic PDEs in a certain direction simultaneously in each sweeping order. The resulting iterative schemes have fast convergence rate to steady state solutions. Moreover, an advantage of fixed-point fast sweeping methods over other types of fast sweeping methods is that they are explicit and do not involve inverse operation of any nonlinear local system. Hence they are robust and flexible, and have been combined with high order accurate weighted essentially non-oscillatory (WENO) schemes to solve various hyperbolic PDEs in the literature. For multidimensional nonlinear problems, high order fixed-point fast sweeping WENO methods still require quite large amount of computational costs. In this technical note, we apply sparse-grid techniques, an effective approximation tool for multidimensional problems, to fixed-point fast sweeping WENO method for reducing its computational costs. Here we focus on a robust Runge-Kutta (RK) type fixed-point fast sweeping WENO scheme with third order accuracy (Zhang et al. 2006 [33]), for solving Eikonal equations, an important class of static Hamilton-Jacobi (H-J) equations. Numerical experiments on solving multidimensional Eikonal equations and a more general static H-J equation are performed to show that the sparse grid computations of the fixed-point fast sweeping WENO scheme achieve large savings of CPU times on refined meshes, and at the same time maintain comparable accuracy and resolution with those on corresponding regular single grids.

math.NA↗