Bilateral generating functions and operational methods

Bilateral generating functions are those involving products of different types of polynomials. We show that operational methods offer a powerful tool to derive these families of generating functions. We study cases relevant to products of Hermite polynomials with Laguerre, Legendre and other polynomials. We also propose further extensions of the method which we develop here.     

Synthesis and Reactions of Some New Pyrrolylfuro[2,3‐d]Pyrimidines and Pyrrolopyrazinofuropyrimidines

5‐Amino‐4‐methyl‐2‐phenyl‐6‐substitutedfuro[2,3‐d]pyrimidines ( 2a‐c ) were reacted with 2,5‐dimethoxytetrahydrfuran to afford the pyrrolyl derivatives 3a‐c . Compound 3a was chosen as intermediate for the synthesis of poly fused heterocycles incorporated furopyrimidines moiety 4–11 . Some of the synthesized compounds were screened for their antibacterial and antifungal activities.     

Method of lines with boundary elements for 1‐D transient diffusion‐reaction problems

Time‐dependent differential equations can be solved using the concept of method of lines (MOL) together with the boundary element (BE) representation for the spatial linear part of the equation. The BE method alleviates the need for spatial discretization and casts the problem in an integral format. Hence errors associated with the numerical approximation of the spatial derivatives are totally eliminated. An element level local cubic approximation is used for the variable at each time step to facilitate the time marching and the nonlinear terms are represented in a semi‐implicit manner by a local linearization at each time step. The accuracy of the method has been illustrated on a number of test problems of engineering significance. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

Interlaboratory comparisons and improvements of methods for acid number determination in used motor oils

The results of two interlaboratory comparisons of acid number determinations in used motor oils are discussed. It is shown that the comparability of the measurement results is not as good as that required by known standards for petroleum products. The problem is motor oil contaminants which accumulated during use, and which are the source of a matrix effect in the acid number determination. The standard methods’ drawbacks are analyzed and some improvements are proposed. Repeatability and accuracy of the improved methods are evaluated. Received: 11 December 2001 Accepted: 15 February 2002     

AGE method simulations of a turbulent far‐wake compared to spectral DNS

Turbulent flow simulation methods based on finite differences are attractive for their simplicity, flexibility and efficiency, but not always for accuracy or stability. This paper demonstrates that a good compromise is possible with the advected grid explicit (AGE) method. Starting from the same initial field as a previous spectral DNS, AGE method simulations of a planar turbulent wake were carried out as DNS, and then at three levels of reduced resolution. The latter cases were in a sense large‐eddy simulations (LES), although no specific sub‐grid‐scale model was used. Results for the two DNS methods, including variances and power spectra, were very similar, but the AGE simulation required much less computational effort. Small‐scale information was lost in the reduced resolution runs, but large‐scale mean and instantaneous properties were reproduced quite well, with further large reductions in computational effort. Quality of results becomes more sensitive to the value chosen for one of the AGE method parameters as resolution is reduced, from which it is inferred that the numerical stability procedure controlled by the parameter is acting in part as a sub‐grid‐scale model. Copyright © 2002 John Wiley & Sons, Ltd.     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

Multilevel preconditioners for a quadrature Galerkin solution of a biharmonic problem

Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

Finite Element Solution of Conical Diffraction Problems

This paper is devoted to the numerical study of diffraction by periodic structures of plane waves under oblique incidence. For this situation Maxwell's equations can be reduced to a system of two Helmholtz equations in R ² coupled via quasiperiodic transmission conditions on the piecewise smooth interfaces between different materials. The numerical analysis is based on a strongly elliptic variational formulation of the differential problem in a bounded periodic cell involving nonlocal boundary operators. We obtain existence and uniqueness results for discrete solutions and provide the corresponding error analysis.