2,701 research outputs found

    Development of iterative techniques for the solution of unsteady compressible viscous flows

    Get PDF
    The development of efficient iterative solution methods for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations is discussed. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. In this work, another approach based on the classical conjugate gradient method, known as the Generalized Minimum Residual (GMRES) algorithm is investigated. The GMRES algorithm has been used in the past by a number of researchers for solving steady viscous and inviscid flow problems. Here, we investigate the suitability of this algorithm for solving the system of non-linear equations that arise in unsteady Navier-Stokes solvers at each time step

    Application of Extended Messinger Models to Complex Geometries

    Get PDF
    Since, ice accretion can significantly degrade the performance and the stability of an airborne vehicle, it is imperative to be able to model it accurately. While ice accretion studies have been performed on airplane wings and helicopter blades in abundance, there are few that attempt to model the process on more complex geometries such as fuselages. This paper proposes a methodology that extends an existing in-house Extended Messinger solver to complex geometries by introducing the capability to work with unstructured grids and carry out spatial surface streamwise marching. For the work presented here commercial solvers such as STAR-CCM+ and ANSYS Fluent are used for the flow field and droplet dispersed phase computations. The ice accretion is carried out using an in-house icing solver called GT-ICE. The predictions by GT-ICE are compared to available experimental data, or to predictions by other solvers such as LEWICE and STAR-CCM+. Three different cases with varying levels of complexity are presented. The first case considered is a commercial transport airfoil, followed by a three-dimensional MS(1)-317 swept wing. Finally, ice accretion calculations performed on a Robin fuselage have been discussed. Good agreement with experimental data, where applicable, is observed. Differences between the ice accretion predictions by different solvers have been discussed

    IMPLEMENTATION OF PATCH BASED INPAINTING METHOD

    Get PDF
    ABSTRACTInpainting is an emerging field in image processing research area. Inpainting is the retouching process which is used to remove or change the deteriorated/destroyed parts of an image and make the image real visualization to human eye in a plausible way. Different algorithms are proposed for this image inpainting to get quality in image and also time taking to process the inpainting technique. It is more useful in the areas of digital photography, films too. Many algorithms had proposed for this inpainting method and from those algorithms Exemplar Based Inpainting has got more popularized algorithm. Different approaches had applied to get reduce the time complexities in achieving the realistic appearance of the image. In this we presenting a new approach algorithm which makes the exemplar approach will be little faster than previous algorithms by using patch-based.Keywords: Inpainting, Exemplar based, digital Photography, algorithms, image Processin

    Bi-Level Selection Model for Web Services Search

    Get PDF
    Service registries and web service engines are the main approaches for discovering web services. Current service directories are mainly based on Universal Description, Discovery and Integration (UDDI), which is an industry standard for service registries, developed to solve the web service search problem. However, UDDI offers limited search functionalities which may return a huge number of irrelevant services. Another critical challenge in web service search and composition is the selection of web services, to be executed or to be composed, from the pool of matching services. Most of the current service selection proposals apply a weighted sum model (WSM) as an evaluation method for selection of services with the same functionality. In this paper, we propose a Bi-level service selection approach that selects the most appropriate web services from the pool of matching services that considers both the functional and non-functional requirements for service selection. The functional requirements are provided by the user as a set of input parameters provided for and output parameters desired from the web service. The user also provides a set of desired QoS values and the order of their preference for selection. The experimental results demonstrate the efficiency of service search in our bi-level model and the variety of user queries supported
    corecore