Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear algebra”

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

Numerical solution of systems of fractional delay differential equations using a new kind of wavelet basis

In the present paper, a new orthonormal wavelet basis, called Chelyshkov wavelet, is constructed from a class of orthonormal polynomials. These wavelet basis and their properties are utilized to obtain their operational matrix of fractional integration in the Riemann–Liouville sense and delay operational matrix. Convergence and error bound of the expansion by this kind of wavelet functions are investigated. Then, these operational matrices along with the Galerkin approach have been implemented to solve systems of fractional delay differential equations (SFDDEs). The main superiority of the proposed technique is that it reduces SFDDEs to a system of algebraic equations. Moreover, accuracy and efficiency of the suggested Chelyshkov wavelet approach are verified through some linear and nonlinear SFDDEs. Finally, the obtained numerical results are compared with those previously reported in the literature.

97 MATHEMATICS AND COMPUTING↗

Applications of symbolic computing methods to the dynamic analysis of large systems

Since the symbolic computing language is very well suited to the operations with algebraic equations, techniques use the transfer function concept as a tool for the analysis of large linear dynamic systems. Techniques were coded in the experimental symbolic computer language FORMAC. The first of these approaches, REDUCE 1, establishes the techniques and a computer program to symbolically reduce arbitrary block diagrams associated with large systems for desired transfer functions. Symbolic closed form solutions are determined in several forms including an expanded form in terms of the driving frequencies and system constants. Programs are also written to numerically evaluate the symbolic solutions. A second computer program, REDUCE 2, is also based on the use of symbolic computing methods and was written to accommodate large engineering systems.

Lorenzo, C. F.↗

Application of Hybrid Optimization-Expert System for Optimal Power Management on Board Space Power Station

The space power system has two sources of energy: photo-voltaic blankets and batteries. The optimal power management problem on-board has two broad operations: off-line power scheduling to determine the load allocation schedule of the next several hours based on the forecast of load and solar power availability. The nature of this study puts less emphasis on speed requirement for computation and more importance on the optimality of the solution. The second category problem, on-line power rescheduling, is needed in the event of occurrence of a contingency to optimally reschedule the loads to minimize the 'unused' or 'wasted' energy while keeping the priority on certain type of load and minimum disturbance of the original optimal schedule determined in the first-stage off-line study. The computational performance of the on-line 'rescheduler' is an important criterion and plays a critical role in the selection of the appropriate tool. The Howard University Center for Energy Systems and Control has developed a hybrid optimization-expert systems based power management program. The pre-scheduler has been developed using a non-linear multi-objective optimization technique called the Outer Approximation method and implemented using the General Algebraic Modeling System (GAMS). The optimization model has the capability of dealing with multiple conflicting objectives viz. maximizing energy utilization, minimizing the variation of load over a day, etc. and incorporates several complex interaction between the loads in a space system. The rescheduling is performed using an expert system developed in PROLOG which utilizes a rule-base for reallocation of the loads in an emergency condition viz. shortage of power due to solar array failure, increase of base load, addition of new activity, repetition of old activity etc. Both the modules handle decision making on battery charging and discharging and allocation of loads over a time-horizon of a day divided into intervals of 10 minutes. The models have been extensively tested using a case study for the Space Station Freedom and the results for the case study will be presented. Several future enhancements of the pre-scheduler and the 'rescheduler' have been outlined which include graphic analyzer for the on-line module, incorporating probabilistic considerations, including spatial location of the loads and the connectivity using a direct current (DC) load flow model.

Momoh, James↗

The Kummer tensor density in electrodynamics and in gravity

Guided by results in the premetric electrodynamics of local and linear media, we introduce on 4-dimensional spacetime the new abstract notion of a Kummer tensor density of rank four, K{sup ijkl}. This tensor density is, by definition, a cubic algebraic functional of a tensor density of rank four T{sup ijkl}, which is antisymmetric in its first two and its last two indices: T{sup ijkl}=−T{sup jikl}=−T{sup ijlk}. Thus, K∼T{sup 3}, see Eq. (46). (i) If T is identified with the electromagnetic response tensor of local and linear media, the Kummer tensor density encompasses the generalized Fresnel wave surfaces for propagating light. In the reversible case, the wave surfaces turn out to be Kummer surfaces as defined in algebraic geometry (Bateman 1910). (ii) If T is identified with the curvature tensor R{sup ijkl} of a Riemann–Cartan spacetime, then K∼R{sup 3} and, in the special case of general relativity, K reduces to the Kummer tensor of Zund (1969). This K is related to the principal null directions of the curvature. We discuss the properties of the general Kummer tensor density. In particular, we decompose K irreducibly under the 4-dimensional linear group GL(4,R) and, subsequently, under the Lorentz group SO(1,3)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analytical Solutions for Non-Linear Differential Equations with the Help of a Digital Computer

A technique was developed with the help of a digital computer for analytic (algebraic) solutions of autonomous and nonautonomous equations. Two operational transform techniques have been programmed for the solution of these equations. Only relatively simple nonlinear differential equations have been considered. In the cases considered it has been possible to assimilate the secular terms into the solutions. For cases where f(t) is not a bounded function, a direct series solution is developed which can be shown to be an analytic function. All solutions have been checked against results obtained by numerical integration for given initial conditions and constants. It is evident that certain nonlinear differential equations can be solved with the help of a digital computer.

Cromwell, P. C.↗

A linearity preserving nodal variation limiting algorithm for continuous Galerkin discretization of ideal MHD equations

A stabilized continuous Galerkin (CG) method for magnetohydrodynamics (MHD) is presented herein. Ideal, compressible inviscid MHD equations are discretized in space on unstructured meshes using piecewise linear or bilinear finite element bases to get a semi-discrete scheme. Stabilization is then introduced to the semi-discrete method in a strategy that follows the algebraic flux correction paradigm. This involves adding some artificial diffusion to the high order, semi-discrete method and mass lumping in the time derivative term. The result is a low order method that provides local extremum diminishing properties for hyperbolic systems. The difference between the low order method and the high order method is scaled element-wise using a limiter and added to the low order scheme. The limiter is solution dependent and computed via an iterative linearity preserving nodal variation limiting strategy. The stabilization also involves an optional consistent background high order dissipation that reduces phase errors. The resulting stabilized scheme is a semi-discrete method that can be applied to inviscid shock MHD problems and may be even extended to resistive and viscous MHD problems. To satisfy the divergence free constraint of the MHD equations, we add parabolic divergence cleaning to the system. Various time integration methods can be used to discretize the scheme in time. We demonstrate the robustness of the scheme by solving several shock MHD problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance of fully-coupled algebraic multigrid preconditioners for large-scale VMS resistive MHD

Here, we explore the current performance and scaling of a fully-implicit stabilized unstructured finite element (FE) variational multiscale (VMS) capability for large-scale simulations of 3D incompressible resistive magnetohydrodynamics (MHD). The large-scale linear systems that are generated by a Newton nonlinear solver approach are iteratively solved by preconditioned Krylov subspace methods. The efficiency of this approach is critically dependent on the scalability and performance of the algebraic multigrid preconditioner. Our study considers the performance of the numerical methods as recently implemented in the second-generation Trilinos implementation that is 64-bit compliant and is not limited by the 32-bit global identifiers of the original Epetra-based Trilinos. The study presents representative results for a Poisson problem on 1.6 million cores of an IBM Blue Gene/Q platform to demonstrate very large-scale parallel execution. Additionally, results for a more challenging steady-state MHD generator and a transient solution of a benchmark MHD turbulence calculation for the full resistive MHD system are also presented. These results are obtained on up to 131,000 cores of a Cray XC40 and one million cores of a BG/Q system.

97 MATHEMATICS AND COMPUTING↗

Second Linear Response Theory and the Analytic Calculation of Excited-State Properties

We present a method based on second linear response time-dependent density func- tional theory (TDDFT) to calculate permanent and transition multipoles of excited states, which are required to compute excited-state absorption/emission spectra, multi- photon optical processes, among others. In previous work, we examined computations based on second linear response theory in which linear response TDDFT was employed twice. In contrast, the present methodology only requires information from a single linear response calculation to compute the excited-state properties. These are eval- uated analytically through various algebraic operations involving electron repulsion integrals and excitation vectors. The present derivation focuses on full many-body wave functions instead of single orbitals, as in our previous approach. Here, we test the proposed method by applying it to several diatomic and triatomic molecules. This shows that the computed excited-state dipoles are consistent with respect to reference equation-of-motion coupled cluster calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal function estimation with photonic quantum sensor networks

The problem of optimally measuring an analytic function of unknown local parameters each linearly coupled to a qubit sensor is well understood, with applications ranging from field interpolation to noise characterization. Here we resolve a number of open questions that arise when extending this framework to Mach-Zehnder interferometers and quadrature displacement sensing. In particular, we derive lower bounds on the achievable mean square error in estimating a linear function of either local phase shifts or quadrature displacements. In the case of local phase shifts, these results prove, and somewhat generalize, a conjecture by Proctor []. For quadrature displacements, we extend proofs of lower bounds to the case of arbitrary linear functions. We provide optimal protocols achieving these bounds up to small (multiplicative) constants and describe an algebraic approach to deriving new optimal protocols, possibly subject to additional constraints. Using this approach, we prove necessary conditions for the amount of entanglement needed for any optimal protocol for both local phase and displacement sensing. Published by the American Physical Society 2024

Bringewatt, Jacob↗

Quantum groups as generalized gauge symmetries in WZNW models. Part II. The quantized model

This is the second part of a paper dealing with the “internal” (gauge) symmetry of the Wess-Zumino-Novikov-Witten (WZNW) model on a compact Lie group G. It contains a systematic exposition, for G = SU(n), of the canonical quantization based on the study of the classical model (performed in the first part) following the quantum group symmetric approach first advocated by L.D. Faddeev and collaborators. The internal symmetry of the quantized model is carried by the chiral WZNW zero modes satisfying quadratic exchange relations and an n-linear determinant condition. For generic values of the deformation parameter the Fock representation of the zero modes’ algebra gives rise to a model space of U{sub q}(sl(n)). The relevant root of unity case is studied in detail for n = 2 when a “restricted” (finite dimensional) quotient quantum group is shown to appear in a natural way. The module structure of the zero modes’ Fock space provides a specific duality with the solutions of the Knizhnik-Zamolodchikov equation for the four point functions of primary fields suggesting the existence of an extended state space of logarithmic CFT type. Combining left and right zero modes (i.e., returning to the 2D model), the rational CFT structure shows up in a setting reminiscent to covariant quantization of gauge theories in which the restricted quantum group plays the role of a generalized gauge symmetry.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Three-dimensional vibration analysis of a uniform beam with offset inertial masses at the ends

Analysis of a flexible beam with displaced end-located inertial masses is presented. The resulting three-dimensional mode shape is shown to consist of two one-plane bending modes and one torsional mode. These three components of the mode shapes are shown to be linear combinations of trigonometric and hyperbolic sine and cosine functions. Boundary conditions are derived to obtain nonlinear algebraic equations through kinematic coupling of the general solutions of the three governing partial differential equations. A method of solution which takes these boundary conditions into account is also presented. A computer program has been written to obtain unique solutions to the resulting nonlinear algebraic equations. This program, which calculates natural frequencies and three-dimensional mode shapes for any number of modes, is presented and discussed.

Robertson, D. K.↗

Relative water content of Spruce needles determined by the leaf water content index

Leaf relative water content (RWC) is defined as the volume of water in a leaf divided by the volume at full turgor. Using reflectance factors of wavelengths 0.83 micron and 1.6 microns, a Leaf Water Content Index (LWCI) was derived from the Lambert-Beer Law such that LWCI should equal RWC; LWCI was equal to RWC for Picea pungens, Picea rubens, Liquidambar styraciflua, and Quercus agrifolia. Algebraic manipulation shows that R(1.6)/R(0.83) termed the Moisture Stress Index (MSI), is near-linearly correlated to RWC and to the Equivalent Water Thickness (EWT). Five species tested so far had the same relationship between MSI and EWT, but EWT is not a measure of plant water status.

Hunt, E. Raymond, Jr.↗

Inverse sequential procedures for the monitoring of time series

Climate changes traditionally have been detected from long series of observations and long after they happened. The 'inverse sequential' monitoring procedure is designed to detect changes as soon as they occur. Frequency distribution parameters are estimated both from the most recent existing set of observations and from the same set augmented by 1,2,...j new observations. Individual-value probability products ('likelihoods') are then calculated which yield probabilities for erroneously accepting the existing parameter(s) as valid for the augmented data set and vice versa. A parameter change is signaled when these probabilities (or a more convenient and robust compound 'no change' probability) show a progressive decrease. New parameters are then estimated from the new observations alone to restart the procedure. The detailed algebra is developed and tested for Gaussian means and variances, Poisson and chi-square means, and linear or exponential trends; a comprehensive and interactive Fortran program is provided in the appendix.

Radok, Uwe↗

Afterbody External Aerodynamic and Performance Prediction at High Reynolds Numbers

This CFD experiment concludes that the potential difference between the flow between a flight Reynolds number test and a sub-scale wind tunnel test are substantial for this particular nozzle boattail geometry. The early study was performed using a linear k-epsilon turbulence model. The present study was performed using the Girimaji formulation of a algebraic Reynolds stress turbulent simulation.

Carlson, John R.↗

Investigation of Conjugate Heat Transfer in Turbine Blades and Vanes

We report on work carried out to develop a 3-D coupled Finite Volume/BEM-based temperature forward/flux back (TFFB) coupling algorithm to solve the conjugate heat transfer (CHT) which arises naturally in analysis of systems exposed to a convective environment. Here, heat conduction within a structure is coupled to heat transfer to the external fluid which is convecting heat into or out of the solid structure. There are two basic approaches to solving coupled fluid structural systems. The first is a direct coupling where the solution of the different fields is solved simultaneously in one large set of equations. The second approach is a loose coupling strategy where each set of field equations is solved to provide boundary conditions for the other. The equations are solved in turn until an iterated convergence criterion is met at the fluid-solid interface. The loose coupling strategy is particularly attractive when coupling auxiliary field equations to computational fluid dynamics codes. We adopt the latter method in which the BEM is used to solve heat conduction inside a structure which is exposed to a convective field which in turn is resolved by solving the NASA Glenn compressible Navier-Stokes finite volume code Glenn-HT. The BEM code features constant and bi-linear discontinuous elements and an ILU-preconditioned GMRES iterative solver for the resulting non-symmetric algebraic set arising in the conduction solution. Interface of flux and temperature is enforced at the solid/fluid interface, and a radial-basis function scheme is used to interpolated information between the CFD and BEM surface grids. Additionally, relaxation is implemented in passing the fluxes from the conduction solution to the fluid solution. Results from a simple test example are reported.

Kassab, A. J.↗

Adaptive Algebraic Multigrid for Finite Element Elliptic Equations with Random Coefficients

This thesis presents a two-grid algorithm based on Smoothed Aggregation Spectral Element Agglomeration Algebraic Multigrid (SA-ρAMGe) combined with adaptation. The aim is to build an efficient solver for the linear systems arising from discretization of second-order elliptic partial differential equations (PDEs) with stochastic coefficients. Examples include PDEs that model subsurface flow with random permeability field. During a Markov Chain Monte Carlo (MCMC) simulation process, that draws PDE coefficient samples from a certain distribution, the PDE coefficients change, hence the resulting linear systems to be solved change. At every such step the system (discretized PDE) needs to be solved and the computed solution used to evaluate some functional(s) of interest that then determine if the coefficient sample is acceptable or not. The MCMC process is hence computationally intensive and requires the solvers used to be efficient and fast. This fact that at every step of MCMC the resulting linear system changes, makes an already existing solver built for the old problem perhaps not as efficient for the problem corresponding to the new sampled coefficient. This motivates the main goal of our study, namely, to adapt an already existing solver to handle the problem (with changed coefficient) with the objective to achieve this goal to be faster and more efficient than building a completely new solver from scratch. Our approach utilizes the local element matrices (for the problem with changed coefficients) to build local problems associated with constructed by the method agglomerated elements (a set of subdomains that cover the given computational domain). We solve a generalized eigenproblem for each set in a subspace spanned by the previous local coarse space (used for the old solver) and a vector, component of the error, that the old solver cannot handle. A portion of the spectrum of these local eigen-problems (corresponding to eigenvalues close to zero) form the coarse basis used to define the new two-level method of our interest. We illustrate the performance of this adaptive two-level procedure with a large set of numerical experiments that demonstrate its efficiency over building the solvers from scratch.

97 MATHEMATICS AND COMPUTING↗

Compare linear-system solver and preconditioner stacks with emphasis on GPU performance and propose phase-2 NGP solver development pathway

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind project are Nalu-Wind, which is an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, and OpenFAST, which is a whole-turbine simulation code. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. In this report we evaluated GPU-performance baselines for the linear solvers in the Trilinos and hypre solver stacks using two representative Nalu-Wind simulations: an atmospheric boundary layer precursor simulation on a structured mesh, and a fixed-wing simulation using unstructured overset meshes. Both strong-scaling and weak-scaling experiments were conducted on the OLCF supercomputer Summit and similar proxy clusters. We focused on the performance of multi-threaded Gauss-Seidel and two-stage Gauss-Seidel that are extensions of classical Gauss-Seidel; of one-reduce GMRES, a communication-reducing variant of the Krylov GMRES; and algebraic multigrid methods that incorporate the afore-mentioned methods. The team has established that AMG methods are capable of solving linear systems arising from the fixed-wing overset meshes on CPU, a critical intermediate result for ExaWind FY20 Q3 and Q4 milestones. For the fixed-wing strong-scaling study (model with 3M grid-points), the team identified that Nalu-Wind simulations with the new Trilinos and hypre solvers scale to modest GPU counts, maintaining above 70% efficiency up to 6 GPUs. However, there still remain significant bottlenecks to performance: matrix assembly (hypre), AMG setup (hypre and Trilinos) In the weak-scaling experiments (going from 0.4M to 211M gridpoints), it's shown that the solver apply phases are faster on GPUs, but that Nalu-Wind simulation times grow, primarily due to the multigrid-setup process. Finally, based on the report outcomes, we propose a linear solver path-forward for the remainder of the ExaWind project. Near term, the NREL team will continue their work on GPU-based linear-system assembly. They will also investigate how the use of alternatives to the NVIDIA UVM (unified virtual memory) paradigm affects performance. Longer term, the NREL team will evaluate algorithmic performance on other types of accelerators and merge their improvements back to the main hypre repository branch. Near term, the Trilinos team will address performance bottlenecks identified in this milestone, such as implementing a GPU-based segregated momentum solve and reusing matrix graphs across linear-system assembly phases. Longer term, the Trilinos team will do detailed analysis and optimization of multigrid setup.

17 WIND ENERGY↗

An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices

In this work, we describe a multilevel preconditioning technique for solving sparse symmetric linear systems of equations. This “Multilevel Schur Low-Rank” (MSLR) preconditioner first builds a tree structure $\mathcal{T}$ based on a hierarchical decomposition of the matrix and then computes an approximate inverse of the original matrix level by level. Unlike classical direct solvers, the construction of the MSLR preconditioner follows a top-down traversal of $\mathcal{T}$ and exploits a low-rank property that is satisfied by the difference between the inverses of the local Schur complements and specific blocks of the original matrix. A few steps of the generalized Lanczos tridiagonalization procedure are applied to capture most of this difference. Numerical results are reported to illustrate the efficiency and robustness of the MSLR preconditioner with both two- and three-dimensional discretized PDE problems and with publicly available test problems.

97 MATHEMATICS AND COMPUTING↗