Tchebychev iteration may be used for acceleration convergence of an iterative algorithm to solve a general linear system equation. Associating it with the Uzawa method, we suggest a new iterative solution method for the Stokes problems. The new algorithm retains the simplicity and robustness of the Uzawa method. So it requires almost no additional cost of computation, in terms of storage or CPU...

Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...

We propose an augmented Lagrangian algorithm for solving large-scale constrained optimization problems. The novel feature of the algorithm is an adaptive update for the penalty parameter motivated by recently proposed techniques for exact penalty methods. This adaptive updating scheme greatly improves the overall performance of the algorithm without sacrificing the strengths of the core augment...

In this paper we propose that adequate treatments of space need to be multiperspectival and related to sound foundational ontologies. To support this, we show that natural spatial descriptions commonly appeal to diverse theories of space and these need to be formally combined to be fully interpreted. Our account draws particularly on the foundational ontology DOLCE and the algebraic specificati...

As the first of two methodological devices aimed at increasing the trust in the ‘correctness’ of a specification, we develop a calculus for proving consistency of Casl specifications. It turns out to be possible to delegate large parts of the proof load to syntactical criteria by structuring consistency proofs along the given specification structure, so that only in rather few remaining focus p...

In this paper we present the higher-order logic used in theorem-provers like the HOL system (see [GM 93]) or Isabelle HOL logic (see [Paul 94]) as an institution. Then we show that for maps of institutions into HOL that satisfy certain technical conditions we can reuse the proof system of the higher-order logic to reason about structured specifications built over the institutions mapped into HO...

This paper describes RHALE, a two and three-dimensional, multi-material, arbitrary Lagrangian-Eulerian (MMALE) shock physics code written in C++. RHALE is the successor to CTH, Sandia’s 3-D Eulerian shock physics code, and will be capable of solving problems that CTH cannot adequately address. RHALE employs a three step solution algorithm for the equations of motion: (1) a Lagrangian step capab...

Description of Assessment The Comprehensive Assessment of Spoken Language (CASL) is a norm-referenced oral language assessment. It provides a thorough evaluation regarding the processes of comprehension, expression, and retrieval in four language categories: (1) lexical/semantic skills, (2) syntactic knowledge, (3) supralinguistic knowledge, and (4) pragmatic abilities through use of fifteen su...

Virtual Environmental for Reactor Analysis (VERA) benchmark was released by the Consortium Advanced Simulation of Light water reactors (CASL) project in 2012. VERA includes more than ten problems at different levels, from 2D fuel pin case to assembly 3D core refuelling case, addition, reference results and experimental measured data some were provided CASL. Fuel assemblies are various, includin...

For solving the multicommodity flow problems, Lagrangian relaxation based algorithms are fast in practice. The time-consuming part of the algorithms is the shortest path computations in solving the Lagrangian dual problem. We show that an A* search based algorithm is faster than Dijkstra’s algorithm for the shortest path computations when the number of demands is relatively smaller than the siz...