In this paper, we first propose and analyze a novel mixed-type DG method for the coupled Stokes--Darcy problem on simplicial meshes. The proposed formulation is locally conservative. A in conjunction with stress-velocity employed Stokes equations, where symmetry of stress strongly imposed. staggered exploited to discretize Darcy equations. As such, discrete can be easily adapted account Beavers...

We propose an extension of the classical real-valued external penalty method to the multicriteria optimization setting. As its single objective counterpart, it also requires an external penalty function for the constraint set, as well as an exogenous divergent sequence of nonnegative real numbers, the so-called penalty parameters, but, differently from the scalar procedure, the vector-valued me...

We prove an existence and uniqueness theorem for solving the operator equation F(x) + G(x)= 0, where F is a continuous and Gâteaux differentiable operator and the operator G satisfies Lipschitz condition on an open convex subset of a Banach space. As corollaries, a recent theorem of Argyros (2003) and the classical convergence theorem for modified Newton iterates are deduced. We further obtain ...

Method inlining is an optimisation that can be invalidated by later class loading. A program analysis based on the current loaded classes might determine that a method call has a unique target, but later class loading could add targets. If a compiler speculatively inlines methods based on current information, then it will have to undo the inlining when later classes invalidate the assumptions. ...

In the distributed setting, the object-oriented programming model may be criticized for its tight coupling of communication and synchronization, found in, e.g., remote procedure calls. Creol is a novel object-oriented language which targets distributed systems by combining asynchronous method calls with so-called processor release points inside concurrent objects [3]. A type system for Creol an...

This paper describes a novel strategy for generating accurate black-box models of datapath power consumption at the architecture level. This is achieved by recognizing that power consumption in digital circuits is affected by activity, as well as physical capacitance. Since existing strategies characterize modules for purely random inputs, they fail to account for the effect of signal statistic...

We discuss a new method for the iterative computation of a portion of the singular values and vectors of a large sparse matrix. Similar to the Jacobi–Davidson method for the eigenvalue problem, we compute in each step a correction by (approximately) solving a correction equation. We give a few variants of this Jacobi–Davidson SVD (JDSVD) method with their theoretical properties. It is shown tha...