Search NASA⌕ Search

SEARCH · Search NASA

Results for “general linear methods”

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 901 records · Page 50

An algorithm for linearizing convex extremal problems

This paper suggests a method of approximating the solution of minimization problems for convex functions of several variables under convex constraints is suggested. The main idea of this approach is the approximation of a convex function by a piecewise linear function, which results in replacing the problem of convex programming by a linear programming problem. To carry out such an approximation, the epigraph of a convex function is approximated by the projection of a polytope of greater dimension. In the first part of the paper, the problem is considered for functions of one variable. In this case, an algorithm for approximating the epigraph of a convex function by a polygon is presented, it is shown that this algorithm is optimal with respect to the number of vertices of the polygon, and exact bounds for this number are obtained. After this, using an induction procedure, the algorithm is generalized to certain classes of functions of several variables. Applying the suggested method, polynomial algorithms for an approximate calculation of the L{sub p}-norm of a matrix and of the minimum of the entropy function on a polytope are obtained. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗

Effect of fast drifting electrons on electron temperature measurement with a triple Langmuir probe

Triple Langmuir Probe (TLP) is a widely used diagnostics for instantaneous measurement of electron temperature and density in low temperature laboratory plasmas as well as in edge region of fusion plasma devices. Presence of a moderately energetic flowing electron component, constituting only a small fraction of the bulk electrons, is also a generally observed scenario in plasma devices, where plasmas are produced by electron impact ionization of neutrals. A theoretical analysis of its effect on interpretation of the TLP data for bulk electron temperature measurement is presented here assuming electron velocity distribution is not deviating substantially from a Maxwellian. The study predicts conventional expression from standard TLP theory to give overestimated value of bulk electron temperature. Correction factor is significant and largely depends on population density, temperature, and energy of the fast component. Experimental verification of theoretical results is obtained in the magnetized plasma linear experimental device of Saha Institute of Nuclear Physics where plasma is produced by an electron cyclotron resonance method and known to have a fast flowing electron component.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hyperentanglement concentration of nonlocal two-photon six-qubit systems with linear optics

Hyperentanglement, the entangled states in the multiple degrees of freedom (DOFs) of a photon system simultaneously, has attracted much attention recently as it can increase the capacity of quantum communication largely. Here we present the first scheme for concentrating the nonlocal two-photon six-qubit systems entangled in polarization, spatial-mode, and time-bin DOFs with linear optics. We construct the parity-check gates for the quantum states of nonlocal photon systems in all the three DOFs with linear-optical elements. Fortunately, our parity-check gate for one DOF does not affect the quantum states in the other two DOFs, which makes our hyperentanglement concentration protocol (hyper-ECP) can be implemented conveniently for polarization–spatial–time-bin partially hyperentangled states. This hyper-ECP is practical as it requires only linear-optical elements, and it can be directly generalized to improve the entanglement of nonlocal multi-photon systems entangled in three DOFs in the long-distance high-capacity quantum communication. - Highlights: • A linear hyperentanglement concentration protocol is proposed for photon systems. • Parity-check gates on one degree of freedom (DOF) will not affect the other two DOFs. • Polarization, spatial-mode, and time-bin DOFs are manipulated with linear optics. • Nonlocal maximally hyperentangled two-photon six-qubit systems are obtained. • Entanglement of multiphoton systems in three DOFs can be improved with this method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithm 1049: The Delaunay Density Diagnostic

Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing whether the density of inputs is sufficient to identify the relevant variations in outputs—i.e., the “geometric scale” of the function—despite the fact that sampling density is closely tied to the success or failure of an approximation method. In this article, we introduce a general purpose, computational approach to detecting the geometric scale of real-valued functions over a fixed domain using a deterministic interpolation technique from computational geometry. The algorithm is intended to work on scalar data in moderate dimensions (2–10). Our algorithm is based on the observation that a sequence of piecewise linear interpolants will converge to a continuous function at a quadratic rate (in L 2 norm) if and only if the data are sampled densely enough to distinguish the feature from noise (assuming sufficiently regular sampling). We present numerical experiments demonstrating how our method can identify feature scale, estimate uncertainty in feature scale, and assess the sampling density for fixed (i.e., static) datasets of input–output pairs. Finally, we include analytical results in support of our numerical findings and have released lightweight code that can be adapted for use in a variety of data science settings.

97 MATHEMATICS AND COMPUTING↗

Split kinetic energy method for quantum systems with competing potentials

For quantum systems with competing potentials, the conventional perturbation theory often yields an asymptotic series and the subsequent numerical outcome becomes uncertain. To tackle such a kind of problems, we develop a general solution scheme based on a new energy dissection idea. Instead of dividing the potential energy into 'unperturbed' and 'perturbed' terms, a partition of the kinetic energy is performed. By distributing the kinetic energy term in part into each individual potential, the Hamiltonian can be expressed as the sum of the subsystem Hamiltonians with respective competing potentials. The total wavefunction is expanded by using a linear combination of the basis sets of respective subsystem Hamiltonians. We first illustrate the solution procedure using a simple system consisting of a particle under the action of double {delta}-function potentials. Next, this method is applied to the prototype systems of a charged harmonic oscillator in strong magnetic field and the hydrogen molecule ion. Compared with the usual perturbation approach, this new scheme converges much faster to the exact solutions for both eigenvalues and eigenfunctions. When properly extended, this new solution scheme can be very useful for dealing with strongly coupling quantum systems. - Highlights: Black-Right-Pointing-Pointer A new basis set expansion method is proposed. Black-Right-Pointing-Pointer Split kinetic energy method is proposed to solve quantum eigenvalue problems. Black-Right-Pointing-Pointer Significant improvement has been obtained in converging to exact results. Black-Right-Pointing-Pointer Extension of such methods is promising and discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Complete solution for unambiguous discrimination of three pure states with real inner products

Complete solutions are given in a closed analytic form for unambiguous discrimination of three general pure states with real mutual inner products. For this purpose, we first establish some general results on unambiguous discrimination of n linearly independent pure states. The uniqueness of solution is proved. The condition under which the problem is reduced to an (n-1)-state problem is clarified. After giving the solution for three pure states with real mutual inner products, we examine some difficulties in extending our method to the case of complex inner products. There is a class of set of three pure states with complex inner products for which we obtain an analytical solution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Predicting Flow in Fracture Networks With Quantum Algorithms

Uncertainty quantification plays a crucial role in the modeling of subsurface flow. For instance, uncertainties in the properties of geologic fracture networks significantly impact flow, requiring numerous simulations to accurately estimate quantities of interest. However, each simulation is computationally expensive because it requires solving a large linear system to capture features that involve both small and large fractures. An example is in percolation, where the interaction of many small fractures (which cumulatively can have a large surface area) with the rock matrix must be modeled precisely. Quantum computing is an emerging tool with the potential to address this issue. Quantum algorithms offer a significant speedup in solving linear systems, achieving efficiencies that are challenging to match with classical approaches. These classical approaches include direct solvers, such as LU decomposition, and iterative methods, notably preconditioned conjugate gradient, commonly used in subsurface modeling to solve large sparse systems. However, applying quantum algorithms to geologic fracture flow requires careful attention to algorithmic and problem-specific constraints to fully realize this quantum advantage. In this work we describe a quantum algorithm for generalized Monte Carlo applications with a quadratic speedup over the classical approaches which can be combined with the quantum speedup, currently under investigation, for solving quantum linear systems for subsurface flow. We show that for quantum algorithms the computational cost of estimating a quantity of interest for a statistical ensemble of networks is roughly the same as that of a single realization, essentially implying that one can get uncertainty quantification for free.

58 GEOSCIENCES↗

From graphical to model-based distillation column design: A McCabe-Thiele-inspired mathematical programming approach

We propose a mixed-integer nonlinear programming (MINLP) model for simple and complex distillation column design and optimization. The model is based upon the concepts and equations underpinning the McCabe-Thiele method. Generalizing this method, we introduce material balances at various locations of the column and employ binary variables to determine the optimal number of trays and optimal feed locations. We model the vapor–liquid equilibrium using continuous piecewise linear approximating functions. The model is extended to account for multicomponent mixtures and non-constant-molar overflow. We also discuss how to estimate the minimum number of trays and the minimum reflux ratio.

42 ENGINEERING↗

Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets

We study multistage distributionally robust mixed-integer programs under endogenous uncertainty, where the probability distribution of stage-wise uncertainty depends on the decisions made in previous stages. We first consider two ambiguity sets defined by decision-dependent bounds on the first and second moments of uncertain parameters and by mean and covariance matrix that exactly match decision-dependent empirical ones, respectively. For both sets, we show that the subproblem in each stage can be recast as a mixed-integer linear program (MILP). Moreover, we extend the general moment-based ambiguity set in to the multistage decision-dependent setting, and derive mixed-integer semidefinite programming (MISDP) reformulations of stage-wise subproblems. We develop methods for attaining lower and upper bounds of the optimal objective value of the multistage MISDPs, and approximate them using a series of MILPs. We deploy the Stochastic Dual Dynamic integer Programming (SDDiP) method for solving the problem under the three ambiguity sets with risk-neutral or risk-averse objective functions, and conduct numerical studies on multistage facility-location instances having diverse sizes under different parameter and uncertainty settings. Furthermore, our results show that the SDDiP quickly finds optimal solutions for moderate-sized instances under the first two ambiguity sets, and also finds good approximate bounds for the multistage MISDPs derived under the third ambiguity set. We also demonstrate the efficacy of incorporating decision-dependent distributional ambiguity in multistage decision-making processes.

97 MATHEMATICS AND COMPUTING↗

Long-range corrected density functional theory with linearly-scaled HF exchange

Long-range corrected density functional theory (LC-DFT) attracts many chemists’ attentions as a quantum chemical method to be applied to large molecular system and its property calculations. However, the expensive time cost to evaluate the long-range HF exchange is a big obstacle to be overcome to be applied to the large molecular systems and the solid state materials. Upon this problem, we propose a linear-scaling method of the HF exchange integration, in particular, for the LC-DFT hybrid functional.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Intelligent Electrochemical Sensors for Precise Identification of Volatile Organic Compounds Enabled by Neural Network Analysis

The volatile organic compounds (VOCs) in a wide spectrum of categories were identified as biomarkers in aquatic environments, playing an important role in marine and freshwater ecology and global atmospheric chemistry. VOCs released from biofuel have also attracted increasing attention. Although the importance has been recognized, the portable detection and analysis methods of VOC in aquatic systems have not yet been well developed and understood. Here, in this work, we innovatively proposed an intelligent electrochemical sensing approach to classify and quantify VOCs in solution. Utilizing the cyclic voltammetry (CV) method with an ionic liquid (IL)-based electrolyte, we analyzed 50 μL samples of various VOC analytes, including acetic acid (AC), acetone, dimethylformamide (DMF), dimethyl sulfoxide (DMSO), ethanol, formaldehyde, formic acid, methanol, methyl formate (MF), toluene, and a formaldehyde-methanol mixture, along with deionized water (DI water). The generated voltammograms were subsequently analyzed using our uniquely designed and optimized 1-D convolutional neural network (1D-CNN). This deep-learning algorithm achieved a 99.09% accuracy in VOC classification validated through fivefold cross-validation and demonstrated an impressive 94.4% test accuracy for methanol detection within a 10 μL error range. For quantification, the system accurately categorized methanol volumes ranging from 0 to 50 μL in 10 μL increments, achieving a 98.18% accuracy. A notable linear correlation (R2 = 95.56%) was found between max current density at the oxidation peak and methanol volume, with the limit of detection (LOD) at 9.3 μL. Such a sensing method exhibits potential for portability, high accuracy, and generalization in the classification and quantification, ultimately reshaping the realm of VOC analysis in solution.

42 ENGINEERING↗

Bayesian data assimilation for stochastic multiscale models of transport in porous media.

We investigate Bayesian techniques that can be used to reconstruct field variables from partial observations. In particular, we target fields that exhibit spatial structures with a large spectrum of lengthscales. Contemporary methods typically describe the field on a grid and estimate structures which can be resolved by it. In contrast, we address the reconstruction of grid-resolved structures as well as estimation of statistical summaries of subgrid structures, which are smaller than the grid resolution. We perform this in two different ways (a) via a physical (phenomenological), parameterized subgrid model that summarizes the impact of the unresolved scales at the coarse level and (b) via multiscale finite elements, where specially designed prolongation and restriction operators establish the interscale link between the same problem defined on a coarse and fine mesh. The estimation problem is posed as a Bayesian inverse problem. Dimensionality reduction is performed by projecting the field to be inferred on a suitable orthogonal basis set, viz. the Karhunen-Loeve expansion of a multiGaussian. We first demonstrate our techniques on the reconstruction of a binary medium consisting of a matrix with embedded inclusions, which are too small to be grid-resolved. The reconstruction is performed using an adaptive Markov chain Monte Carlo method. We find that the posterior distributions of the inferred parameters are approximately Gaussian. We exploit this finding to reconstruct a permeability field with long, but narrow embedded fractures (which are too fine to be grid-resolved) using scalable ensemble Kalman filters; this also allows us to address larger grids. Ensemble Kalman filtering is then used to estimate the values of hydraulic conductivity and specific yield in a model of the High Plains Aquifer in Kansas. Strong conditioning of the spatial structure of the parameters and the non-linear aspects of the water table aquifer create difficulty for the ensemble Kalman filter. We conclude with a demonstration of the use of multiscale stochastic finite elements to reconstruct permeability fields. This method, though computationally intensive, is general and can be used for multiscale inference in cases where a subgrid model cannot be constructed.

54 ENVIRONMENTAL SCIENCES↗

PaRSEC: A Software Framework for Performance and Productivity on Hybrid, Manycore Platforms

As the era of computer architectures dominated by serial processors ends, the convergence of several unprecedented challenges suggests that closing the longstanding "application–architecture performance gap" will become more challenging than ever. To address this problem, the Parallel Runtime Scheduling and Execution Control (PaRSEC) project created a modular software framework that achieved two major objectives: first, it built a task-based runtime capable of delivering portable performance to a wide range of science and engineering applications at all levels of the platform pyramid, including the upcoming 100 Pflop/s systems and then exascale; and second, it supported and facilitated the work of developers in migrating their legacy codes and writing entirely new ones for the emerging hybrid and massively parallel manycore processor system designs. PaRSEC will support multiple domain-specific languages capable of increasing the developers' productivity while also providing the runtime with the constructs and flexibility necessary to exploit the maximal parallelism from parallel applications. Extensive preliminary research in dense linear algebra showed convincingly that a parameterized task graph representation that symbolically describes the algorithm content can achieve the project's twofold objective within that domain. The research also strongly suggested that this powerful method could be generalized to a far-wider variety of applications.

97 MATHEMATICS AND COMPUTING↗

Elastic Solutions to 2D Plane Strain Problems: Nonlinear Contact and Settlement Analysis for Shallow Foundations

The classical Neumann boundary value problem of an isotropic, homogeneous elastic half-plane under plane strain conditions is readdressed as the limiting case of the fully three-dimensional problem. Analytical solutions of the stress and strain tensors are obtained by taking the limit from known three-dimensional solutions. It is shown that the displacement fields for the plane strain problem are not well defined. A small number of simple expressions are developed, which provide a general solution for linearly-varying traction over arbitrary regions on the boundary. A simple, efficient, and rapidly convergent algorithm is developed which uses these solutions as analytic elements and provides a solution approach to the general boundary value problem. The method is verified against known solutions for Hertzian contact between parallel cylinders. Two numerical examples are presented for the analysis of shallow foundation systems. In the first, the boundary conditions are informed by analytical elastoplastic calculations and a strain influence analysis is performed and compared with the Schmertmann method. Subsequently, empirical laboratory contact traction distributions measured by Bauer et al., in both the normal and tangential directions are employed as boundary conditions for an analysis of the underlying stress field.

42 ENGINEERING↗

The finite element method in computational fluid mechanics

A finite element solution algorithm is established for a general statement of the time-averaged Navier-Stokes equations governing multi-dimensional turbulent flows. Numerical results are presented which evaluate factors affecting solution accuracy for a broad spectrum of linear and non-linear problem classes.

Baker, A. J.↗

Linear approximations of nonlinear systems

The development of a method for designing an automatic flight controller for short and vertical take off aircraft is discussed. This technique involves transformations of nonlinear systems to controllable linear systems and takes into account the nonlinearities of the aircraft. In general, the transformations cannot always be given in closed form. Using partial differential equations, an approximate linear system called the modified tangent model was introduced. A linear transformation of this tangent model to Brunovsky canonical form can be constructed, and from this the linear part (about a state space point x sub 0) of an exact transformation for the nonlinear system can be found. It is shown that a canonical expansion in Lie brackets about the point x sub 0 yields the same modified tangent model.

Hunt, L. R.↗

Enhanced rotor modeling tailored for rub dynamic stability analysis and simulation

New methods are presented that allow straightforward application of complex nonlinearities to finite element based rotor dynamic analyses. The key features are: (1) the methods can be implemented with existing finite element or dynamic simulation programs, (2) formulation is general for simple application to a wide range of problems, and (3) implementation is simplified because nonlinear aspects are separated from the linear part of the model. The new techniques are illustrated with examples of inertial nonlinearity and torquewhirl which can be important in rubbing turbomachinery. The sample analyses provide new understanding of these nonlinearities which are discussed.

Davis, R. R.↗

Implementation of a partitioned algorithm for simulation of large CSI problems

The implementation of a partitioned numerical algorithm for determining the dynamic response of coupled structure/controller/estimator finite-dimensional systems is reviewed. The partitioned approach leads to a set of coupled first and second-order linear differential equations which are numerically integrated with extrapolation and implicit step methods. The present software implementation, ACSIS, utilizes parallel processing techniques at various levels to optimize performance on a shared-memory concurrent/vector processing system. A general procedure for the design of controller and filter gains is also implemented, which utilizes the vibration characteristics of the structure to be solved. Also presented are: example problems; a user's guide to the software; the procedures and algorithm scripts; a stability analysis for the algorithm; and the source code for the parallel implementation.

Alvin, Kenneth F.↗