External elliptical crack in elastic solid
Potential functions for three dimensional problems of infinite elastic solid containing elliptical crack
SEARCH · Engineering Papers
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.
Potential functions for three dimensional problems of infinite elastic solid containing elliptical crack
In this paper we investigate the solution of boundary value problems on polygonal domains for elliptic partial differential equations. We observe that when the problems are formulated as the boundary integral equations of classical potential theory, the solutions are representable by series of elementary functions. In addition to being analytically perspicuous, the resulting expressions lend themselves to the construction of accurate and efficient numerical algorithms. The results are illustrated by a number of numerical examples.
This paper is initially concerned with the minimum-time, exoatmospheric flight of a rocket with constant thrust acceleration magnitude, as in the cases of nuclear and solar electric propulsion. Gravitational acceleration is assumed to be a constant scalar multiple of the radius vector, plus a correction term which is a given function of time. The solution to the state equations is obtained in terms of elliptic integrals. A method is presented for the solution of the two-point boundary-condition problem associated with orbital transfer. At most, the latter method requires iteration upon final time, angle of injection, and two other parameters which are bounded. An example problem is provided which involves a rocket with very low thrust and a spiraling trajectory of many revolutions, but an altitude change of only several hundred miles above the earth. Finally, the original elliptic integral solution is extended to a larger class of low and intermediate thrust problems with constant thrust magnitude, mass decreasing with time, and an inverse square gravitational force.
A numerical generalized-capacity-matrix technique is developed for application to aerodynamic flow computations. This technique allows the very fast direct (noniterative) numerical elliptic solvers to be used in problems with arbitrary internal boundaries and with a wide class of boundary conditions, including numerical application of the Kutta condition on an airfoil without iteration. Accuracy, speed, and usefulness of the technique are demonstrated with linear problems for potential flows over airfoil shapes. The method's main advantages, however, can be exploited within iterative procedures for a variety of complex flow problems governed by systems of equations not necessarily elliptic or linear.
We consider the Schwarz problem for first order elliptic systems in the plane. We obtain the conditions on three– and two-dimensional matrices J admitting nondiagonal Jordan form under which a solution to the Schwarz problem in an arbitrary disk exists and is unique in Hölder classes. We describe an algorithm for constructing the solution. Bibliography: 5 titles.
A two-dimensional elliptic grid solver is presented and its application to various three-dimensional configurations, both internal and external, is demonstrated. The method uses proper forcing terms to cluster grid points near boundaries with a specified grid spacing and allows grid lines to intersect the boundaries at a specified angle. By segmenting the region, grid results are generated for sharp leading edged configurations and wing-vertical tail combinations.
The problem of generating spatial coordinates by numerical methods through carefully selected mathematical models is of current interest both in mechanics and physics. The problem of generation of a desired system of coordinates in a given surface was considered, which essentially is an effort directed to the problem of grid generation in a two-dimensional non-Euclidean space. The mathematical model selected for this purpose is based on the formulae of Gauss for a surface. The proposed equations can be used to generate a new coordinate system from the data of an already given coordinate system in a surface. If the coefficients of the first and second fundamental forms have been given, then the proposed equations can be used to generate a surface satisfying the given data (surface fitting). The proposed equations can also be used to generate surfaces in the space between two arbitrary given surfaces, thus providing 3D grids in an Euclidean space.
For special model problems, Fourier analysis gives exact convergence rates for the two-grid multigrid cycle and, for more general problems, provides estimates of the two-grid convergence rates via local mode analysis. A method is presented for obtaining mutigrid convergence rate estimates for cycles involving more than two grids (using essentially the same analysis as for the two-grid cycle). For the simple cast of the V-cycle used as a fast Laplace solver on the unit square, the k-grid convergence rate bounds obtained by this method are sharper than the bounds predicted by the variational theory. Both theoretical justification and experimental evidence are presented.
Summary We construct an algebraic multigrid (AMG) based preconditioner for the reduced Hessian of a linear‐quadratic optimization problem constrained by an elliptic partial differential equation. While the preconditioner generalizes a geometric multigrid preconditioner introduced in earlier works, its construction relies entirely on a standard AMG infrastructure built for solving the forward elliptic equation, thus allowing for it to be implemented using a variety of AMG methods and standard packages. Our analysis establishes a clear connection between the quality of the preconditioner and the AMG method used. The proposed strategy has a broad and robust applicability to problems with unstructured grids, complex geometry, and varying coefficients. The method is implemented using the Hypre package and several numerical examples are presented.
We present a new multigrid preconditioner for the linear systems arising in the semismooth Newton method solution of certain control-constrained, quadratic distributed optimal control problems. Using a piecewise constant discretization of the control space, each semismooth Newton iteration essentially requires inverting a principal submatrix of the matrix entering the normal equations of the associated unconstrained optimal control problem, the rows (and columns) of the submatrix representing the constraints deemed inactive at the current iteration. Previously developed multigrid preconditioners for the aforementioned submatrices were based on constructing a sequence of conforming coarser spaces and proved to be of suboptimal quality for the class of problems considered. Instead, the multigrid preconditioner introduced in this work uses nonconforming coarse spaces, and it is shown that, under reasonable geometric assumptions on the constraints that are deemed inactive, the preconditioner approximates the inverse of the desired submatrix to optimal order. The preconditioner is tested numerically on a classical elliptic-constrained optimal control problem and further on a constrained image-deblurring problem.
A numerical solution of the isothermal elastohydrodynamic problem for point contacts is presented which reproduces all the essential features of experimental observations based upon optical interferometry. In particular, the two side lobes, in which minimum film thickness regions occur, emerge in the theoretical solutions. The influence of the ellipticity parameter on solutions to the point contact problem is explored. The ellipticity parameter k was varied from 1 (a ball on a plate) to 8 (a configuration approaching line contact). It is shown that the minimum film thickness can be related to the well known line contact solutions by a remarkably simple expression involving either k or the effective radius of curvature ratio R sub y/R sub x.
A numerical solution to the three-dimensional equations of elasticity is presented for the problem of a semi-elliptical surface crack in the surface of a finite thickness solid. The alternating method is used to develop the numerical results which incorporate the effects on the stress intensity factor due to the presence of both the front and the back surfaces. The stress intensity factor is presented as a function of position along the crack border for a variety of crack shapes and crack depths. A comparison of the results of this study is made with previous theoretical and experimental work.
This paper presents the complete analysis of the problem of minimum-fuel aeroassisted transfer between coplanar elliptical orbits in the case where the orientation of the final orbit is free for selection in the optimization process. The comparison between the optimal pure propulsive transfer and the idealized aeroassisted transfer, by several passages through the atmosphere, is made. In the case where aeroassisted transfer provides fuel saving, a practical scheme for its realization by one passage is proposed. The maneuver consists of three phases: a deorbit phase for nonzero entry angle, followed by an atmospheric fly-through with variable drag control and completed by a postatmospheric phase. An explicit guidance formula for drag control is derived and it is shown that the required exit speed for ascent to the final orbit can be obtained with a very high degree of accuracy.
Iterative method for optimal control problems for Markov chains, discussing degenerate nonlinear elliptic equations solution in optimal stochastic control theory
This paper is devoted to the theory of approximation of coefficient inverse problems for differential equations of parabolic, elliptic, and hyperbolic types in functional spaces. We present general statements of problems and their approximations and review results obtained earlier in the literature.
Abstract. We consider robust optimal experimental design (ROED) for nonlinear Bayesian inverse problems governed by partial differential equations (PDEs). An optimal design is one that maximizes some utility quantifying the quality of the solution of an inverse problem. However, the optimal design is dependent on elements of the inverse problem such as the simulation model, the prior, or the measurement error model. ROED aims to produce an optimal design that is aware of the additional uncertainties encoded in the inverse problem and remains optimal even after variations in them. We follow a worst-case scenario approach to develop a new framework for robust optimal design of nonlinear Bayesian inverse problems. The proposed framework (a) is scalable and designed for infinite-dimensional Bayesian nonlinear inverse problems constrained by PDEs; (b) develops efficient approximations of the utility, namely the expected information gain; (c) employs eigenvalue sensitivity techniques to develop analytical forms and efficient evaluation methods of the gradient of the utility with respect to the uncertainties against which we wish to be robust; and (d) employs a probabilistic optimization paradigm that properly defines and efficiently solves the resulting combinatorial max-min optimization problem. The effectiveness of the proposed approach is illustrated for optimal sensor placement problem in an inverse problem governed by an elliptic PDE.
ParFELAG is a parallel distributed memory C++ library for numerical upscaling of finite element discretizations. It provides optimal complesity algorithms ro build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured mesh (under the assumption that the topology of the agglomerated entities is correct). Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.
Earth-moon and other trajectories calculation in planar elliptic restricted three body problem by slowly varying Jacobi function