Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical mathematics”

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 1,351 records · Page 75
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Theoretical models for duct acoustic propagation and radiation

The development of computational methods in acoustics has led to the introduction of analysis and design procedures which model the turbofan inlet as a coupled system, simultaneously modeling propagation and radiation in the presence of realistic internal and external flows. Such models are generally large, require substantial computer speed and capacity, and can be expected to be used in the final design stages, with the simpler models being used in the early design iterations. Emphasis is given to practical modeling methods that have been applied to the acoustical design problem in turbofan engines. The mathematical model is established and the simplest case of propagation in a duct with hard walls is solved to introduce concepts and terminologies. An extensive overview is given of methods for the calculation of attenuation in uniform ducts with uniform flow and with shear flow. Subsequent sections deal with numerical techniques which provide an integrated representation of duct propagation and near- and far-field radiation for realistic geometries and flight conditions.

Eversman, Walter↗
NASA NTRS1993

Numerical simulation of upstream disturbance on flows around a slender body

Numerical solutions of the thin-layer approximation of the compressible Navier-Stokes equations have been obtained for flows around an ogive-cylinder body with and without a small fixed disturbance placed upstream of the body tip. Locating the disturbance at positions in the flow field upstream of the tip provokes the same range of behavior of the asymmetric flow that was numerically produced earlier by use of a geometrical disturbance on the body tip. Results remain consistent with the presence of a convective instability mechanism, and demonstrate the potential for a precise mapping of the body's receptivity to fixed disturbances in the flow field. Numerical solutions were also obtained for the flow-field responses to impulsive upstream disturbances to determine whether there is a growing response to an asymmetric impulsive disturbance that is consistent with presence of a convective instability mechanism. Results for surface pressure are interpreted with the aid of a mathematical model. The model suggests that the observed growth of surface pressure gradient with time and distance along a ray in response to an asymmetnc impulsive disturbance is in accord with the solution of a Ginzberg-Landau equation, with distinguishing features of the solution being consistent with the convective instability mode of behavior.

Degani, David↗
NASA NTRS2011

Engineering and Scientific Applications: Using MatLab(Registered Trademark) for Data Processing and Visualization

MatLab(TradeMark)(MATrix LABoratory) is a numerical computation and simulation tool that is used by thousands Scientists and Engineers in many countries. MatLab does purely numerical calculations, which can be used as a glorified calculator or interpreter programming language; its real strength is in matrix manipulations. Computer algebra functionalities are achieved within the MatLab environment using "symbolic" toolbox. This feature is similar to computer algebra programs, provided by Maple or Mathematica to calculate with mathematical equations using symbolic operations. MatLab in its interpreter programming language form (command interface) is similar with well known programming languages such as C/C++, support data structures and cell arrays to define classes in object oriented programming. As such, MatLab is equipped with most of the essential constructs of a higher programming language. MatLab is packaged with an editor and debugging functionality useful to perform analysis of large MatLab programs and find errors. We believe there are many ways to approach real-world problems; prescribed methods to ensure foregoing solutions are incorporated in design and analysis of data processing and visualization can benefit engineers and scientist in gaining wider insight in actual implementation of their perspective experiments. This presentation will focus on data processing and visualizations aspects of engineering and scientific applications. Specifically, it will discuss methods and techniques to perform intermediate-level data processing covering engineering and scientific problems. MatLab programming techniques including reading various data files formats to produce customized publication-quality graphics, importing engineering and/or scientific data, organizing data in tabular format, exporting data to be used by other software programs such as Microsoft Excel, data presentation and visualization will be discussed.

Sen, Syamal K.↗
DOE OSTI2021

Analysis of the ratio of ℓ 1 and ℓ 2 norms in compressed sensing

We study the ratio of ℓ 1 and ℓ 2 norms ( ℓ 1 / ℓ 2 ) as a sparsity-promoting objective in compressed sensing. We first propose a novel criterion that guarantees that an s-sparse signal is the local minimizer of the ℓ 1 / ℓ 2 objective; our criterion is interpretable and useful in practice. We also give the first uniform recovery condition using a geometric characterization of the null space of the measurement matrix, and show that this condition is satisfied for a class of random matrices. We also present analysis on the robustness of the procedure when noise pollutes data. Numerical experiments are provided that compare ℓ 1 / ℓ 2 with some other popular non-convex methods in compressed sensing. Finally, we propose a novel initialization approach to accelerate the numerical optimization procedure. We call this initialization approach support selection, and we demonstrate that it empirically improves the performance of existing ℓ 1 / ℓ 2 algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Partitioned exponential methods for coupled multiphysics systems

Multiphysics problems involving two or more coupled physical phenomena are ubiquitous in science and engineering. This work develops a new partitioned exponential approach for the time integration of multiphysics problems. After a possible semi-discretization in space, the class of problems under consideration is modeled by a system of ordinary differential equations where the right-hand side is a summation of two component functions, each corresponding to a given set of physical processes. The partitioned-exponential methods proposed herein evolve each component of the system via an exponential integrator, and information between partitions is exchanged via coupling terms. Here, the traditional approach to constructing exponential methods, based on the variation-of-constants formula, is not directly applicable to partitioned systems. Rather, our approach to developing new partitioned-exponential families is based on a general-structure additive formulation of the schemes. Two method formulations are considered, one based on a linear-nonlinear splitting of the right hand component functions, and another based on approximate Jacobians. The paper develops classical (non-stiff) order conditions theory for partitioned exponential schemes based on particular families of T-trees and B-series theory. Several practical methods of third order are constructed that extend the Rosenbrock-type and EPIRK families of exponential integrators. Several implementation optimizations specific to the application of these methods to reaction-diffusion systems are also discussed. Numerical experiments reveal that the new partitioned-exponential methods can perform better than traditional unpartitioned exponential methods on some problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

A face-upwinded spectral element method

Here we present a new high-order accurate discretisation on unstructured meshes of quadrilateral elements. Our Face Upwinded Spectral Element (FUSE) method uses the same node distribution as a high-order continuous Galerkin (CG) method, but with a particular choice of node locations within each element and an upwinded stencil on the face nodes. This results in a number of benefits, including fewer degrees of freedom and straight-forward integration with CG. We present the derivation of the scheme and the analysis of its properties, in particular showing stability using von Neumann analysis. We show numerical evidence for its accuracy and efficiency on multiple classes of problems including convection-dominated flows, Poisson's equation, and the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Multigrid Optimization for Large-Scale Ptychographic Phase Retrieval

Ptychography is a popular imaging technique that combines diffractive imaging with scanning microscopy. The technique consists of a coherent beam that is scanned across an object in a series of overlapping positions, leading to reliable and improved reconstructions. Ptychographic microscopes allow for large fields to be imaged at high resolution at the cost of additional computational expense. Herein, we propose a multigrid-based optimization framework to reduce the computational burdens of large-scale ptychographic phase retrieval. Our proposed method exploits the inherent hierarchical structures in ptychography through tailored restriction and prolongation operators for the object and data domains. Our numerical results show that our proposed scheme accelerates the convergence of its underlying solver and outperforms the ptychographical iterative engine, a workhorse in the optics community.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Asymptotically Compatible Reproducing Kernel Collocation and Meshfree Integration for Nonlocal Diffusion

Reproducing kernel (RK) approximations are meshfree methods that construct shape functions from sets of scattered data. We present an asymptotically compatible (AC) RK collocation method for nonlocal diffusion models with Dirichlet boundary condition. The numerical scheme is shown to be convergent to both nonlocal diffusion and its corresponding local limit as nonlocal interaction vanishes. The analysis is carried out on a special family of rectilinear Cartesian grids for a linear RK method with designed kernel support. The key idea for the stability of the RK collocation scheme is to compare the collocation scheme with the standard Galerkin scheme, which is stable. In addition, assembling the stiffness matrix of the nonlocal problem requires costly computational resources because high-order Gaussian quadrature is necessary to evaluate the integral. We thus provide a remedy to the problem by introducing a quasi-discrete nonlocal diffusion operator for which no numerical quadrature is further needed after applying the RK collocation scheme. The quasi-discrete nonlocal diffusion operator combined with RK collocation is shown to be convergent to the correct local diffusion problem by taking the limits of nonlocal interaction and spatial resolution simultaneously. The theoretical results are then validated with numerical experiments. We additionally illustrate a connection between the proposed technique and an existing optimization based approach based on generalized moving least squares.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Vision Transformers Explained Series

Since their introduction in 2017 with Attention is All You Need¹, transformers have established themselves as the state of the art for natural language processing (NLP). In 2021, An Image is Worth 16x16 Words successfully adapted transformers for computer vision tasks. Since then, numerous transformer-based architectures have been proposed for computer vision. This article walks through the Vision Transformer (ViT) as laid out in An Image is Worth 16x16 Words.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Level 2 Milestone: Develop and Incorporate Novel Code Verification of Fundamental Equations in Gemma and Set Up Appropriate Tests

For computational physics simulations, code verification plays a major role in establishing the credibility of the results by assessing the correctness of the implementation of the underlying numerical methods. In computational electromagnetics, surface integral equations, such as the method-of-moments implementations of the electric-, magnetic-, and combinedfield integral equations, are frequently used to solve Maxwell’s equations on the surfaces of electromagnetic scatterers. These electromagnetic surface integral equations yield many code-verification challenges due to the various sources of numerical error and their possible interactions. In this report, we provide approaches to separately measure the numerical errors arising from these different error sources. We demonstrate the effectiveness of these approaches in Gemma.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1976

Solutions to divergence form equations using the method of partial implicitization

Partial implicitization is well suited for use on vector-processing computers since the method is an explicit unconditionally stable numerical technique. So far equations cast in nondivergence form have been used, though equations cast in the divergence form would have inherently greater accuracy. Since the method of partial implicitization is applicable only to relaxing problems to their steady state and is not applicable to true transient problems, a simple mathematical manipulation can be carried out which will produce the desired partial implicitization solution to divergence form equations.

Graves, R. A., Jr.↗
NASA NTRS1982

The calculation of transport phenomena in electromagnetically levitated metal droplets

A mathematical representation has been developed for the electromagnetic force field, fluid flow field, and solute concentration field of levitation-melted metal specimens. The governing equations consist of the conventional transport equations combined with the appropriate expressions for the electromagnetic force field. The predictions obtained by solving the governing equations numerically on a digital computer are in good agreement with lifting force and average temperature measurements reported in the literature.

El-Kaddah, N.↗
NASA NTRS1985

Nonlinear rotordynamics analysis

The special nonlinearities of the Jeffcott equations in rotordynamics are examined. The immediate application of this analysis is directed toward understanding the excessive vibrations recorded in the LOX pump of the SSME during hot firing ground testing. Deadband, side force and rubbing are three possible sources of inducing nonlinearity in the Jeffcott equations. The present analysis initially reduces these problems to the same mathematical description. A special frequency, named the nonlinear natural frequency is defined and used to develop the solutions of the nonlinear Jeffcott equations as asympotic expansions. This nonlinear natural frequency which is the ratio of the cross-stiffness and the damping, plays a major role in determining response frequencies. Numerical solutions are included for comparison with the analysis. Also, nonlinear frequency-response tables are made for a typical range of values.

Day, W. B.↗
NASA NTRS2003

Universal Behavior of a Cyclic Oxidation Model

A mathematical model has been generated to represent the iterative, discrete growth and spallation processes associated with cyclic oxidation. Parabolic growth kinetics (k(sub p)) over and a constant spall area (F(sub A)) were assumed, with spalling occurring interfacially at the thickest regions of the scale. Although most models require numerical techniques, the regularity and simplicity of this progression permitted an approximation by algebraic expressions. Normalization could now be performed to reflect all parametric effects, and a universal cyclic oxidation response was generated: W(sub u) = 1/2 {3J(sub u)(sup 1/2)+ J(sub u)(sup 3/2)} where W, is weight change normalized by the maximum and J(sub u) is the cycle number normalized by the number to reach maximum. Similarly, the total amount of metal consumed was represented by a single normalized curve. The factor [(S(sub c)-l)(raised dot)sqrt(F(sub A)k(sub p)DELTAt)] was identified as a general figure of merit, where S(sub c) is the mass ratio of oxide to oxygen and DELTAt is the cycle duration. A cyclic oxidation failure map was constructed, in normalized k(sub p)-F(sub A) space, as defined by the locus of points corresponding to a critical amount of metal consumption in a given time. All three constructions describe behavior for every value of growth rate, spall fraction, and cycle duration by means of single curves, but with two branches corresponding to the times before and after steady state is achieved.

Smialek, James L.↗
DOE OSTI2023

High-Order Mesh hr-adaptivity for Surface Fitting to Implicit Geometries

We present an ℎ𝑟-adaptivity framework for morphing a given mesh to fit a target surface prescribed as the zero isocontour of a discrete function. In this framework, high-order meshing is posed as a variational minimization problem that depends on the mesh quality prescribed via the target matrix optimization paradigm (TMOP) and position of a subset of mesh nodes with respect to the target surface. The proposed formulation ensures that the variational problem is converged and mesh quality degradation near the surface is limited, even when the mesh topology is incompatible with the target surface. Additionally, a mesh subset-based approach and ℎ-refinement is introduced to efficiently increase fitting accuracy while reducing the computational cost of the mesh morphing problem. The ℎ𝑟-adaptivity technique extends to different element types in two- and three-dimensions, and can be used in existing finite element and spectral element frameworks to obtain high-order body-fitted meshes. Various numerical experiments demonstrate the robustness and accuracy of the fitting approach for problems of practical interest such as Lagrangian hydrodynamics and topology optimization.

97 MATHEMATICS AND COMPUTING↗