Construction of nonlinear programming test problems
Construction of nonlinear programming tests with known optimum solutions - algorithm
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.
Construction of nonlinear programming tests with known optimum solutions - algorithm
Through the use of a space-time warp, specialized moving finite elements are developed that can be employed to generate a nonlinear heat conduction model for situations involving traveling boundary and heat generation fields superposed on an initial state. To facilitate the solution of the resulting nonlinear finite-element formulation, a multilevel heuristic iterative solution strategy is developed. In order to demonstrate the versatility and accuracy of the moving elements and their associated nonlinear solution strategy, the results of several numerical experiments are presented.
The paper studies the inversion of the radiative transfer equation describing the interaction of electromagnetic radiation with atmospheric aerosols. The interaction can be considered as the propagation in the aerosol medium of two light beams: the direct beam in the line-of-sight attenuated by absorption and scattering, and the diffuse beam arising from scattering into the viewing direction, which propagates more or less in random fashion. The latter beam has single scattering and multiple scattering contributions. In the former case and for single scattering, the problem is reducible to first-kind Fredholm equations, while for multiple scattering it is necessary to invert partial integrodifferential equations. A nonlinear minimization search method, applicable to the solution of both types of problems has been developed, and is applied here to the problem of monitoring aerosol pollution, namely the complex refractive index and size distribution of aerosol particles.
A parallel adaptive dynamic relaxation (ADR) algorithm has been developed for nonlinear structural analysis. This algorithm has minimal memory requirements, is easily parallelizable and scalable to many processors, and is generally very reliable and efficient for highly nonlinear problems. Performance evaluations on single-processor computers have shown that the ADR algorithm is reliable and highly vectorizable, and that it is competitive with direct solution methods for the highly nonlinear problems considered. The present algorithm is implemented on the 512-processor Intel Touchstone DELTA system at Caltech, and it is designed to minimize the extent and frequency of interprocessor communication. The algorithm has been used to solve for the nonlinear static response of two and three dimensional hyperelastic systems involving contact. Impressive relative speedups have been achieved and demonstrate the high scalability of the ADR algorithm. For the class of problems addressed, the ADR algorithm represents a very promising approach for parallel-vector processing.
This paper develops an algorithmic solution strategy which allows the handling of positive/indefinite stiffness characteristics associated with the pre- and post-buckling of structures subject to complex thermomechanical loading fields. The flexibility of the procedure is such that it can be applied to both finite difference and element-type simulations. Due to the generality of the algorithmic approach developed, both kinematic and thermal/mechanical type material nonlinearity including inelastic effects can be treated. This includes the possibility of handling completely general thermomechanical boundary conditions. To demonstrate the scheme, the results of several benchmark problems is presented.
The efficiency of the quadrature-free form of the dis- continuous Galerkin method in two dimensions, and briefly in three dimensions, is examined. Most of the work for constant-coefficient, linear problems involves the volume and edge integrations, and the transformation of information from the volume to the edges. These operations can be viewed as matrix-vector multiplications. Many of the matrices are sparse as a result of symmetry, and blocking and specialized multiplication routines are used to account for the sparsity. By optimizing these operations, a 35% reduction in total CPU time is achieved. For nonlinear problems, the calculation of the flux becomes dominant because of the cost associated with polynomial products and inversion. This component of the work can be reduced by up to 75% when the products are approximated by truncating terms. Because the cost is high for nonlinear problems on general elements, it is suggested that simplified physics and the most efficient element types be used over most of the domain.
The postbuckling behavior of shear webs divided into rectangular panels by stiffeners (uprights) was studied numerically, using the STAGS program in which two-dimensional finite differences are used to solve buckling and nonlinear problems. Universal nondimensional parameters, suggested by linear buckling data, are found to hold for the postbuckling range. Results indicate that the postbuckling stiffness of shear webs with isotropic panels is roughly two thirds of the prebuckling stiffness. The postbuckling behavior of shear webs with isotropic and orthotropic material properties is compared. Some practical aspects of solving nonlinear problems of this type by the numerical method employed are examined.
In this paper we review the existing and develop new continuous Galerkin methods for solving time dependent partial differential equations with higher order derivatives in one and multiple space dimensions. We review local discontinuous Galerkin methods for convection diffusion equations involving second derivatives and for KdV type equations involving third derivatives. We then develop new local discontinuous Galerkin methods for the time dependent bi-harmonic type equations involving fourth derivatives, and partial differential equations involving fifth derivatives. For these new methods we present correct interface numerical fluxes and prove L(exp 2) stability for general nonlinear problems. Preliminary numerical examples are shown to illustrate these methods. Finally, we present new results on a post-processing technique, originally designed for methods with good negative-order error estimates, on the local discontinuous Galerkin methods applied to equations with higher derivatives. Numerical experiments show that this technique works as well for the new higher derivative cases, in effectively doubling the rate of convergence with negligible additional computational cost, for linear as well as some nonlinear problems, with a local uniform mesh.
Used in concert with the Kirchhoff transformation, implicit differentiation of the discretized boundary integral equations governing the conduction of heat in solids with temperature dependent thermal conductivity is shown to generate an accurate and economical approach for computation of shape sensitivities. For problems with specified temperature and heat flux boundary conditions, a linear problem results for both the analysis and sensitivity analysis. In problems with either convection or radiation boundary conditions, a nonlinear problem is generated. Several iterative strategies are presented for the solution of the resulting sets of nonlinear equations and the computational performances examined in detail. Multizone analysis and zone condensation strategies are demonstrated to provide substantive computational economies in this process for models with either localized nonlinear boundary conditions or regions of geometric insensitivity to design variables. A series of nonlinear example problems is presented that have closed form solutions. Exact analytical expressions for the shape sensitivities associated with these problems are developed and these are compared with the sensitivities computed using the boundary element formulation.
First-order nonlinear one-dimensional mathematical model of viscoelasticity using perturbation method
This paper is concerned with analyses of nonlinear waves in solid propellant rockets. Most attention is given to an approximate technique which inexpensively provides results which appear to be quite accurate at least up to amplitudes of ten percent. The connection with linear stability analysis is shown. Primarily to study nonlinear stability, or triggering, the method is extended to third order in the amplitude of wave motion; no explicit results have been obtained. Application of the approximate method to the behavior of pulses is described.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
The present adaptive FEM technique for convection-dominated problems is based on a Petrov-Galerkin scheme for spatial approximation, whose typical time-step employs test functions chosen to yield an approximate solution coinciding with the exact solutions at the finite element grid nodes. The derivation of truly local a posteriori error estimates is made possible by this procedure, which is also shown to be a very effective solver by the numerical examples presented.
Explore the source record for details and available documents.
This project is concerned with the possibility of using computers for the simulation of structural systems with the same degree of reliability as full scale physical experiments. Reliable numerical simulation will make it possible to reduce the costs of engineering and improve the quality of engineering decisions based on computed information. An error of idealization is an error between the actual physical quantities on which engineering decisions are based (e.g., maximum principal stress, first natural frequency, etc.) and the same data corresponding to the exact solution of the mathematical model. An error of discretization is an error between the quantities of interest corresponding to the exact and approximate solutions of a mathematical model. A high degree of reliability can be achieved in numerical simulation only if both the errors of idealization and errors of discretization can be shown to be small.
Explore the source record for details and available documents.
As more and more nonlinear estimation techniques become available, our interest is in finding out what performance improvement, if any, they can provide for practical nonlinear problems that have been traditionally solved using linear methods. In this paper we examine the problem of estimating spacecraft position using conical scan (conscan) for NASA's Deep Space Network antennas. We show that for additive disturbances on antenna power measurement, the problem can be transformed into a linear one, and we present a general solution to this problem, with the least square solution reported in literature as a special case. We also show that for additive disturbances on antenna position, the problem is a truly nonlinear one, and we present two approximate solutions based on linearization and Unscented Transformation respectively, and one 'exact' solution based on Markov Chain Monte Carlo (MCMC) method. Simulations show that, with the amount of data collected in practice, linear methods perform almost the same as MCMC methods. It is only when we artificially reduce the amount of collected data and increase the level of noise that nonlinear methods show significantly better accuracy than that achieved by linear methods, at the expense of more computation.