Approximation of infinite delay and Volterra type equations

Summary We consider a class of infinite delay equations of neutral type which includes Volterrra type integral und integrodifferential equations. Using abstract approximation results (cf. Trotter-Kato-type) for strongly continuous semigroups we develop an approximation scheme which is based on approximation of the system state by Laguerre (and Legendre) polynomials. Numerical examples demonstrate the feasibility of the scheme and show infinite order convergence for smooth data.Supported in part by the Air Force Office of Scientific Research under Contracts AFORS-84-0398 and AFORS-85-0303 and the National Aeronautics and Space Administration under NASA Grant NAG-1-517 and by NSF under Grant UINT-8521208Supported in part by the Air Force Office of Scientific Research under Contract AFORS-84-0398 and in part by the Fonds zur Förderung der wissenschaftlichen Forschung, Austria, under project No. S3206     

On the pivot structure for the weighing matrix W(12,11)

In the present article we concentrate our study on the growth problem for the weighing matrix W(12,11) and show that the unique W(12,11) has three pivot structures. An improved algorithm for extending a k × k (0,+,-) matrix to a W(n,n-1), if possible, has been developed to simplify the proof. For the implementation of the algorithm special emphasis is given to the notions of data structures and parallel processing.     

The treatment of nonhomogeneous Dirichlet boundary conditions by thep-version of the finite element method

Summary The paper addresses the problem of the implementation of nonhomogeneous essential Dirichlet type boundary conditions in thep-version of the finite element method.Partially supported by the Office of Naval Research under Grant N-00014-85-K-0169Research partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR 85-0322     

On the third largest Laplacian eigenvalue of a graph

In this article, a sharp lower bound for the third largest Laplacian eigenvalue of a graph is given in terms of the third largest degree of the graph.     

Asymptotic Distribution of Nodes for Near-Optimal Polynomial Interpolation on Certain Curves in R 2

Let E\subset \Bbb R ^s be compact and let d _n ^E denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ _n ={ \bf x _k,n } _k=1 ^dnE , n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R ² . It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore, for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes. November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001.     

Finite element error estimates for non-linear elliptic equations of monotone type

Summary In this paper we shall consider the application of the finite element method to a class of second order elliptic boundary value problems of divergence form and with gradient nonlinearity in the principal coefficient, and the derivation of error estimates for the finite element approximations. Such problems arise in many practical situations — for example, in shock-free airfoil design, seepage through coarse grained porous media, and in some glaciological problems. By making use of certain properties of the nonlinear coefficients, we shall demonstrate that the variational formulations associated with these boundary value problems are well-posed. We shall also prove that the abstract operators accompanying such problems satisfy certain continuity and monotonicity inequalities. With the aid of these inequalities and some standard results from approximation theory, we show how one may derive error estimates for the finite element approximations in the energy norm.     

Continuous time collocation methods for Volterra-Fredholm integral equations

Summary Integral equations of mixed Volterra-Fredholm type arise in various physical and biological problems. In the present paper we study continuous time collocation, time discretization and their global and discrete convergence properties.     

Optimality relationships forp-cyclic SOR

Summary The optimality question for blockp-cyclic SOR iterations discussed in Young and Varga is answered under natural conditions on the spectrum of the block Jacobi matrix. In particular, it is shown that repartitioning a blockp-cyclic matrix into a blockq-cyclic form,q, results in asymptotically faster SOR convergence for the same amount of work per iteration. As a consequence block 2-cyclic SOR is optimal under these conditions.Research supported in part by the US Air Force under Grant no. AFOSR-88-0285 and the National Science Foundation under grant no. DMS-85-21154 Present address: Boeing Computer Services, P.O. Box 24346, MS 7L-21, Seattle, WA 98124-0346, USA     

Tchebychev acceleration technique for large scale nonsymmetric matrices

Summary The acceleration by Tchebychev iteration for solving nonsymmetric eigenvalue problems is dicussed. A simple algorithm is derived to obtain the optimal ellipse which passes through two eigenvalues in a complex plane relative to a reference complex eigenvalue. New criteria are established to identify the optimal ellipse of the eigenspectrum. The algorithm is fast, reliable and does not require a search for all possible ellipses which enclose the spectrum. The procedure is applicable to nonsymmetric linear systems as well.