Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1503.09157

Computational and in vitro studies of blast-induced blood-brain barrier disruption

Mauricio J. Del Razo·Yoichi Morofuji·James S. Meabon·B. Russell Huber·Elaine R. Peskind·William A. Banks·Pierre D. Mourad·Randall J. Leveque·David G. Cook
View original source ↗Read source document ↗Export metadata ↓

Abstract

There is growing concern that blast-exposed individuals are at risk of developing neurological disorders later in life. Therefore, it is important to understand the dynamic properties of blast forces on brain cells, including the endothelial cells that maintain the blood-brain barrier (BBB), which regulates the passage of nutrients into the brain and protects it from toxins in the blood. To better understand the effect of shock waves on the BBB we have investigated an {\em in vitro} model in which BBB endothelial cells are grown in transwell vessels and exposed in a shock tube, confirming that BBB integrity is directly related to shock wave intensity. It is difficult to directly measure the forces acting on these cells in the transwell container during the experiments, and so a computational tool has been developed and presented in this paper. Two-dimensional axisymmetric Euler equations with the Tammann equation of state were used to model the transwell materials, and a high-resolution finite volume method based on Riemann solvers and the Clawpack software was used to solve these equations in a mixed Eulerian/Lagrangian frame. Results indicated that the geometry of the transwell plays a significant role in the observed pressure time series in these experiments. We also found that pressures can fall below vapor pressure due to the interaction of reflecting and diffracting shock waves, suggesting that cavitation bubbles could be a damage mechanism. Computations that include a simulated hydrophone inserted in the transwell suggest that the instrument itself could significantly alter blast wave properties. These findings illustrate the need for further computational modeling studies aimed at understanding possible blast-induced BBB damage.

Explore related subjects

math.NAcs.NAphysics.comp-phphysics.med-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mauricio J. Del Razo, Yoichi Morofuji, James S. Meabon, B. Russell Huber, Elaine R. Peskind, William A. Banks, Pierre D. Mourad, Randall J. Leveque, David G. Cook. 2015-12-17. Computational and in vitro studies of blast-induced blood-brain barrier disruption. https://doi.org/10.1137/15m1010750

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↗