We present an extension to the labelling approach, a technique for lifting resource consumption information from compiled to source code. This approach, which is at the core of the annotating compiler from a large fragment of C to 8051 assembly of the CerCo project, looses preciseness when differences arise as to the cost of the same portion of code, whether due to code transformation such as l...

Article history: Received 27 March 2014 Received in revised form 7 November 2014 Accepted 15 November 2014 Available online 5 December 2014

In this paper, we prove the existence of a random common fixed point of two continuous contractive random operators on a separable Banach space. We introduce the random modified Ishikawa iteration scheme and use our existence result to study weak and strong convergence of this scheme to a unique random common fixed point of two random asymptotically quasi-nonexpansive operator. Our work extends...

The input motion for seismic analysis of building structures is generally specified in design codes in terms of response spectrum. Therefore, real or simulated time histories for ground motions whose response spectrum matches approximately the design spectrum is desired. Among the various techniques currently available for generating spectrum compatible time histories it is possible to distingu...

This paper studies issues concerning parallel execution of regular Fortran DO loops on an asynchronous shared-memory multiprocessor, where each iteration is the basic unit to be executed by a single processing element. An iteration is a dependent predecessor of another iteration if execution of the latter iteration has to wait until execution of the former iteration has completed. During the ex...

Let K be a subset of a real normed linear space E and let T be a self-mapping on K . T is said to be nonexpansive provided ‖Tx−Ty‖ ‖x− y‖ for all x, y ∈ K . Fixed-point iteration process for nonexpansive mappings in Banach spaces including Mann and Ishikawa iteration processes has been studied extensively by many authors to solve the nonlinear operator equations in Hilbert spaces and Banach spa...

A deeation procedure is introduced that is designed to improve the convergence of an implicitly restarted Arnoldi iteration for computing a few eigenvalues of a large matrix. As the iteration progresses the Ritz value approximations of the eigenvalues of A converge at diierent rates. A numerically stable scheme is introduced that implicitly deeates the converged approximations from the iteratio...

in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.

We construct a preconditioned modified Hermitian and skew-Hermitian splitting (PMHSS) iteration scheme for solving and preconditioning a class of block two-by-two linear systems arising from the Galerkin finite element discretizations of a class of distributed control problems. The convergence theory of this class of PMHSS iteration methods is established and the spectral properties of the PMHS...

In this paper, we present a new approach to the least-squares design of stable infinite impulse response (IIR) digital filters. The design is accomplished by using an iterative scheme in which the denominator polynomial obtained from the preceding iteration is treated as a part of the weighting function, and each iteration is carried out by solving a standard quadratic programming problem that ...