Search NASA⌕ Search

SEARCH · Search NASA

Results for “Inverse problem”

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

Simultaneous time-optimal control of the inversion of two spin-(1/2) particles

We analyze the simultaneous time-optimal control of two-spin systems. The two noncoupled spins, which differ in the value of their chemical offsets, are controlled by the same magnetic fields. Using an appropriate rotating frame, we restrict the study to the case of opposite shifts. We then show that the optimal solution of the inversion problem in a rotating frame is composed of a pulse sequence of maximum intensity and is similar to the optimal solution for inverting only one spin by using a nonresonant control field in the laboratory frame. An example is implemented experimentally using nuclear magnetic resonance techniques.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A persistent adjoint method with dynamic time-scaling and an application to mass action kinetics

In this article, we consider an optimization problem where the objective function is evaluated at the fixed-point of a contraction mapping parameterized by a control variable, and optimization takes place over this control variable. Since the derivative of the fixed-point with respect to the parameter can usually not be evaluated exactly, an adjoint dynamical system can be used to estimate gradients. Using this estimation procedure, the optimization algorithm alternates between derivative estimation and an approximate gradient descent step. We analyze a variant of this approach involving dynamic time-scaling, where after each parameter update the adjoint system is iterated until a convergence threshold is passed. Here, we prove that, under certain conditions, the algorithm can find approximate stationary points of the objective function. We demonstrate the approach in the settings of an inverse problem in chemical kinetics, and learning in attractor networks.

97 MATHEMATICS AND COMPUTING↗

2022 AI Testbed Expeditions Report

By exploiting the coherent properties of a light source, coherent diffraction imaging (CDI) is able to obtain the sample image at a nanoscale resolution using the measured diffraction pattern. Bragg Coherent Diffraction Imaging (BCDI) has become valuable for recovering the displacement and strain field of crystals, providing a valuable tool in material science and solid-state physics. X-ray ptychography is another emerging CDI technique that can produce a high-resolution image of the extended sample and has become popular in many research areas (e.g., materials science, biology, electronics, and optics characterization). CDI including BCDI and ptychography has become an established technique in Synchrotron Facilities including the Advanced Photon Source (APS) and will greatly benefit from the 100x coherent flux increase of the upcoming APS Upgrade (APSU). The current image formation process in CDI employs iterative phase retrieval algorithms, which is a time-consuming and computationally expensive process. Especially after APSU, the traditional iterative methods will not be able to match the experimental data acquisition speed. We employ deep learning (DL) approach to replace the iterative approaches, therefore allowing hundreds of times faster recovery of the object. We developed AutoPhaseNN, a DL-based approach which learns to solve the inverse problem without labeled data. Taking 3D BCDI as a representative technique, AutoPhaseNN has been demonstrated to be one hundred times faster than traditional iterative phase retrieval methods while providing comparable image quality. The current network is trained with 64 x 64 x 64 data size, to achieve higher resolution imaging, we will need to scale the network to input and train/infer 3D arrays of size 256 x 256 x 256 (today) and of size 2560x2560x2560 (APSU). However, the scalability of the network is restricted due to the memory-intensive training process. To perform the training for a 256 x 256 x 256 data size, the required memory exceeds the capacity of the current machine. In this project, we explore using Sambanova system to train the network for the direct data inversion for CDI.

36 MATERIALS SCIENCE↗

Automated treatment planning for a dedicated multi-source intracranial radiosurgery treatment unit using projected gradient and grassfire algorithms

Purpose: The purpose of this work is to develop a framework to the inverse problem for radiosurgery treatment planning on the Gamma Knife{sup Registered-Sign} Perfexion Trade-Mark-Sign (PFX) for intracranial targets. Methods: The approach taken in the present study consists of two parts. First, a hybrid grassfire and sphere-packing algorithm is used to obtain shot positions (isocenters) based on the geometry of the target to be treated. For the selected isocenters, a sector duration optimization (SDO) model is used to optimize the duration of radiation delivery from each collimator size from each individual source bank. The SDO model is solved using a projected gradient algorithm. This approach has been retrospectively tested on seven manually planned clinical cases (comprising 11 lesions) including acoustic neuromas and brain metastases. Results: In terms of conformity and organ-at-risk (OAR) sparing, the quality of plans achieved with the inverse planning approach were, on average, improved compared to the manually generated plans. The mean difference in conformity index between inverse and forward plans was -0.12 (range: -0.27 to +0.03) and +0.08 (range: 0.00-0.17) for classic and Paddick definitions, respectively, favoring the inverse plans. The mean difference in volume receiving the prescribed dose (V{sub 100}) between forward and inverse plans was 0.2% (range: -2.4% to +2.0%). After plan renormalization for equivalent coverage (i.e., V{sub 100}), the mean difference in dose to 1 mm{sup 3} of brainstem between forward and inverse plans was -0.24 Gy (range: -2.40 to +2.02 Gy) favoring the inverse plans. Beam-on time varied with the number of isocenters but for the most optimal plans was on average 33 min longer than manual plans (range: -17 to +91 min) when normalized to a calibration dose rate of 3.5 Gy/min. In terms of algorithm performance, the isocenter selection for all the presented plans was performed in less than 3 s, while the SDO was performed in an average of 215 min. Conclusions: PFX inverse planning can be performed using geometric isocenter selection and mathematical modeling and optimization techniques. The obtained treatment plans all meet or exceed clinical guidelines while displaying high conformity.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A truncated Levenberg-Marquardt algorithm for the calibration of highly parameterized nonlinear models

We propose a modification to the Levenberg-Marquardt minimization algorithm for a more robust and more efficient calibration of highly parameterized, strongly nonlinear models of multiphase flow through porous media. The new method combines the advantages of truncated singular value decomposition with those of the classical Levenberg-Marquardt algorithm, thus enabling a more robust solution of underdetermined inverse problems with complex relations between the parameters to be estimated and the observable state variables used for calibration. The truncation limit separating the solution space from the calibration null space is re-evaluated during the iterative calibration process. In between these re-evaluations, fewer forward simulations are required, compared to the standard approach, to calculate the approximate sensitivity matrix. Truncated singular values are used to calculate the Levenberg-Marquardt parameter updates, ensuring that safe small steps along the steepest-descent direction are taken for highly correlated parameters of low sensitivity, whereas efficient quasi-Gauss-Newton steps are taken for independent parameters with high impact. The performance of the proposed scheme is demonstrated for a synthetic data set representing infiltration into a partially saturated, heterogeneous soil, where hydrogeological, petrophysical, and geostatistical parameters are estimated based on the joint inversion of hydrological and geophysical data.

54 ENVIRONMENTAL SCIENCES↗

BREEDING SUPER-EARTHS AND BIRTHING SUPER-PUFFS IN TRANSITIONAL DISKS

The riddle posed by super-Earths (1–4R{sub ⊕}, 2–20M{sub ⊕}) is that they are not Jupiters: their core masses are large enough to trigger runaway gas accretion, yet somehow super-Earths accreted atmospheres that weigh only a few percent of their total mass. We show that this puzzle is solved if super-Earths formed late, as the last vestiges of their parent gas disks were about to clear. This scenario would seem to present fine-tuning problems, but we show that there are none. Ambient gas densities can span many (in one case up to 9) orders of magnitude, and super-Earths can still robustly emerge after ∼0.1–1 Myr with percent-by-weight atmospheres. Super-Earth cores are naturally bred in gas-poor environments where gas dynamical friction has weakened sufficiently to allow constituent protocores to gravitationally stir one another and merge. So little gas is present at the time of core assembly that cores hardly migrate by disk torques: formation of super-Earths can be in situ. The basic picture—that close-in super-Earths form in a gas-poor (but not gas-empty) inner disk, fed continuously by gas that bleeds inward from a more massive outer disk—recalls the largely evacuated but still accreting inner cavities of transitional protoplanetary disks. We also address the inverse problem presented by super-puffs: an uncommon class of short-period planets seemingly too voluminous for their small masses (4–10R{sub ⊕}, 2–6M{sub ⊕}). Super-puffs most easily acquire their thick atmospheres as dust-free, rapidly cooling worlds outside ∼1 AU where nebular gas is colder, less dense, and therefore less opaque. Unlike super-Earths, which can form in situ, super-puffs probably migrated in to their current orbits; they are expected to form the outer links of mean-motion resonant chains, and to exhibit greater water content. We close by confronting observations and itemizing remaining questions.

79 ASTRONOMY AND ASTROPHYSICS↗

Tackling the curse of dimensionality in fractional and tempered fractional PDEs with physics-informed neural networks

Fractional and tempered fractional partial differential equations (PDEs) are effective models of long-range interactions, anomalous diffusion, and non-local effects. Traditional numerical methods for these problems are mesh-based, thus struggling with the curse of dimensionality (CoD). Physics-informed neural networks (PINNs) offer a promising solution due to their universal approximation, generalization ability, and mesh-free training. In principle, Monte Carlo fractional PINN (MC-fPINN) estimates fractional derivatives using Monte Carlo methods and thus could lift CoD. However, this may cause significant variance and errors, hence affecting convergence; in addition, MC-fPINN is sensitive to hyperparameters. In general, numerical methods and specifically PINNs for tempered fractional PDEs are under-developed. Herein, we extend MC-fPINN to tempered fractional PDEs to address these issues, resulting in the Monte Carlo tempered fractional PINN (MC-tfPINN). To reduce possible high variance and errors from Monte Carlo sampling, we replace the one-dimensional (1D) Monte Carlo with 1D Gaussian quadrature, applicable to both MC-fPINN and MC-tfPINN. We validate our methods on various forward and inverse problems of fractional and tempered fractional PDEs, scaling up to 100,000 dimensions. Our improved MC-fPINN/MC-tfPINN using quadrature consistently outperforms the original versions in accuracy and convergence speed in very high dimensions.

42 ENGINEERING↗

MatCal Users Guide: Release 1.3.0

Any continuum mechanics model will require three components: (1) a discretized geometry of the boundary value problem being studied, (2) the partial differential equations to be solved, and (3) the initial conditions and boundary conditions for the problem. To describe material behavior in these computational models, material models contribute to (2) the underlying equations and, occasionally, to (3) the initial conditions for the simulation. These material models can exhibit a mathematical form that is empirically based, based on first principles, or developed from both empirical observations and known physics. In general, these models are meant to represent a class of materials with well understood behavior. As a result, material models have parameters that must be tuned or calibrated so that the model response matches characterization data available for the specific material it is intended to represent when used to simulate a specific system. For simple models, such as isotropic, linear elastic materials in solid mechanics, this calibration process can be a simple analytical calculation directly extracting the parameters from experimental measurements. For complex models that have many inputs and require many characterization datasets to adequately identify the material behavior, the model calibration process can require an inverse problem approach where an optimization is performed to tune the model parameters to the available data.

36 MATERIALS SCIENCE↗

Imaging in Diagnostic Nuclear Medicine

Single-photon emission computed tomography (SPECT) and positron emission tomography (PET) are modern methods for visualization in diagnostic nuclear medicine. SPECT is known as a workhorse in cardiology, and PET is the gold standard in oncology. The development of nuclear medicine is provided by cooperation of physicists, mathematicians, biologists, medical doctors, and radio-chemists. In spite of extensive clinical applications, several problems may lead to false diagnoses. In particular, the correction of attenuation of gamma radiation in human organs must be taken into account. For interpretation and evaluation of such an effect on the clinical results, we perform physico-mathematical simulation of the SPECT diagnostics in cardiology in the absence and presence of the correction of attenuation. A brief review of the state-of-the art is presented. The simulation employs the first Russian anthropomorphic mathematical phantom that describes the distribution of radio-pharmacological agent ({sup 99m }Tc-methoxyisobutylisonitrile) in chest organs of a typical male patient. A model for calculation of raw images is developed with allowance for attenuation of radiation in biological tissues and the effect of collimator and detector. The results of the proposed models and calculated images are compared with clinical images obtained at the Meshalkin Institute of Circulation Pathology (Novosibirsk) and Myasnikov Institute of Clinical Cardiology (Moscow). Statistical algorithms are developed for the solution of the inverse problem of image reconstruction based on the entropy principle. The clinical and physico-mathematical approaches are compared in the evaluation of the effect of correction on the quality of reconstructed images of the left ventricle of myocardium.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Scalable algorithms for physics-informed neural and graph networks

Physics-informed machine learning (PIML) has emerged as a promising new approach for simulating complex physical and biological systems that are governed by complex multiscale processes for which some data are also available. In some instances, the objective is to discover part of the hidden physics from the available data, and PIML has been shown to be particularly effective for such problems for which conventional methods may fail. Unlike commercial machine learning where training of deep neural networks requires big data, in PIML big data are not available. Instead, we can train such networks from additional information obtained by employing the physical laws and evaluating them at random points in the space–time domain. Such PIML integrates multimodality and multifidelity data with mathematical models, and implements them using neural networks or graph networks. Here, we review some of the prevailing trends in embedding physics into machine learning, using physics-informed neural networks (PINNs) based primarily on feed-forward neural networks and automatic differentiation. For more complex systems or systems of systems and unstructured data, graph neural networks (GNNs) present some distinct advantages, and here we review how physics-informed learning can be accomplished with GNNs based on graph exterior calculus to construct differential operators; we refer to these architectures as physics-informed graph networks (PIGNs). We present representative examples for both forward and inverse problems and discuss what advances are needed to scale up PINNs, PIGNs and more broadly GNNs for large-scale engineering problems.

42 ENGINEERING↗

Confronting the Challenge of Modeling Cloud and Precipitation Microphysics

In the atmosphere, microphysics refers to the microscale processes that affect cloud and precipitation particles and is a key linkage among the various components of Earth’s atmospheric water and energy cycles. The representation of microphysical processes in models continues to pose a major challenge leading to uncertainty in numerical weather forecasts and climate simulations. In this paper, the problem of treating microphysics in models is divided into two parts: i) how to represent the population of cloud and precipitation particles, given the impossibility of simulating all particles individually within a cloud, and ii) uncertainties in the microphysical process rates owing to fundamental gaps in knowledge of cloud physics. The recently-developed Lagrangian particle-based method is advocated as a way to address several conceptual and practical challenges of representing particle populations using traditional bulk and bin microphysics parameterization schemes. For addressing critical gaps in cloud physics knowledge, sustained investment for observational advances from laboratory experiments, new probe development, and next-generation instruments in space is needed. Greater emphasis on laboratory work, which has apparently declined over the past several decades relative to other areas of cloud physics research, is argued to be an essential ingredient for improving process-level understanding. More systematic use of natural cloud and precipitation observations to constrain microphysics schemes is also advocated. Because it is generally difficult to quantify individual microphysical process rates from these observations directly, this presents an inverse problem that can be viewed from the standpoint of Bayesian statistics. Following this idea, a probabilistic framework is proposed that combines elements from statistical and physical modeling. Besides providing rigorous constraint of schemes, there is an added benefit of quantifying uncertainty systematically. Finally, a broader hierarchical approach is proposed to accelerate improvements in microphysics schemes, leveraging the advances described in this paper related to process modeling (using Lagrangian particle-based schemes), laboratory experimentation, cloud and precipitation observations, and statistical methods.

54 ENVIRONMENTAL SCIENCES↗

Joint state-parameter estimation for the reduced fracture model via the united filter

Here, in this paper, we introduce an effective United Filter method for jointly estimating the solution state and physical parameters in flow and transport problems within fractured porous media. Fluid flow and transport in fractured porous media are critical in subsurface hydrology, geophysics, and reservoir geomechanics. Reduced fracture models, which represent fractures as lower-dimensional interfaces, enable efficient multi-scale simulations. However, reduced fracture models also face accuracy challenges due to modeling errors and uncertainties in physical parameters such as permeability and fracture geometry. To address these challenges, we propose a United Filter method, which integrates the Ensemble Score Filter (EnSF) for state estimation with the Direct Filter for parameter estimation. EnSF, based on a score-based diffusion model framework, produces ensemble representations of the state distribution without deep learning. Meanwhile, the Direct Filter, a recursive Bayesian inference method, estimates parameters directly from state observations. The United Filter combines these methods iteratively: EnSF estimates are used to refine parameter values, which are then fed back to improve state estimation. Numerical experiments demonstrate that the United Filter method surpasses the state-of-the-art Augmented Ensemble Kalman Filter, delivering more accurate state and parameter estimation for reduced fracture models. This framework also provides a robust and efficient solution for PDE-constrained inverse problems with uncertainties and sparse observations.

Bayesian inference↗

1-D coupled surface flow and transport equations revisited via the physics-informed neural network approach

The de Saint-Venant equation (SVE) and advection–diffusion equation (ADE) are commonly employed to solve solute transport problems in surface water. In this work, we propose a mesh-free method based on the physics-informed neural network (PINN) to solve the one dimensional (1-D) SVE, ADE, and the coupled SVE and ADE (SVE-ADE) under various initial and boundary conditions. The PINN model extends the architecture of deep neural networks (DNNs) with implementation of loss function, which are additionally subject to constraints imposed by the physical laws of SVE and ADE, along with their initial and boundary conditions. In such a manner, PINNs can be quickly steered to the true solution while obeying the physical laws. The results of PINN model are compared with the analytical and/or numerical solutions under various conditions to investigate its accuracy and efficiency in solving the SVE, ADE, and SVE-ADE. Our results indicate PINN can accurately simulate the shock wave morphology and avoid numerical dissipation in unsteady flow condition. The PINN method outweighed traditional numerical methods in several aspects, including its ability to function with small amounts of data, no grid discretization, and random selection of sampling points, etc. Additionally, the PINN method is also suitable for solving inverse problems with sparse and noisy data. With 1% noise and 2000 initial and boundary condition points (N u ), the errors of the estimated flow rate (v) and diffusion coefficient (D) are 0.003% and 0.105%, respectively, which indicate the accuracy and robustness of the proposed method. Finally, our results indicate the capability and robustness of the proposed PINN methodology for solving multi-physics problems, irrespective of the presence of sparse and noisy data in the training dataset.

54 ENVIRONMENTAL SCIENCES↗

Lossy checkpoint compression in full waveform inversion: a case study with ZFPv0.5.5 and the overthrust model

This paper proposes a new method that combines checkpointing methods with error-controlled lossy compression for large-scale high-performance full-waveform inversion (FWI), an inverse problem commonly used in geophysical exploration. This combination can significantly reduce data movement, allowing a reduction in run time as well as peak memory. In the exascale computing era, frequent data transfer (e.g., memory bandwidth, PCIe bandwidth for GPUs, or network) is the performance bottleneck rather than the peak FLOPS of the processing unit. Like many other adjoint-based optimization problems, FWI is costly in terms of the number of floating-point operations, large memory footprint during backpropagation, and data transfer overheads. Past work for adjoint methods has developed checkpointing methods that reduce the peak memory requirements during backpropagation at the cost of additional floating-point computations. Combining this traditional checkpointing with error-controlled lossy compression, we explore the three-way tradeoff between memory, precision, and time to solution. We investigate how approximation errors introduced by lossy compression of the forward solution impact the objective function gradient and final inverted solution. Empirical results from these numerical experiments indicate that high lossy-compression rates (compression factors ranging up to 100) have a relatively minor impact on convergence rates and the quality of the final solution.

58 GEOSCIENCES↗

Calibration of RAFM Micromechanical Model for Creep Using Bayesian Optimization for Functional Output

A Bayesian optimization procedure is presented for calibrating a multimechanism micromechanical model for creep to experimental data of F82H steel. Reduced activation ferritic martensitic (RAFM) steels based on Fe(8–9)%Cr are the most promising candidates for some fusion reactor structures. Although there are indications that RAFM steel could be viable for fusion applications at temperatures up to 600°C, the maximum operating temperature will be determined by the creep properties of the structural material and the breeder material compatibility with the structural material. Due to the relative paucity of available creep data on F82H steel compared to other alloys such as Grade 91 steel, micromechanical models are sought for simulating creep based on relevant deformation mechanisms. As a point of departure, this work recalibrates a model form that was previously proposed for Grade 91 steel to match creep curves for F82H steel. Due to the large number of parameters (9) and cost of the nonlinear simulations, an automated approach for tuning the parameters is pursued using a recently developed Bayesian optimization for functional output (BOFO) framework (Huang et al., 2021, “Bayesian optimization of functional output in inverse problems,” Optim. Eng., 22, pp. 2553–2574). Incorporating extensions such as batch sequencing and weighted experimental load cases into BOFO, a reasonably small error between experimental and simulated creep curves at two load levels is achieved in a reasonable number of iterations. In conclusion, validation with an additional creep curve provides confidence in the fitted parameters obtained from the automated calibration procedure to describe the creep behavior of F82H steel.

42 ENGINEERING↗

Robust scalable initialization for Bayesian variational inference with multi-modal Laplace approximations

Predictive modeling typically relies on Bayesian model calibration to provide uncertainty quantification. Variational inference utilizing fully independent (“mean-field”) Gaussian distributions are often used as approximate probability density functions. This simplification is attractive since the number of variational parameters grows only linearly with the number of unknown model parameters. However, the resulting diagonal covariance structure and unimodal behavior can be too restrictive to provide useful approximations of intractable Bayesian posteriors that exhibit highly non-Gaussian behavior, including multimodality. High-fidelity surrogate posteriors for these problems can be obtained by considering the family of Gaussian mixtures. Gaussian mixtures are capable of capturing multiple modes and approximating any distribution to an arbitrary degree of accuracy, while maintaining some analytical tractability. Unfortunately, variational inference using Gaussian mixtures with full-covariance structures suffers from a quadratic growth in variational parameters with the number of model parameters. The existence of multiple local minima due to strong nonconvex trends in the loss functions often associated with variational inference present additional complications, These challenges motivate the need for robust initialization procedures to improve the performance and computational scalability of variational inference with mixture models. In this work, we propose a method for constructing an initial Gaussian mixture model approximation that can be used to warm-start the iterative solvers for variational inference. The procedure begins with a global optimization stage in model parameter space. In this step, local gradient-based optimization, globalized through multistart, is used to determine a set of local maxima, which we take to approximate the mixture component centers. Around each mode, a local Gaussian approximation is constructed via the Laplace approximation. Finally, the mixture weights are determined through constrained least squares regression. The robustness and scalability of the proposed methodology is demonstrated through application to an ensemble of synthetic tests using high-dimensional, multimodal probability density functions. Here, the practical aspects of the approach are demonstrated with inversion problems in structural dynamics.

97 MATHEMATICS AND COMPUTING↗

MTUQ: a framework for estimating moment tensors, point forces, and their uncertainties

SUMMARY We introduce MTUQ, an open-source Python package for seismic source estimation and uncertainty quantification, emphasizing flexibility and operational scalability. MTUQ provides MPI-parallelized grid search and global optimization capabilities, compatibility with 1-D and 3-D Green’s function database formats, customizable data processing, C-accelerated waveform and first-motion polarity misfit functions, and utilities for plotting seismic waveforms and visualizing misfit and likelihood surfaces. Applicability to a range of full- and constrained-moment tensor, point force, and centroid inversion problems is possible via a documented application programming interface, accompanied by example scripts and integration tests. We demonstrate the software using three different types of seismic events: (1) a 2009 intraslab earthquake near Anchorage, Alaska; (2) an episode of the 2021 Barry Arm landslide in Alaska; and (3) the 2017 Democratic People’s Republic of Korea underground nuclear test. With these events, we illustrate the well-known complementary character of body waves, surface waves, and polarities for constraining source parameters. We also convey the distinct misfit patterns that arise from each individual data type, the importance of uncertainty quantification for detecting multimodal or otherwise poorly constrained solutions, and the software’s flexible, modular design.

58 GEOSCIENCES↗

An Extended Trajectory Mechanics Approach for Calculating the Path of a Pressure Transient: Derivation and Illustration

Following an approach used in quantum dynamics, an exponential representation of the hydraulic head transforms the diffusion equation governing pressure propagation into an equivalent set of ordinary differential equations. Using a reservoir simulator to determine one set of dependent variables leaves a reduced set of equations for the path of a pressure transient. Unlike the current approach for computing the path of a transient, based on a high-frequency asymptotic solution, the trajectories resulting from this new formulation are valid for arbitrary spatial variations in aquifer properties. For a medium containing interfaces and layers with sharp boundaries, the trajectory mechanics approach produces paths that are compatible with travel time fields produced by a numerical simulator, while the asymptotic solution produces paths that bend too strongly into high permeability regions. The breakdown of the conventional asymptotic solution, due to the presence of sharp boundaries, has implications for model parameter sensitivity calculations and the solution of the inverse problem. For example, near an abrupt boundary, trajectories based on the asymptotic approach deviate significantly from regions of high sensitivity observed in numerical computations. In contrast, paths based on the new trajectory mechanics approach coincide with regions of maximum sensitivity to permeability changes.

42 ENGINEERING↗