Search NASA⌕ Search

SEARCH · Search NASA

Results for “boundary value problems”

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 883 records · Page 49

Implementation of Hybrid V-Cycle Multilevel Methods for Mixed Finite Element Systems with Penalty

The goal of this paper is the implementation of hybrid V-cycle hierarchical multilevel methods for the indefinite discrete systems which arise when a mixed finite element approximation is used to solve elliptic boundary value problems. By introducing a penalty parameter, the perturbed indefinite system can be reduced to a symmetric positive definite system containing the small penalty parameter for the velocity unknown alone. We stabilize the hierarchical spatial decomposition approach proposed by Cai, Goldstein, and Pasciak for the reduced system. We demonstrate that the relative condition number of the preconditioner is bounded uniformly with respect to the penalty parameter, the number of levels and possible jumps of the coefficients as long as they occur only across the edges of the coarsest elements.

Lai, Chen-Yao G.↗

Convergence of a Substructuring Method with LaGrange Multipliers

We analyze the convergence of a substructuring iterative method with Lagrange multipliers, proposed recently by Farhat and Roux. The method decomposes finite element discretization of an elliptic boundary value problem into Neumann problems on the subdomains and a coarse problem for the subdomain nullspace components. For linear conforming elements and preconditioning by the Dirichlet problems on the subdomains, we prove the asymptotic bound on the condition number C(1 + log(H/h))(sup gamma), gamma = 2 or 3, where h is the characteristic element size and H is the subdomain size.

Mandel, Jan↗

Preconditioning Operators on Unstructured Grids

We consider systems of mesh equations that approximate elliptic boundary value problems on arbitrary (unstructured) quasi-uniform triangulations and propose a method for constructing optimal preconditioning operators. The method is based upon two approaches: (1) the fictitious space method, i.e., the reduction of the original problem to a problem in an auxiliary (fictitious) space, and (2) the multilevel decomposition method, i.e., the construction of preconditioners by decomposing functions on hierarchical meshes. The convergence rate of the corresponding iterative process with the preconditioner obtained is independent of the mesh step. The preconditioner has an optimal computational cost: the number of arithmetic operations required for its implementation is proportional to the number of unknowns in the problem. The construction of the preconditioning operators for three dimensional problems can be done in the same way.

Nepomnyaschikh, S. V.↗

Multigrid with Overlapping Patches

Solving boundary value problems with optimal efficiency requires adaptivity and multilevel techniques. Previously, an implementation of the AFACx algorithm is presented that is based on rectangular Cartesian grids. This implementation does not allow for the over]ap of grids that lie on the same level of refinement. We investigate the case in which these grids overlap. A standard technique for overlapping grids is the Schwarz algorithm. Some ways of using the Schwarz algorithm in a standard multigrid scheme are presented. Also, a problem that arises in some situations with non-aligned, overlapping grids is described. This situation comes up in a natural way when the Schwarz algorithm is used as a relaxation scheme within a multilevel algorithm. We identify the reason for the bad convergence and show that by more sophisticated interpolation the difficulties can be overcome. Then we present a multiplicative Schwarz algorithm for a large number of grids that has a high potential for parallelization. Finally we give some numerical results for the FACx algorithm with overlapping grids on each refinement level. The implementation of the described codes uses C++ and the array class libraries A++ and P++. Using the A++/P++ programming environment, it was possible to move from a serial code to a parallel code within a few days.

Berndt, Markus↗

Diffraction of a Gaussian Beam by a Spherical Obstacle

The Kirchhoff integral for diffraction in the near-forward direction is derived from the exact solution of the electromagnetic boundary value problem of a focused Gaussian laser beam incident on a spherical particle. The diffracted intensity in the vicinity of the particle is computed and the way in which the features of the diffraction pattern depend on the width of the Gaussian beam is commented on.

Lock, James A.↗

Time-Domain Impedance Boundary Conditions for Computational Aeroacoustics

It is an accepted practice in aeroacoustics to characterize the properties of an acoustically treated surface by a quantity known as impedance. Impedance is a complex quantity. As such, it is designed primarily for frequency-domain analysis. Time-domain boundary conditions that are the equivalent of the frequency-domain impedance boundary condition are proposed. Both single frequency and model broadband time-domain impedance boundary conditions are provided. It is shown that the proposed boundary conditions, together with the linearized Euler equations, form well-posed initial boundary value problems. Unlike ill-posed problems, they are free from spurious instabilities that would render time-marching computational solutions impossible.

Tam, Christopher K. W.↗

A Comparison of PETSC Library and HPF Implementations of an Archetypal PDE Computation

Two paradigms for distributed-memory parallel computation that free the application programmer from the details of message passing are compared for an archetypal structured scientific computation a nonlinear, structured-grid partial differential equation boundary value problem using the same algorithm on the same hardware. Both paradigms, parallel libraries represented by Argonne's PETSC, and parallel languages represented by the Portland Group's HPF, are found to be easy to use for this problem class, and both are reasonably effective in exploiting concurrency after a short learning curve. The level of involvement required by the application programmer under either paradigm includes specification of the data partitioning (corresponding to a geometrically simple decomposition of the domain of the PDE). Programming in SPAM style for the PETSC library requires writing the routines that discretize the PDE and its Jacobian, managing subdomain-to-processor mappings (affine global- to-local index mappings), and interfacing to library solver routines. Programming for HPF requires a complete sequential implementation of the same algorithm, introducing concurrency through subdomain blocking (an effort similar to the index mapping), and modest experimentation with rewriting loops to elucidate to the compiler the latent concurrency. Correctness and scalability are cross-validated on up to 32 nodes of an IBM SP2.

Hayder, M. Ehtesham↗

Hypersonic Vehicle Trajectory Optimization and Control

Two classes of neural networks have been developed for the study of hypersonic vehicle trajectory optimization and control. The first one is called an 'adaptive critic'. The uniqueness and main features of this approach are that: (1) they need no external training; (2) they allow variability of initial conditions; and (3) they can serve as feedback control. This is used to solve a 'free final time' two-point boundary value problem that maximizes the mass at the rocket burn-out while satisfying the pre-specified burn-out conditions in velocity, flightpath angle, and altitude. The second neural network is a recurrent network. An interesting feature of this network formulation is that when its inputs are the coefficients of the dynamics and control matrices, the network outputs are the Kalman sequences (with a quadratic cost function); the same network is also used for identifying the coefficients of the dynamics and control matrices. Consequently, we can use it to control a system whose parameters are uncertain. Numerical results are presented which illustrate the potential of these methods.

Balakrishnan, S. N.↗

Optimization of Supersonic Transport Trajectories

This paper develops a near-optimal guidance law for generating minimum fuel, time, or cost fixed-range trajectories for supersonic transport aircraft. The approach uses a choice of new state variables along with singular perturbation techniques to time-scale decouple the dynamic equations into multiple equations of single order (second order for the fast dynamics). Application of the maximum principle to each of the decoupled equations, as opposed to application to the original coupled equations, avoids the two point boundary value problem and transforms the problem from one of a functional optimization to one of multiple function optimizations. It is shown that such an approach produces well known aircraft performance results such as minimizing the Brequet factor for minimum fuel consumption and the energy climb path. Furthermore, the new state variables produce a consistent calculation of flight path angle along the trajectory, eliminating one of the deficiencies in the traditional energy state approximation. In addition, jumps in the energy climb path are smoothed out by integration of the original dynamic equations at constant load factor. Numerical results performed for a supersonic transport design show that a pushover dive followed by a pullout at nominal load factors are sufficient maneuvers to smooth the jump.

Ardema, Mark D.↗

Development of Advanced Methods of Structural and Trajectory Analysis for Transport Aircraft

This paper develops a near-optimal guidance law for generating minimum fuel, time, or cost fixed-range trajectories for supersonic transport aircraft. The approach uses a choice of new state variables along with singular perturbation techniques to time-scale decouple the dynamic equations into multiple equations of single order (second order for the fast dynamics). Application of the maximum principle to each of the decoupled equations, as opposed to application to the original coupled equations, avoids the two point boundary value problem and transforms the problem from one of a functional optimization to one of multiple function optimizations. It is shown that such an approach produces well known aircraft performance results such as minimizing the Brequet factor for minimum fuel consumption and the energy climb path. Furthermore, the new state variables produce a consistent calculation of flight path angle along the trajectory, eliminating one of the deficiencies in the traditional energy state approximation. In addition, jumps in the energy climb path are smoothed out by integration of the original dynamic equations at constant load factor. Numerical results performed for a supersonic transport design show that a pushover dive followed by a pullout at nominal load factors are sufficient maneuvers to smooth the jump.

Ardema, Mark D.↗

On the Buckling of Imperfect Anisotropic Shells with Elastic Edge Supports Under Combined Loading Part I:: Theory and Numerical Analysis - Pt. 1

A rigorous solution is presented for the case of stiffened anisotropic cylindrical shells with general imperfections under combined loading, where the edge supports are provided by symmetrical or unsymmetrical elastic rings. The circumferential dependence is eliminated by a truncated Fourier series. The resulting nonlinear 2-point boundary value problem is solved numerically via the "Parallel Shooting Method". The changing deformation patterns resulting from the different degrees of interaction between the given initial imperfections and the specified end rings are displayed. Recommendations are made as to the minimum ring stiffnesses required for optimal load carrying configurations.

Arbocz, Johann↗

Simulating the Formation of Lunar Floor-Fracture Craters Using Elastoviscoplastic Relaxation

Lunar floor-fracture craters formed during the height of mare basalt emplacement. Due to a general temporal and spatial relation with the maria, these craters, numbering some 200, may be diagnostic of the thermal structure of the crust during this time. As the name suggests, these craters exhibit brittle failure, generally limited to the central floor region. That, and a shallower depth than fresh lunar craters, has led to two main theories as to their formation: laccolith emplacement under the crater and viscous relaxation. The implications of each model for the state of the Moon's crust during this time are quite different, so the viability of each model must be checked. Laccolith emplacement has been treated elsewhere. However, previous attempts to study the relaxation of the craters have assumed only a uniform, Newtonian viscous response of the near surface to the topographic driving forces, and simply postulated that the fractures resulted from tensile stresses associated with floor uplift. Here, we use a more sophisticated rheological model that includes not only non-Newtonian viscous behavior (i.e., the viscosity is stress-dependent), but also incorporates elastic behavior and a plastic component to the rheology to directly simulate the formation of the floor fractures. The results of our simulations show that while elastoviscoplastic relaxation is potentially viable for larger floor-fracture craters, it is not viable for craters with diameters < or = 60 km, the size of the majority of floor-fracture craters. We employ the finite element method, a numerical technique well suited for boundary-value problems, via the commercially available MARC software package. To test the viability of topographic relaxation, our goal is to prepare the simulations as to maximize the amount of relaxation. We take advantage of the natural axisymmetry of craters, simulating one radial plane. Initial shapes are based on data for fresh craters from Pike. To simplify implementation, a fourth order polynomial is used for the basin, while a third order inverse function is used for the rim. This form closely approximates the long-wavelength behavior of complex craters, while ignoring higher-frequency topography, save the rim. This approximation is appropriate because crater relaxation is strongly controlled by long-wavelength topography. Loading is accomplished assuming a uniform gravity field (1.62 m/s-square) and a uniform density of 2900 kg/cubic m. The initial stress state is set to be hydrostatic, with an additional pressure term to account for any overlying topography. This additional pressure term is tapered exponentially with depth. While the simulations quickly settle on a preferred stress state, and while the final solution is fairly insensitive to the choice of the e-folding depth of the taper, selecting an e-folding depth close to the diameter of the crater sets the initial stress state near the preferred state. We assume a diuranally averaged surface temperature of -20 C, and allow temperature to increase with depth at a rate of 50 K//km. Assuming a thermal conductivity of 2 W/in/K, this gradient translates to a heat flow of 100mW/square m, an extremely high value for the Moon. Temperature, of course, will not increase without bound. To maximize relaxation, we allow our temperature profile to increase linearly until it reaches the solidus (assumed to be 1200C) at a depth of 24.4 km, at which point it is kept constant. The presence of melt will drop the bulk viscosity; however, we have no rheological control for partial melts. Therefore, we make no attempt to simulate this situation. Elastoviscoplastic rheological model. In general, geologic materials can behave in three main ways: elastically, viscously (via solid-state creep), and brittly (plasticity is a continuum approach to simulate this phenomenon). We combine these three deformation mechanisms in an extended Maxwell solid, where the total strain can be broken down into a simple summation of the elastic, creep, and plastic strains. In relaxation phenomena in general, the system takes advantage of any means possible to eliminate deviatoric stresses by relaxing away the topography. Previous analyses have only modeled the viscous response. Comparatively, the elastic response in our model can augment the relaxation, to a point. This effect decreases as the elastic response becomes stiffer; indeed, in the limit of infinite elastic Young's modulus (and with no plasticity), the solution converges on the purely viscous solution. Igneous rocks common to the lunar near-surface have Young's modulii in the range of 10-100 GPa. To maximize relaxation, we use a Young's modulus of 10 GPa. (There is negligible sensitivity to the other elastic modulus, the Poisson's ratio; we use 0.25.) For the viscous response, we use a flow law for steady-state creep in thoroughly dried Columbia diabase, because the high plagioclase (about 70 vol%) and orthopyroxene (about 17 vol%) content is similar to the composition of the lunar highland crust as described by remote sensing and sample studies: noritic anorthosite. This flow law is highly non-Newtonian, i.e., the viscosity is highly stress dependent. That, and the variability with temperature, stands in strong contrast to previous examinations of lunar floor-fracture crater relaxation. To model discrete, brittle faulting, we assume "Byerlee's rule," a standard geodynamical technique. We implement this "rule" with an-angle of internal friction of about 40 deg, and a higher-than-normal cohesion of about 3.2 MPa (to approximate the breaking of unfractured rock). The actual behavior of geologic materials is more complex than in our rheological model, so the uncertainties in the plasticity do not represent the state-of-the-art error. Additional information is contained in the original.

Dombard, A. J.↗

Preliminary Design of Low-Thrust Interplanetary Missions

For interplanetary missions, highly efficient electric propulsion systems can be used to increase the mass delivered to the destination and/or reduce the trip time over typical chemical propulsion systems. This technology is being demonstrated on the Deep Space 1 mission - part of NASA's New Millennium Program validating technologies which can lower the cost and risk and enhance the performance of future missions. With the successful demonstration on Deep Space 1, future missions can consider electric propulsion as a viable propulsion option. Electric propulsion systems, while highly efficient, produce only a small amount of thrust. As a result, the engines operate during a significant fraction of the trajectory. This characteristic makes it much more difficult to find optimal trajectories. The methods for optimizing low-thrust trajectories are typically categorized as either indirect, or direct. Indirect methods are based on calculus of variations, resulting in a two-point boundary value problem that is solved by satisfying terminal constraints and targeting conditions. These methods are subject to extreme sensitivity to the initial guess of the variables - some of which are not physically intuitive. Adding a gravity assist to the trajectory compounds the sensitivity. Direct methods parameterize the problem and use nonlinear programming techniques to optimize an objective function by adjusting a set of variables. A variety of methods of this type have been examined with varying results. These methods are subject to the limitations of the nonlinear programming techniques. In this paper we present a direct method intended to be used primarily for preliminary design of low-thrust interplanetary trajectories, including those with multiple gravity assists. Preliminary design implies a willingness to accept limited accuracy to achieve an efficient algorithm that executes quickly.

Sims, Jon A.↗

Feedback Implementation of Zermelo's Optimal Control by Sugeno Approximation

This paper proposes an approach to implement optimal control laws of nonlinear systems in real time. Our methodology does not require solving two-point boundary value problems online and may not require it off-line either. The optimal control law is learned using the original Sugeno controller (OSC) from a family of optimal trajectories. We compare the trajectories generated by the OSC and the trajectories yielded by the optimal feedback control law when applied to Zermelo's ship steering problem.

Clifton, C.↗

Entropy Splitting and Numerical Dissipation

A rigorous stability estimate for arbitrary order of accuracy of spatial central difference schemes for initial-boundary value problems of nonlinear symmetrizable systems of hyperbolic conservation laws was established recently by Olsson and Oliger (1994) and Olsson (1995) and was applied to the two-dimensional compressible Euler equations for a perfect gas by Gerritsen and Olsson (1996) and Gerritsen (1996). The basic building block in developing the stability estimate is a generalized energy approach based on a special splitting of the flux derivative via a convex entropy function and certain homogeneous properties. Due to some of the unique properties of the compressible Euler equations for a perfect gas, the splitting resulted in the sum of a conservative portion and a non-conservative portion of the flux derivative. hereafter referred to as the "Entropy Splitting." There are several potential desirable attributes and side benefits of the entropy splitting for the compressible Euler equations that were not fully explored in Gerritsen and Olsson. The paper has several objectives. The first is to investigate the choice of the arbitrary parameter that determines the amount of splitting and its dependence on the type of physics of current interest to computational fluid dynamics. The second is to investigate in what manner the splitting affects the nonlinear stability of the central schemes for long time integrations of unsteady flows such as in nonlinear aeroacoustics and turbulence dynamics. If numerical dissipation indeed is needed to stabilize the central scheme, can the splitting help minimize the numerical dissipation compared to its un-split cousin? Extensive numerical study on the vortex preservation capability of the splitting in conjunction with central schemes for long time integrations will be presented. The third is to study the effect of the non-conservative proportion of splitting in obtaining the correct shock location for high speed complex shock-turbulence interactions. The fourth is to determine if this method can be extended to other physical equations of state and other evolutionary equation sets. If numerical dissipation is needed, the Yee, Sandham, and Djomehri (1999) numerical dissipation is employed. The Yee et al. schemes fit in the Olsson and Oliger framework.

Yee, H. C.↗

Entropy Splitting for High Order Numerical Simulation of Compressible Turbulence

A stable high-order numerical scheme for direct numerical simulation (DNS) of shock-free compressible turbulence is presented. The method is applicable to general geometries. It contains no upwinding, artificial dissipation, or filtering. Instead the method relies on the stabilizing mechanisms of an appropriate conditioning of the governing equations and the use of compatible spatial difference operators for the interior points (interior scheme) as well as the boundary points (boundary scheme). An entropy-splitting approach splits the inviscid flux derivatives into conservative and nonconservative portions. The spatial difference operators satisfy a summation-by-parts condition, leading to a stable scheme (combined interior and boundary schemes) for the initial boundary value problem using a generalized energy estimate. A Laplacian formulation of the viscous and heat conduction terms on the right hand side of the Navier–Stokes equations is used to ensure that any tendency to odd–even decoupling associated with central schemes can be countered by the fluid viscosity. The resulting methods are able to minimize the spurious high-frequency oscillations associated with pure central schemes, especially for long time integration applications such as DNS. For validation purposes, the methods are tested in a DNS of compressible turbulent plane channel flow at low values of friction Mach number, where reference turbulence data bases exist. It is demonstrated that the methods are robust in terms of grid resolution, and in good agreement with published channel data. Accurate turbulence statistics can be obtained with moderate grid sizes. Stability limits on the range of the splitting parameter are determined from numerical tests.

N.D. Sandham↗

Computation of Nonlinear Backscattering Using a High-Order Numerical Method

The nonlinear Schrodinger equation (NLS) is the standard model for propagation of intense laser beams in Kerr media. The NLS is derived from the nonlinear Helmholtz equation (NLH) by employing the paraxial approximation and neglecting the backscattered waves. In this study we use a fourth-order finite-difference method supplemented by special two-way artificial boundary conditions (ABCs) to solve the NLH as a boundary value problem. Our numerical methodology allows for a direct comparison of the NLH and NLS models and for an accurate quantitative assessment of the backscattered signal.

Fibich, G.↗

An Automated Method to Compute Orbital Re-Entry Trajectories with Heating Constraints

Determining how to properly manipulate the controls of a re-entering re-usable launch vehicle (RLV) so that it is able to safely return to Earth and land involves the solution of a two-point boundary value problem (TPBVP). This problem, which can be quite difficult, is traditionally solved on the ground prior to flight. If necessary, a nearly unlimited amount of time is available to find the "best" solution using a variety of trajectory design and optimization tools. The role of entry guidance during flight is to follow the pre-determined reference solution while correcting for any errors encountered along the way. This guidance method is both highly reliable and very efficient in terms of onboard computer resources. There is a growing interest in a style of entry guidance that places the responsibility of solving the TPBVP in the actual entry guidance flight software. Here there is very limited computer time. The powerful, but finicky, mathematical tools used by trajectory designers on the ground cannot in general be made to do the job. Nonconvergence or slow convergence can result in disaster. The challenges of designing such an algorithm are numerous and difficult. Yet the payoff (in the form of decreased operational costs and increased safety) can be substantial. This paper presents an algorithm that incorporates features of both types of guidance strategies. It takes an initial RLV orbital re-entry state and finds a trajectory that will safely transport the vehicle to a Terminal Area Energy Management (TAEM) region. During actual flight, the computed trajectory is used as the reference to be flown by a more traditional guidance method.

Zimmerman, Curtis↗