Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

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 1,639 records · Page 91

Quantum-classical embedding via ghost Gutzwiller approximation for enhanced simulations of correlated electron systems

Simulating correlated materials on present-day quantum hardware remains challenging due to limited quantum resources. Quantum embedding methods offer a promising route by reducing computational complexity through the mapping of bulk systems onto effective impurity models, allowing more feasible simulations on pre- and early-fault-tolerant quantum devices. Here, this work develops a quantum-classical embedding framework based on the ghost Gutzwiller approximation to enable quantum-enhanced simulations of ground-state properties and spectral functions of correlated electron systems. Circuit complexity is analyzed using an adaptive variational quantum algorithm on a statevector simulator, applied to the infinite-dimensional Hubbard model with increasing ghost mode numbers from 3 to 5, resulting in circuit depths growing from 16 to 104. Noise effects are examined using a realistic error model, revealing significant impact on the spectral weight of the Hubbard bands. To mitigate these effects, the Iceberg quantum error detection code is employed, achieving up to 40% error reduction in simulations. Finally, the accuracy of the density matrix estimation and the derived spectral function is benchmarked on IBM and Quantinuum quantum hardware, featuring distinct qubit-connectivity and employing multiple levels of error mitigation techniques.

Chen, I-Chi [Ames Laboratory (AMES), Ames, IA (Uni↗

Linearly scaling and almost Hamiltonian dielectric continuum molecular dynamics simulations through fast multipole expansions

Hamiltonian Dielectric Solvent (HADES) is a recent method [S. Bauer et al., J. Chem. Phys. 140, 104103 (2014)] which enables atomistic Hamiltonian molecular dynamics (MD) simulations of peptides and proteins in dielectric solvent continua. Such simulations become rapidly impractical for large proteins, because the computational effort of HADES scales quadratically with the number N of atoms. If one tries to achieve linear scaling by applying a fast multipole method (FMM) to the computation of the HADES electrostatics, the Hamiltonian character (conservation of total energy, linear, and angular momenta) may get lost. Here, we show that the Hamiltonian character of HADES can be almost completely preserved, if the structure-adapted fast multipole method (SAMM) as recently redesigned by Lorenzen et al. [J. Chem. Theory Comput. 10, 3244-3259 (2014)] is suitably extended and is chosen as the FMM module. By this extension, the HADES/SAMM forces become exact gradients of the HADES/SAMM energy. Their translational and rotational invariance then guarantees (within the limits of numerical accuracy) the exact conservation of the linear and angular momenta. Also, the total energy is essentially conserved—up to residual algorithmic noise, which is caused by the periodically repeated SAMM interaction list updates. These updates entail very small temporal discontinuities of the force description, because the employed SAMM approximations represent deliberately balanced compromises between accuracy and efficiency. The energy-gradient corrected version of SAMM can also be applied, of course, to MD simulations of all-atom solvent-solute systems enclosed by periodic boundary conditions. However, as we demonstrate in passing, this choice does not offer any serious advantages.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Improvements to the Ion Doppler Spectrometer Diagnostic on the HIT-SI Experiments

An Ion Doppler Spectrometer diagnostic system measuring impurity ion temperature and velocity on the HIT-SI and HIT-SI3 spheromak devices has been improved with higher spatiotemporal resolution and lower error than previously described devices. Hardware and software improvements to the established technique have resulted in a record 6.9 µs temporal and <=2.8 cm spatial resolution in the midplane of each device. These allow C III and O II flow, displacement, and temperature profiles to be simultaneously observed. With 72 fused-silica fiber channels in two independent bundles, and an f/8.5 Czerny-Turner spectrometer coupled to video camera, frame-rates of up to ten times the imposed magnetic perturbation frequency of 14.5 kHz were achieved in HIT-SI, viewing the upper 1/2 of the midplane. In HIT-SI3 frame-rates of up to eight times the perturbation frequency were achieved viewing both halves of the midplane. Biorthogonal Decomposition is used as a novel filtering tool, reducing uncertainty in ion temperature from <=13 to <=5 eV (with an instrument temperature of 8-16 eV), and uncertainty in velocity from <=2 to <=1 km/s. Doppler shift and broadening is calculated via the Levenberg-Marquart algorithm, after which errors in velocity and temperature are uniquely specified. Axisymmetric temperature profiles on HIT-SI3 for C III peaked near the inboard current separatrix at approximately 40 eV are observed. Axisymmetric plasma displacement profiles have been measured on HIT-SI3, peaking at approximately 6 cm at the outboard separatrix. Both profiles agree with the upper half of the midplane observable by HIT-SI. With its complete midplane view, HIT-SI3 has unambiguously extracted axisymmetric, toroidal current dependent rotation of up to 3 km/s. Analysis of the temporal phase of the displacement uncovers a coherent structure, locked to the applied perturbation. Previously described diagnostic systems could not achieve such results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Bridging material models across scales: An integrated approach to equation of state and molecular dynamics modeling of copper

New uncertainty-aware equation of state (EOS) and electrical conductivity (EC) models for copper have been developed. The multiphase EOS/EC models are fit to experimental solid/liquid EC isobar measurements as well as density-functional theory molecular dynamics (DFT-MD) EC calculations in both expanded and compressed regimes (0.1–16 g/ cm 3 ⁠). The liquid and solid EOS phases were fit to available experimental data along with additional DFT-MD data over the same range as the EC. Leveraging the DFT-MD data, a corresponding machine-learned interatomic potential (MLIAP) for copper was trained using genetic-algorithm optimization. The copper MLIAP was constrained by EOS shock points at high compressions. The final EOS bounded MLIAP proves to be stable over a large density range (approximately 0.1–20 g/ cm 3 ) with good agreement to an isothermal compression curve, shock Hugoniot, and liquid speed of sound measurements at high pressures (100s of GPa).

Acoustic measurements and instrumentation↗

Asymptotic method for constructing a dynamic frequency response of a laser gyro

We consider an equation describing the dynamics of the phase of a beat signal at the output of a ring laser gyro in the presence of an alternating-sign frequency biasing in the form of a superposition of two meanders with different amplitudes and periods. It is assumed that the amplitude of one of the meanders is much larger than that of the other as well as than the half-widths of the static lock-in and the measured difference of eigenfrequencies of a ring resonator. A method is proposed for approximately calculating the beat frequency as a function of the measured difference between the eigenrequencies of the resonator. The result of applying this method represents analytically a recursive algorithm. Its implementation on a computer has made it possible to construct a dynamic frequency (output) response of a laser gyro with a biasing of given form. (laser applications and other topics in quantum electronics)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimized low-depth quantum circuits for molecular electronic structure using a separable-pair approximation

We present a classically tractable model that leads to optimized low-depth quantum circuits leveraging separable-pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms. The associated wave functions can be represented with linear memory requirement, which allows classical optimization of the circuits and naturally defines a minimum benchmark for quantum algorithms. In this work we employ directly determined pair-natural orbitals within a basis-set-free approach. This leads to accurate representation of the one- and many-body parts for weakly correlated systems and we explicitly illustrate how the model can be integrated into other quantum algorithms for stronger correlated systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Continuous momentum dependence in the dynamical cluster approximation

The dynamical cluster approximation (DCA) is a quantum cluster extension to the single-site dynamical mean-field theory that incorporates spatially nonlocal dynamic correlations systematically and nonperturbatively. The DCA + algorithm addresses the cluster shape dependence of the DCA and improves the convergence with cluster size by introducing a lattice self-energy with continuous momentum dependence. However, we show that the DCA + algorithm is plagued by a fundamental problem when its self-consistency equations are formulated using the bare Green's function of the cluster. This problem is most severe in the strongly correlated regime at low doping, where the DCA + self-energy becomes overly metallic and local, and persists to cluster sizes where the standard DCA has long converged. In view of the failure of the DCA + algorithm, we propose to complement DCA simulations with a post-interpolation procedure for single-particle and two-particle correlation functions to preserve continuous momentum dependence and the associated benefits in the DCA. We demonstrate the effectiveness of this practical approach with results for the half-filled and hole-doped two-dimensional Hubbard model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗

Assessing the Effects of Data Compression in Simulations Using Physically Motivated Metrics

This paper examines whether lossy compression can be used effectively in physics simulations as a possible strategy to combat the expected data-movement bottleneck in future high performance computing architectures. We show that, for the codes and simulations we tested, compression levels of 3–5X can be applied without causing significant changes to important physical quantities. Rather than applying signal processing error metrics, we utilize physics-based metrics appropriate for each code to assess the impact of compression. We evaluate three different simulation codes: a Lagrangian shock-hydrodynamics code, an Eulerian higher-order hydrodynamics turbulence modeling code, and an Eulerian coupled laser-plasma interaction code. We compress relevant quantities after each time-step to approximate the effects of tightly coupled compression and study the compression rates to estimate memory and disk-bandwidth reduction. We find that the error characteristics of compression algorithms must be carefully considered in the context of the underlying physics being modeled.

Laney, Daniel↗

Parallax-corrected VISST-derived pixel-level products from satellite GOES-16

The NASA Langley group led by William Smith produced GOES-16 satellite cloud retrievals over an approximate 10 by 10 degree region over the CACTI field campaign location. These retrievals are described here: https://www.arm.gov/capabilities/vaps/visst and are available for download here . They use algorithms historically called VISST that are now referred to as SatCORPS. More information can be found in Trepte et al. (2019), Minnis et al. (2021), and Yost et al. (2021). If using this dataset, please cite these references, the CACTI VISST dataset DOI found at the download link above, and this dataset’s DOI. The CACTI VISST pixel-level retrievals are on a 2 km spatial grid and available every 15 minutes (every 10 minutes late in the campaign), producing 21,765 files for the entire field campaign between October 2018 and April 2019. They are not corrected for parallax error, which is an offset in the actual geographical location of a cloud above the surface due to the satellite viewing the cloud partly from the side off nadir. This dataset applies a correction for parallax using the location relative to the satellite and the retrieved cloud top height above the surface, which allows the dataset to be geo-located with surface-based observations. The parallax correction for each location depends on the longitude, latitude and cloud top height above ground level (AGL) for that longitude and latitude in the original VISST files. The cloud top height AGL requires first computing the surface elevation at each VISST grid point. Data from the Advanced Spaceborne Thermal Emission and Reflection (ASTER) Global Digital Elevation Map Version 3 at 30-m resolution is projected onto the VISST grid using conservative coarsening (conserving surface elevation) in the xESMF Python package. The surface elevation is then subtracted from the VISST-retrieved cloud top height above mean sea level. These cloud top heights AGL are then combined with longitude and latitude to estimate the latitude and longitude corrections. Due to variability in cloud top height, the parallax shifts produce an irregular grid of values since higher cloud tops are shifted further than lower cloud tops. A ball tree-based neighbor search with Haversine distance is performed using the Python-based scikit-learn library to find the nearest VISST grid point to each parallax correction-shifted point. The data value of the shifted point is then assigned to that VISST grid point. In this manner, the irregular geographical shifts to correct for parallax are projected back to the rectilinear VISST grid. Because relatively higher clouds should obscure lower clouds, the variable values for the highest cloud top are preferentially chosen if two or more values are assigned to a grid point. The parallax correction should be viewed as an improved but still imperfect estimation of the cloud top locations, largely because the cloud top height is an imperfect retrieval. Please see the attached README document for further information. Users are encouraged to contact the authors with any additional questions.

54 ENVIRONMENTAL SCIENCES↗

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems

This work aims at bringing advances in discrete optimization algorithms to solving practical engineering problems at scale. Often times, in many engineering design problems, there is a need to select a small set of influential or representative elements from a large ground set of entities in an optimal fashion. Submodular optimization provides for a formal way to solve such problems. Common examples with infrastructure systems involve sensor placement and identification of key entities with certain objectives. However, scaling these approaches to large infrastructure systems can be challenging because of the high computational complexity of the overall framework that include the optimization algorithms as well as high-complexity compute-oracles that provide the necessary objective function values. In this work, we explore a well-studied and widely-applicable paradigm, namely leader-selection in a multi-agent networked setting in the context of scalable methodologies. We demonstrate novel frameworks that utilize variations of accelerated submodular optimization algorithms along with linear-algebraic methods that can help accelerate the oracle computations. We further explore this combination in conjunction with graph partitioning paradigms to take advantage of the accelerated algorithms in a distributed setting. Finally we demonstrate the key findings on a practical problem in an operational setting. For this, we leverage an example road network with approximately 18k nodes and 27k edges in a traffic control application, where we seek a limited number of k=200 key intersections. This problem can be solved in a serial setting in just under 5 hours providing more than 2 orders of magnitude speed-up over methods that do not consider acceleration techniques.

Visweswara Sathanur, Arun↗

Can Handheld Plastic Detectors Do Both Gamma and Neutron Isotopic Identification with Directional Source Location?

This paper demonstrates, through MCNPX simulations, that a compact hexagonal array of detectors can be utilized to do both gamma isotopic identification (ID) along with neutron identification while simultaneously finding the direction of the source relative to the detector array. The detector array itself is composed of seven borated polyvinyl toluene (PVT) hexagonal light pipes approximately 4 inches long and with a 1.25 inch face-to-face thickness assembled in a tight configuration. The gamma ID capability is realized through judicious windowing algorithms as is the neutron spectral unfolding. By having multiple detectors in different relative positions, directional determination of the source can be realized. By further adding multiplicity counters to the neutron counts, fission events can be measured.

61 RADIATION PROTECTION AND DOSIMETRY↗

The Human Carbon Budget: An Estimate of the Spatial Distribution of Metabolic Carbon Consumption and Release in the United States

Carbon dioxide is taken up by agricultural crops and released soon after during the consumption of agricultural commodities. The global net impact of this process on carbon flux to the atmosphere is negligible, but impact on the spatial distribution of carbon dioxide uptake and release across regions and continents is significant. To estimate the consumption and release of carbon by humans over the landscape, we developed a carbon budget for humans in the United States. The budget was derived from food commodity intake data for the US and from algorithms representing the metabolic processing of carbon by humans. Data on consumption, respiration, and waste of carbon by humans were distributed over the US using geospatial population data with a resolution of approximately 450 x 450 m. The average adult in the US contains about 21 kg C and consumes about 67 kg C yr-1 which is balanced by the annual release of about 59 kg C as expired CO2, 7 kg C as feces and urine, and less than 1 kg C as flatus, sweat, and aromatic compounds. In 2000, an estimated 17.2 Tg C were consumed by the US population and 15.2 Tg C were expired to the atmosphere as CO2. Historically, carbon stock in the US human population has increased between 1790-2006 from 0.06 Tg to 5.37 Tg. Displacement and release of total harvested carbon per capita in the US is nearly 12% of per capita fossil fuel emissions. Humans are using, storing, and transporting carbon about the Earth s surface. Inclusion of these carbon dynamics in regional carbon budgets can improve our understanding of carbon sources and sinks.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A sparse matrix–vector multiplication based algorithm for accurate density matrix computations on systems of millions of atoms

Here we present an efficient sparse matrix–vector (SpMV) based method to compute the density matrix P from a given Hamiltonian in electronic structure computations. Our method is a hybrid approach based on Chebyshev–Jackson approximation theory and matrix purification methods like the second order spectral projection purification (SP2). Recent methods to compute the density matrix scale as O(N) in the number of floating point operations but are accompanied by large memory and communication overhead, and they are based on iterative use of the sparse matrix–matrix multiplication kernel (SpGEMM), which is known to be computationally irregular. In addition to irregularity in the sparse Hamiltonian H, the nonzero structure of intermediate estimates of P depends on products of H and evolves over the course of computation. On the other hand, an expansion of the density matrix P in terms of Chebyshev polynomials is straightforward and SpMV based; however, the resulting density matrix may not satisfy the required constraints exactly. In this paper, we analyze the strengths and weaknesses of the Chebyshev–Jackson polynomials and the second order spectral projection purification (SP2) method, and propose to combine them so that the accurate density matrix can be computed using the SpMV computational kernel only, and without having to store the density matrix P. Our method accomplishes these objectives by using the Chebyshev polynomial estimate as the initial guess for SP2, which is followed by using sparse matrix–vector multiplications (SpMVs) to replicate the behavior of the SP2 algorithm for purification. We demonstrate the method on a tight-binding model system of an oxide material containing more than 3 million atoms. In addition, we also present the predicted behavior of our method when applied to near-metallic Hamiltonians with a wide energy spectrum.

42 ENGINEERING↗

SU-D-BRF-07: Ultrasound and Fluoroscopy Based Intraoperative Image-Guidance System for Dynamic Dosimetry in Prostate Brachytherapy

Purpose: Prostate brachytherapy is a common treatment method for low-risk prostate cancer patients. Intraoperative treatment planning is known to improve the treatment procedure and the outcome. The current limitation of intraoperative treatment planning is the inability to localize the seeds in relation to the prostate. We developed an image-guidance system to fulfill this need to achieve intraoperative dynamic dosimetry in prostate brachytherapy. Methods: Our system is based on standard imaging equipments available in the operating room, including the transrectal ultrasound (TRUS) and the mobile C-arm. A simple fiducial is added to compute the C-arm pose. Three fluoroscopic images and an ultrasound volume of the seeds and the prostate are acquired and processed by four image processing algorithms: seed segmentation, fiducial detection with pose estimation, seed reconstruction, and seeds-to-TRUS registration. The updated seed positions allow the physician to assess the quality of implantation and dynamically adjust the treatment plan during the course of surgery to achieve improved exit dosimetry. Results: The system was tested on 10 phantoms and 37 patients. Seed segmentation resulted in a 1% false negative and 2% false positive rates. Fiducial detection with pose estimation resulted in a detection rate of 98%. Seed reconstruction had a mean reconstruction error of 0.4 mm. Seeds-to-TRUS registration had a mean registration error of 1.3 mm. The total processing time from image acquisition to registration was approximately 1 minute. Conclusion: We present an image-guidance system for intraoperative dynamic dosimetry in prostate brachytherapy. Using standard imaging equipments and a simple fiducial, our system can be easily adopted in any clinics. Robust image processing algorithms enable accurate and fast computation of the delivered dose. Especially, the system enables detection of possible hot/cold spots during the surgery, allowing the physician to address these in the operating room rather than requiring additional therapy afterwards. This research was supported in part by the National Institutes of Health/National Cancer Institute (NIH/NCI) under grant 2R44CA099374 and grant 1R01CA151395, and in part by the Department of Defense (DoD) under grant W81XWH-05-1-0407.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

The potential of positron emission tomography for intratreatment dynamic lung tumor tracking: A phantom study

Purpose: This study aims to evaluate the potential and feasibility of positron emission tomography for dynamic lung tumor tracking during radiation treatment. The authors propose a center of mass (CoM) tumor tracking algorithm using gated-PET images combined with a respiratory monitor and investigate the geometric accuracy of the proposed algorithm. Methods: The proposed PET dynamic lung tumor tracking algorithm estimated the target position information through the CoM of the segmented target volume on gated PET images reconstructed from accumulated coincidence events. The information was continuously updated throughout a scan based on the assumption that real-time processing was supported (actual processing time at each frame ≈10 s). External respiratory motion and list-mode PET data were acquired from a phantom programmed to move with measured respiratory traces (external respiratory motion and internal target motion) from human subjects, for which the ground truth target position was known as a function of time. The phantom was cylindrical with six hollow sphere targets (10, 13, 17, 22, 28, and 37 mm in diameter). The measured respiratory traces consisted of two sets: (1) 1D-measured motion from ten healthy volunteers and (2) 3D-measured motion from four lung cancer patients. The authors evaluated the geometric accuracy of the proposed algorithm by quantifying estimation errors (Euclidean distance) between the actual motion of targets (1D-motion and 3D-motion traces) and CoM trajectories estimated by the proposed algorithm as a function of time. Results: The time-averaged error of 1D-motion traces over all trajectories of all targets was 1.6 mm. The error trajectories decreased with time as coincidence events were accumulated. The overall error trajectory of 1D-motion traces converged to within 2 mm in approximately 90 s. As expected, more accurate results were obtained for larger targets. For example, for the 37 mm target, the average error over all 1D-motion traces was 1.1 mm; and for the 10 mm target, the average error over all 1D-motion traces was 2.8 mm. The overall time-averaged error of 3D-motion traces was 1.6 mm, which was comparable to that of the 1D-motion traces. There were small variations in the errors between the 3D-motion traces, although the motion trajectories were very different. The accuracy of the estimates was consistent for all targets except for the smallest. Conclusions: The authors developed an algorithm for dynamic lung tumor tracking using list-mode PET data and a respiratory motion signal, and demonstrated proof-of-principle for PET-guided lung tumor tracking. The overall tracking error in phantom studies is less than 2 mm.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Comparison of Grid-based and SPH Binary Mass-transfer and Merger Simulations

There is currently a great amount of interest in the outcomes and astrophysical implications of mergers of double degenerate binaries. In a commonly adopted approximation, the components of such binaries are represented by polytropes with an index of n = 3/2. We present detailed comparisons of stellar mass-transfer and merger simulations of polytropic binaries that have been carried out using two very different numerical algorithms—a finite-volume “grid” code and a smoothed-particle hydrodynamics (SPH) code. We find that there is agreement in both the ultimate outcomes of the evolutions and the intermediate stages if the initial conditions for each code are chosen to match as closely as possible. We find that even with closely matching initial setups, the time it takes to reach a concordant evolution differs between the two codes because the initial depth of contact cannot be matched exactly. There is a general tendency for SPH to yield higher mass transfer rates and faster evolution to the final outcome. We also present comparisons of simulations calculated from two different energy equations: in one series, we assume a polytropic equation of state and in the other series an ideal gas equation of state. In the latter series of simulations, an atmosphere forms around the accretor, which can exchange angular momentum and cause a more rapid loss of orbital angular momentum. In the simulations presented here, the effect of the ideal equation of state is to de-stabilize the binary in both SPH and grid simulations, but the effect is more pronounced in the grid code.

79 ASTRONOMY AND ASTROPHYSICS↗

Endovascular Management of Refractory Hepatic Encephalopathy Complication of Transjugular Intrahepatic Portosystemic Shunt (TIPS): Comprehensive Review and Clinical Practice Algorithm

Transjugular intrahepatic portosystemic shunt (TIPS) has evolved as an effective intervention for treatment of complications of portal hypertension. The use of polytetrafluoroethylene-covered stents have improved the patency of the shunts and diminished the incidence of TIPS dysfunction. However, TIPS-related refractory hepatic encephalopathy (rHE) poses a significant challenge. Approximately 3–7 % of patients with TIPS develop rHE. Refractory hepatic encephalopathy is defined as a recurrent or persistent encephalopathy despite appropriate medical treatment. Hepatic encephalopathy can be an extremely debilitating complication that profoundly affects quality of life. The approach to management of patients with rHE is complex and typically requires collaboration between different specialties. Liver transplantation is the ultimate treatment for rHE; however, the ongoing shortage of organ donation markedly limits this treatment option. Alternative therapies such as shunt occlusion or reduction can control symptoms and serve as a ‘bridge’ therapy to liver transplantation. Therefore, interventional radiologists play a key role in the management of these patients by offering a variety of endovascular techniques. The purpose of this review is to highlight some of these endovascular techniques and to develop a therapeutic algorithm that can be applied in clinical practice for the management of rHE.

62 RADIOLOGY AND NUCLEAR MEDICINE↗