ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    facet.materialart.
    Unknown
    Multilevel decomposition of complete vehicle configuration in a parallel computing environment (1989)
    In:  CASI
    Details
    Publication Date: 2013-08-31
    Description: This research summarizes various approaches to multilevel decomposition to solve large structural problems. A linear decomposition scheme based on the Sobieski algorithm is selected as a vehicle for automated synthesis of a complete vehicle configuration in a parallel processing environment. The research is in a developmental state. Preliminary numerical results are presented for several example problems.
    Keywords: AIRCRAFT DESIGN, TESTING AND PERFORMANCE
    Type: NASA. Langley Research Center, Recent Advances in Multidisciplinary Analysis and Optimization, Part 3; p 1069-1082
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 2
    facet.materialart.
    Unknown
    Quasi-three-dimensional turbomachinery flow calculations on multiple hub-to-shroud stream surfaces (1983)
    In:  Other Sources
    Details
    Publication Date: 2019-06-28
    Description: Results are presented from a quasi-three-dimensional calculation of steady (relative), inviscid, adiabatic, subsonic/shock-free transonic flow on multiple hub-to-shroud stream surfaces through turbomachinery blade rows. The quasi-three-dimensional technique incorporates some three-dimensional effects while retaining much of the simplicity of two-dimensional computational methods. Three typical turbomachinery flowfield calculations are presented including an axial-flow compressor rotor, a turbine stator vane cascade, and a radial-inflow turbine rotor. The calculations were performed using quasi-three-dimensional extensions of existing two-dimensional methods. The current results represent an intermediate step in the complete quasi-three-dimensional solution process. However, the results demonstrate the usefulness of the quasi-three-dimensional technique in complementing and extending the applicability of the two-dimensional methods of turbomachinery flow analysis.
    Keywords: AERODYNAMICS
    Type: AIAA PAPER 83-1820
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 3
    Electronic Resource
    Electronic Resource
    On the computational utility of posynomial geometric programming solution methods (1982)
    Springer
    Mathematical programming 22 (1982), S. 163-201 
    Details
    ISSN: 1436-4646
    Keywords: Geometric Programming ; Code Comparisons ; Numerical Testing ; Nonlinear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Ten codes or code variants were used to solve the five equivalent posynomial GP problem formulations. Four of these codes were general NLP codes; six were specialized GP codes. A total of forty-two test problems was solved with up to twenty randomly generated starting points per problem. The convex primal formulation is shown to be intrinsically easiest to solve. The general purpose GRG code called OPT appears to be the most efficient code for GP problem solution. The reputed superiority of the specialized GP codes GGP and GPKTC appears to be largely due to the fact that these codes solve the convex primal formulation. The dual approaches are only likely to be competitive for small degree of difficulty, tightly constrained problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581036
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    On the relationship between a continuous update method of multipliers and the generalized reduced gradient method (1980)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 15 (1980), S. 1735-1745 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The method of multipliers1-3 (MOM) is a transformation technique which has enjoyed considerable popularity in recent years. The algorithmic philosophy is similar to conventional penalty function methods in that a constrained nonlinear programming problem is transformed into a sequence of unconstrained problems. In the standard MOM approach, the multipliers are updated after each unconstrained search. In this paper we investigate methods which involve continuous updating of the penalty parameters and design variables. We demonstrate that this continuous updating scheme is equivalent to the generalized reduced gradient method4,5 applied to a certain dual problem. Computational results are given which suggest that the continuous updating MOM is not as efficient as one might reasonably hope.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620151203
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...