Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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,027 records · Page 57

A block iterative finite element algorithm for numerical solution of the steady-state, compressible Navier-Stokes equations

An iterative method for numerically solving the time independent Navier-Stokes equations for viscous compressible flows is presented. The method is based upon partial application of the Gauss-Seidel principle in block form to the systems of nonlinear algebraic equations which arise in construction of finite element (Galerkin) models approximating solutions of fluid dynamic problems. The C deg-cubic element on triangles is employed for function approximation. Computational results for a free shear flow at Re = 1,000 indicate significant achievement of economy in iterative convergence rate over finite element and finite difference models which employ the customary time dependent equations and asymptotic time marching procedure to steady solution. Numerical results are in excellent agreement with those obtained for the same test problem employing time marching finite element and finite difference solution techniques.

Cooke, C. H.↗

Relaxation and Preconditioning for High Order Discontinuous Galerkin Methods with Applications to Aeroacoustics and High Speed Flows

This project is about the investigation of the development of the discontinuous Galerkin finite element methods, for general geometry and triangulations, for solving convection dominated problems, with applications to aeroacoustics. Other related issues in high order WENO finite difference and finite volume methods have also been investigated. methods are two classes of high order, high resolution methods suitable for convection dominated simulations with possible discontinuous or sharp gradient solutions. In [18], we first review these two classes of methods, pointing out their similarities and differences in algorithm formulation, theoretical properties, implementation issues, applicability, and relative advantages. We then present some quantitative comparisons of the third order finite volume WENO methods and discontinuous Galerkin methods for a series of test problems to assess their relative merits in accuracy and CPU timing. In [3], we review the development of the Runge-Kutta discontinuous Galerkin (RKDG) methods for non-linear convection-dominated problems. These robust and accurate methods have made their way into the main stream of computational fluid dynamics and are quickly finding use in a wide variety of applications. They combine a special class of Runge-Kutta time discretizations, that allows the method to be non-linearly stable regardless of its accuracy, with a finite element space discretization by discontinuous approximations, that incorporates the ideas of numerical fluxes and slope limiters coined during the remarkable development of the high-resolution finite difference and finite volume schemes. The resulting RKDG methods are stable, high-order accurate, and highly parallelizable schemes that can easily handle complicated geometries and boundary conditions. We review the theoretical and algorithmic aspects of these methods and show several applications including nonlinear conservation laws, the compressible and incompressible Navier-Stokes equations, and Hamilton-Jacobi-like equations.

Shu, Chi-Wang↗

A numerical study of the contrarotating vortex pair associated with a jet in a crossflow

An implicit two-factor partially flux split solver for the thin-layer Navier-Stokes equations is used to solve the aerodynamic/propulsive interaction between a subsonic jet exhausting perpendicularly through a flat plat plate into a crossflow. The algorithm is applied to flows with a range of jet to crossflow velocity ratios between 4 and 8. The computed velocity field is analyzed and comparisons are made with experimentally determined properties of the contrarotating vortex pair.

Roth, Karlin R.↗

Numerical solution of three-dimensional unsteady transonic flow over wings including inviscid/viscous interactions

A numerical procedure is presented for computing the unsteady transonic flow field about three dimensional swept wings undergoing general time dependent motion. The outer inviscid portion of the flow is assumed to be governed by the modified unsteady transonic small disturbance potential equation which is integrated in the time domain by means of an efficient alternating direction implicit approximate factorization algorithm. Gross dominant effects of the shock boundary layer interaction are accounted for by a simple empirically defined model. Viscous flow regions adjacent to the wing surface and in the trailing wake are described by a set of integral equations appropriate for compressible turbulent shear layers. The two dimensional boundary layer equations are applied quasi-statically stripwise across the span. Coupling with the outer inviscid flow is implemented through use of the displacement thickness concept within the limitations of small disturbance theory. Validity of the assumptions underlying the method is established by comparison with experimental data for the flow about a high aspect ratio transport wing having an advanced airfoil section.

Rizzetta, D. P.↗

Optimization methods and silicon solar cell numerical models

An optimization algorithm for use with numerical silicon solar cell models was developed. By coupling an optimization algorithm with a solar cell model, it is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junction depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm was developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAP1D). SCAP1D uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the performance of a solar cell. A major obstacle is that the numerical methods used in SCAP1D require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the values associated with the maximum efficiency. This problem was alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution.

Girardini, K.↗

Practical design optimization of wing/body configurations using the Euler equations

The development of a practical method for the aerodynamic design of isolated wing and wing/body configurations is achieved through the coupling of existing computational fluid dynamics (CFD) analysis codes and a quasi-Newton numerical optimization method. The direct design method is generalized to treat three-dimensional aerodynamic optimization problems subject to inviscid, rotational, compressible flow conditions imposed by the Euler equations. The method couples either the FLO57 or the TEAM flow solver with a modified version of the QNMDIF numerical optimization algorithm. The method is applied, but is not limited, to supersonic design problems. A case study is presented illustrating the method's effectiveness in maximizing the lift-to-drag ratio, subject to a variety of constraints, of selected supersonic configurations at cruise conditions.

Reuther, J.↗

Conversion from Engineering Units to Telemetry Counts on Dryden Flight Simulators

Dryden real-time flight simulators encompass the simulation of pulse code modulation (PCM) telemetry signals. This paper presents a new method whereby the calibration polynomial (from first to sixth order), representing the conversion from counts to engineering units (EU), is numerically inverted in real time. The result is less than one-count error for valid EU inputs. The Newton-Raphson method is used to numerically invert the polynomial. A reverse linear interpolation between the EU limits is used to obtain an initial value for the desired telemetry count. The method presented here is not new. What is new is how classical numerical techniques are optimized to take advantage of modem computer power to perform the desired calculations in real time. This technique makes the method simple to understand and implement. There are no interpolation tables to store in memory as in traditional methods. The NASA F-15 simulation converts and transmits over 1000 parameters at 80 times/sec. This paper presents algorithm development, FORTRAN code, and performance results.

Fantini, Jay A.↗

Preliminary Work for Modeling the Propellers of an Aircraft as a Noise Source in an Acoustic Boundary Element Analysis

An algorithm for generating appropriate velocity boundary conditions for an acoustic boundary element analysis from the kinematics of an operating propeller is presented. It constitutes the initial phase of Integrating sophisticated rotorcraft models into a conventional boundary element analysis. Currently, the pressure field is computed by a linear approximation. An initial validation of the developed process was performed by comparing numerical results to test data for the external acoustic pressure on the surface of a tilt-rotor aircraft for one flight condition.

Vlahopoulos, Nickolas↗

Research on an augmented Lagrangian penalty function algorithm for nonlinear programming

The augmented Lagrangian (ALAG) Penalty Function Algorithm for optimizing nonlinear mathematical models is discussed. The mathematical models of interest are deterministic in nature and finite dimensional optimization is assumed. A detailed review of penalty function techniques in general and the ALAG technique in particular is presented. Numerical experiments are conducted utilizing a number of nonlinear optimization problems to identify an efficient ALAG Penalty Function Technique for computer implementation.

Frair, L.↗

Optimization methods and silicon solar cell numerical models

The goal of this project is the development of an optimization algorithm for use with a solar cell model. It is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junctions depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm has been developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAPID). SCAPID uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the operation of a solar cell. A major obstacle is that the numerical methods used in SCAPID require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the value associated with the maximum efficiency. This problem has been alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution. Adapting SCAPID so that it could be called iteratively by the optimization code provided another means of reducing the cpu time required to complete an optimization. Instead of calculating the entire I-V curve, as is usually done in SCAPID, only the efficiency is calculated (maximum power voltage and current) and the solution from previous calculations is used to initiate the next solution.

Girardini, K.↗

Finite element methods of analysis for high speed viscous flows

Over the past three years a finite element based procedure for the solution of high speed viscous compressible flows was developed. The approach followed was to compute steady state solutions via a false transient, using an explicit time stepping scheme, and to attempt to improve the solution quality by incorporating adaptive mesh procedures. The main thrust of the work was to continue on the extension of the approach to the solution of some realistic compressible viscous flows. When flows at high Reynolds number are investigated, is soon becomes apparent that explicit techniwues have to be supplemented if they are to deal effectively with the large variations in element size and aspect ratio which characterize the computational grids necessary for adequate resolutin of the primary flow features. For this reason, the Taylor-Galerkin solution algorithm was rewritten in an explicit/implicit form. Solutions were computed for the problems of a flow past a flat plate, M-3, Re-100; shock/boundary layer interaction, M-2, Re-296000; flow over a compression corner, M-11.68, Re246000; and unifrom flow past a circular cylinder, M-6.34, Re-39770. A summary of the results is included and demonstrates the numerical performance of the scheme.

Source record↗

A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix

A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.

Shroff, Gautam↗

A computer code for multiphase all-speed transient flows in complex geometries. MAST version 1.0

The operation of the MAST code, which computes transient solutions to the multiphase flow equations applicable to all-speed flows, is described. Two-phase flows are formulated based on the Eulerian-Lagrange scheme in which the continuous phase is described by the Navier-Stokes equation (or Reynolds equations for turbulent flows). Dispersed phase is formulated by a Lagrangian tracking scheme. The numerical solution algorithms utilized for fluid flows is a newly developed pressure-implicit algorithm based on the operator-splitting technique in generalized nonorthogonal coordinates. This operator split allows separate operation on each of the variable fields to handle pressure-velocity coupling. The obtained pressure correction equation has the hyperbolic nature and is effective for Mach numbers ranging from the incompressible limit to supersonic flow regimes. The present code adopts a nonstaggered grid arrangement; thus, the velocity components and other dependent variables are collocated at the same grid. A sequence of benchmark-quality problems, including incompressible, subsonic, transonic, supersonic, gas-droplet two-phase flows, as well as spray-combustion problems, were performed to demonstrate the robustness and accuracy of the present code.

Chen, C. P.↗

Antenna pattern control using impedance surfaces

During this research period, we have effectively transferred existing computer codes from CRAY supercomputer to work station based systems. The work station based version of our code preserved the accuracy of the numerical computations while giving a much better turn-around time than the CRAY supercomputer. Such a task relieved us of the heavy dependence of the supercomputer account budget and made codes developed in this research project more feasible for applications. The analysis of pyramidal horns with impedance surfaces was our major focus during this research period. Three different modeling algorithms in analyzing lossy impedance surfaces were investigated and compared with measured data. Through this investigation, we discovered that a hybrid Fourier transform technique, which uses the eigen mode in the stepped waveguide section and the Fourier transformed field distributions across the stepped discontinuities for lossy impedances coating, gives a better accuracy in analyzing lossy coatings. After a further refinement of the present technique, we will perform an accurate radiation pattern synthesis in the coming reporting period.

Balanis, Constantine A.↗

Symmetric Galerkin boundary formulations employing curved elements

Accounts of the symmetric Galerkin approach to boundary element analysis (BEA) have recently been published. This paper attempts to add to the understanding of this method by addressing a series of fundamental issues associated with its potential computational efficiency. A new symmetric Galerkin theoretical formulation for both the (harmonic) heat conduction and the (biharmonic) elasticity problem that employs regularized singular and hypersingular boundary integral equations (BIEs) is presented. The novel use of regularized BIEs in the Galerkin context is shown to allow straightforward incorporation of curved, isoparametric elements. A symmetric reusable intrinsic sample point (RISP) numerical integration algorithm is shown to produce a Galerkin (i.e., double) integration strategy that is competitive with its counterpart (i.e., singular) integration procedure in the collocation BEA approach when the time saved in the symmetric equation solution phase is also taken into account. This new formulation is shown to be capable of employing hypersingular BIEs while obviating the requirement of C 1 continuity, a fact that allows the employment of the popular continuous element technology. The behavior of the symmetric Galerkin BEA method with regard to both direct and iterative equation solution operations is also addressed. A series of example problems are presented to quantify the performance of this symmetric approach, relative to the more conventional unsymmetric BEA, in terms of both accuracy and efficiency. It is concluded that appropriate implementations of the symmetric Galerkin approach to BEA indeed have the potential to be competitive with, if not superior to, collocation-based BEA, for large-scale problems.

Kane, J. H.↗

Genetically Engineered Microelectronic Infrared Filters

A genetic algorithm is used for design of infrared filters and in the understanding of the material structure of a resonant tunneling diode. These two components are examples of microdevices and nanodevices that can be numerically simulated using fundamental mathematical and physical models. Because the number of parameters that can be used in the design of one of these devices is large, and because experimental exploration of the design space is unfeasible, reliable software models integrated with global optimization methods are examined The genetic algorithm and engineering design codes have been implemented on massively parallel computers to exploit their high performance. Design results are presented for the infrared filter showing new and optimized device design. Results for nanodevices are presented in a companion paper at this workshop.

Cwik, Tom↗

Parallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing

The ability to dynamically adapt an unstructured grid is a powerful tool for efficiently solving computational problems with evolving physical features. In this paper, we report on our experience parallelizing an edge-based adaptation scheme, called 3D_TAG. using message passing. Results show excellent speedup when a realistic helicopter rotor mesh is randomly refined. However. performance deteriorates when the mesh is refined using a solution-based error indicator since mesh adaptation for practical problems occurs in a localized region., creating a severe load imbalance. To address this problem, we have developed PLUM, a global dynamic load balancing framework for adaptive numerical computations. Even though PLUM primarily balances processor workloads for the solution phase, it reduces the load imbalance problem within mesh adaptation by repartitioning the mesh after targeting edges for refinement but before the actual subdivision. This dramatically improves the performance of parallel 3D_TAG since refinement occurs in a more load balanced fashion. We also present optimal and heuristic algorithms that, when applied to the default mapping of a parallel repartitioner, significantly reduce the data redistribution overhead. Finally, portability is examined by comparing performance on three state-of-the-art parallel machines.

Oliker, Leonid↗

Characterization of Meta-Materials Using Computational Electromagnetic Methods

An efficient and powerful computational method is presented to synthesize a meta-material to specified electromagnetic properties. Using the periodicity of meta-materials, the Finite Element Methodology (FEM) is developed to estimate the reflection and transmission through the meta-material structure for a normal plane wave incidence. For efficient computations of the reflection and transmission over a wide band frequency range through a meta-material a Finite Difference Time Domain (FDTD) approach is also developed. Using the Nicholson-Ross method and the Genetic Algorithms, a robust procedure to extract electromagnetic properties of meta-material from the knowledge of its reflection and transmission coefficients is described. Few numerical examples are also presented to validate the present approach.

Deshpande, Manohar↗