Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Boundary value problem”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Quadrature methods for periodic singular and weakly singular Fredholm integral equations

High-accuracy numerical quadrature methods for integrals of singular periodic functions are proposed. These methods are based on the appropriate Euler-Maclaurin expansions of trapezoidal rule approximations and their extrapolations. They are subsequently used to obtain accurate quadrature methods for the solution of singular and weakly singular Fredholm integral equations. Throughout the development the periodic nature of the problem plays a crucial role. Such periodic equations are used in the solution of planar elliptic boundary value problems such as those that arise in elasticity, potential theory, conformal mapping, and free surface flows. The use of the quadrature methods is demonstrated with numerical examples.

Sidi, Avram↗
NASA NTRS1991

Effect of nose shape on three-dimensional stagnation region streamlines and heating rates

A new method for calculating the three-dimensional inviscid surface streamlines and streamline metrics using Cartesian coordinates and time as the independent variable of integration has been developed. The technique calculates the streamline from a specified point on the body to a point near the stagnation point by using a prescribed pressure distribution in the Euler equations. The differential equations, which are singular at the stagnation point, are of the two point boundary value problem type. Laminar heating rates are calculated using the axisymmetric analog concept for three-dimensional boundary layers and approximate solutions to the axisymmetric boundary layer equations. Results for elliptic conic forebody geometries show that location of the point of maximum heating depends on the type of conic in the plane of symmetry and the angle of attack, and that this location is in general different from the stagnation point. The new method was found to give smooth predictions of heat transfer in the nose region where previous methods gave oscillatory results.

Hassan, Basil↗
NASA NTRS1996

The Prediction of Ducted Fan Engine Noise Via a Boundary Integral Equation Method

A computationally efficient Boundary Integral Equation Method (BIEM) for the prediction of ducted fan engine noise is presented. The key features of the BIEM are its versatility and the ability to compute rapidly any portion of the sound field without the need to compute the entire field. Governing equations for the BIEM are based on the assumptions that all acoustic processes are linear, generate spinning modes, and occur in a uniform flow field. An exterior boundary value problem (BVP) is defined that describes the scattering of incident sound by an engine duct with arbitrary profile. Boundary conditions on the duct walls are derived that allow for passive noise control treatment. The BVP is recast as a system of hypersingular boundary integral equations for the unknown duct surface quantities. BIEM solution methodology is demonstrated for the scattering of incident sound by a thin cylindrical duct with hard walls. Numerical studies are conducted for various engine parameters and continuous portions of the total pressure field are computed. Radiation and duct propagation results obtained are in agreement with the classical results of spinning mode theory for infinite ducts.

Boundary integral equation↗
NASA NTRS1988

Solution of the Neumann pressure problem in general orthogonal coordinates using the multigrid technique

The multigrid (MG) technique has been advanced for use with Neumann boundary-value problems in clustered curvilinear orthogonal coordinates. This comprises an important step in the analysis of incompressible flow using the velocity-pressure formulation of the Navier-Stokes equations. The finite-difference representation of the problem and the formulation of the restriction and coarse-grid correction operators are examined in detail. Maintaining consistency between these and the integral constraint associated with the Neumann problem is found to be critical for the success of the MG technique. The influence of the smoothing operator is examined by employing Gauss-Seidel, alternating-direction implicit, and strongly implicit techniques. The MG procedure enhances the efficiency of fine-grid solutions of the Neumann problem by a factor of 3 to 14, depending on the type of smoothing operator employed and the values of the problem parameters.

Ghia, U.↗
DOE OSTI2024

Numerical integration in the virtual element method with the scaled boundary cubature scheme

Abstract The virtual element method (VEM) is a stabilized Galerkin method on meshes that consist of arbitrary (convex and nonconvex) polygonal and polyhedral elements. A crucial ingredient in the implementation of low‐ and high‐order VEM is the numerical integration of monomials and nonpolynomial functions over such elements. In this article, we apply the recently proposed scaled boundary cubature (SBC) scheme to compute the weak form integrals in various virtual element formulations over polygonal and polyhedral meshes. In doing so, we demonstrate the flexibility of the approach and the accuracy that it delivers on a broad suite of boundary‐value problems in 2D and 3D over polytopes with affine faces as well as on elements with curved boundaries. In addition, the use of the SBC scheme is exemplified in an enriched Poisson formulation of the VEM in which weakly singular functions are required to be integrated. This study establishes the SBC method as a simple, accurate and efficient integration scheme for use in the VEM.

Chin, Eric B.↗
DOE OSTI2024

MatCal Users Guide: Release 1.3.0

Any continuum mechanics model will require three components: (1) a discretized geometry of the boundary value problem being studied, (2) the partial differential equations to be solved, and (3) the initial conditions and boundary conditions for the problem. To describe material behavior in these computational models, material models contribute to (2) the underlying equations and, occasionally, to (3) the initial conditions for the simulation. These material models can exhibit a mathematical form that is empirically based, based on first principles, or developed from both empirical observations and known physics. In general, these models are meant to represent a class of materials with well understood behavior. As a result, material models have parameters that must be tuned or calibrated so that the model response matches characterization data available for the specific material it is intended to represent when used to simulate a specific system. For simple models, such as isotropic, linear elastic materials in solid mechanics, this calibration process can be a simple analytical calculation directly extracting the parameters from experimental measurements. For complex models that have many inputs and require many characterization datasets to adequately identify the material behavior, the model calibration process can require an inverse problem approach where an optimization is performed to tune the model parameters to the available data.

36 MATERIALS SCIENCE↗
NASA NTRS1975

The determination of orbits using Picard iteration

The determination of orbits by using Picard iteration is reported. This is a direct extension of the classical method of Picard that has been used in finding approximate solutions of nonlinear differential equations for a variety of problems. The application of the Picard method of successive approximations to the initial value and the two point boundary value problems is given.

Mikkilineni, R. P.↗
NASA NTRS1976

A higher order panel method for general analysis and design applications in subsonic flow

A higher-order panel method is described for numerical solution of boundary-value problems relating to steady inviscid irrotational incompressible subsonic fluid flow in a domain. Both Neumann and Dirichlet boundary conditions are treated; two types of auxiliary conditions are used to remove the degrees of freedom that arise from specifying only the derivative of the perturbation velocity potential. Four general network types and two expansions of the induced potential kernel are employed in the numerical solution. Some results are presented which illustrate the modeling options and numerical characteristics of the method.

Johnson, F. T.↗
NASA NTRS1983

Multi-grid solution of Neumann pressure problem for viscous flows using primitive variables

The multi-grid (MG) technique has been advanced for use with the Neumann boundary-value problem in clustered curvilinear orthogonal coordinates. This comprises an important step in the analysis of viscous flows using the velocity-pressure formulation of the Navier-Stokes equations. With successive over-relaxation (SOR) as the smoothing operator and with suitably formulated restriction and coarse-grid-correction operators, a 4-grid procedure enhances the efficiency of fine-grid solutions of the Neumann problem by a factor of 3 to 5, depending on the problem parameters. Thy influence of the smoothing operator is also examined by employing the alternating-direction implicit and the strongly implicit techniques instead of SOR.

Ghia, U.↗
NASA NTRS1990

An improved shooting method for solving minimum-time maneuver problems

The minimum-time attitude maneuvers of a rigid spacecraft are considered. Generally, the associated nonsingular, nonlinear two-point boundary-value problem, derived by using Pontryagin's Maximum Principle, can be solved through shooting methods to find the switching times for the bang-bang control. However, a good initial guess for the missing initial costates is important because the convergence range of the initial costates is very narrow, especially when a multi-bang-bang control strategy is needed. This paper proposes a numerical approach to generate the initial costates so that they are very close to the converged values. The initial costates are first generated by using a recently developed quasi-linearization technique for the near-minimum-time problem and then reduced in magnitude, through some properly designed scales, before the shooting method is used. Numerical examples indicate the closeness of the results from these two techniques (quasi-linearization and shooting).

Li, Feiyue↗
NASA NTRS1976

Optimal reusable-tug and expendable-kickstage trajectories for high-energy planetary missions including correction for nodal precession

Equations are derived by using branched trajectory optimization techniques and the maximum principle to maximize the payload capability of a reusable tug/expendable kickstage vehicle configuration for planetary missions. The two stages and the payload are launched into a low earth orbit by a single space shuttle. The analysis includes correction for precession of the orbit. This correction is done by the tug. The tug propels the payload and the kickstage to an energy beyond earth escape and returns within a specified time to the precessed orbit. After separating from the tug, the kickstage accelerates the payload to the required injection conditions. Planetary injection conditions are specified by the mission energy and a fixed declination and right ascension of the outgoing asymptote. The multipoint boundary value problem resulting from the analysis is solved by a Newton-Raphson iteration technique. Partial derivatives of the boundary conditions are obtained by perturbing the initial conditions one at a time, integrating the trajectory and adjoint equations, and observing the changes in boundary conditions. Maximum payload capability is derived for two typical mission energies. In addition, the variations of several mission and stage parameters are also examined.

Borsody, J.↗
NASA NTRS1993

Summation by parts, projections, and stability

We have derived stability results for high-order finite difference approximations of mixed hyperbolic-parabolic initial-boundary value problems (IBVP). The results are obtained using summation by parts and a new way of representing general linear boundary conditions as an orthogonal projection. By slightly rearranging the analytic equations, we can prove strict stability for hyperbolic-parabolic IBVP. Furthermore, we generalize our technique so as to yield strict stability on curvilinear non-smooth domains in two space dimensions. Finally, we show how to incorporate inhomogeneous boundary data while retaining strict stability. Using the same procedure one can prove strict stability in higher dimensions as well.

Olsson, Pelle↗
NASA NTRS1974

Transonic conical flow

The problem of inviscid, steady transonic conical flow, formulated in terms of the small disturbance theory, is studied. The small disturbance equation and similarity rules are presented, and a boundary value problem is formulated for the case of a supersonic freestream Mach number. The equation for the perturbation potential is solved numerically using an elliptic finite difference system. The difference equations are solved with a point relaxation algorithm that is also capable of capturing the shock wave during the iteration procedure by using the boundary conditions at the shock. Numerical calculations, for shock location, pressure distribution and drag coefficient, are presented for a family of nonlifting conical wings. The theory of slender wings is also presented and analytical results for pressure and drag coefficients are obtained.

Agopian, K. G.↗
NASA NTRS1996

Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems

Multigrid methods are very efficient iterative solvers for system of algebraic equations arising from finite element and finite difference discretization of elliptic boundary value problems. The main principle of multigrid methods is to complement the local exchange of information in point-wise iterative methods by a global one utilizing several related systems, called coarse levels, with a smaller number of variables. The coarse levels are often obtained as a hierarchy of discretizations with different characteristic meshsizes, but this requires that the discretization is controlled by the iterative method. To solve linear systems produced by existing finite element software, one needs to create an artificial hierarchy of coarse problems. The principal issue is then to obtain computational complexity and approximation properties similar to those for nested meshes, using only information in the matrix of the system and as little extra information as possible. Such algebraic multigrid method that uses the system matrix only was developed by Ruge. The prolongations were based on the matrix of the system by partial solution from given values at selected coarse points. The coarse grid points were selected so that each point would be interpolated to via so-called strong connections. Our approach is based on smoothed aggregation introduced recently by Vanek. First the set of nodes is decomposed into small mutually disjoint subsets. A tentative piecewise constant interpolation (in the discrete sense) is then defined on those subsets as piecewise constant for second order problems, and piecewise linear for fourth order problems. The prolongation operator is then obtained by smoothing the output of the tentative prolongation and coarse level operators are defined variationally.

Vanek, Petr↗
NASA NTRS1996

A Conforming Multigrid Method for the Pure Traction Problem of Linear Elasticity: Mixed Formulation

A multigrid method using conforming P-1 finite element is developed for the two-dimensional pure traction boundary value problem of linear elasticity. The convergence is uniform even as the material becomes nearly incompressible. A heuristic argument for acceleration of the multigrid method is discussed as well. Numerical results with and without this acceleration as well as performance estimates on a parallel computer are included.

Lee, Chang-Ock↗