Search NASA⌕ Search

SEARCH · Search NASA

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.

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

At least 577 records · Page 32

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↗

An efficient cell-vertex multigrid scheme for the three-dimensional Navier-Stokes equations

A cell-vertex scheme for the three-dimensional Navier-Stokes equations, which is based on central difference approximations and Runge-Kutta time stepping, is described. Using local time stepping, implicit residual smoothing with locally varying coefficients, a multigrid method and carefully controlled dissipative terms, very good convergence rates are obtained for two- and three-dimensional flows. Details of the acceleration techniques, which are important for convergence on meshes with high aspect-ratio cells, are discussed. Emphasis is put on the analysis of the stability properties of the implicit smoothing of the explicit residuals with coefficients, which depend on cell aspect ratios.

Radespiel, R.↗

Visualization of Unsteady Computational Fluid Dynamics

The current compute environment that most researchers are using for the calculation of 3D unsteady Computational Fluid Dynamic (CFD) results is a super-computer class machine. The Massively Parallel Processors (MPP's) such as the 160 node IBM SP2 at NAS and clusters of workstations acting as a single MPP (like NAS's SGI Power-Challenge array and the J90 cluster) provide the required computation bandwidth for CFD calculations of transient problems. If we follow the traditional computational analysis steps for CFD (and we wish to construct an interactive visualizer) we need to be aware of the following: (1) Disk space requirements. A single snap-shot must contain at least the values (primitive variables) stored at the appropriate locations within the mesh. For most simple 3D Euler solvers that means 5 floating point words. Navier-Stokes solutions with turbulence models may contain 7 state-variables. (2) Disk speed vs. Computational speeds. The time required to read the complete solution of a saved time frame from disk is now longer than the compute time for a set number of iterations from an explicit solver. Depending, on the hardware and solver an iteration of an implicit code may also take less time than reading the solution from disk. If one examines the performance improvements in the last decade or two, it is easy to see that depending on disk performance (vs. CPU improvement) may not be the best method for enhancing interactivity. (3) Cluster and Parallel Machine I/O problems. Disk access time is much worse within current parallel machines and cluster of workstations that are acting in concert to solve a single problem. In this case we are not trying to read the volume of data, but are running the solver and the solver outputs the solution. These traditional network interfaces must be used for the file system. (4) Numerics of particle traces. Most visualization tools can work upon a single snap shot of the data but some visualization tools for transient problems require dealing with time.

Haimes, Robert↗

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↗

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↗

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↗

Supercomputing of supersonic flows using upwind relaxation and MacCormack schemes

The performance of two numerical solution schemes, (1) an implicit upwind relaxation with a finite-volume discretization (Thomas and Walters, 1985) and (2) an explicit-implicit MacCormack (1981) scheme with a finite-difference discretization, is compared in two-dimensional simulations of supersonic flow past a flat plate with leading edge, a rearward-facing step, a 10-deg compression corner, a NACA 0012 airfoil at high angle of attack, and a cavity. The algebraic turbulence model, the solution methods, and the boundary conditions and SIMD coding are explained, and the results are presented in tables and graphs and characterized with reference to published experimental data. Scheme (1) is found to converge more rapidly and to give more accurate results than (2) in a wide range of problem types.

Baysal, O.↗

An optimal, parallel, fully implicit Newton-Krylov solver for three-dimensional viscoresistive magnetohydrodynamics

The conceptual development and implementation of a scalable nonlinear solver for the time-dependent three-dimensional (3D) compressible resistive magnetohydrodynamics model (MHD) is discussed. The approach is based on Jacobian-free Newton-Krylov technology, preconditioned with multigrid methods for algorithmic scalability. The key to the approach is the reformulation of the hyperbolic MHD system into a parabolic one, which is amenable to multigrid techniques. Such reformulation (parabolization) aims to render the modified system block diagonally dominant (unlike the original MHD system, which is diagonally submissive for implicit time steps {delta}t larger than the explicit Courant-Friedrichs-Lewy time step). The algorithm has been tested on a variety of 2D and 3D configurations which demonstrate its excellent algorithmic scalability properties. In particular, it is shown that, serially, the CPU time for a given simulation scales linearly with the number of unknowns, and that large CPU gains ({approx}30) are attainable with respect to an explicit approach even for moderate grids (256x256). In parallel, the algorithm features excellent scalability properties up to thousands of processors (4096) and millions of unknowns ({approx}1.3x10{sup 8})

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Space Station Active Thermal Control System modeling

The Space Station Active Thermal Control System (ATCS) has been modeled using modified SINDA/SINFLO programs to solve two-phase Thermo-fluid problems. The modifications include changes in several subroutines to incorporate implicit solution which allows larger time step as compared to that for explicit solutions. Larger time step saves computer time but involves larger computational error. Several runs were made using various time steps for the ATCS model. It has been found that for a reasonable approach, three times larger time step as compared to that used in explicit method is a good value which will reduce the computer time by approximately 50 percent and still maintain the accuracy of the output data to within 90 percent of the explicit values.

Hye, Abdul↗

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↗

A composite grid solver for conjugate heat transfer in fluid-structure systems

We describe a numerical method for modeling temperature-dependent fluid flow coupled to heat transfer in solids. This approach to conjugate heat transfer can be used to compute transient and steady state solutions to a wide range of fluid-solid systems in complex two- and three-dimensional geometry. Fluids are modeled with the temperature-dependent incompressible Navier-Stokes equations using the Boussinesq approximation. Solids with heat transfer are modeled with the heat equation. Appropriate interface equations are applied to couple the solutions across different domains. The computational region is divided into a number of sub-domains corresponding to fluid domains and solid domains. There may be multiple fluid domains and multiple solid domains. Each fluid or solid sub-domain is discretized with an overlapping grid. The entire region is associated with a composite grid which is the union of the overlapping grids for the sub-domains. A different physics solver (fluid solver or solid solver) is associated with each sub-domain. A higher-level multi-domain solver manages the entire solution process. We propose and analyze some centered discrete approximations to the interface equations that have some desirable stability properties. The coupled interface equations may be solved directly when using explicit time-stepping methods in the sub-domains, resulting in a strongly coupled approach. The stability of the interface treatment in this case is independent of the relative sizes of the material properties in the two domains with the time-step only depending on the usual von Neumann conditions for each sub-domain. For implicit time-stepping methods we solve the interface equations in a weakly coupled fashion to avoid forming a coupled implicit system across all sub-domains. The convergence of this approach does depend on the relative sizes of the thermal conductivities and diffusivities. We analyze different iteration strategies for solving these implicit equations including the use of mixed (Robin) approximations at the interface. Numerical results are presented to illustrate the method. The accuracy of the technique is verified using the method of analytic solutions and by computing the solution to some heat exchanger problems where the exact solution is known. The technique is also applied to the modeling of an inertial-confinement-fusion hohlraum target and the flow of coolant past an hexagonal array of heated fuel rods. The multi-domain solver runs in parallel on distributed memory computers and some parallel results are provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Derivative interface conditions for multiblock grids

Methods are developed for computing numerical solutions along block boundaries, even when there is a discontinuity in the grid lines or slopes. The technique is based on matching derivatives and does not require overlapping and interpolation of solution values at block boundaries. The comparison of block boundary values is implicit and has proven to be stable for both implicit and explicit numerical algorithms. Examples are included for the numerical solution of the Euler equations for compressible flow on grids with both grid line discontinuities and discontinuous slopes at block boundaries.

Mastin, C. W.↗

A hybrid Godunov method for radiation hydrodynamics

From a mathematical perspective, radiation hydrodynamics can be thought of as a system of hyperbolic balance laws with dual multiscale behavior (multiscale behavior associated with the hyperbolic wave speeds as well as multiscale behavior associated with source term relaxation). With this outlook in mind, this paper presents a hybrid Godunov method for one-dimensional radiation hydrodynamics that is uniformly well behaved from the photon free streaming (hyperbolic) limit through the weak equilibrium diffusion (parabolic) limit and to the strong equilibrium diffusion (hyperbolic) limit. Moreover, one finds that the technique preserves certain asymptotic limits. The method incorporates a backward Euler upwinding scheme for the radiation energy density E{sub r} and flux F{sub r} as well as a modified Godunov scheme for the material density {rho}, momentum density m, and energy density E. The backward Euler upwinding scheme is first-order accurate and uses an implicit HLLE flux function to temporally advance the radiation components according to the material flow scale. The modified Godunov scheme is second-order accurate and directly couples stiff source term effects to the hyperbolic structure of the system of balance laws. This Godunov technique is composed of a predictor step that is based on Duhamel's principle and a corrector step that is based on Picard iteration. The Godunov scheme is explicit on the material flow scale but is unsplit and fully couples matter and radiation without invoking a diffusion-type approximation for radiation hydrodynamics. This technique derives from earlier work by Miniati and Colella (2007) . Numerical tests demonstrate that the method is stable, robust, and accurate across various parameter regimes.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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↗

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↗