SEARCH · Engineering Papers

Results for “explicit and implicit methods”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14

All sources NASA NTRS DOE OSTI

DOE OSTI2022

On the Rapid Calculation of Binding Affinities for Antigen and Antibody Design and Affinity Maturation Simulations

The accurate and efficient calculation of protein-protein binding affinities is an essential component in antibody and antigen design and optimization, and in computer modeling of antibody affinity maturation. Such calculations remain challenging despite advances in computer hardware and algorithms, primarily because proteins are flexible molecules, and thus, require explicit or implicit incorporation of multiple conformational states into the computational procedure. The astronomical size of the amino acid sequence space further compounds the challenge by requiring predictions to be computed within a short time so that many sequence variants can be tested. In this study, we compare three classes of methods for antibody/antigen (Ab/Ag) binding affinity calculations: (i) a method that relies on the physical separation of the Ab/Ag complex in equilibrium molecular dynamics (MD) simulations, (ii) a collection of 18 scoring functions that act on an ensemble of structures created using homology modeling software, and (iii) methods based on the molecular mechanics-generalized Born surface area (MM-GBSA) energy decomposition, in which the individual contributions of the energy terms are scaled to optimize agreement with the experiment. When applied to a set of 49 antibody mutations in two Ab/HIV gp120 complexes, all of the methods are found to have modest accuracy, with the highest Pearson correlations reaching about 0.6. In particular, the most computationally intensive method, i.e., MD simulation, did not outperform several scoring functions. The optimized energy decomposition methods provided marginally higher accuracy, but at the expense of requiring experimental data for parametrization. Within each method class, we examined the effect of the number of independent computational replicates, i.e., modeled structures or reinitialized MD simulations, on the prediction accuracy. We suggest using about ten modeled structures for scoring methods, and about five simulation replicates for MD simulations as a rule of thumb for obtaining reasonable convergence. We anticipate that our study will be a useful resource for practitioners working to incorporate binding affinity calculations within their protein design and optimization process.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

A high-order finite difference method for moving immersed domain boundaries and material interfaces

Here, we present a high-order sharp treatment of immersed moving domain boundaries and material interfaces, and apply it to the advection-diffusion equation in two and three dimensions. The spatial discretization combines dimension-split finite difference schemes with an immersed boundary treatment based on a weighted least-squares reconstruction of the solution, providing stable discretizations with up to sixth order accuracy for diffusion terms and third order accuracy for advection terms. The temporal discretization relies on a novel strategy for maintaining high-order temporal accuracy in problems with moving boundaries that minimizes implementation complexity and allows arbitrary explicit or diagonally-implicit Runge-Kutta schemes. The approach is broadly compatible with popular PDE-specialized Runge-Kutta time integrators, including low-storage, strong stability preserving, and diagonally implicit schemes. Through numerical experiments we demonstrate that the full discretization maintains high-order spatial and temporal accuracy in the presence of complex 3D geometries and for a range of boundary conditions, including Dirichlet, Neumann, and flux conditions with large jumps in coefficients.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

Generalized fictitious methods for fluid–structure interactions: Analysis and simulations

We present a new fictitious pressure method for fluid–structure interaction (FSI) problems in incompressible flow by generalizing the fictitious mass and damping methods we published previously in [1]. The fictitious pressure method involves modification of the fluid solver whereas the fictitious mass and damping methods modify the structure solver. We analyze all fictitious methods for simplified problems and obtain explicit expressions for the optimal reduction factor (convergence rate index) at the FSI interface [2]. This analysis also demonstrates an apparent similarity of fictitious methods to the FSI approach based on Robin boundary conditions, which have been found to be very effective in FSI problems. We implement all methods, including the semi-implicit Robin based coupling method, in the context of spectral element discretization, which is more sensitive to temporal instabilities than low-order methods. However, the methods we present here are simple and general, and hence applicable to FSI based on any other spatial discretization. In numerical tests, we verify the selection of optimal values for the fictitious parameters for simplified problems and for vortex-induced vibrations (VIV) even at zero mass ratio (“for-ever-resonance”). We also develop an empirical a posteriori analysis for complex geometries and apply it to 3D patient-specific flexible brain arteries with aneurysms for very large deformations. We demonstrate that the fictitious pressure method enhances stability and convergence, and is comparable or better in most cases to the Robin approach or the other fictitious methods.

Computer Science↗

DOE OSTI2012

Modified semi-classical methods for nonlinear quantum oscillations problems

We develop a modified semi-classical approach to the approximate solution of Schroedinger's equation for certain nonlinear quantum oscillations problems. In our approach, at lowest order, the Hamilton-Jacobi equation of the conventional semi-classical formalism is replaced by an inverted-potential-vanishing-energy variant thereof. With suitable smoothness, convexity and coercivity properties imposed on its potential energy function, we prove, using methods drawn from the calculus of variations together with the (Banach space) implicit function theorem, the existence of a global, smooth 'fundamental solution' to this equation. Higher order quantum corrections thereto, for both ground and excited states, can then be computed through the integration of associated systems of linear transport equations, derived from Schroedinger's equation, and formal expansions for the corresponding energy eigenvalues obtained therefrom by imposing the natural demand for smoothness on the (successively computed) quantum corrections to the eigenfunctions. For the special case of linear oscillators our expansions naturally truncate, reproducing the well-known exact solutions for the energy eigenfunctions and eigenvalues. As an explicit application of our methods to computable nonlinear problems, we calculate a number of terms in the corresponding expansions for the one-dimensional anharmonic oscillators of quartic, sectic, octic, and dectic types and compare the results obtained with those of conventional Rayleigh/Schroedinger perturbation theory. To the orders considered (and, conjecturally, to all orders) our eigenvalue expansions agree with those of Rayleigh/Schroedinger theory whereas our wave functions more accurately capture the more-rapid-than-gaussian decay known to hold for the exact solutions to these problems. For the quartic oscillator in particular our results strongly suggest that both the ground state energy eigenvalue expansion and its associated wave function expansion are Borel summable to yield natural candidates for the actual exact ground state solution and its energy. Our techniques for proving the existence of the crucial 'fundamental solution' to the relevant (inverted-potential-vanishing-energy) Hamilton-Jacobi equation have the important property of admitting interesting infinite dimensional generalizations. In a project paralleling the present one we shall show how this basic construction can be carried out for the Yang-Mills equations in Minkowski spacetime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2014

Compressible, multiphase semi-implicit method with moment of fluid interface representation

A unified method for simulating multiphase flows using an exactly mass, momentum, and energy conserving Cell-Integrated Semi-Lagrangian advection algorithm is presented. The deforming material boundaries are represented using the moment-of-fluid method. Our new algorithm uses a semi-implicit pressure update scheme that asymptotically preserves the standard incompressible pressure projection method in the limit of infinite sound speed. The asymptotically preserving attribute makes the new method applicable to compressible and incompressible flows including stiff materials; enabling large time steps characteristic of incompressible flow algorithms rather than the small time steps required by explicit methods. Moreover, shocks are captured and material discontinuities are tracked, without the aid of any approximate or exact Riemann solvers. As a result, wimulations of underwater explosions and fluid jetting in one, two, and three dimensions are presented which illustrate the effectiveness of the new algorithm at efficiently computing multiphase flows containing shock waves and material discontinuities with large “impedance mismatch.”

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Optimal experimental design: Formulations and computations

Questions of ‘how best to acquire data’ are essential to modelling and prediction in the natural and social sciences, engineering applications, and beyond. Optimal experimental design (OED) formalizes these questions and creates computational methods to answer them. This article presents a systematic survey of modern OED, from its foundations in classical design theory to current research involving OED for complex models. We begin by reviewing criteria used to formulate an OED problem and thus to encode the goal of performing an experiment. We emphasize the flexibility of the Bayesian and decision-theoretic approach, which encompasses information-based criteria that are well-suited to nonlinear and non-Gaussian statistical models. We then discuss methods for estimating or bounding the values of these design criteria; this endeavour can be quite challenging due to strong nonlinearities, high parameter dimension, large per-sample costs, or settings where the model is implicit. A complementary set of computational issues involves optimization methods used to find a design; we discuss such methods in the discrete (combinatorial) setting of observation selection and in settings where an exact design can be continuously parametrized. Finally we present emerging methods for sequential OED that build non-myopic design policies, rather than explicit designs; these methods naturally adapt to the outcomes of past experiments in proposing new experiments, while seeking coordination among all experiments to be performed. Throughout, we highlight important open questions and challenges.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Four decades of implicit Monte Carlo

In 1971, Fleck and Cummings derived a system of equations to enable robust Monte Carlo simulations of time-dependent, thermal radiative transfer problems. Denoted the “Implicit Monte Carlo” (IMC) equations, their solution remains the de facto standard of high-fidelity radiative transfer simulations. Over the course of 44 years, their numerical properties have become better understood, and accuracy enhancements, novel acceleration methods, and variance reduction techniques have been suggested. In this review, we rederive the IMC equations—explicitly highlighting assumptions as they are made—and outfit the equations with a Monte Carlo interpretation. We put the IMC equations in context with other approximate forms of the radiative transfer equations and present a new demonstration of their equivalence to another well-used linearization solved with deterministic transport methods for frequency-independent problems. We discuss physical and numerical limitations of the IMC equations for asymptotically small time steps, stability characteristics and the potential of maximum principle violations for large time steps, and solution behaviors in an asymptotically thick diffusive limit. We provide a new stability analysis for opacities with general monomial dependence on temperature. Here, we consider spatial accuracy limitations of the IMC equations and discussion acceleration and variance reduction techniques.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2019

NONLINEAR SOIL-STRUCTURE INTERACTION ANALYSIS USING CO-SIMULATION

Nonlinear soil-structure interaction (NLSSI) analysis methods are currently being developed at Idaho National Laboratory. Appendix B in ASCE (2016) includes a framework for performing NLSSI analysis. For NLSSI analysis to be widely implemented in industry, it is important to demonstrate that accurate response in dynamically loaded, nonlinear models can be achieved in an efficient manner. Both explicit and implicit dynamic solvers are applicable to NLSSI. When considering cpu time, an explicit dynamic solver is often desirable for large models with no features (e.g. small elements, stiff elements, or stiffness damping) that can drive the time step unreasonably small. An implicit dynamic solver may be desirable in models not well suited for an explicit solver. A further option is co-simulation where a portion of the model is run with an explicit dynamic solver and the rest of the model is run with an implicit dynamic solver. This study explores NLSSI examples where co-simulation could be the most cpu efficient modelling strategy.

99 GENERAL AND MISCELLANEOUS↗

DOE OSTI2017

One-dimensional Lagrangian implicit hydrodynamic algorithm for Inertial Confinement Fusion applications

A new one-dimensional hydrodynamic algorithm, specifically developed for Inertial Confinement Fusion (ICF) applications, is presented. The scheme uses a fully conservative Lagrangian formulation in planar, cylindrical, and spherically symmetric geometries, and supports arbitrary equations of state with separate ion and electron components. Fluid equations are discretized on a staggered grid and stabilized by means of an artificial viscosity formulation. The space discretized equations are advanced in time using an implicit algorithm. The method includes several numerical parameters that can be adjusted locally. In regions with low Courant–Friedrichs–Lewy (CFL) number, where stability is not an issue, they can be adjusted to optimize the accuracy. In typical problems, the truncation error can be reduced by a factor between 2 to 10 in comparison with conventional explicit algorithms. On the other hand, in regions with high CFL numbers, the parameters can be set to guarantee unconditional stability. The method can be integrated into complex ICF codes. This is demonstrated through several examples covering a wide range of situations: from thermonuclear ignition physics, where alpha particles are managed as an additional species, to low intensity laser–matter interaction, where liquid–vapor phase transitions occur.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Learning Constrained Parametric Differentiable Predictive Control Policies With Guarantees

We present differentiable predictive control (DPC), a method for offline learning of constrained neural control policies for nonlinear dynamical systems with performance guarantees. We show that the sensitivities of the parametric optimal control problem can be used to obtain direct policy gradients. Specifically, we employ automatic differentiation (AD) to efficiently compute the sensitivities of the model predictive control (MPC) objective function and constraints penalties. To guarantee safety upon deployment, we derive probabilistic guarantees on closed-loop stability and constraint satisfaction based on indicator functions and Hoeffding’s inequality. We empirically demonstrate that the proposed method can learn neural control policies for various parametric optimal control tasks. In particular, we show that the proposed DPC method can stabilize systems with unstable dynamics, track time-varying references, and satisfy nonlinear state and input constraints. Our DPC method has practical time savings compared to alternative approaches for fast and memory-efficient controller design. Specifically, DPC does not depend on a supervisory controller as opposed to approximate MPC based on imitation learning. We demonstrate that, without losing performance, DPC is scalable with greatly reduced demands on memory and computation compared to implicit and explicit MPC while being more sample efficient than model-free reinforcement learning (RL) algorithms.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Generalized, Energy-conserving Numerical Simulations of Particles in General Relativity. I. Time-like and Null Geodesics

The numerical integration of particle trajectories in curved spacetimes is fundamental for obtaining realistic models of the particle dynamics around massive compact objects such as black holes and neutron stars. Generalized algorithms capable of handling generic metrics are needed for studies of both standard (Schwarzschild and Kerr metrics) and nonstandard (e.g., Schwarzschild metric plus nonclassical perturbations or multiple black hole metrics) spacetimes. The most commonly employed explicit numerical schemes (e.g., Runge–Kutta) are incapable of producing highly accurate results at critical points, e.g., in the regions close to the event horizon where gravity causes extreme curvature of the spacetime, at an acceptable computational cost. In this work we describe a generalized algorithm for the numerical integration of time-like (massive particles) and null (photons) geodesics in any given 3 + 1 split spacetime. We introduce a new, exactly energy-conserving implicit integration scheme based on the preservation of the underlying Hamiltonian, and we compare its properties with a standard fourth-order Runge–Kutta explicit scheme and an implicit midpoint scheme. We test the numerical performance of the three schemes against analytic solutions of particle and photon orbits in Schwarzschild and Kerr spacetimes. We additionally prove the versatility of our framework in handling more exotic metrics, such as Morris–Thorne wormholes and quantum-perturbed Schwarzschild black holes. The generalized method is also discussed in the perspective of future extensions to more complex particle dynamics, e.g., the addition of the Lorentz force acting on charged particles, which allows for test particle diagnostics in GRMHD simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2016

Data-driven operator inference for nonintrusive projection-based model reduction

We presenta a nonintrusive projection-based model reduction method for full models based on time-dependent partial differential equations. Projection-based model reduction constructs the operators of a reduced model by projecting the equations of the full model onto a reduced space. Traditionally, this projection is intrusive, which means that the full-model operators are required either explicitly in an assembled form or implicitly through a routine that returns the action of the operators on a given vector; however, in many situations the full model is given as a black box that computes trajectories of the full-model states and outputs for given initial conditions and inputs, but does not provide the full-model operators. Our nonintrusive operator inference approach infers approximations of the reduced operators from the initial conditions, inputs, trajectories of the states, and outputs of the full model, without requiring the full-model operators. Our operator inference is applicable to full models that are linear in the state or have a low-order polynomial nonlinear term. The inferred operators are the solution of a least-squares problem and converge, with sufficient state trajectory data, in the Frobenius norm to the reduced operators that would be obtained via an intrusive projection of the full-model operators. Our numerical results reflect operator inference on a linear climate model and on a tubular reactor model with a polynomial nonlinear term of third order.

42 ENGINEERING↗

DOE OSTI2018

A Numerical Tool for the Design of Enhanced Geothermal Reservoirs based on Modeling of Thermo-Hydro-Mechanical Processes and Explicit Representation of 3D Discrete Fracture Networks

This project has developed a coupled thermo-hydro-mechanical numerical modeling tool for prediction of energy production from Enhanced Geothermal Reservoirs (EGS). The tool is unique because it can explicitly represent thousands of pre-existing natural fractures. The capabilities developed in this project were built on the already existing expertise of Itasca arising from thirty years of research and development in discrete element modeling of fractured rocks. A thermal module suitable for analysis of different heat transfer mechanisms in fractured rocks percolated by fluids was developed and coupled with the already existing hydro-mechanical calculation in 3DEC, a commercial software for analysis of jointed rock based on the discrete element method (DEM). The heat transfer module simulates heat conduction, heat advection by moving fluid in rock fractures, and convective heat exchange at the fracture walls between the rock and the moving fluid. Techniques for spatial discretization of heat transfer in EGS-type problems were evaluated, and a boundary layer meshing approach was developed. Also, given the significant differences in time scale of physical processes involved, temporal integration schemes for coupled advection-diffusion processes and coupled thermal-hydro-mechanical processes were developed by taking advantage of both implicit and explicit time integration and also optimizing the coupling intervals. These improvements were necessary for modeling EGS reservoirs. Also, the DFN capacities in 3DEC were extended to include a larger number of fractures. Research was carried out on approaches to simplify the DFN so that the model can meet computational demands, while preserving thermo-hydro-mechanical characteristics of the DFN. The developed modules were coupled with the already existing capabilities of 3DEC. The results were presented as a submitted conference paper (Riahi et al., 2018a). A series of benchmark and test examples showed the developed capabilities. Finally, the developed tool was tested for a large-scale reservoir model for longer periods of injection and production. The thermal draw-down curves were generated and presented. The project successfully met all the milestones laid out in the proposal. Results demonstrated the feasibility of developing a fast and reliable software for the EGS community to use for assessment and prediction of reservoir performance. Some of its applications include assessment of stimulated volume and produced temperature and power. It can also be used for improved engineering, design and optimization of EGS reservoirs as well as other unconventional resources such as shale gas. Finally, the 3D analysis presented in this study showed that simulating EGS reservoirs with tens of thousands of fractures is feasible, and confirmed that the developed tool can serve toward meeting the goals and objectives of Geothermal Technologies Office in overcoming technical barriers associated with commercial EGS development.

15 GEOTHERMAL ENERGY↗

DOE OSTI2020

In situ monitoring of the stopped muon flux at Mu2e

The specific object of Mu2e search is the neutrino-less coherent $\mu^-\rightarrow e^-$ conversion in the field of an aluminum nucleus and the signal is a monoenergetic electron of energy $ \approx 104.97$ MeV. This process is forbidden in the Standard Model but allowed in many of its extensions: with minimal changes to include neutrino masses and oscillation, the Branching Ratio of this process, or the similarly interesting $\mu\rightarrow e \gamma$ decay, is expected to be of the order of $\mathcal{O}(10^{-54})$. Values like these are below any currently achievable experimental sensitivity, and the observation of a signal would be unambiguous evidence of New Physics. The upper limit on the muon conversion was set by SINDRUM II at $7\times10^{-13}$ (90\% C.L.) and the goal of the Mu2e collaboration is an improvement of 4 order of magnitudes.\\ The Mu2e experiment can be conceptually divided into three stages: interaction of the primary proton pulse with the tungsten target a nd production of $\pi$ and $\mu$; collection and transport of the produced particles down to the aluminum stopping target; interaction with the stopping target and measurement of the output particles. The measurement of the stopped muon flux is of cardinal importance for the normalization of the Mu2e results. The baseline design includes two detectors developed to measure this flux, counting $\gamma$ emitted by the muonic atoms: HPGe and LaBr$_3$(Ce). The studies performed by the Mu2e Collaboration show that these two systems can be reliably used to determine the overall normalization.\\ The number of stopped muons is proportional to the number of protons on target, which itself depends on the extraction system for the proton beam. The Mu2e beam delivery system will use a resonant extraction to create the proton pulses and this method is characterized by intensity fluctuations on the time scale of milliseconds. These fluctuations, aside from the proportional fluctuation of t he number of muons, have a non-trivial impact on the overall! performance of the apparatus. For example, higher intensity proton bunches translate into higher veto rates by the Cosmic Rays Veto system, which is triggered by secondary particles generated by the proton interaction. Another example is the effect of the instantaneous luminosity on the reconstruction efficiency: higher intensity translates into higher detector occupancy, which in turn reduces the reconstruction efficiency.\\ The two cited detectors encounter limitations when trying to monitor the flux at the millisecond timescales: HPGe is by construction a slow detector while the rate of emission of the $\gamma (1809\textrm{ keV})$ the LaBr$_3$(Ce) will measure is too low. As of today, no system allows to monitor these fluctuations and the goal of this Thesis is to try filling this gap. The method we developed to monitor the fluctuations of the stopped muon flux, and by extension, the fluctuation in the proton pulses intensity is based on counting the number of muons capt ured in the stopping target by counting the number of protons produced in the process of the nuclear muon capture. This is one of the possible processes a stopped muon can undergo and it can lead to the ejection of charged particles.\\ The reconstruction algorithms were developed by the Mu2e collaboration with the explicit (and sometimes implicit) aim to reconstruct tracks of electrons in an energy range of a conversion electron. The protons we are interested in behave quite differently from these electrons and the cardinal task of this study has been to tailor the reconstruction routines to these particles. This has been done by analyzing simulated events consisting of a single proton to optimize the procedure and understand the features of these tracks. A major difference with respect to the electrons is the non-relativistic nature of $100\div300$ MeV$/c$ protons: accounting for the low velocity is both a challenge and a unique signature of the tracks.\\ The use of a pulse d beam and the need to allow produced $\pi$ to decay and $\m! u$ to int! eract in the stopping target forces the definition of a Mu2e \textit{event}: an event is comprised by everything which happens in a $1.7\ \mu$s window between the incidence two consecutive proton pulses. This means that the reconstruction will be performed in an environment crowded by many different particles. The next step of this study has been to estimate the performance of the method in a fully-fledged Mu2e simulated event and to study what kind of selections would improve it.\\ Our results are satisfactory since the number of reconstructed protons is significant (few per event), and show that a monitor on the timescale of milliseconds is indeed possible.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2014

Beyond the Born-Oppenheimer approximation with quantum Monte Carlo methods

Here, we develop tools that enable the study of non-adiabatic effects with variational and diffusion Monte Carlo methods. We propose a highly accurate wave function ansatz for electron-ion systems that can involve a combination of both fixed and quantum ions. We explicitly calculate the ground state energies of H 2 , LiH, H 2 O and FHF - using fixed-node quantum Monte Carlo with wave function nodes that explicitly depend on the ion positions. The obtained energies implicitly include the effects arising from quantum nuclei and electron-nucleus coupling. We compare our findings to the best theoretical and experimental results available and find excellent agreement.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2025

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

Task-based detectability in CT image reconstruction by filtered backprojection and penalized likelihood estimation

Purpose: Nonstationarity is an important aspect of imaging performance in CT and cone-beam CT (CBCT), especially for systems employing iterative reconstruction. This work presents a theoretical framework for both filtered-backprojection (FBP) and penalized-likelihood (PL) reconstruction that includes explicit descriptions of nonstationary noise, spatial resolution, and task-based detectability index. Potential utility of the model was demonstrated in the optimal selection of regularization parameters in PL reconstruction. Methods: Analytical models for local modulation transfer function (MTF) and noise-power spectrum (NPS) were investigated for both FBP and PL reconstruction, including explicit dependence on the object and spatial location. For FBP, a cascaded systems analysis framework was adapted to account for nonstationarity by separately calculating fluence and system gains for each ray passing through any given voxel. For PL, the point-spread function and covariance were derived using the implicit function theorem and first-order Taylor expansion according toFessler [“Mean and variance of implicitly defined biased estimators (such as penalized maximum likelihood): Applications to tomography,” IEEE Trans. Image Process. 5(3), 493–506 (1996)]. Detectability index was calculated for a variety of simple tasks. The model for PL was used in selecting the regularization strength parameter to optimize task-based performance, with both a constant and a spatially varying regularization map. Results: Theoretical models of FBP and PL were validated in 2D simulated fan-beam data and found to yield accurate predictions of local MTF and NPS as a function of the object and the spatial location. The NPS for both FBP and PL exhibit similar anisotropic nature depending on the pathlength (and therefore, the object and spatial location within the object) traversed by each ray, with the PL NPS experiencing greater smoothing along directions with higher noise. The MTF of FBP is isotropic and independent of location to a first order approximation, whereas the MTF of PL is anisotropic in a manner complementary to the NPS. Task-based detectability demonstrates dependence on the task, object, spatial location, and smoothing parameters. A spatially varying regularization “map” designed from locally optimal regularization can improve overall detectability beyond that achievable with the commonly used constant regularization parameter. Conclusions: Analytical models for task-based FBP and PL reconstruction are predictive of nonstationary noise and resolution characteristics, providing a valuable framework for understanding and optimizing system performance in CT and CBCT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

DOE OSTI2020

Approximate inverse-based block preconditioners in poroelasticity

We focus on the fully implicit solution of the linear systems arising from a three-field mixed finite element approximation of Biot’s poroleasticity equations. The objective is to develop algebraic block preconditioners for the efficient solution of such systems by Krylov subspace methods. In this work, we investigate the use of approximate inverse-based techniques to decouple the native system of equations and obtain explicit sparse approximations of the Schur complements related to the physics-based partitioning of the unknowns by field type. Here, the proposed methods are tested in various numerical experiments including real-world applications dealing with petroleum and geotechnical engineering.

54 ENVIRONMENTAL SCIENCES↗