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 793 records · Page 44

Synchronized multiartifact reduction with tomographic reconstruction (SMART-RECON): A statistical model based iterative image reconstruction method to eliminate limited-view artifacts and to mitigate the temporal-average artifacts in time-resolved CT

Purpose: In x-ray computed tomography (CT), a violation of the Tuy data sufficiency condition leads to limited-view artifacts. In some applications, it is desirable to use data corresponding to a narrow temporal window to reconstruct images with reduced temporal-average artifacts. However, the need to reduce temporal-average artifacts in practice may result in a violation of the Tuy condition and thus undesirable limited-view artifacts. In this paper, the authors present a new iterative reconstruction method, synchronized multiartifact reduction with tomographic reconstruction (SMART-RECON), to eliminate limited-view artifacts using data acquired within an ultranarrow temporal window that severely violates the Tuy condition. Methods: In time-resolved contrast enhanced CT acquisitions, image contrast dynamically changes during data acquisition. Each image reconstructed from data acquired in a given temporal window represents one time frame and can be denoted as an image vector. Conventionally, each individual time frame is reconstructed independently. In this paper, all image frames are grouped into a spatial–temporal image matrix and are reconstructed together. Rather than the spatial and/or temporal smoothing regularizers commonly used in iterative image reconstruction, the nuclear norm of the spatial–temporal image matrix is used in SMART-RECON to regularize the reconstruction of all image time frames. This regularizer exploits the low-dimensional structure of the spatial–temporal image matrix to mitigate limited-view artifacts when an ultranarrow temporal window is desired in some applications to reduce temporal-average artifacts. Both numerical simulations in two dimensional image slices with known ground truth and in vivo human subject data acquired in a contrast enhanced cone beam CT exam have been used to validate the proposed SMART-RECON algorithm and to demonstrate the initial performance of the algorithm. Reconstruction errors and temporal fidelity of the reconstructed images were quantified using the relative root mean square error (rRMSE) and the universal quality index (UQI) in numerical simulations. The performance of the SMART-RECON algorithm was compared with that of the prior image constrained compressed sensing (PICCS) reconstruction quantitatively in simulations and qualitatively in human subject exam. Results: In numerical simulations, the 240{sup ∘} short scan angular span was divided into four consecutive 60{sup ∘} angular subsectors. SMART-RECON enables four high temporal fidelity images without limited-view artifacts. The average rRMSE is 16% and UQIs are 0.96 and 0.95 for the two local regions of interest, respectively. In contrast, the corresponding average rRMSE and UQIs are 25%, 0.78, and 0.81, respectively, for the PICCS reconstruction. Note that only one filtered backprojection image can be reconstructed from the same data set with an average rRMSE and UQIs are 45%, 0.71, and 0.79, respectively, to benchmark reconstruction accuracies. For in vivo contrast enhanced cone beam CT data acquired from a short scan angular span of 200{sup ∘}, three 66{sup ∘} angular subsectors were used in SMART-RECON. The results demonstrated clear contrast difference in three SMART-RECON reconstructed image volumes without limited-view artifacts. In contrast, for the same angular sectors, PICCS cannot reconstruct images without limited-view artifacts and with clear contrast difference in three reconstructed image volumes. Conclusions: In time-resolved CT, the proposed SMART-RECON method provides a new method to eliminate limited-view artifacts using data acquired in an ultranarrow temporal window, which corresponds to approximately 60{sup ∘} angular subsectors.

60 APPLIED LIFE SCIENCES↗

A pure-sampling quantum Monte Carlo algorithm

The objective of pure-sampling quantum Monte Carlo is to calculate physical properties that are independent of the importance sampling function being employed in the calculation, save for the mismatch of its nodal hypersurface with that of the exact wave function. To achieve this objective, we report a pure-sampling algorithm that combines features of forward walking methods of pure-sampling and reptation quantum Monte Carlo (RQMC). The new algorithm accurately samples properties from the mixed and pure distributions simultaneously in runs performed at a single set of time-steps, over which extrapolation to zero time-step is performed. In a detailed comparison, we found RQMC to be less efficient. It requires different sets of time-steps to accurately determine the energy and other properties, such as the dipole moment. We implement our algorithm by systematically increasing an algorithmic parameter until the properties converge to statistically equivalent values. As a proof in principle, we calculated the fixed-node energy, static α polarizability, and other one-electron expectation values for the ground-states of LiH and water molecules. These quantities are free from importance sampling bias, population control bias, time-step bias, extrapolation-model bias, and the finite-field approximation. We found excellent agreement with the accepted values for the energy and a variety of other properties for those systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Interlocked optimization and fast gradient algorithm for a seismic inverse problem

Highlights: {yields} A 2D extension of the 1D nonlinear inversion of well-seismic data is given. {yields} Appropriate regularization yields a well-determined large scale inverse problem. {yields} An interlocked optimization loop acts as an efficient preconditioner. {yields} The adjoint state method is used to compute the misfit function gradient. {yields} Domain decomposition method yields an efficient parallel implementation. - Abstract: We give a nonlinear inverse method for seismic data recorded in a well from sources at several offsets from the borehole in a 2D acoustic framework. Given the velocity field, approximate values of the impedance are recovered. This is a 2D extension of the 1D inversion of vertical seismic profiles . The inverse problem generates a large scale undetermined ill-conditioned problem. Appropriate regularization terms render the problem well-determined. An interlocked optimization algorithm yields an efficient preconditioning. A gradient algorithm based on the adjoint state method and domain decomposition gives a fast parallel numerical method. For a realistic test case, convergence is attained in an acceptable time with 128 processors.

97 MATHEMATICS AND COMPUTING↗

SU-F-I-63: Relaxation Times of Lipid Resonances in NAFLD Animal Model Using Enhanced Curve Fitting

Purpose: The objective of this study is to evaluate the relaxation time of methylene resonance in comparison with other lipid resonances. Methods: The examinations were performed on a 3.0T MRI scanner using a four-channel animal coil. Eight more Sprague-Dawley rats in the same baseline weight range were housed with ad libitum access to water and a high-fat (HF) diet (60% fat, 20% protein, and 20% carbohydrate). In order to avoid large blood vessels, a voxel (0.8×0.8×0.8 cm{sup 3}) was placed in a homogeneous area of the liver parenchyma during free breathing. Lipid relaxations in NC and HF diet rats were estimated at a fixed repetition time (TR) of 6000 msec, and multi echo time (TEs) of 40–220 msec. All spectra for data measurement were processed using the Advanced Method for Accurate, Robust, and Efficient Spectral (AMARES) fitting algorithm of the Java-based Magnetic Resonance User Interface (jMRUI) package. Results: The mean T2 relaxation time of the methylene resonance in normal-chow diet was 37.1 msec (M{sub 0}, 2.9±0.5), with a standard deviation of 4.3 msec. The mean T2 relaxation time of the methylene resonance was 31.4 msec (M{sub 0}, 3.7±0.3), with a standard deviation of 1.8 msec. The T2 relaxation times of methylene protons were higher in normal-chow diet rats than in HF rats (p<0.05), and the extrapolated M{sub 0} values were higher in HF rats than in NC rats (p<0.005). The excellent linear fit with R{sup 2}>0.9971 and R{sup 2}>0.9987 indicates T2 relaxation decay curves with mono-exponential function. Conclusion: In in vivo, a sufficient spectral resolution and a sufficiently high signal-to-noise ratio (SNR) can be achieved, so that the data measured over short TE values can be extrapolated back to TE = 0 to produce better estimates of the relative weights of the spectral components. In the short term, treating the effective decay rate as exponential is an adequate approximation.

60 APPLIED LIFE SCIENCES↗

Data-driven Distributed Learning of Multi-agent Systems: A Koopman Operator Approach

Koopman operator theory provides a model-free technique for studying nonlinear dynamical systems purely from data. Since the Koopman operator is infinite-dimensional, researchers have developed several methods that provide a finite-dimensional approximation of the Koopman operator so that it can be applied for practical use cases. One common thing with most of the methods is that their solutions are obtained by solving a centralized minimization problem. In this work, we treat the dynamical system to be a multi-agent system and propose an algorithm to compute the finite-dimensional approximation of the Koopman operator in a distributed manner using the knowledge of the topology of the underlying multi-agent system. The proposed distributed approach is shown to be equivalent to the centralized learning problem and results in a sparse Koopman whose block structure mimics the Laplacian of the multi-agent system. Extensive simulation studies illustrate the proposed framework on the network of oscillators and the IEEE 68 bus system.

Nandanoori, Sai Pushpak↗

Data-Centric Approach to Capture Non-Polynomial Nonlinear Dynamics

We propose an analytical construction of observable functions in the extended dynamic mode decomposition (EDMD) algorithm. EDMD is a numerical method for approximating the spectral properties of the Koopman operator. The choice of observable functions is fundamental for applying EDMD to nonlinear problems arising in systems and control. Existing methods either start from a set of dictionary functions and look for the subset that best fits the underlying nonlinear dynamics or rely on machine learning algorithms to “learn” observable functions. Conversely, in this paper, we start from the dynamical system model and lift it through the Lie derivatives, rendering it into a polynomial form. This proposed transformation into a polynomial form is exact and provides an adequate set of observable functions. The strength of the proposed approach is its applicability to a broader class of nonlinear dynamical systems, particularly those with nonpolynomial functions and compositions thereof. Moreover, it retains the physical interpretability of the underlying dynamical system and can be readily integrated into existing numerical libraries. We demonstrate the proposed approach with an application to electric power systems. The modeled system consists of a single generator connected to an infinite bus, where nonlinear terms include sine and cosine functions. The results demonstrate the effectiveness of the proposed procedure in off-attractor nonlinear dynamics for estimation and prediction; the observable functions obtained from the proposed construction outperform methods that use dictionary functions comprising monomials or radial basis functions.

extended dynamic mode decomposition↗

Implementation of a symmetric boundary integral formulation for cohesive cracks in homogeneous media and at interfaces

A symmetric boundary integral formulation for cohesive cracks growing in the interior of homogeneous linear elastic isotropic media and/or at interfaces between these media is developed and implemented in a numerical code. The solution of a problem that includes cohesive cracks depends on the cohesive law adopted. In the present work, models based on the concept of free energy density per unit undeformed area are considered. The corresponding constitutive cohesive equations present a softening branch which induces to the problem a potential instability. Thus, the development and implementation of a suitable solution algorithm capable of following the growth of the cohesive zone becomes an important issue. An arc-length control combined with a Newton-Raphson algorithm for iterative solution of nonlinear equations is used. The Boundary Element Method is very attractive for modeling cohesive crack problems as all nonlinearities are located on the boundaries (including the crack boundaries) of linear elastic domains. A Galerkin approximation scheme, applied to a suitable symmetric integral formulation, ensures an easy treatment of cracks in homogeneous media and excellent convergence behavior of the numerical solution. Numerical results for the wedge split test are presented and compared with experimental results available in the literature.

36 MATERIALS SCIENCE↗

A Perturbation Expansion Method to Study Highly Correlated Spins

This paper proposes a new numerical algorithm to study dynamical spin dependent properties of local highly correlated structures. The method consists in diagonalizing a finite cluster containing the many-body terms of the Hamil- tonian and embedding it into the rest of the system, the Em- bedding Cluster Approximation (ECA), combined with Wil- son s ideas of logarithmic discretization of the representa- tion of the Hamiltonian, the Logarithm Discretization Em- bedded Cluster Approximation (LDECA). The physics as- sociated to a dot and a side-coupled double dot connected to leads are discussed in detail.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Higher order treatment on temporal derivative of angular flux for time-dependent MOC

A new kinetic analysis method, whose angular dependence of temporal derivative for angular flux is accurately treated within practical memory requirement, is proposed. The method of characteristics (MOC) is being widely used for reactor analysis thanks to the advances of numerical algorithms and computer hardware. However, the computational resources, i.e., the memory capacity, can be still a crucial problem for rigorous kinetic calculations using MOC. In the straightforward approach for kinetic calculation using MOC, the segment-averaged angular fluxes should be stored on the memory in order to explicitly calculate the temporal derivative of the angular flux, which would require huge memory. Thus, in the conventional kinetic calculation code using MOC, the temporal derivative of the angular flux has been approximated as angularly isotropic in order to reduce the memory requirement (isotropic assumption). However, the approximation error caused by the conventional isotropic assumption has not been thoroughly and quantitatively investigated so far and an accurate kinetic calculation method, which can quantitatively estimate the above approximation error within practical memory storage, has not been developed. The present study tries to address this issue with a newly developed approach. Effect of the approximate treatment for the temporal derivative of angular flux is evaluated through benchmark calculations. (authors)

97 MATHEMATICS AND COMPUTING↗

Nonlinear Fourier analysis for discontinuous conductivities: Computational results

Two reconstruction methods of Electrical Impedance Tomography (EIT) are numerically compared for nonsmooth conductivities in the plane based on the use of complex geometrical optics (CGO) solutions to D-bar equations involving the global uniqueness proofs for Calderón problem exposed in Nachman (1996) [43] and Astala and Päivärinta (2006) [6]: the Astala–Päivärinta theory-based low-pass transport matrix method implemented in Astala et al. (2011) [3] and the shortcut method which considers ingredients of both theories. The latter method is formally similar to the Nachman theory-based regularized EIT reconstruction algorithm studied in Knudsen et al. (2009) [34] and several references from there. New numerical results are presented using parallel computation with size parameters larger than ever, leading mainly to two conclusions as follows. First, both methods can approximate piecewise constant conductivities better and better as the cutoff frequency increases, and there seems to be a Gibbs-like phenomenon producing ringing artifacts. Second, the transport matrix method loses accuracy away from a (freely chosen) pivot point located outside of the object to be studied, whereas the shortcut method produces reconstructions with more uniform quality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamical vertex approximation for many-electron systems with spontaneously broken SU(2) symmetry

We generalize the formalism of the dynamical vertex approximation (DΓA)—a diagrammatic extension of the dynamical mean-field theory (DMFT)—to treat magnetically ordered phases. To this aim, we start by concisely illustrating the many-electron formalism for performing ladder resummations of Feynman diagrams in systems with broken SU(2) symmetry associated to ferromagnetic (FM) or antiferromagnetic (AF) order. We then analyze the algorithmic simplifications introduced by taking the local approximation of the two-particle irreducible vertex functions in the Bethe-Salpeter equations, which defines the ladder implementation of DΓA for magnetic systems. The relation of this assumption with the DMFT limit of large coordination-number/high dimensions is explicitly discussed. As a last step, we derive the expression for the ladder DΓA self-energy in the FM- and AF-ordered phases of the Hubbard model. The physics emerging in the AF-ordered case is explicitly illustrated by means of approximated calculations based on a static mean-field input for DΓA equations. The results obtained capture fundamental aspects of both metallic and insulating ground states of two-dimensional antiferromagnets, providing a reliable compass for future, more extensive applications of our approach. Furthermore, possible routes to further develop diagrammatic-based treatments of magnetic phases in correlated electron systems are briefly outlined in the Conclusions.

2-dimensional systems↗

GUIDING NONLINEAR FORCE-FREE MODELING USING CORONAL OBSERVATIONS: FIRST RESULTS USING A QUASI-GRAD-RUBIN SCHEME

At present, many models of the coronal magnetic field rely on photospheric vector magnetograms, but these data have been shown to be problematic as the sole boundary information for nonlinear force-free field extrapolations. Magnetic fields in the corona manifest themselves in high-energy images (X-rays and EUV) in the shapes of coronal loops, providing an additional constraint that is not at present used as constraints in the computational domain, directly influencing the evolution of the model. This is in part due to the mathematical complications of incorporating such input into numerical models. Projection effects, confusion due to overlapping loops (the coronal plasma is optically thin), and the limited number of usable loops further complicate the use of information from coronal images. We develop and test a new algorithm to use images of coronal loops in the modeling of the solar coronal magnetic field. We first fit projected field lines with those of constant-{alpha} force-free fields to approximate the three-dimensional distribution of currents in the corona along a sparse set of trajectories. We then apply a Grad-Rubin-like iterative technique, which uses these trajectories as volume constraints on the values of {alpha}, to obtain a volume-filling nonlinear force-free model of the magnetic field, modifying a code and method presented by Wheatland. We thoroughly test the technique on known analytical and solar-like model magnetic fields previously used for comparing different extrapolation techniques and compare the results with those obtained by currently available methods relying only on the photospheric data. We conclude that we have developed a functioning method of modeling the coronal magnetic field by combining the line-of-sight component of the photospheric magnetic field with information from coronal images. Whereas we focus on the use of coronal loop information in combination with line-of-sight magnetograms, the method is readily extended to incorporate vector-magnetic data over any part of the photospheric boundary.

79 ASTRONOMY AND ASTROPHYSICS↗

Impulse position control algorithms for nonlinear systems

The article is devoted to the formalization and description of impulse-sliding regime in nonlinear dynamical systems that arise in the application of impulse position controls of a special kind. The concept of trajectory impulse-sliding regime formalized as some limiting network element Euler polygons generated by a discrete approximation of the impulse position control This paper differs from the previously published papers in that it uses a definition of solutions of systems with impulse controls, it based on the closure of the set of smooth solutions in the space of functions of bounded variation. The need for the study of such regimes is the fact that they often arise when parry disturbances acting on technical or economic control system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Local time–space mesh refinement for simulation of elastic wave propagation in multi-scale media

This paper presents an original approach to local time–space grid refinement for the numerical simulation of wave propagation in models with localized clusters of micro-heterogeneities. The main features of the algorithm are –the application of temporal and spatial refinement on two different surfaces; –the use of the embedded-stencil technique for the refinement of grid step with respect to time; –the use of the Fast Fourier Transform (FFT)-based interpolation to couple variables for spatial mesh refinement. The latter makes it possible to perform filtration of high spatial frequencies, which provides stability in the proposed finite-difference schemes. In the present work, the technique is implemented for the finite-difference simulation of seismic wave propagation and the interaction of such waves with fluid-filled fractures and cavities of carbonate reservoirs. However, this approach is easy to adapt and/or combine with other numerical techniques, such as finite elements, discontinuous Galerkin method, or finite volumes used for approximation of various types of linear and nonlinear hyperbolic equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Random Forests and Networks Analysis

Wilson (Proceedings of the twenty-eight annual acm symposium on the theory of computing, pp. 296–303, 1996) in the 1990s described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works (Avena and Gaudillière in A proof of the transfer-current theorem in absence of reversibility, in Stat. Probab. Lett. 142, 17–22 (2018); Avena and Gaudillière in J Theor Probab, 2017. https://doi.org/10.1007/s10959-017-0771-3 ; Avena et al. in Approximate and exact solutions of intertwining equations though random spanning forests, 2017. arXiv:1702.05992v1 ; Avena et al. in Intertwining wavelets or multiresolution analysis on graphs through random forests, 2017. arXiv:1707.04616 , to appear in ACHA (2018)) we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational part on determinantal structures and efficient sampling procedures is followed by four main applications: (1) a random-walk-based notion of well-distributed points in a graph, (2) a framework to describe metastable-like dynamics in finite settings by means of Markov intertwining dualities, (3) coarse graining schemes for networks and associated processes, (4) wavelets-like pyramidal algorithms for graph signals.

97 MATHEMATICS AND COMPUTING↗

THE TIME DOMAIN SPECTROSCOPIC SURVEY: VARIABLE SELECTION AND ANTICIPATED RESULTS

We present the selection algorithm and anticipated results for the Time Domain Spectroscopic Survey (TDSS). TDSS is an Sloan Digital Sky Survey (SDSS)-IV Extended Baryon Oscillation Spectroscopic Survey (eBOSS) subproject that will provide initial identification spectra of approximately 220,000 luminosity-variable objects (variable stars and active galactic nuclei across 7500 deg{sup 2} selected from a combination of SDSS and multi-epoch Pan-STARRS1 photometry. TDSS will be the largest spectroscopic survey to explicitly target variable objects, avoiding pre-selection on the basis of colors or detailed modeling of specific variability characteristics. Kernel Density Estimate analysis of our target population performed on SDSS Stripe 82 data suggests our target sample will be 95% pure (meaning 95% of objects we select have genuine luminosity variability of a few magnitudes or more). Our final spectroscopic sample will contain roughly 135,000 quasars and 85,000 stellar variables, approximately 4000 of which will be RR Lyrae stars which may be used as outer Milky Way probes. The variability-selected quasar population has a smoother redshift distribution than a color-selected sample, and variability measurements similar to those we develop here may be used to make more uniform quasar samples in large surveys. The stellar variable targets are distributed fairly uniformly across color space, indicating that TDSS will obtain spectra for a wide variety of stellar variables including pulsating variables, stars with significant chromospheric activity, cataclysmic variables, and eclipsing binaries. TDSS will serve as a pathfinder mission to identify and characterize the multitude of variable objects that will be detected photometrically in even larger variability surveys such as Large Synoptic Survey Telescope.

79 ASTRONOMY AND ASTROPHYSICS↗

Linear scaling solution of the time-dependent self-consistent-field equations with quasi-independent Rayleigh quotient iteration

An algorithm for solution of the Time-Dependent Self-Consistent-Field (TD-SCF) equations is developed, based on dual solution channels for non-linear optimization of the Tsiper functional [J.Phys.B, 34 L401 (2001)]. This formulation poses the TD-SCF problem as two Rayleigh quotients, coupled weakly through biorthogonality. Convergence rates for the Random Phase Approximation (RPA) are found to be equivalent to the Tamm-Dancoff approximation (TDA). Moreover, the variational nature of the quotient is robust to approximation errors, allowing linear scaling solution to the bulk limit of the RPA matrix-eigenvalue and exchange operator problem for molecular wires with extended conjugation, including polyphenylene vinylene and the (4,3) nanotube.

74 ATOMIC AND MOLECULAR PHYSICS↗

Automated Mapping of a Plane Curvilinear Contour by a Smooth Set of Arcs in Rotary and Deep Extrusion

The use of smooth continuous approximating curves consisting of arcs of circles to solve production problems is considered. A relatively simple and efficient recurrent algorithm is developed for use with Kompas-3D, MS Excel, and other software. The algorithm is based on the property of the bisector of a triangle. An analytical form of the approximating curve is determined. A real-time graphic interactive interface in Kompas-3D software is derived. Some irregular mapping situations are described. Practical results are outlined.

42 ENGINEERING↗