A posteriori error estimation with finite element methods of lines for one-dimensional parabolic systems

Summary Consider the solution of one-dimensional linear initial-boundary value problems by a finite element method of lines using a piecewiseP ^th -degree polynomial basis. A posteriori estimates of the discretization error are obtained as the solutions of either local parabolic or local elliptic finite element problems using piecewise polynomial corrections of degreep+1 that vanish at element ends. Error estimates computed in this manner are shown to converge in energy under mesh refinement to the exact finite element discretization error. Computational results indicate that the error estimates are robust over a wide range of mesh spacings and polynomial degrees and are, furthermore, applicable in situations that are not supported by the analysis.This research was partially supported by the U.S. Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR 90-0194; by the U.S. Army Research Office under Contract Number DAAL03-91-G-0215; and by the National Science Foundation under Institutional Infrastructure Grant Number CDA-8805910     

Nitrostyrene Derivatives of Adenosine 5′-Glutarates Modified with an Alkyl Spacer and their inhibitory activity on epidermal growth factor receptor protein tyrosine kinase

β-Nitrostyrene derivatives of adenosine 5′-glutarates are potent and selective bisubstrate-type inhibitors of the epidermal growth factor receptor protein tyrosine kinase (EGF-R PTK). In an attempt to improve the inhibitory activity, this type of compounds was modified with alkyl spacers of varying length between the nitrostyrene and the glutaryl units. The spacers consisted of 1, 3, 4, and 5 atoms to give compounds of the benzyl, oxyethyl, oxypropyl, and oxybutyl series, respectively (Schemes 1 and 2). Adenosine 5′-esters were prepared in the benzyl and oxypropyl series only. Compared to the compounds in the parent series without spacer (IC₅₀ = 0.7–12 μM ), most of the modified compounds inhibited the EGF-R PTK only marginally or were inactive (IC₅₀ ≥ 100 μM ). The only exceptions were the free acids 19 and 20 with IC₅₀ values of ca. 5 μM . It is noteworthy that esterification of these two hydrogen glutarates with either MeOH or adenosine yielded inactive compounds, which is in contrast to the corresponding substances without spacers.     

Derivatives of (2R)-N-Glyoxylbornane-10,2-sultam and Their Use as auxiliaries in the diastereoselective spirocyclization of 2-substituted tryptamines

A crude hydrate 6 and a crystalline hemiacetal 7 of glyoxylamide 4 were prepared from crotonamide 5 (Scheme 2). Particularly hemiacetal 7 , but also 6 and the ‘dimer’ 8 (obtained from 7 ) may serve as homochiral auxiliaries. The structure of 8 was determined by X-ray analysis. By arenesulfonyl halides, tryptimines 12–14 of 4 were diastereoselectively transformed into spirotricycles 15–17 and 19 .     

Synthesis of Benzazepine Analogues of Noscapine

The synthesis of benzazepine analogues of the opium alkaloid noscapine ( 1 ) is described. The benzazepines 2 and 3 were prepared starting from nornarceine ethyl ester ( 4 ; readily available from 1 ) in several steps. X-Ray analysis of compound 2 revealed that it is not a diastereosisomer mixture but a racemate of the threo-form and thus has the same configuration as 1 .     

An approach to triquinane synthesis using the Pauson-Khand reaction

Tricyclic skeletons have been generated from acyclic enyne precursors by using an intramolecular Pauson-Khand reaction in combination with aldol, Michael and alkylation reactions.     

Cleaving functors and controlled wild algebras

We show that the cleaving functors introduced in [Bautista et al., Invent. Math. 81 (1985) 217] as a tool for proving infinite representation type of finite-dimensional algebras can also be used to establish controlled wildness. The main application is that an algebra is controlled wild if there is an indecomposable projective module with a Loewy factor having a homogeneous direct summand which is of length at least 3. As a second application we derive Han's covering criterion.     

A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps.     

Products of mixed covering arrays of strength two

A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006