7 resultados para Regularization scheme
em Greenwich Academic Literature Archive - UK
Resumo:
A monotone scheme for finite volume simulation of magnetohydrodynamic internal flows at high Hartmann number is presented. The numerical stability is analysed with respect to the electromagnetic force. Standard central finite differences applied to finite volumes can only be numerically stable if the vector products involved in this force are computed with a scheme using a fully staggered grid. The electromagnetic quantities (electric currents and electric potential) must be shifted by half the grid size from the mechanical ones (velocity and pressure). An integral treatment of the boundary layers is used in conjunction with boundary conditions for electrically conducting walls. The simulations are performed with inhomogeneous electrical conductivities of the walls and reach high Hartmann numbers in three-dimensional simulations, even though a non-adaptive grid is used.
Resumo:
Graph partitioning divides a graph into several pieces by cutting edges. Very effective heuristic partitioning algorithms have been developed which run in real-time, but it is unknown how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. Distinctive features are the transmission and modification of whole subdomains (the partitioned units) that act as genes, and the use of a multilevel heuristic algorithm to effect the crossover and mutations. Its effectiveness is demonstrated by improvements on previously established benchmarks.
Resumo:
The PHYSICA software was developed to enable multiphysics modelling allowing for interaction between Computational Fluid Dynamics (CFD) and Computational Solid Mechanics (CSM) and Computational Aeroacoustics (CAA). PHYSICA uses the finite volume method with 3-D unstructured meshes to enable the modelling of complex geometries. Many engineering applications involve significant computational time which needs to be reduced by means of a faster solution method or parallel and high performance algorithms. It is well known that multigrid methods serve as a fast iterative scheme for linear and nonlinear diffusion problems. This papers attempts to address two major issues of this iterative solver, including parallelisation of multigrid methods and their applications to time dependent multiscale problems.
Resumo:
This paper presents a proactive approach to load sharing and describes the architecture of a scheme, Concert, based on this approach. A proactive approach is characterized by a shift of emphasis from reacting to load imbalance to avoiding its occurrence. In contrast, in a reactive load sharing scheme, activity is triggered when a processing node is either overloaded or underloaded. The main drawback of this approach is that a load imbalance is allowed to develop before costly corrective action is taken. Concert is a load sharing scheme for loosely-coupled distributed systems. Under this scheme, load and task behaviour information is collected and cached in advance of when it is needed. Concert uses Linux as a platform for development. Implemented partially in kernel space and partially in user space, it achieves transparency to users and applications whilst keeping the extent of kernel modifications to a minimum. Non-preemptive task transfers are used exclusively, motivated by lower complexity, lower overheads and faster transfers. The goal is to minimize the average response-time of tasks. Concert is compared with other schemes by considering the level of transparency it provides with respect to users, tasks and the underlying operating system.
Resumo:
A numerical scheme for coupling temperature and concentration fields in a general solidification model is presented. A key feature of this scheme is an explicit time stepping used in solving the governing thermal and solute conservation equations. This explicit approach results in a local point-by-point coupling scheme for the temperature and concentration and avoids the multi-level iteration required by implicit time stepping schemes. The proposed scheme is validated by predicting the concentration field in a benchmark solidification problem. Results compare well with an available similarity solution. The simplicity of the proposed explicit scheme allows for the incorporation of complex microscale models into a general solidification model. This is demonstrated by investigating the role of dendrite coarsening on the concentration field in the solidification benchmark problem.
Resumo:
We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total tardiness on a single machine, provided that all due dates are equal. The FPTAS is obtained by converting an especially designed pseudopolynomial dynamic programming algorithm.
Resumo:
This paper presents an approach for detecting local damage in large scale frame structures by utilizing regularization methods for ill-posed problems. A direct relationship between the change in stiffness caused by local damage and the measured modal data for the damaged structure is developed, based on the perturbation method for structural dynamic systems. Thus, the measured incomplete modal data can be directly adopted in damage identification without requiring model reduction techniques, and common regularization methods could be effectively employed to solve the developed equations. Damage indicators are appropriately chosen to reflect both the location and severity of local damage in individual components of frame structures such as in brace members and at beam-column joints. The Truncated Singular Value Decomposition solution incorporating the Generalized Cross Validation method is introduced to evaluate the damage indicators for the cases when realistic errors exist in modal data measurements. Results for a 16-story building model structure show that structural damage can be correctly identified at detailed level using only limited information on the measured noisy modal data for the damaged structure.