Library

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
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 21 (1985), S. 19-36 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A numerical method is presented for the design of thin turbomachinery blades with specified whirl velocities across the blade span. The numerical scheme involves iteration between the directs solution of a finite-volume method developed earlier on by Soulis1 and a design solution.The finite-volume method, which is a combination of finite elements and finite differences, solves the three-dimensional, inviscid, steady arid potential flow through turbomachinery blade rows in the incompressible, compressible and transonic flow range. In the design step, the whirl velocity distribution is specified across the blade span (Dirichlet boundary condition). The design procedure yields a new set of co-ordinates for the blade geometry which are used in the next iteration of the direct solution. However, in the present analysis only thin turbomachinery blades are designed, although a fully three-dimensional numerical method is used (the whirl velocity components of the flow field are averaged over the blade suction and pressure surface).The numerical method has been used to design free-vortex thin turbomachinery blades. Results show that the new numerical procedure is a comparatively economic and reliable method for designing thin turbomachinery blades. It may form the baseline for complete three-dimensional turbomachinery blade designs.
    Additional Material: 16 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...