Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization, inverse problems”

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 271 records · Page 15

Deep learning for accelerated all-dielectric metasurface design

Deep learning has risen to the forefront of many fields in recent years, overcoming challenges previously considered intractable with conventional means. Materials discovery and optimization is one such field, but significant challenges remain, including the requirement of large labeled datasets and one-to-many mapping that arises in solving the inverse problem. Here we demonstrate modeling of complex all-dielectric metasurface systems with deep neural networks, using both the metasurface geometry and knowledge of the underlying physics as inputs. Our deep learning network is highly accurate, achieving an average mean square error of only 1.16 × 10 -3 and is over five orders of magnitude faster than conventional electromagnetic simulation software. We further develop a novel method to solve the inverse modeling problem, termed fast forward dictionary search (FFDS), which offers tremendous controls to the designer and only requires an accurate forward neural network model. These techniques significantly increase the viability of more complex all-dielectric metasurface designs and provide opportunities for the future of tailored light matter interactions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Guided search for desired functional responses via Bayesian optimization of generative model: Hysteresis loop shape engineering in ferroelectrics

Advances in theoretical modeling across multiple disciplines have yielded generative models capable of high veracity in predicting macroscopic functional responses of materials emerging as a result of complex non-local interactions. Correspondingly, of interest is the inverse problem of finding the model parameter that will yield desired macroscopic responses, such as stress–strain curves, ferroelectric hysteresis loops, etc. Here, we suggest and implement Gaussian process based methods that allow to effectively sample the degenerate parameter space of a complex non-local model to output regions of parameter space which yield desired functionalities. In this work, we discuss the specific adaptation of the acquisition function and sampling function to make the process efficient and balance the efficient exploration of parameter space for multiple possible minima and exploitation to densely sample the regions of interest where target behaviors are optimized. Additionally, this approach is illustrated via the hysteresis loop engineering in ferroelectric materials but can be adapted to other functionalities and generative models.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Inverse point source location with the Helmholtz equation on a bounded domain

The problem of recovering acoustic sources, more specifically monopoles, from point-wise measurements of the corresponding acoustic pressure at a limited number of frequencies is addressed. To this purpose, a family of sparse optimization problems in measure space in combination with the Helmholtz equation on a bounded domain is considered in this study. A weighted norm with unbounded weight near the observation points is incorporated into the formulation. Optimality conditions and conditions for recovery in the small noise case are discussed, which motivates concrete choices of the weight. The numerical realization is based on an accelerated conditional gradient method in measure space and a finite element discretization.

97 MATHEMATICS AND COMPUTING↗

ELSI: A unified software interface for Kohn–Sham electronic structure solvers

Solving the electronic structure from a generalized or standard eigenproblem is often the bottleneck in large scale calculations based on Kohn-Sham density-functional theory. This problem must be addressed by essentially all current electronic structure codes, based on similar matrix expressions, and by high-performance computation. We here present a unified software interface, ELSI, to access different strategies that address the Kohn-Sham eigenvalue problem. Currently supported algorithms include the dense generalized eigensolver library ELPA, the orbital minimization method implemented in libOMM, and the pole expansion and selected inversion (PEXSI) approach with lower computational complexity for semilocal density functionals. The ELSI interface aims to simplify the implementation and optimal use of the different strategies, by offering (a) a unified software framework designed for the electronic structure solvers in Kohn-Sham density-functional theory; (b) reasonable default parameters for a chosen solver; (c) automatic conversion between input and internal working matrix formats, and in the future (d) recommendation of the optimal solver depending on the specific problem. As a result, comparative benchmarks are shown for system sizes up to 11,520 atoms (172,800 basis functions) on distributed memory supercomputing architectures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Double sweep preconditioner for optimized Schwarz methods applied to the Helmholtz problem

This paper presents a preconditioner for non-overlapping Schwarz methods applied to the Helmholtz problem. Starting from a simple analytic example, we show how such a preconditioner can be designed by approximating the inverse of the iteration operator for a layered partitioning of the domain. The preconditioner works by propagating information globally by concurrently sweeping in both directions over the subdomains, and can be interpreted as a coarse grid for the domain decomposition method. The resulting algorithm is shown to converge very fast, independently of the number of subdomains and frequency. The preconditioner has the advantage that, like the original Schwarz algorithm, it can be implemented as a matrix-free routine, with no additional preprocessing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A mixed, unified forward/inverse framework for earthquake problems: fault implementation and coseismic slip estimate

SUMMARY We introduce a new finite-element (FE) based computational framework to solve forward and inverse elastic deformation problems for earthquake faulting via the adjoint method. Based on two advanced computational libraries, FEniCS and hIPPYlib for the forward and inverse problems, respectively, this framework is flexible, transparent and easily extensible. We represent a fault discontinuity through a mixed FE elasticity formulation, which approximates the stress with higher order accuracy and exposes the prescribed slip explicitly in the variational form without using conventional split node and decomposition discrete approaches. This also allows the first order optimality condition, that is the vanishing of the gradient, to be expressed in continuous form, which leads to consistent discretizations of all field variables, including the slip. We show comparisons with the standard, pure displacement formulation and a model containing an in-plane mode II crack, whose slip is prescribed via the split node technique. We demonstrate the potential of this new computational framework by performing a linear coseismic slip inversion through adjoint-based optimization methods, without requiring computation of elastic Green’s functions. Specifically, we consider a penalized least squares formulation, which in a Bayesian setting—under the assumption of Gaussian noise and prior—reflects the negative log of the posterior distribution. The comparison of the inversion results with a standard, linear inverse theory approach based on Okada’s solutions shows analogous results. Preliminary uncertainties are estimated via eigenvalue analysis of the Hessian of the penalized least squares objective function. Our implementation is fully open-source and Jupyter notebooks to reproduce our results are provided. The extension to a fully Bayesian framework for detailed uncertainty quantification and non-linear inversions, including for heterogeneous media earthquake problems, will be analysed in a forthcoming paper.

58 GEOSCIENCES↗

Interim report on fuel cycle neutronics code development.

As part of the Global Nuclear Energy Partnership (GNEP), a fast reactor simulation program was launched in April 2007 to develop a suite of modern simulation tools specifically for the analysis and design of sodium cooled fast reactors. The general goal of the new suite of codes is to reduce the uncertainties and biases in the various areas of reactor design activities by enhanced prediction capabilities. Under this fast reactor simulation program, a high-fidelity deterministic neutron transport code named UNIC is being developed. The final objective is to produce an integrated, advanced neutronics code that allows the high fidelity description of a nuclear reactor and simplifies the multi-step design process by direct coupling with thermal-hydraulics and structural mechanics calculations. Currently there are three solvers for the neutron transport code incorporated in UNIC: PN2ND, SN2ND, and MOCFE. PN2ND is based on a second-order even-parity spherical harmonics discretization of the transport equation and its primary target area of use is the existing homogenization approaches that are prevalent in reactor physics. MOCFE is based upon the method of characteristics applied to an unstructured finite element mesh and its primary target area of use is the fine grained nature of the explicit geometrical problems which is the long term goal of this project. SN2ND is based on a second-order, even-parity discrete ordinates discretization of the transport equation and its primary target area is the modeling transition region between the PN2ND and MOCFE solvers. The major development goal in fiscal year 2008 for the MOCFE solver was to include a two-dimensional capability that is scalable to hundreds of processors. The short term goal of this solver is to solve two-dimensional representations of reactor systems such that the energy and spatial self-shielding are accounted for and reliable cross sections can be generated for the homogeneous calculations. In this report we present good results for an OECD benchmark obtained using the new two-dimensional capability of the MOCFE solver. Additional work on the MOCFE solver is focused on studying the current parallelization algorithms that can be applied to both the two- and three-dimensional implementations such that they are scalable to thousands of processors. The initial research into this topic indicates that, as expected, the current parallelization scheme is not sufficiently scalable for the detailed reactor geometry that it is intended for. As a consequence, we are starting the investigative research to determine the alternatives that are applicable for massively parallel machines. The major development goal in fiscal year 2008 for the PN2ND and SN2ND solvers was to introduce parallelism by angle and energy. The motivation for this is two-fold: (1) reduce the memory burden by picking a simpler preconditioner with reduced matrix storage and (2) improve parallel performance by solving the angular subsystems of the within group equation simultaneously. The solver development in FY2007 focused on using PETSc to solve the within group equation where only spatial parallelization was utilized. Because most homogeneous problems required relatively few spatial degrees of freedom (tens of thousands) the only way to improve the parallelism was to spread the angular moment subsystems across the parallel system. While the coding has been put into place for parallelization by space, angle, and group, we have not optimized any of the solvers and therefore do not give an assessment of the achievement of this work in this report. The immediate task to be completed is to implement and validate Tchebychev acceleration of the fission source iteration algorithm (inverse power method in this work) and optimize both the PN2ND and SN2ND solvers. We further intend to extend the applicability of the UNIC code by adding a first-order discrete ordinates solver termed SN1ST. Upon completion of this work, all memory usage problems are to be identified and studied in the solvers with the intent of making the new version of an exportable production code in either FY2008 or FY2009. This report covers the status of these tasks and discusses the work yet to be completed.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Transient Storage Model Parameter Optimization Using the Simulated Annealing Method

Hyporheic exchange in streams is critical to ecosystem functions such as nutrient cycling along river corridors, especially for slowly moving or small stream systems. The transient storage model (TSM) has been widely used for modeling of hyporheic exchange. TSM calibration, for hyporheic exchange, is typically used to estimate four parameters, including the mass exchange rate coefficient, the dispersion coefficient, stream cross-sectional area, and hyporheic zone cross-sectional area. Prior studies have raised concerns regarding the non-uniqueness of the inverse problem for the TSM, that is, the occurrence of different parameter vectors resulting in TSM solution that reproduces the observed in-stream tracer break through curve (BTC) with the same error. This leads to practical non-identifiability in determining the unknown parameter vector values even when global-optimal values exist, and the parameter optimization becomes practically non-unique. To address this problem, we applied the simulated annealing method to calibrate the TSM to BTCs, because it is less susceptible to local minima-induced non-identifiability. A hypothetical (or synthetic) tracer test data set with known parameters was developed to demonstrate the capability of the simulated annealing method to find the global minimum parameter vector, and it identified the “hypothetically-true” global minimum parameter vector even with input data that were modified with up to 10% noise without increasing the number of iterations required for convergence. The simulated annealing TSM was then calibrated using two in-stream tracer tests conducted in East Fork Poplar Creek, Tennessee. In conclusion, simulated annealing was determined to be appropriate for quantifying the TSM parameter vector because of its search capability for the global minimum parameter vector.

54 ENVIRONMENTAL SCIENCES↗

Characterization of zinc oxide thin film using atomic force microscopy and optimized X-ray reflectivity by genetic algorithm

For the nanostructured thin films, the study of surface physical parameters is often of crucial importance. For example, the transport properties of ZnO thin film are strongly affected by the geometry of this film. In this study sol—gel ZnO thin film was spin coated on glass substrate. The inverse problem of thin film characterization is formulated as a parameter identification problem in which a set of parameters corresponding to the thin film property can be found by minimizing fitness functions formulated using theoretical and experimental X-ray reflectivity. Atomic force microscopy (AFM) measurements used as an independent procedure for extracting structural parameters of the film and accurate interpretation of X-ray reflectivity data. After applying Fractal calculations on the AFM measured data the Genetic algorithm (GA) method was applied for extracting other important structural parameters. Optimization of specular X-ray reflectivity by GA method gives information along the depth such as thickness, roughness, and electron density profile of layers in the film.

36 MATERIALS SCIENCE↗

An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems

We consider an inverse quadratic programming (QP) problem in which the parameters in the objective function of a given QP problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a minimization problem with a positive semidefinite cone constraint and its dual is a linearly constrained semismoothly differentiable (SC{sup 1}) convex programming problem with fewer variables than the original one. We demonstrate the global convergence of the augmented Lagrangian method for the dual problem and prove that the convergence rate of primal iterates, generated by the augmented Lagrange method, is proportional to 1/r, and the rate of multiplier iterates is proportional to 1/{radical}r, where r is the penalty parameter in the augmented Lagrangian. As the objective function of the dual problem is a SC{sup 1} function involving the projection operator onto the cone of symmetrically semi-definite matrices, the analysis requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and properties of the projection operator in the symmetric-matrix space. Furthermore, the semismooth Newton method with Armijo line search is applied to solve the subproblems in the augmented Lagrange approach, which is proven to have global convergence and local quadratic rate. Finally numerical results, implemented by the augmented Lagrangian method, are reported.

97 MATHEMATICS AND COMPUTING↗

Approximate solutions of acoustic 3D integral equation and their application to seismic modeling and full-waveform inversion

Over the recent decades, a number of fast approximate solutions of Lippmann–Schwinger equation, which are more accurate than classic Born and Rytov approximations, were proposed in the field of electromagnetic modeling. Those developments could be naturally extended to acoustic and elastic fields; however, until recently, they were almost unknown in seismology. This paper presents several solutions of this kind applied to acoustic modeling for both lossy and lossless media. We evaluated the numerical merits of those methods and provide an estimation of their numerical complexity. In our numerical realization we use the matrix-free implementation of the corresponding integral operator. We study the accuracy of those approximate solutions and demonstrate, that the quasi-analytical approximation is more accurate, than the Born approximation. Further, we apply the quasi-analytical approximation to the solution of the inverse problem. It is demonstrated that, this approach improves the estimation of the data gradient, comparing to the Born approximation. The developed inversion algorithm is based on the conjugate-gradient type optimization. Numerical model study demonstrates that the quasi-analytical solution significantly reduces computation time of the seismic full-waveform inversion. We also show how the quasi-analytical approximation can be extended to the case of elastic wavefield.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A refined assessment of nuclear data target accuracy requirements for ALFRED

The interest in target accuracy assessment has been recently renewed within the OECD/NEA Working Party on International Nuclear Data Evaluation Cooperation with an update exercise, thanks to the invaluable initiative of Massimo Salvatores. This work, moving from evaluations on the main core integral parameters of the Advanced Lead-cooled Fast Reactor European Demonstrator (ALFRED), and the identification of the associated target accuracies needed for improving its design, approaches the retrieval of target accuracy requirements for nuclear data, as the inverse problem of uncertainty quantification. The preliminary results obtained in a previous work are here refined by explicitly taking into account the total contribution due to correlations among variables in the optimization constraint, while its various components are evaluated individually. Moreover, three different sets of cost parameters are considered to introduce a bias in the solution in order to take in due account the relative difficulties in the execution of new differential experiments as needed for achieving the proposed target accuracies. By this, the obtained results are deemed usefully informative, and proposed for the update of a High Priority List which identifies the isotopes-reaction couples of most interest for future refinement experiments, especially when integrated with further analogous information collected on other advanced nuclear systems. Among the cross-sections whose refinement contributes the most to the reduction of the multiplication factor, the fission of Pu{sup 239} was found, which needs to be fixed below 1% in the range of interest for ALFRED (2 keV-4 MeV). Another contribution for the amelioration of the multiplication factor calculation accuracy, is due to the capture channel of Pu{sup 239}, for which the initial high uncertainty (around 15%) can be significantly reduced resorting to easily practicable experiments. The same occurs for the inelastic of Pb{sup 207}, for which the initial uncertainty value of around 50% can be drastically reduced up to target values between 4% and 7%.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A special generalized HSS method for discrete ill-posed problems

In this paper, we use a new special generalized Hermitian and skew-Hermitian splitting (SGHSS) method for solving ill-posed inverse problems. Based on an augmented system formulation, we apply a new splitting for the Hermitian part of the coefficient matrix and discuss on the convergence of this iterative method. Moreover, the optimal parameter minimizing the spectral radius of iteration matrix is derived. Finally, we present some numerical examples to demonstrate the performance of the presented method.

97 MATHEMATICS AND COMPUTING↗

An analysis of the spatio-temporal resolution of the immersed boundary method with direct forcing

The immersed boundary method (IBM) with direct forcing is very popular in the simulation of rigid particulate flows. In the IBM, an interaction force is introduced at the interface between fluid and particle in order to approximate the no-slip boundary condition. The interaction force is calculated through dividing the velocity difference (or error) between fluid and particle at the interface by the time step. Here, a dynamic equation for the velocity difference is derived. Additionally, analyses on the dynamic equation provide a few new findings: (i) The interaction force is the solution of a least-squares error problem, with the direct implication that the Lagrangian marker distribution has no effect on the large scale flow structure once the distribution of Lagrangian markers become saturated along the interface (i.e., each marker remains properly correlated with all its neighbors); (ii) The Lagrangian volume-weight is a relaxation factor to control how fast the velocity error decays to the ideal value of zero; (iii) The optimal choice of the Lagrangian volume-weight is the largest value permissible by a stability condition. A comprehensive convergence analysis with regard to the spatial and temporal resolution is presented for the velocity error and also for the shear-stress and surface pressure. In three simple canonical problems, it is analytically and numerically shown that the IBM results converge to the theoretical solutions obtained with precise imposition of no-slip and no-penetration boundary conditions. It is observed that it is not necessary to match the Lagrangian marker volume-weight to that of the local Eulerian cell volume and in fact this matching leads to lower than optimal computational efficiency. However, it is found that extremely high Eulerian grid resolution and small time step have to be used to obtain high precision simulation results. Especially, the time step should be inversely proportional to the particle Reynolds number for low Reynolds number flows. For high frequency oscillation problems, the grid size needs to be reduced by a factor of the square root of the frequency, and the time step to be reduced by a factor of the frequency. The theoretical findings here can be used to alleviate the technical difficulties in simulating non-spherical particles by not requiring the Lagrangian marker distribution to match the Eulerian grids and also in the implementation of IBM on non-uniform Eulerian grids. The present work also provides simple practical guidance on the choice of temporal and spatial resolution so as to control the simulation error a priori.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Refracting Roentgen's rays: Propagation-based x-ray phase contrast for biomedical imaging

Absorption-contrast x-ray imaging serves to visualize the variation in x-ray attenuation within the volume of a given sample, whereas phase contrast allows one to visualize variations in x-ray refractive index. The former imaging mechanism has been well known and widely utilized since the time of Roentgen's Nobel prize winning work, whereas the latter mechanism--sought for, but not found, by Roentgen himself--has laid the foundation for a revolution in x-ray imaging which is the central topic of this review. We consider the physical imaging mechanisms underlying both absorption contrast and phase contrast, together with the associated inverse problem of how one may obtain quantitative two- or three-dimensional information regarding a sample, given one or more phase-contrast images of the same. Practical questions are considered, regarding optimized phase-contrast imaging geometries as a function of detector resolution, source size, x-ray spectrum, and dose. Experimental examples pertaining to biomedical applications are given, and prospects for the future outlined.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Improved Bayesian regularization of inverse problems in vibrations and acoustics using noise-only measurements

Here, this paper studies Tikhonov regularization (ridge regression) parameter selection for problems in vibrations and acoustics. The selection method is based on a popular Bayesian method, but it incorporates measurements of sensor noise. The regularization parameter is closely related to the ratio of system input energy to noise energy, so noise measurements inform the inference procedure and improve parameter identification. In cases where standard Bayesian regularization identifies zero as the optimal regularization parameter, noise measurements guarantee a unique nonzero optimum. Sufficient theoretical criteria are developed for this guarantee. The method is verified in even-determined and under-determined configurations in an acoustic source localization simulation and a vibration load identification experiment. It is shown to yield significant improvements over existing empirical Bayesian regularization. Improvements are larger in the even-determined case and smaller in the under-determined case, wherein the inverse solution is less sensitive to the regularization parameter.

42 ENGINEERING↗

Extended Lagrangian Born–Oppenheimer molecular dynamics using a Krylov subspace approximation

It is shown how the electronic equations of motion in extended Lagrangian Born–Oppenheimer molecular dynamics simulations can be integrated using low-rank approximations of the inverse Jacobian kernel. This kernel determines the metric tensor in the harmonic oscillator extension of the Lagrangian that drives the evolution of the electronic degrees of freedom. The proposed kernel approximation is derived from a pseudoinverse of a low-rank estimate of the Jacobian, which is expressed in terms of a generalized set of directional derivatives with directions that are given from a Krylov subspace approximation. The approach allows a tunable and adaptive approximation that can take advantage of efficient preconditioning techniques. The proposed kernel approximation for the integration of the electronic equations of motion makes it possible to apply extended Lagrangian first-principles molecular dynamics simulations to a broader range of problems, including reactive chemical systems with numerically sensitive and unsteady charge solutions. This can be achieved without requiring exact full calculations of the inverse Jacobian kernel in each time step or relying on iterative non-linear self-consistent field optimization of the electronic ground state prior to the force evaluations as in regular direct Born–Oppenheimer molecular dynamics. We note the low-rank approximation of the Jacobian is directly related to Broyden’s class of quasi-Newton algorithms and Jacobian-free Newton–Krylov methods and provides a complementary formulation for the solution of nonlinear systems of equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic inverse problems: Models and metrics

In past work, we introduced model-based inverse methods, and applied them to problems in which the anomaly could be reasonably modeled by simple canonical shapes, such as rectangular solids. In these cases the parameters to be inverted would be length, width and height, as well as the occasional probe lift-off or rotation. We are now developing a formulation that allows more flexibility in modeling complex flaws. The idea consists of expanding the flaw in a sequence of basis functions, and then solving for the expansion coefficients of this sequence, which are modeled as independent random variables, uniformly distributed over their range of values. There are a number of applications of such modeling: 1. Connected cracks and multiple half-moons, which we have noted in a POD set. Ideally we would like to distinguish connected cracks from one long shallow crack. 2. Cracks of irregular profile and shape which have appeared in cold work holes during bolt-hole eddy-current inspection. One side of such cracks is much deeper than other. 3. L or C shaped crack profiles at the surface, examples of which have been seen in bolt-hole cracks. By formulating problems in a stochastic sense, we are able to leverage the stochastic global optimization algorithms in NLSE, which is resident in VIC-3D®, to answer questions of global minimization and to compute confidence bounds using the sensitivity coefficient that we get from NLSE. We will also address the issue of surrogate functions which are used during the inversion process, and how they contribute to the quality of the estimation of the bounds.

36 MATERIALS SCIENCE↗