Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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 235 records · Page 13

Data-driven efficient network and surveillance-based immunization

Given a contact network and coarse-grained diagnostic information such as electronic Healthcare Reimbursement Claims (eHRC) data, can we develop efficient intervention policies from data to control an epidemic? Immunization is an important problem in multiple areas, especially epidemiology and public health. However, most existing studies rely on assuming prior epidemiological models to develop pre-emptive strategies, which may fail to adapt to the change in new epidemiological patterns and the availability of rich data such as eHRC. In practice, disease spread is usually complicated, hence assuming an underlying model may deviate from true spreading patterns, leading to possibly inaccurate interventions. Additionally, the abundance of health care surveillance data (such as eHRC) makes it possible to study data-driven strategies without too many restrictive assumptions. Therefore, such a data-driven intervention approach can help public-health experts take more practical decisions. In this work, we take into account propagation log and contact networks for controlling propagation. Furthermore, different from previous model-based approaches, our solutions are solely data driven in a sense that we develop immunization strategies directly from the network and eHRC without assuming classical epidemiological models. In particular, we formulate the novel and challenging data-driven immunization problem. To solve it, we first propose an efficient sampling approach to align surveillance data with contact networks, then develop an efficient algorithm with the provably approximate guarantee for immunization. Finally, we show the effectiveness and scalability of our methods via extensive experiments on multiple datasets, and conduct case studies on nation-wide real medical surveillance data.

60 APPLIED LIFE SCIENCES↗

Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation

In this work, we consider the problem of designing a cloak for waves described by the Helmholtz equation from an integer programming point of view. The problem can be modeled as a PDE-constrained optimization problem with integer-valued control inputs that are distributed in the computational domain. A first-discretize-then-optimize approach results in a large-scale mixed-integer nonlinear program that is in general intractable because of the large number of integer variables that arise from the discretization of the domain. Instead, we propose an efficient algorithm that is able to approximate the local infima of the underlying nonconvex infinite-dimensional problem arbitrarily close without the need to solve the discretized finite-dimensional integer programs to optimality. We optimize only the continuous relaxations of the approximations for local minima and then apply the sum-up rounding methodology to obtain integer-valued controls. If the solutions of the discretized continuous relaxations converge to a local minimizer of the continuous relaxation, then the resulting discrete-valued control sequence converges weakly \(^*\) in \(L^\infty\) to the same local minimizer. These approximation properties follow under suitable refinements of the involved discretization grids. Our results use familiar concepts arising from the analytical properties of the underlying PDE and complement previous results, derived from a topology optimization point of view.

97 MATHEMATICS AND COMPUTING↗

Spatially dependent regularization parameter selection for total generalized variation-based image denoising

We propose a novel image denoising model based on the total generalized variation (TGV) regularization. In the model, a spatially dependent regularization parameter is utilized to adaptively fit the local image features, resulting in further exploitation of the denoising potential of the TGV regularization. The proposed model is formulated under a joint optimization framework, by which the estimations of the restored image and the regularization parameter are achieved simultaneously. Furthermore, the model is general purpose that can handle various types of noise occurring in image processing. An alternating minimization-based numerical scheme is especially developed, which leads to an efficient algorithmic solution to the nonconvex optimization problem. Numerical experiments are reported to illustrate the effectiveness of our model in terms of both peak signal-to-noise ratio and visual perception.

97 MATHEMATICS AND COMPUTING↗

A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality

In this paper, we study the extended trust region subproblem (eTRS) in which the trust region intersects the Euclidean ball with a single linear inequality constraint. By reformulating the Lagrangian dual of eTRS as a two-parameter linear eigenvalue problem, we state a necessary and sufficient condition for its strong duality in terms of an optimal solution of a linearly constrained bivariate concave maximization problem. This results in an efficient algorithm for solving eTRS of large size whenever the strong duality is detected. Finally, some numerical experiments are given to show the effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗

An analytical method as a preconditioning modeling for systems of linear equations

In this paper, we propose a simple and practical preconditioner based on the homotopy analysis method. Furthermore, using this modeling, we design an efficient algorithm to solve linear systems. Within the computational framework, convection–diffusion equation candidates are investigated and evaluated. Finally, computational comparisons of the standard methods against preconditioned methods based on experiments are presented which illustrate the merits of the simplicity, power, and effectiveness of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Effective construction of eigenvectors for a class of singular sparse matrices

Fundamental results and an efficient algorithm for constructing eigenvectors corresponding to non-zero eigenvalues of matrices with zero rows and/or columns are developed. The formulation is built on the relation between eigenvectors of such matrices and the eigenvectors of their submatrices after removing all zero rows and columns. While being easily utilized, the algorithm decreases the computation time needed for numerical eigenanalysis, and resolves potential numerical eigensolver instabilities.

97 MATHEMATICS AND COMPUTING↗

Applications of the worldline Monte Carlo formalism in quantum mechanics

Highlights: Universal approach to the numerical computation of the Euclidean path integral. Inspired by recent work in relativistic quantum field theory. Here adapted to non-relativistic quantum mechanics. Worked out for the computation of propagators and ground-state energies. Special smoothing procedure for singular potentials. -- Abstract: In recent years efficient algorithms have been developed for the numerical computation of relativistic single-particle path integrals in quantum field theory. Here, we adapt this “worldline Monte Carlo” approach to the standard problem of the numerical approximation of the non-relativistic path integral, resulting in a formalism whose characteristic feature is the fast, non-recursive generation of an ensemble of trajectories that is independent of the potential, and is thus universally applicable. The numerical implementation discretises the trajectories with respect to their time parametrisation but maintains a continuous spatial domain. In the case of singular potentials, the discretised action gets adapted to the singularity through a “smoothing” procedure. We show for a variety of examples (the harmonic oscillator in various dimensions, the modified Pöschl–Teller potential, delta-function potentials, the Coulomb and Yukawa potentials) that the method allows one to obtain fast and reliable estimates for the Euclidean propagator and use them in a certain time window suitable for extracting the ground state energy. Usually Monte Carlo calculations in quantum mechanics are performed using algorithms that involve a more specific adaptation to the potential, and we briefly compare our method with the most widely used such algorithms, which are of Metropolis type. As an aside, we apply it for studying the classical limit where nearly classical trajectories are expected to dominate in the path integral. We expect the advances made here to be useful also in the relativistic case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A high-order discontinuous Galerkin method with unstructured space–time meshes for two-dimensional compressible flows on domains with large deformations

We introduce a high-order accurate space-time discontinuous Galerkin method for solving two-dimensional compressible flow problems on fully unstructured space-time meshes. The discretization is based on a nodal formulation, with appropriate numerical fluxes for the first and the second-order terms, respectively. The scheme is implicit, and we solve the resulting non-linear systems using a parallel Newton-Krylov solver. The meshes are produced by a mesh moving technique with element connectivity updates, and the corresponding space-time elements are produced directly based on these local operations. To obtain globally conforming tetrahedral meshes, we first derive the required conditions on a prism boundary mesh to allow for a valid local triangulation. Next, we present an efficient algorithm for finding a global mesh that satisfies these conditions. We additionally show how to add and remove mesh nodes, again using local constructs for the space-time mesh. Our approach is demonstrated on a number of test problems, showing the high-order accuracy for model problems, and the ability to solve flow problems on domains with complex large deformations.

97 MATHEMATICS AND COMPUTING↗

Efficient and robust phase-split computations in the internal energy, volume, and moles ( UVN ) space

Phase-split computations in an isolated system, which in general may be defined as one where the total internal energy (U), volume (V), and the number of moles (N = N 1 , N 2 ,..., N n ) of the components are fixed at some specified set of values, involves the determination of the temperature (T), pressure (P), plus the amount and composition of the various phases that constitute the system. A simpler, but analogous problem is one where T, P, and N are specified instead. In TPN space, one may first perform a stability analysis to determine whether the system is stable, meaning whether at equilibrium it will split up into multiple phases or remain in single phase. If the single-phase state is unstable, the stability analysis reliably provides a good set of initial guesses in the subsequent phase-split computations. In UVN space, however, we demonstrate that the stability analysis (which is the main subject of our earlier study [1]) may not in general provide good enough initial guesses; we offer alternative strategies for setting up good initial guesses. Furthermore, we show that a combination of successive substitution iteration (SSI) and Newton's method---two iterative methods that are prevalent in the literature in TPN space---facilitates a robust and efficient algorithm for phase-split computations in isolated systems. Finally, this combination has so far not been applied in UVN space.

02 PETROLEUM↗

CHARACTERIZATION OF DISCONTINUITIES IN HIGH-DIMENSIONAL STOCHASTIC PROBLEMS ON ADAPTIVE SPARSE GRIDS

In this paper we present a set of efficient algorithms for detection and identification of discontinuities in high dimensional space. The method is based on extension of polynomial annihilation for edge detection in low dimensions. Compared to the earlier work, the present method poses significant improvements for high dimensional problems. The core of the algorithms relies on adaptive refinement of sparse grids. It is demonstrated that in the commonly encountered cases where a discontinuity resides on a small subset of the dimensions, the present method becomes optimal , in the sense that the total number of points required for function evaluations depends linearly on the dimensionality of the space. The details of the algorithms will be presented and various numerical examples are utilized to demonstrate the efficacy of the method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Fractional modeling of viscoelasticity in 3D cerebral arteries and aneurysms

We develop efficient numerical methods for fractional order PDEs, and employ them to investigate viscoelastic constitutive laws for arterial wall mechanics. Recent simulations using one-dimensional models [1] have indicated that fractional order models may offer a more powerful alternative for modeling the arterial wall response, exhibiting reduced sensitivity to parametric uncertainties compared with the integer-calculus-based models. Here, we study three-dimensional (3D) fractional PDEs that naturally model the continuous relaxation properties of soft tissue, and for the first time employ them to simulate flow structure interactions for patient-specific brain aneurysms. To deal with the high memory requirements and in order to accelerate the numerical evaluation of hereditary integrals, we employ a fast convolution method [2] that reduces the memory cost to O(log(N)) and the computational complexity to O(N log(N)). Furthermore, we combine the fast convolution with high-order backward differentiation to achieve third-order time integration accuracy. We confirm that in 3D viscoelastic simulations, the integer order models strongly depends on the relaxation parameters, while the fractional order models are less sensitive. As an application to long-time simulations in complex geometries, we also apply the method to modeling fluid-structure interaction of a 3D patient-specific compliant cerebral artery with an aneurysm. Taken together, our findings demonstrate that fractional calculus can be employed effectively in modeling complex behavior of materials in realistic 3D time-dependent problems if properly designed efficient algorithms are employed to overcome the extra memory requirements and computational complexity associated with the non-local character of fractional derivatives.

Computer Science↗

A Verified Conformal Decomposition Finite Element Method for Implicit, Many-Material Geometries

As computing power rapidly increases, quickly creating a representative and accurate discretization of complex geometries arises as a major hurdle towards achieving a next generation simulation capability. Component definitions may be in the form of solid (CAD) models or derived from 3D computed tomography (CT) data, and creating a surface-conformal discretization may be required to resolve complex interfacial physics. Furthermore, the Conformal Decomposition Finite Element Methods (CDFEM) has been shown to be an efficient algorithm for creating conformal tetrahedral discretizations of these implicit geometries without manual mesh generation.

97 MATHEMATICS AND COMPUTING↗

Boundary-consistent B-spline filtering schemes and application to high-fidelity simulations of turbulence

A filtering operation, based on B-spline discretizations, is introduced to target weakly growing mesh-scale oscillations that can arise in high-fidelity turbulence simulations. This is a spectral regularization that can be described using the singular values of a banded matrix operator, with the filtering strength set by a scalar- or vector-valued penalty parameter. The penalty parameter can be specified though it can also be advantageously selected to minimize the generalized cross validation (GCV) measure of distance between the pre- and post-filtered solutions. Efficient algorithms are developed to compute both the scalar and vector penalty parameters. The B-spline filter has a sharper localization to high-wavenumber than compact or explicit filters of the same stencil width and is demonstrated for solutions of the Burgers' equation, decaying Burgers' turbulence, and compressible Navier–Stokes turbulent channel flow. Furthermore, these simulations confirm the scheme's numerical stability and ability to narrowly target the high wavenumber components of numerical solutions. An advantage over finite-difference filters is that these B-spline filters are stable on bounded domains and even preserve formal order of accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A greedy Galerkin method to efficiently select sensors for linear dynamical systems

A key challenge in inverse problems is the selection of sensors to gather the most effective data. In this paper, we consider the problem of inferring the initial condition to a linear dynamical system and develop an efficient control-theoretical approach for greedily selecting sensors. Our method employs a Galerkin projection to reduce the size of the inverse problem, resulting in a computationally efficient algorithm for sensor selection. As a byproduct of our algorithm, we obtain a preconditioner for the inverse problem that enables the rapid recovery of the initial condition. Here, we analyze the theoretical performance of our greedy sensor selection algorithm as well as the performance of the associated preconditioner. Finally, we verify our theoretical results on various inverse problems involving partial differential equations.

97 MATHEMATICS AND COMPUTING↗

A topological screening heuristic for low-energy, high-index surfaces

Robust ab initio investigations of nanoparticle surface properties require a method to identify candidate low-energy surface facets a priori . By assuming that low-energy surfaces are planes with high atomic density, we devise an efficient algorithm to screen for low-energy surface orientations, even if they have high ( hkl ) miller indices. We successfully predict the observed low-energy, high-index {$10\overline{12} $} and {$10\bar{1}4 $} surfaces of hematite α-Fe 2 O 3 , the {311} surfaces of cuprite Cu 2 O, and the {112} surfaces of anatase TiO 2 . We further tabulate candidate low-energy surface orientations for nine of the most common binary oxide structures. Screened surfaces are found to be generally applicable across isostructural compounds with varying chemistries, although relative surface energies between facets may vary based on the preferred coordination of the surface atoms.

36 MATERIALS SCIENCE↗

The DESC stellarator code suite. Part 2. Perturbation and continuation methods

A new perturbation and continuation method is presented for computing and analysing stellarator equilibria. The method is formally derived from a series expansion about the equilibrium condition $\boldsymbol {F} \equiv \boldsymbol {J}\times \boldsymbol {B} - \boldsymbol {\nabla } p = 0$ , and an efficient algorithm for computing solutions to second- and third-order perturbations is developed. The method has been implemented in the DESC stellarator equilibrium code, using automatic differentiation to compute the required derivatives. Examples are shown demonstrating its use for computing complicated equilibria, perturbing a tokamak into a stellarator and performing parameter scans in pressure, rotational transform and boundary shape in a fraction of the time required for a full solution.

Conlin, Rory (ORCID:0000000183662111)↗

Single-Molecule Kinetics of Styrene Hydrogenation on Silica-Supported Vanadium: The Role of Disorder for Single-Atom Catalysts

We report a theoretical approach for the study of supported atom catalysis is developed based on recent advances in the study of single-molecule kinetics. This view is particularly useful in exhibiting the role of disorder in single-atom and single-site catalysts on amorphous supports. The distribution of passage times (or waiting times) through a complex catalytic network originating from a set of coupled active sites is described by a probability distribution function (PDF), f(t), that reflects the local environment of the reaction center. An efficient algorithm is developed based on the linear algebra of the Markov transition matrix that produces f(t) or its moments. The kinetics of the hydrogenation reaction of styrene on an organovanadium(III) catalyst supported on amorphous silica is studied. A kinetic model consisting of three intertwined catalytic cycles emanating from three chemically distinct active sites is proposed to describe the chemistry. Density functional theory (DFT) calculations are employed to determine the free energy barriers of the reactions, which are used to construct the rate coefficient matrix. The disorder induced by the amorphous support material is divided into a low-dimensional short-range component reflecting the covalent structures near the reaction center and a weaker long-range component modeling the bulk randomness. The results are computed and analyzed for a wide range of concentration values and disorder scenarios. The unusual structure in the f(t) PDF is found to occur for certain cases that reveal the contribution of multiple catalytic pathways acting in concert.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗