Searcharxiv⌕ Search

arXiv subjects

Dominik Schillinger

Publications and source records attributed to Dominik Schillinger.

34 records · Page 2Linked to original sources

Connecting continuum poroelasticity with discrete synthetic vascular trees for modeling liver tissue

Computational simulations have the potential to assist in liver resection surgeries by facilitating surgical planning, optimizing resection strategies, and predicting postoperative outcomes. The modeling of liver tissue across multiple length scales constitutes a significant challenge, primarily due to the multiphysics coupling of mechanical response and perfusion within the complex multiscale vascularization of the organ. In this paper, we present a modeling framework that connects continuum poroelasticity and discrete vascular tree structures to model liver tissue across disparate levels of the perfusion hierarchy. The connection is achieved through a series of modeling decisions, which include source terms in the pressure equation to model inflow from the supplying tree, pressure boundary conditions to model outflow into the draining tree, and contact conditions to model surrounding tissue. We investigate the numerical behaviour of our framework and apply it to a patient-specific full-scale liver problem that demonstrates its potential to help assess surgical liver resection procedures

cs.CE↗

Branching exponents of synthetic vascular trees under different optimality principles

The branching behavior of vascular trees is often characterized using Murray's law. We investigate its validity using synthetic vascular trees generated under global optimization criteria. Our synthetic tree model does not incorporate Murray's law explicitly. Instead, we assume it holds implicitly and investigate the effects of different physical constraints and optimization goals on the branching exponent that is now allowed to vary locally. In particular, we include variable blood viscosity due to the Fåhræus--Lindqvist effect and enforce an equal pressure drop between inflow and the micro-circulation. Using our global optimization framework, we generate vascular trees with over one million terminal vessels and compare them against a detailed corrosion cast of the portal venous tree of a human liver. Murray's law is implicitly fulfilled when no additional constraints are enforced, indicating its validity in this setting. Variable blood viscosity or equal pressure drop leads to deviations from this optimum, but with the branching exponent inside the experimentally predicted range between 2.0 and 3.0. The validation against the corrosion cast shows good agreement from the portal vein down to the venules. Not enforcing Murray's law explicitly reduces the computational cost and increases the predictive capabilities of synthetic vascular trees. The ability to study optimal branching exponents across different scales can improve the functional assessment of organs.

physics.bio-ph↗

A matrix-free macro-element variant of the hybridized discontinuous Galerkin method

We investigate a macro-element variant of the hybridized discontinuous Galerkin (HDG) method, using patches of standard simplicial elements that can have non-matching interfaces. Coupled via the HDG technique, our method enables local refinement by uniform simplicial subdivision of each macro-element. By enforcing one spatial discretization for all macro-elements, we arrive at local problems per macro-element that are embarrassingly parallel, yet well balanced. Therefore, our macro-element variant scales efficiently to n-node clusters and can be tailored to available hardware by adjusting the local problem size to the capacity of a single node, while still using moderate polynomial orders such as quadratics or cubics. Increasing the local problem size means simultaneously decreasing, in relative terms, the global problem size, hence effectively limiting the proliferation of degrees of freedom. The global problem is solved via a matrix-free iterative technique that also heavily relies on macro-element local operations. We investigate and discuss the advantages and limitations of the macro-element HDG method via an advection-diffusion model problem.

cs.CE↗

Thermodynamically consistent concurrent material and structure optimization of elastoplastic multiphase hierarchical systems

The concept of concurrent material and structure optimization aims at alleviating the computational discovery of optimum microstructure configurations in multiphase hierarchical systems, whose macroscale behavior is governed by their microstructure composition that can evolve over multiple length scales from a few micrometers to centimeters. It is based on the split of the multiscale optimization problem into two nested sub-problems, one at the macroscale (structure) and the other at the microscales (material). In this paper, we establish a novel formulation of concurrent material and structure optimization for multiphase hierarchical systems with elastoplastic constituents at the material scales. Exploiting the thermomechanical foundations of elastoplasticity, we reformulate the material optimization problem based on the maximum plastic dissipation principle such that it assumes the format of an elastoplastic constitutive law and can be efficiently solved via modified return mapping algorithms. We integrate continuum micromechanics based estimates of the stiffness and the yield criterion into the formulation, which opens the door to a computationally feasible treatment of the material optimization problem. To demonstrate the accuracy and robustness of our framework, we define new benchmark tests with several material scales that, for the first time, become computationally feasible. We argue that our formulation naturally extends to multiscale optimization under further path-dependent effects such as viscoplasticity or multiscale fracture and damage.

physics.comp-ph↗

A variational approach based on perturbed eigenvalue analysis for improving spectral properties of isogeometric multipatch discretizations

A key advantage of isogeometric discretizations is their accurate and well-behaved eigenfrequencies and eigenmodes. For degree two and higher, however, optical branches of spurious outlier frequencies and modes may appear due to boundaries or reduced continuity at patch interfaces. In this paper, we introduce a variational approach based on perturbed eigenvalue analysis that eliminates outlier frequencies without negatively affecting the accuracy in the remainder of the spectrum and modes. We then propose a pragmatic iterative procedure that estimates the perturbation parameters in such a way that the outlier frequencies are effectively reduced. We demonstrate that our approach allows for a much larger critical time-step size in explicit dynamics calculations. In addition, we show that the critical time-step size obtained with the proposed approach does not depend on the polynomial degree of spline basis functions.

math.NA↗

Rigorous mathematical optimization of synthetic hepatic vascular trees

In this paper, we introduce a new framework for generating synthetic vascular trees, based on rigorous model-based mathematical optimization. Our main contribution is the reformulation of finding the optimal global tree geometry into a nonlinear optimization problem (NLP). This rigorous mathematical formulation accommodates efficient solution algorithms such as the interior point method and allows us to easily change boundary conditions and constraints applied to the tree. Moreover, it creates trifurcations in addition to bifurcations. A second contribution is the addition of an optimization stage for the tree topology. Here, we combine constrained constructive optimization (CCO) with a heuristic approach to search among possible tree topologies. We combine the NLP formulation and the topology optimization into a single algorithmic approach. Finally, we attempt the validation of our new model-based optimization framework using a detailed corrosion cast of a human liver, which allows a quantitative comparison of the synthetic tree structure to the tree structure determined experimentally down to the fifth generation. The results show that our new framework is capable of generating asymmetric synthetic trees that match the available physiological corrosion cast data better than trees generated by the standard CCO approach.

physics.bio-ph↗

Variationally consistent mass scaling for explicit time-integration schemes of lower- and higher-order finite element methods

In this paper, we propose a variationally consistent technique for decreasing the maximum eigenfrequencies of structural dynamics related finite element formulations. Our approach is based on adding a symmetric positive-definite term to the mass matrix that follows from the integral of the traction jump across element boundaries. The added term is weighted by a small factor, for which we derive a suitable, and simple, element-local parameter choice. For linear problems, we show that our mass-scaling method produces no adverse effects in terms of spatial accuracy and orders of convergence. We illustrate these properties in one, two and three spatial dimension, for quadrilateral elements and triangular elements, and for up to fourth order polynomials basis functions. To extend the method to non-linear problems, we introduce a linear approximation and show that a sizeable increase in critical time-step size can be achieved while only causing minor (even beneficial) influences on the dynamic response.

math.NA↗

A DEIM driven reduced basis method for the diffuse Stokes/Darcy model coupled at parametric phase-field interfaces

In this article, we develop a reduced basis method for efficiently solving the coupled Stokes/Darcy equations with parametric internal geometry. To accommodate possible changes in topology, we define the Stokes and Darcy domains implicitly via a phase-field indicator function. In our reduced order model, we approximate the parameter-dependent phase-field function with a discrete empirical interpolation method (DEIM) that enables affine decomposition of the associated linear and bilinear forms. In addition, we introduce a modification of DEIM that leads to non-negativity preserving approximations, thus guaranteeing positive-semidefiniteness of the system matrix. We also present a strategy for determining the required number of DEIM modes for a given number of reduced basis functions. We couple reduced basis functions on neighboring patches to enable the efficient simulation of large-scale problems that consist of repetitive subdomains. We apply our reduced basis framework to efficiently solve the inverse problem of characterizing the subsurface damage state of a complete in-situ leach mining site.

math.NA↗

Leveraging spectral analysis to elucidate membrane locking and unlocking in isogeometric finite element formulations of the curved Euler-Bernoulli beam

In this paper, we take a fresh look at using spectral analysis for assessing locking phenomena in finite element formulations. We propose to "measure" locking by comparing the difference between eigenvalue and mode error curves computed on coarse meshes with "asymptotic" error curves computed on "overkill" meshes, both plotted with respect to the normalized mode number. To demonstrate the intimate relation between membrane locking and spectral accuracy, we focus on the example of a circular ring discretized with isogeometric curved Euler-Bernoulli beam elements. We show that the transverse-displacement-dominating modes are locking-prone, while the circumferential-displacement-dominating modes are naturally locking-free. We use eigenvalue and mode errors to assess five isogeometric finite element formulations in terms of their locking-related efficiency: the displacement-based formulation with full and reduced integration and three locking-free formulations based on the B-bar, discrete strain gap and Hellinger-Reissner methods. Our study shows that spectral analysis uncovers locking-related effects across the spectrum of eigenvalues and eigenmodes, rigorously characterizing membrane locking in the displacement-based formulation and unlocking in the locking-free formulations.

cs.CE↗

A matrix-free isogeometric Galerkin method for Karhunen-Loève approximation of random fields using tensor product splines, tensor contraction and interpolation based quadrature

The Karhunen-Loève series expansion (KLE) decomposes a stochastic process into an infinite series of pairwise uncorrelated random variables and pairwise $L^2$-orthogonal functions. For any given truncation order of the infinite series the basis is optimal in the sense that the total mean squared error is minimized. The orthogonal basis functions are determined as the solution of an eigenvalue problem corresponding to the homogeneous Fredholm integral equation of the second kind, which is computationally challenging for several reasons. Firstly, a Galerkin discretization requires numerical integration over a $2d$ dimensional domain, where $d$, in this work, denotes the spatial dimension. Secondly, the main system matrix of the discretized weak-form is dense. Consequently, the computational complexity of classical finite element formation and assembly procedures as well as the memory requirements of direct solution techniques become quickly computationally intractable with increasing polynomial degree, number of elements and degrees of freedom. The objective of this work is to significantly reduce several of the computational bottlenecks associated with numerical solution of the KLE. We present a matrix-free solution strategy, which is embarrassingly parallel and scales favorably with problem size and polynomial degree. Our approach is based on (1) an interpolation based quadrature that minimizes the required number of quadrature points; (2) an inexpensive reformulation of the generalized eigenvalue problem into a standard eigenvalue problem; and (3) a matrix-free and parallel matrix-vector product for iterative eigenvalue solvers. Two higher-order three-dimensional benchmarks illustrate exceptional computational performance combined with high accuracy and robustness.

cs.CE↗

A comparison of matrix-free isogeometric Galerkin and collocation methods for Karhunen--Loève expansion

Numerical computation of the Karhunen--Loève expansion is computationally challenging in terms of both memory requirements and computing time. We compare two state-of-the-art methods that claim to efficiently solve for the K--L expansion: (1) the matrix-free isogeometric Galerkin method using interpolation based quadrature proposed by the authors in [1] and (2) our new matrix-free implementation of the isogeometric collocation method proposed in [2]. Two three-dimensional benchmark problems indicate that the Galerkin method performs significantly better for smooth covariance kernels, while the collocation method performs slightly better for rough covariance kernels.

cs.CE↗

Unification of variational multiscale analysis and Nitsche's method, and a resulting boundary layer fine-scale model

We show that in the variational multiscale framework, the weak enforcement of essential boundary conditions via Nitsche's method corresponds directly to a particular choice of projection operator. The consistency, symmetry and penalty terms of Nitsche's method all originate from the fine-scale closure dictated by the corresponding scale decomposition. As a result of this formalism, we are able to determine the exact fine-scale contributions in Nitsche-type formulations. In the context of the advection-diffusion equation, we develop a residual-based model that incorporates the non-vanishing fine scales at the Dirichlet boundaries. This results in an additional boundary term with a new model parameter. We then propose a parameter estimation strategy for all parameters involved that is also consistent for higher-order basis functions. We illustrate with numerical experiments that our new augmented model mitigates the overly diffusive behavior that the classical residual-based fine-scale model exhibits in boundary layers at boundaries with weakly enforced essential conditions.

math.NA↗

A Framework for Data-Driven Computational Dynamics Based on Nonlinear Optimization

In this article, we present an extension of the formulation recently developed by the authors (A Framework for Data-Driven Computational Mechanics Based on Nonlinear Optimization, arXiv:1910.12736 [math.NA]) to the structural dynamics setting. Inspired by a structure-preserving family of variational integrators, our new formulation relies on a discrete balance equation that establishes the dynamic equilibrium. From this point of departure, we first derive an "exact" discrete-continuous nonlinear optimization problem that works directly with data sets. We then develop this formulation further into an "approximate" nonlinear optimization problem that relies on a general constitutive model. This underlying model can be identified from a data set in an offline phase. To showcase the advantages of our framework, we specialize our methodology to the case of a geometrically exact beam formulation that makes use of all elements of our approach. We investigate three numerical examples of increasing difficulty that demonstrate the excellent computational behavior of the proposed framework and motivate future research in this direction.

math.NA↗

A Framework for Data-Driven Computational Mechanics Based on Nonlinear Optimization

Data-Driven Computational Mechanics is a novel computing paradigm that enables the transition from standard data-starved approaches to modern data-rich approaches. At this early stage of development, one can distinguish two mainstream directions. The first one relies on a discrete-continuous optimization problem and seeks to assign to each material point a point in the phase space that satisfies compatibility and equilibrium, while being closest to the data set provided. The second one is a data driven inverse approach that seeks to reconstruct a constitutive manifold from data sets by manifold learning techniques, relying on a well-defined functional structure of the underlying constitutive law. In this work, we propose a third route that combines the strengths of the two existing directions and mitigates some of their weaknesses. This is achieved by the formulation of an approximate nonlinear optimization problem, which can be robustly solved, is computationally efficient, and does not rely on any special functional structure of the reconstructed constitutive manifold. Additional benefits include the natural incorporation of kinematic constraints and the possibility to operate with implicitly defined stress-strain relations. We discuss important mathematical aspects of our approach for a data-driven truss element and investigate its key numerical behavior for a data-driven beam element that makes use of all components of our methodology.

math.NA↗

A review of the finite cell method for nonlinear structural analysis of complex CAD and image-based geometric models

The finite cell method (FCM) belongs to the class of immersed boundary methods, and combines the fictitious domain approach with high-order approximation, adaptive integration and weak imposition of unfitted Dirichlet boundary conditions. For the analysis of complex geometries, it circumvents expensive and potentially error-prone meshing procedures, while maintaining high rates of convergence. The present contribution provides an overview of recent accomplishments in the FCM with applications in structural mechanics. First, we review the basic components of the technology using the p- and B-spline versions of the FCM. Second, we illustrate the typical solution behavior for linear elasticity in 1D. Third, we show that it is straightforward to extend the FCM to nonlinear elasticity. We also outline that the FCM can be extended to applications beyond structural mechanics, such as transport processes in porous media. Finally, we demonstrate the benefits of the FCM with two application examples, i.e. the vibration analysis of a ship propeller described by T-spline CAD surfaces and the nonlinear compression test of a CT-based metal foam.

math.NA↗

Residual-based variational multiscale modeling in a discontinuous Galerkin framework

We develop the general form of the variational multiscale method in a discontinuous Galerkin framework. Our method is based on the decomposition of the true solution into discontinuous coarse-scale and discontinuous fine-scale parts. The obtained coarse-scale weak formulation includes two types of fine-scale contributions. The first type corresponds to a fine-scale volumetric term, which we formulate in terms of a residual-based model that also takes into account fine-scale effects at element interfaces. The second type consists of independent fine-scale terms at element interfaces, which we formulate in terms of a new fine-scale "interface model". We demonstrate for the one-dimensional Poisson problem that existing discontinuous Galerkin formulations, such as the interior penalty method, can be rederived by choosing particular fine-scale interface models. The multiscale formulation thus opens the door for a new perspective on discontinuous Galerkin methods and their numerical properties. This is demonstrated for the one-dimensional advection-diffusion problem, where we show that upwind numerical fluxes can be interpreted as an ad hoc remedy for missing volumetric fine-scale terms.

math.NA↗