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 865 records · Page 48

A New and General Formulation of the Parametric HFGMC Micromechanical Method for Three-Dimensional Multi-Phase Composites

The recent two-dimensional (2-D) parametric formulation of the high fidelity generalized method of cells (HFGMC) reported by the authors is generalized for the micromechanical analysis of three-dimensional (3-D) multiphase composites with periodic microstructure. Arbitrary hexahedral subcell geometry is developed to discretize a triply periodic repeating unit-cell (RUC). Linear parametric-geometric mapping is employed to transform the arbitrary hexahedral subcell shapes from the physical space to an auxiliary orthogonal shape, where a complete quadratic displacement expansion is performed. Previously in the 2-D case, additional three equations are needed in the form of average moments of equilibrium as a result of the inclusion of the bilinear terms. However, the present 3-D parametric HFGMC formulation eliminates the need for such additional equations. This is achieved by expressing the coefficients of the full quadratic polynomial expansion of the subcell in terms of the side or face average-displacement vectors. The 2-D parametric and orthogonal HFGMC are special cases of the present 3-D formulation. The continuity of displacements and tractions, as well as the equilibrium equations, are imposed in the average (integral) sense as in the original HFGMC formulation. Each of the six sides (faces) of a subcell has an independent average displacement micro-variable vector which forms an energy-conjugate pair with the transformed average-traction vector. This allows generating symmetric stiffness matrices along with internal resisting vectors for the subcells which enhances the computational efficiency. The established new parametric 3-D HFGMC equations are formulated and solution implementations are addressed. Several applications for triply periodic 3-D composites are presented to demonstrate the general capability and varsity of the present parametric HFGMC method for refined micromechanical analysis by generating the spatial distributions of local stress fields. These applications include triply periodic composites with inclusions in the form of a cavity, spherical inclusion, ellipsoidal inclusion, discontinuous aligned short fiber. A 3-D repeating unit-cell for foam material composite is simulated.

Haj-Ali, Rami↗

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets

Interpolating scattered data points is a problem of wide ranging interest. A number of approaches for interpolation have been proposed both from theoretical domains such as computational geometry and in applications' fields such as geostatistics. Our motivation arises from geological and mining applications. In many instances data can be costly to compute and are available only at nonuniformly scattered positions. Because of the high cost of collecting measurements, high accuracy is required in the interpolants. One of the most popular interpolation methods in this field is called ordinary kriging. It is popular because it is a best linear unbiased estimator. The price for its statistical optimality is that the estimator is computationally very expensive. This is because the value of each interpolant is given by the solution of a large dense linear system. In practice, kriging problems have been solved approximately by restricting the domain to a small local neighborhood of points that lie near the query point. Determining the proper size for this neighborhood is a solved by ad hoc methods, and it has been shown that this approach leads to undesirable discontinuities in the interpolant. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. This process achieves its efficiency by replacing the large dense kriging system with a much sparser linear system. This technique has been applied to a restriction of our problem, called simple kriging, which is not unbiased for general data sets. In this paper we generalize these results by showing how to apply covariance tapering to the more general problem of ordinary kriging. Through experimentation we demonstrate the space and time efficiency and accuracy of approximating ordinary kriging through the use of covariance tapering combined with iterative methods for solving large sparse systems. We demonstrate our approach on large data sizes arising both from synthetic sources and from real applications.

Memarsadeghi, Nargess↗

A primer on resurgent transseries and their asymptotics

The computation of observables in general interacting theories, be them quantum mechanical, field, gauge or string theories, is a non-trivial problem which in many cases can only be addressed by resorting to perturbative methods. In most physically interesting problems these perturbative expansions result in asymptotic series with zero radius of convergence. These asymptotic series then require the use of resurgence and transseries in order for the associated observables to become nonperturbatively well-defined. Resurgence encodes the complete large-order asymptotic behaviour of the coefficients from a perturbative expansion, generically in terms of (multi) instanton sectors and for each problem in terms of its Stokes constants. Some observables arise from linear problems, and have a finite number of instanton sectors and associated Stokes constants; some other observables arise from nonlinear problems, and have an infinite number of instanton sectors and Stokes constants. By means of two very explicit examples, and with emphasis on a pedagogical style of presentation, here this work aims at serving as a primer on the aforementioned resurgent, large-order asymptotics of general perturbative expansions. This includes discussions of transseries, Stokes phenomena, generalized steepest-descent methods, Borel transforms, nonlinear resonance, and alien calculus. Furthermore, resurgent properties of transseries – usually described mathematically via alien calculus – are recast in equivalent physical languages: either a “statistical mechanical” language, as motions in chains and lattices; or a “conformal field theoretical” language, with underlying Virasoro-like algebraic structures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust stability of linear systems: Some computational considerations

The cases of both additive and multiplicative perturbations were discussed and a number of relationships between the two cases were given. A number of computational aspects of the theory were also discussed, including a proposed new method for evaluating general transfer or frequency response matrices. The new method is numerically stable and efficient, requiring only operations to update for new values of the frequency parameter.

Laub, A. J.↗

Quasi-Linear Parameter Varying Representation of General Aircraft Dynamics Over Non-Trim Region

For applying linear parameter varying (LPV) control synthesis and analysis to a nonlinear system, it is required that a nonlinear system be represented in the form of an LPV model. In this paper, a new representation method is developed to construct an LPV model from a nonlinear mathematical model without the restriction that an operating point must be in the neighborhood of equilibrium points. An LPV model constructed by the new method preserves local stabilities of the original nonlinear system at "frozen" scheduling parameters and also represents the original nonlinear dynamics of a system over a non-trim region. An LPV model of the motion of FASER (Free-flying Aircraft for Subscale Experimental Research) is constructed by the new method.

Shin, Jong-Yeob↗

Adaptive Discontinuous Galerkin Methods in Multiwavelets Bases

We use a multiwavelet basis with the Discontinuous Galerkin (DG) method to produce a multi-scale DG method. We apply this Multiwavelet DG method to convection and convection-diffusion problems in multiple dimensions. Merging the DG method with multiwavelets allows the adaptivity in the DG method to be resolved through manipulation of multiwavelet coefficients rather than grid manipulation. Additionally, the Multiwavelet DG method is tested on non-linear equations in one dimension and on the cubed sphere.

99 GENERAL AND MISCELLANEOUS↗

On the equivalence of dynamically orthogonal and bi-orthogonal methods: Theory and numerical simulations

The Karhunen–Lòeve (KL) decomposition provides a low-dimensional representation for random fields as it is optimal in the mean square sense. Although for many stochastic systems of practical interest, described by stochastic partial differential equations (SPDEs), solutions possess this low-dimensional character, they also have a strongly time-dependent form and to this end a fixed-in-time basis may not describe the solution in an efficient way. Motivated by this limitation of standard KL expansion, Sapsis and Lermusiaux (2009) [26] developed the dynamically orthogonal (DO) field equations which allow for the simultaneous evolution of both the spatial basis where uncertainty ‘lives’ but also the stochastic characteristics of uncertainty. Recently, Cheng et al. (2013) [28] introduced an alternative approach, the bi-orthogonal (BO) method, which performs the exact same tasks, i.e. it evolves the spatial basis and the stochastic characteristics of uncertainty. In the current work we examine the relation of the two approaches and we prove theoretically and illustrate numerically their equivalence, in the sense that one method is an exact reformulation of the other. We show this by deriving a linear and invertible transformation matrix described by a matrix differential equation that connects the BO and the DO solutions. We also examine a pathology of the BO equations that occurs when two eigenvalues of the solution cross, resulting in an instantaneous, infinite-speed, internal rotation of the computed spatial basis. We demonstrate that despite the instantaneous duration of the singularity this has important implications on the numerical performance of the BO approach. On the other hand, it is observed that the BO is more stable in nonlinear problems involving a relatively large number of modes. Several examples, linear and nonlinear, are presented to illustrate the DO and BO methods as well as their equivalence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory: The DEC-RI-MP2 gradient

We report an implementation of the molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory (DEC-RI-MP2). The new DEC-RI-MP2 gradient method combines the precision control as well as the linear-scaling and massively parallel features of the DEC scheme with efficient evaluations of the gradient contributions using the RI approximation. We further demonstrate that the DEC-RI-MP2 gradient method is capable of calculating molecular gradients for very large molecular systems. A test set of supramolecular complexes containing up to 158 atoms and 1960 contracted basis functions has been employed to demonstrate the general applicability of the DEC-RI-MP2 method and to analyze the errors of the DEC approximation. Moreover, the test set contains molecules of complicated electronic structures and is thus deliberately chosen to stress test the DEC-RI-MP2 gradient implementation. Additionally, as a showcase example the full molecular gradient for insulin (787 atoms and 7604 contracted basis functions) has been evaluated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Numerical solution of the Stratonovich- and Ito–Euler equations: Application to the stochastic piston problem

We consider a piston with a velocity perturbed by Brownian motion moving into a straight tube filled with a perfect gas at rest. The shock generated ahead of the piston can be located by solving the one-dimensional Euler equations driven by white noise using the Stratonovich or Ito formulations. We approximate the Brownian motion with its spectral truncation and subsequently apply stochastic collocation using either sparse grid or the quasi-Monte Carlo (QMC) method. In particular, we first transform the Euler equations with an unsteady stochastic boundary into stochastic Euler equations over a fixed domain with a time-dependent stochastic source term. We then solve the transformed equations by splitting them up into two parts, i.e., a ‘deterministic part’ and a ‘stochastic part’. Numerical results verify the Stratonovich–Euler and Ito–Euler models against stochastic perturbation results, and demonstrate the efficiency of sparse grid and QMC for small and large random piston motions, respectively. The variance of shock location of the piston grows cubically in the case of white noise in contrast to colored noise reported in [1], where the variance of shock location grows quadratically with time for short times and linearly for longer times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A large family of optical solutions to Kundu–Eckhaus model by a new auxiliary equation method

The present study suggests a large family of optical solutions to the Kundu–Eckhaus model. Modified form of an auxiliary equation approach have been used to set the solution families. Compatible variable transform reduces the governing equation to a non linear ordinary differential equation. The parameters of the predicted solution in finite series form are determined by substitution of the solution into this ODE. The results cover a large family of optical solutions that are determined by implementation of various techniques in the literature. In this perspective, the modifed form of the a auxiliary equation approach is evaluated as a generalization of different methods widely used to construct the solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamically stratified Monte Carlo forecasting

A new method for performing Monte Carlo forecasts is introduced. The method, called dynamic stratification, selects initial perturbations based on a stratification of the error distribution. A simple implementation is presented in which the error distribution used for the stratification is estimated from a linear model derived from a large ensemble of 12-h forecasts with the full dynamic model. The stratification thus obtained is used to choose a small subsample of initial states with which to perform the dynamical Monte Carlo forecasts. Several test cases are studied using a simple two-level general circulation model with uncertain initial conditions. It is found that the method provides substantial reductions in the sampling error of the forecast mean and variance when compared to the more traditional approach of choosing the initial perturbations at random. The degree of improvement, however, is sensitive to the nature of the initial error distribution and to the base state. In practice the method may be viable only if the computational burden involved in obtaining an adequate estimate of the error distribution is shared with the data-assimilation procedure.

Schubert, Siegfried↗

Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters

We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.

Applied Dynamical Systems↗

A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems

Constructing surrogate models for uncertainty quantification (UQ) on complex partial differential equations (PDEs) having inherently high-dimensional O(10 n ), n ≥ 2, stochastic inputs (e.g., forcing terms, boundary conditions, initial conditions) poses tremendous challenges. The “curse of dimensionality” can be addressed with suitable unsupervised learning techniques used as a pre-processing tool to encode inputs onto lower-dimensional subspaces while retaining its structural information and meaningful properties. In this work, we review and investigate thirteen dimension reduction methods including linear and nonlinear, spectral, blind source separation, convex and non-convex methods and utilize the resulting embeddings to construct a mapping to quantities of interest via polynomial chaos expansions (PCE). Here, we refer to the general proposed approach as manifold PCE (m-PCE), where manifold corresponds to the latent space resulting from any of the studied dimension reduction methods. To investigate the capabilities and limitations of these methods we conduct numerical tests for three physics-based systems (treated as black-boxes) having high-dimensional stochastic inputs of varying complexity modeled as both Gaussian and non-Gaussian random fields to investigate the effect of the intrinsic dimensionality of input data. We demonstrate both the advantages and limitations of the unsupervised learning methods and we conclude that a suitable m-PCE model provides a cost-effective approach compared to alternative algorithms proposed in the literature, including recently proposed expensive deep neural network-based surrogates and can be readily applied for high-dimensional UQ in stochastic PDEs.

42 ENGINEERING↗

Quasi-periodic solutions for d-dimensional beam equation with derivative nonlinear perturbation

In this paper, we consider the d-dimensional beam equation with convolution potential under periodic boundary conditions. We will apply the Kolmogorov-Arnold-Moser theorem in Eliasson and Kuksin [Ann. Math. 172, 371-435 (2010)] into this system and obtain that for sufficiently small ε, there is a large subset S′ of S such that for all s ∈ S′, the solution u of the unperturbed system persists as a time-quasi-periodic solution which has all Lyapunov exponents equal to zero and whose linearized equation is reducible to constant coefficients.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Regular black holes in f(T) Gravity through a nonlinear electrodynamics source

We seek to obtain a new class of exact solutions of regular black holes in f(T) Gravity with non-linear electrodynamics material content, with spherical symmetry in 4D. The equations of motion provide the regaining of various solutions of General Relativity, as a particular case where the function f(T)=T. We developed a powerful method for finding exact solutions, where we get the first new class of regular black holes solutions in the f(T) Theory, where all the geometrics scalars disappear at the origin of the radial coordinate and are finite everywhere, as well as a new class of singular black holes.

79 ASTRONOMY AND ASTROPHYSICS↗

Linear-optics realization of channels for single-photon multimode qudits

We propose and theoretically study a method for the stochastic realization of arbitrary quantum channels on multimode single-photon qudits. In order for our method to be undemanding in its implementation, we restrict our analysis to linear-optical techniques, vacuum ancillary states, and nonadaptive schemes, but we allow for random switching between different optical networks. With our method it is possible to deterministically implement random-unitary channels and to stochastically implement general channels. We provide an expression for the optimal probability of success of our scheme and calculate this quantity for specific examples such as the qubit amplitude-damping channel. The success probability is shown to be related to the entanglement properties of the Choi-Jamiolkowski state isomorphic to the channel.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance Analysis and Design Synthesis (PADS) computer program. Volume 3: User manual

The two-fold purpose of the Performance Analysis and Design Synthesis (PADS) computer program is discussed. The program can size launch vehicles in conjunction with calculus-of-variations optimal trajectories and can also be used as a general purpose branched trajectory optimization program. For trajectory optimization alone or with sizing, PADS has two trajectory modules. The first trajectory module uses the method of steepest descent. The second module uses the method of quasi-linearization, which requires a starting solution from the first trajectory module.

Source record↗

Semidirect calculation of steady two- and three-dimensional flows

This paper describes a semidirect method for rapidly solving steady-state viscous flows described by the complete Navier-Stokes equations. The current results are for two-dimensional incompressible flows in general channels at arbitrary Reynolds numbers, but work in progress on compressible and three-dimensional flows is also described. The basic concept of semidirect methods is to use the recently developed fast (direct, or noniterative) linear solvers to solve linearized equations, which are then iterated to solve the nonlinearity. The method used here is an extension of the Split NOS method (Roache, 1975)

Roache, P. J.↗