SEARCH · Search NASA
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.
Programs based on equations that include functions for boundary values along nozzle axis yield different types of flow field configurations. Program's documentation details method of calculating subsonic flow field and sonic line, and describes modified method of characteristics for calculating supersonic flow downstream of sonic line.
Jet-based printing techniques and direct ink writing have emerged as complementary, convergent technologies serving as key platforms in additive manufacturing for functional nano- to microscale architectures. This review highlights how these approaches enable fine feature resolution and three-dimensional structures in advanced electronics and biointerfacing applications. The interplay of fluid mechanics, viscoelastic ink rheology, droplet–substrate interactions, and drying dynamics is examined as a critical determinant of printing fidelity. Application-focused case studies, from flexible thin-film transistors to bioprinted artificial tissues, demonstrate how precise structural control via printing translates to enhanced device performance and new functionality in electronic and biological systems. Finally, we discuss the challenges and future opportunities driving the evolution of these printing platforms toward autonomous, adaptive, and intelligent manufacturing systems.
The concept of contracting-interval programs is applied to finding the eigenvalues of a matrix. The development is a three-step process in which (1) a program is developed for the reduction of a matrix to Hessenberg form, (2) a program is developed for the reduction of a Hessenberg matrix to colleague form, and (3) the characteristic polynomial with interval coefficients is readily obtained from the interval of colleague matrices. This interval polynomial is then factored into quadratic factors so that the eigenvalues may be obtained. To develop a contracting-interval program for factoring this polynomial with interval coefficients it is necessary to have an iteration method which converges even in the presence of controlled rounding errors. A theorem is stated giving sufficient conditions for the convergence of Newton's method when both the function and its Jacobian cannot be evaluated exactly but errors can be made proportional to the square of the norm of the difference between the previous two iterates. This theorem is applied to prove the convergence of the generalization of the Newton-Bairstow method that is used to obtain quadratic factors of the characteristic polynomial.
The problem of synthesizing transfer functions from frequency response measurements is considered. Given a complex vector representing the measured frequency response of a physical system, a transfer function of specified order is determined that minimizes the sum of the magnitude-squared of the frequency response errors. This nonlinear least squares minimization problem is solved by an iterative global descent algorithm of the Newton type which converges quadratically near the minimum. The unknown transfer function is expressed as a sum of second order rational polynomials, a parameterization that facilitates a numerically robust computer implementation. The algorithm is developed for single-input, single-output, causal, stable transfer functions.
In this paper the problem of synthesizing transfer functions from frequency response measurements is considered. Given a complex vector representing the measured frequency response of a physical system, a transfer function of specified order is determined that minimizes the sum of the magnitude-squared of the frequency response errors. This nonlinear least squares minimization problem is solved by an iterative global descent algorithm of the Newton type that converges quadratically near the minimum. The unknown transfer function is expressed as a sum of second-order rational polynomials, a parameterization that facilitates a numerically robust computer implementation. The algorithm is developed for single-input, single-output, causal, stable transfer functions. Two numerical examples demonstrate the effectiveness of the algorithm.
In the present technological society, there is a major need to build machines that would execute intelligent tasks operating in uncertain environments with minimum interaction with a human operator. Although some designers have built smart robots, utilizing heuristic ideas, there is no systematic approach to design such machines in an engineering manner. Recently, cross-disciplinary research from the fields of computers, systems AI and information theory has served to set the foundations of the emerging area of the design of intelligent machines. Since 1977 Saridis has been developing an approach, defined as Hierarchical Intelligent Control, designed to organize, coordinate and execute anthropomorphic tasks by a machine with minimum interaction with a human operator. This approach utilizes analytical (probabilistic) models to describe and control the various functions of the intelligent machine structured by the intuitively defined principle of Increasing Precision with Decreasing Intelligence (IPDI) (Saridis 1979). This principle, even though resembles the managerial structure of organizational systems (Levis 1988), has been derived on an analytic basis by Saridis (1988). The purpose is to derive analytically a Boltzmann machine suitable for optimal connection of nodes in a neural net (Fahlman, Hinton, Sejnowski, 1985). Then this machine will serve to search for the optimal design of the organization level of an intelligent machine. In order to accomplish this, some mathematical theory of the intelligent machines will be first outlined. Then some definitions of the variables associated with the principle, like machine intelligence, machine knowledge, and precision will be made (Saridis, Valavanis 1988). Then a procedure to establish the Boltzmann machine on an analytic basis will be presented and illustrated by an example in designing the organization level of an Intelligent Machine. A new search technique, the Modified Genetic Algorithm, is presented and proved to converge to the minimum of a cost function. Finally, simulations will show the effectiveness of a variety of search techniques for the intelligent machine.
In this presentation, the authors address topics relevant to higher order modeling using hybrid BEM/FEM formulations. The first of these is the limitation on convergence rates imposed by geometric modeling errors in the analysis of scattering by a dielectric sphere. The second topic is the application of an Incomplete LU Threshold (ILUT) preconditioner to solve the linear system resulting from the BEM/FEM formulation. The final tOpic is the application of the higher order BEM/FEM formulation to antenna modeling problems. The authors have previously presented work on the benefits of higher order modeling. To achieve these benefits, special attention is required in the integration of singular and near-singular terms arising in the surface integral equation. Several methods for handling these terms have been presented. It is also well known that achieving ~he high rates of convergence afforded by higher order bases may als'o require the employment of higher order geometry models. A number of publications have described the use of quadratic elements to model curved surfaces. The authors have shown in an EFIE formulation, applied to scattering by a PEC .sphere, that quadratic order elements may be insufficient to prevent the domination of modeling errors. In fact, on a PEC sphere with radius r = 0.58 Lambda(sub 0), a quartic order geometry representation was required to obtain a convergence benefi.t from quadratic bases when compared to the convergence rate achieved with linear bases. Initial trials indicate that, for a dielectric sphere of the same radius, - requirements on the geometry model are not as severe as for the PEC sphere. The authors will present convergence results for higher order bases as a function of the geometry model order in the hybrid BEM/FEM formulation applied to dielectric spheres. It is well known that the system matrix resulting from the hybrid BEM/FEM formulation is ill -conditioned. For many real applications, a good preconditioner is required to obtain usable convergence from an iterative solver. The authors have examined the use of an Incomplete LU Threshold (ILUT) preconditioner . to solver linear systems stemming from higher order BEM/FEM formulations in 2D scattering problems. Although the resulting preconditioner provided aD excellent approximation to the system inverse, its size in terms of non-zero entries represented only a modest improvement when compared with the fill-in associated with a sparse direct solver. Furthermore, the fill-in of the preconditioner could not be substantially reduced without the occurrence of instabilities. In addition to the results for these 2D problems, the authors will present iterative solution data from the application of the ILUT preconditioner to 3D problems.
A brief summary of the contents of this paper is presented here. In part I the differential equations of the problem of a gas flow in two dimensions is derived and the particular integrals by which the problem on jets is solved are given. Use is made of the same independent variables as Molenbroek used, but it is found to be more suitable to consider other functions. The stream function and velocity potential corresponding to the problem are given in the form of series. The investigation on the convergence of these series in connection with certain properties of the functions entering them forms the subject of part II. In part III the problem of the outflow of a gas from an infinite vessel with plane walls is solved. In part IV the impact of a gas jet on a plate is considered and the limiting case where the jet expands to infinity changing into a gas flow is taken up in more detail. This also solved the equivalent problem of the resistance of a gaseous medium to the motion of a plate. Finally, in part V, an approximate method is presented that permits a simpler solution of the problem of jet flows in the case where the velocities of the gas (velocities of the particles in the gas) are not very large.
Recent progress towards universal machine-learned interatomic potentials holds considerable promise for materials discovery. Yet the accuracy of these potentials for predicting phase stability may still be limited. In contrast, cluster expansions provide accurate phase stability predictions but are computationally demanding to parameterize from first principles, especially for structures of low dimension or with a large number of components, such as interfaces or multimetal catalysts. We overcome this trade-off via transfer learning. Using Bayesian inference, we incorporate prior statistical knowledge from machine-learned and physics-based potentials, enabling us to sample the most informative configurations and to efficiently fit first-principles cluster expansions. Furthermore, this algorithm is tested on Pt:Ni, showing robust convergence of the mixing energies as a function of sample size with reduced statistical fluctuations.
Abstract A major question in ΛCDM is what this theory actually predicts for the properties of subhalo populations. Subhalos are difficult to accurately simulate and to find within simulations, and this propagates into uncertainty in theoretical predictions for satellite galaxies. We present Symfind , a new particle-tracking-based subhalo finder, and demonstrate that it can track subhalos to orders-of-magnitude lower masses than commonly used halo-finding tools, with a focus on Rockstar and consistent-trees . These longer survival times mean that at a fixed peak subhalo mass, we find ≈ 15%–40% more subhalos within the virial radius, R vir , and ≈35%–120% more subhalos within R vir /4 in the Symphony dark-matter-only simulation suite. More subhalos are found as the resolution is increased, in contrast to the Rockstar halo finder, which appears to be converged at smaller subhalo counts. We perform extensive numerical testing. In agreement with idealized simulations, we show that the v max , the maximum circular velocity, is systematically biased low until high resolutions ( n peak ≳ 3 × 10 4 ) are achieved, but that mass loss itself can be resolved at much more modest resolutions ( n peak ≳ 4 × 10 3 ). We show that Rockstar converges to false solutions for the mass function, radial distribution, and disruption masses of subhalos. We argue that our new method can trace resolved subhalos until the point of typical galaxy disruption without invoking post hoc orphan modeling. We outline a concrete set of steps for determining whether other subhalo finders meet the same criteria. We publicly release Symfind catalogs and particle data for the Symphony simulation suite at http://web.stanford.edu/group/gfc/symphony .
Solution instabilities are identified within the procedures used to predict unsteady loadings due to motions of swept hingeline control surfaces. A preferred solution process that demonstrates the need of calculating smooth residual downwash distributions is described. Numerical results displaying erratic solution behavior when use is made of various forms of pressure expressions currently employed in control surface analyses are presented. A new expression of the asymptotic pressure function is derived, which exactly satisfies the change in boundary conditions around the boundary of the control surface. Results of applying the new pressure function are presented and indicate that stable converged solutions may be achieved for predicting the unsteady loadings caused by motions of swept hingeline control surfaces.
The dependency of Mach number on the Prandtl-Meyer function was numerically determined by iterating the Prandtl-Meyer function and applying the Muller method to converge on the Mach number for flows in cryogenic parahydrogen and nitrogen at various total pressures and total temperatures. The results are compared with the ideal diatomic gas values and are presented in tabular form.
Parameters which contribute to supersonic jet shock noise were investigated for the purpose of determining means to reduce such noise generation to acceptable levels. Six dual-stream test nozzles with varying flow passage and plug closure designs were evaluated under simulated flight conditions in an anechoic chamber. All nozzles had combined convergent-divergent or convergent flow passages. Acoustic behavior as a function of nozzle flow passage geometry was measured. The acoustic data consist primarily of 1/3 octave band sound pressure levels and overall sound pressure levels. Detailed schematics and geometric characteristics of the six scale model nozzle configurations and acoustic test point definitions are presented. Tabulation of aerodynamic test conditions and a computer listing of the measured acoustic data are displayed.
Optimization procedures are developed to systematically provide closely-spaced vibration frequencies. A general-purpose finite-element program for eigenvalue and sensitivity analyses is combined with formal mathematical programming techniques. Results are presented for three studies. The first study uses a simple model to obtain a design with two pairs of closely-spaced frequencies. Two formulations are developed: an objective function-based formulation and constraint-based formulation for the frequency spacing. It is found that conflicting goals are handled better by a constraint-based formulation. The second study uses a detailed model to obtain a design with one pair of closely-spaced frequencies while satisfying requirements on local member frequencies and manufacturing tolerances. Two formulations are developed. Both the constraint-based and the objective function-based formulations perform reasonably well and converge to the same results. However, no feasible design solution exists which satisfies all design requirements for the choices of design variables and the upper and lower design variable values used. More design freedom is needed to achieve a fully satisfactory design. The third study is part of a redesign activity in which a detailed model is used. The use of optimization in this activity allows investigation of numerous options (such as number of bays, material, minimum diagonal wall thicknesses) in a relatively short time. The procedure provides data for judgments on the effects of different options on the design.
Optimization procedures are developed to systematically provide closely-spaced vibration frequencies. A general purpose finite-element program for eigenvalue and sensitivity analyses is combined with formal mathematical programming techniques. Results are presented for three studies. The first study uses a simple model to obtain a design with two pairs of closely-spaced frequencies. Two formulations are developed: an objective function-based formulation and constraint-based formulation for the frequency spacing. It is found that conflicting goals are handled better by a constraint-based formulation. The second study uses a detailed model to obtain a design with one pair of closely-spaced frequencies while satisfying requirements on local member frequencies and manufacturing tolerances. Two formulations are developed. Both the constraint-based and the objective function-based formulations perform reasonably well and converge to the same results. However, no feasible design solution exists which satisfies all design requirements for the choices of design variables and the upper and lower design variable values used. More design freedom is needed to achieve a fully satisfactory design. The third study is part of a redesign activity in which a detailed model is used.
Procedures for system identification using realization theory in conjunction with learning control ideas are developed. The Markov parameters of the system are identified by combining data from repeated experiments. Three approaches are discussed for identification of as many Markov parameters as sample points in the experiment. Making use of all the parameters, realization theory is then employed to determine the system order and to obtain a minimal order representation. The first two approaches are non-recursive, which in the case of noise-free data yields a one step solution. The third approach uses a recursive formulation rendered from adaptive control but modified for successive experiments. A simple example shows the numerical convergence of the identified parameters as a function of the number of experiments. The procedure presented herein is an extension of the existing Eigensystem Realization Algorithm (ERA), which has been successfully applied for system identification of large structures.
A VLSI implementable neural network architecture for dynamic assignment is presented. The resource allocation problems involve assigning members of one set (e.g. resources) to those of another (e.g. consumers) such that the global 'cost' of the associations is minimized. The network consists of a matrix of sigmoidal processing elements (neurons), where the rows of the matrix represent resources and columns represent consumers. Unlike previous neural implementations, however, association costs are applied directly to the neurons, reducing connectivity of the network to VLSI-compatible 0 (number of neurons). Each row (and column) has an additional neuron associated with it to independently oversee activations of all the neurons in each row (and each column), providing a programmable 'k-winner-take-all' function. This function simultaneously enforces blocking (excitatory/inhibitory) constraints during convergence to control the number of active elements in each row and column within desired boundary conditions. Simulations show that the network, when implemented in fully parallel VLSI hardware, offers optimal (or near-optimal) solutions within only a fraction of a millisecond, for problems up to 128 resources and 128 consumers, orders of magnitude faster than conventional computing or heuristic search methods.
We present a quasi-Newton interior points algorithm for nonlinear constrained optimization. It is based on a general approach consisting of the iterative solution in the primal and dual spaces of the equalities in Karush-Kuhn-Tucker optimality conditions. This is done in such a way to have primal and dual feasibility at each iteration, which ensures satisfaction of those optimality conditions at the limit points. This approach is very strong and efficient, since at each iteration it only requires the solution of two linear systems with the same matrix, instead of quadratic programming subproblems. It is also particularly appropriate for engineering design optimization inasmuch at each iteration a feasible design is obtained. The present algorithm uses a quasi-Newton approximation of the second derivative of the Lagrangian function in order to have superlinear asymptotic convergence. We discuss theoretical aspects of the algorithm and its computer implementation.