Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2110.10827

How to pose material design problems for flow through porous media applications?: Sensitivity of dissipation rate to medium's permeability holds the key

K. B. Nakshatrala
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recent studies have advocated using the total dissipation rate under topology optimization to realize material designs involving the flow of fluids through porous media. However, these studies decided how to pose the design problem, such as maximizing the total dissipation rate for some situations while minimizing for others, by solving one-dimensional problems and justifying their choices using numerical experiments. The rigor is lacking -- a bottleneck for further scientific advancements to computational material design. This paper provides the missing theoretical justification. We identify four classes of boundary value problems using the adjoint state method and analytically calculate the sensitivity of the total dissipation rate to the permeability field. For two of those classes in which the flow of fluids is pressure-driven, the sensitivity is positive -- the total dissipation rate increases if the medium's permeability increases. While for the other two classes, in which the flow is velocity-driven, the trend is the opposite. These sensitivities provide rigorous answers to the central question: how to pose a material design problem for flow through porous media applications. The impact of our work is multi-fold. First, this study further elevates the role of the dissipation rate in posing well-posed material design problems using topology optimization. Second, besides the theoretical significance, the results benefit computational scientists and practitioners to realize optimal designs. Third, given their simplicity yet far-reaching impact, both the approach and results possess immense pedagogical value.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

K. B. Nakshatrala. 2022-02-09. How to pose material design problems for flow through porous media applications?: Sensitivity of dissipation rate to medium's permeability holds the key. https://doi.org/10.1063/5.0076317

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↗