Home About us Contact
|
Home About us Contact | ||
|
|
||
Parallel Solution (parallel + solution)
Selected AbstractsParallel solution of lifting rotors in hover and forward flightINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, Issue 1 2007C. B. Allen Abstract An implicit unsteady, multiblock, multigrid, upwind solver including mesh deformation capability, and structured multiblock grid generator, are presented and applied to lifting rotors in both hover and forward flight. To allow the use of very fine meshes and, hence, better representation of the flow physics, a parallel version of the code has been developed. It is demonstrated that once the grid density is sufficient to capture enough turns of the tip vortices, hover exhibits oscillatory behaviour of the wake, even using a steady formulation. An unsteady simulation is then presented, and detailed analysis of the time-accurate wake history is performed and compared to theoretical predictions. Forward flight simulations are also presented and, again, grid density effects on the wake formation investigated. Parallel performance of the code using up to 1024 CPU's is also presented. Copyright © 2006 John Wiley & Sons, Ltd. [source] Parallel iterative multilevel solution of mixed finite element systems for scalar equationsCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 5 2006V. Chugunov Abstract A combination of several contemporary techniques is used for the efficient parallel solution of the mixed finite element systems on locally refined Grids. Implementation experience and numerical results are reported. Copyright © 2005 John Wiley & Sons, Ltd. [source] An efficient methodology for security assessment of power systems based on distributed optimal power flowEUROPEAN TRANSACTIONS ON ELECTRICAL POWER, Issue 3 2003D. Hur This paper presents an algorithm for the parallel solution of the security constrained optimal power flow (SCOPF) problem in a decentralized framework, consisting of regions, using a price-based mechanism that models each region as an economic unit. We first solve the distributed optimal power flow (OPF) problem to determine the maximum secure simultaneous transfer capability of each tie-line between adjacent regions by taking only the security constraints imposed on the tie-lines into account. In this paper, the line outage distribution factors (LODF) calculated at the current state are used to formulate the appended constraints. Once the secure transfer capability of each tie-line is determined, the intra-regional SCOPF is performed using the conventional linear programming (LP) approach. A description on the inclusion of security constraints with distributed OPF algorithm will be given, followed by the case study for Korea Electric Power System. [source] Parallel eigenanalysis of multiaquifer systemsINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 15 2005L. Bergamaschi Abstract Finite element discretizations of flow problems involving multiaquifer systems deliver large, sparse, unstructured matrices, whose partial eigenanalysis is important for both solving the flow problem and analysing its main characteristics. We studied and implemented an effective preconditioning of the Jacobi,Davidson algorithm by FSAI-type preconditioners. We developed efficient parallelization strategies in order to solve very large problems, which could not fit into the storage available to a single processor. We report our results about the solution of multiaquifer flow problems on an SP4 machine and a Linux Cluster. We analyse the sequential and parallel efficiency of our algorithm, also compared with standard packages. Questions regarding the parallel solution of finite element eigenproblems are addressed and discussed. Copyright © 2005 John Wiley & Sons, Ltd. [source] A domain decomposition approach to finite volume solutions of the Euler equations on unstructured triangular meshesINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, Issue 6 2001Victoria Dolean Abstract We report on our recent efforts on the formulation and the evaluation of a domain decomposition algorithm for the parallel solution of two-dimensional compressible inviscid flows. The starting point is a flow solver for the Euler equations, which is based on a mixed finite element/finite volume formulation on unstructured triangular meshes. Time integration of the resulting semi-discrete equations is obtained using a linearized backward Euler implicit scheme. As a result, each pseudo-time step requires the solution of a sparse linear system for the flow variables. In this study, a non-overlapping domain decomposition algorithm is used for advancing the solution at each implicit time step. First, we formulate an additive Schwarz algorithm using appropriate matching conditions at the subdomain interfaces. In accordance with the hyperbolic nature of the Euler equations, these transmission conditions are Dirichlet conditions for the characteristic variables corresponding to incoming waves. Then, we introduce interface operators that allow us to express the domain decomposition algorithm as a Richardson-type iteration on the interface unknowns. Algebraically speaking, the Schwarz algorithm is equivalent to a Jacobi iteration applied to a linear system whose matrix has a block structure. A substructuring technique can be applied to this matrix in order to obtain a fully implicit scheme in terms of interface unknowns. In our approach, the interface unknowns are numerical (normal) fluxes. Copyright © 2001 John Wiley & Sons, Ltd. [source] On parallel solution of linear elasticity problems.NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 3 2002Part II: Methods, some computer experiments Abstract This is the second part of a trilogy on parallel solution of the linear elasticity problem. We consider the plain case of the problem with isotropic material, including discontinuous coefficients, and with homogeneous Dirichlet boundary condition. The discretized problem is solved by the preconditioned conjugate gradient (pcg) method. In the first part of the trilogy block- diagonal preconditioners based on the separate displacement component part of the elasticity equations were analysed. The preconditioning systems were solved by the pcg-method, i.e. inner iterations were performed. As preconditioner, we used modified incomplete factorization MIC(0), where possibly the element matrices were modified in order to give M -matrices, i.e. in order to guarantee the existence of the MIC(0) factorization. In the present paper, the second part, full block incomplete factorization preconditioners are presented and analysed. In order to avoid inner/outer iterations we also study a variant of the block-diagonal method and of the full block method, where the matrices of the inner systems are just replaced by their MIC(0)-factors. A comparison is made between the various methods with respect to rate of convergence and work per unknown. The fastest methods are implemented by message passing utilizing the MPI system. In the third part of the trilogy, we will focus on the use of higher-order finite elements. Copyright © 2002 John Wiley & Sons, Ltd. [source] | ||||||||||