A CHEBYSHEV-TYPE QUADRATURE RULE WITH SOME INTERESTING PROPERTIES

We give here an n-point Chebyshev-type rule of algebraic degree of precision n - 1, but having nodes that can be given explicitly. This quadrature rule also turns out to be one with an ''almost'' highest algebraic degree of precision.

Zipf and Type-Token rules for the English, Spanish, Irish and Latin languages

The Zipf curves of log of frequency against log of rank for a large English corpus of 500 million word tokens, 689,000 word types and for a large Spanish corpus of 16 million word tokens, 139,000 word types are shown to have the usual slope close to –1 for rank less than 5,000, but then for a higher rank they turn to give a slope close to –2. This is apparently mainly due to foreign words and place names. Other Zipf curves for highlyinflected Indo-European languages, Irish and ancient Latin, are also given. Because of the larger number of word types per lemma, they remain flatter than the English curve maintaining a slope of –1 until turning points of about ranks 30,000 for Irish and 10,000 for Latin. A formula which calculates the number of tokens given the number of types is derived in terms of the rank at the turning point, 5,000 for both English and Spanish, 30,000 for Irish and 10,000 for Latin.

Ixaru's Extended Frequency Dependent Quadrature Rules for Slater Integrals: Parallel Computation Issues

We describe recent progress of an ongoing research programme aimed at producing computational science software that can exploit high performance architectures in the atomic physics application domain. We examine the computational bottleneck of matrix construction in a suite of two-dimensional R-matrix propagation programs, 2DRMP, that are aimed at creating virtual electron collision experiments on HPC architectures. We build on Ixaru's extended frequency dependent quadrature rules (EFDQR) for Slater integrals and examine the challenge of constructing Hamiltonian matrices in parallel across an m-processor compute node in a block cyclic distribution for subsequent diagonalization by ScaLAPACK.

Gaussian quadrature rules with simple node-weight relations

In this paper, we consider the symmetric Gaussian and L-Gaussian quadrature rules associated with twin periodic recurrence relations with possible variations in the initial coefficient. We show that the weights of the associated Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 4. We also show that the weights of the associated L-Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 5. Special cases of these quadrature rules are given. Finally, an easy to implement procedure for the evaluation of the nodes is described.

Approximations for the generalized temperature integral: a method based on quadrature rules

The generalized temperature integral I(m, x) appears in non-isothermal kinetic analysis when the frequency factor depends on the temperature. A procedure based on Gaussian quadrature to obtain analytical approximations for the integral I(m, x) was proposed. The results showed good agreement between the obtained approximation values and those obtained by numerical integration. Unless other approximations found in literature, the methodology presented in this paper can be easily generalized in order to obtain approximations with the maximum of accurate.

Associated symmetric quadrature rules

We prove a relation between two different types of symmetric quadrature rules, where one of the types is the classical symmetric interpolatory quadrature rules. Some applications of a new quadrature rule which was obtained through this relation are also considered.

Inversely symmetric interpolatory quadrature rules

We consider interpolatory quadrature rules with nodes and weights satisfying symmetric properties in terms of the division operator. Information concerning these quadrature rules is obtained using a transformation that exists between these rules and classical symmetric interpolatory quadrature rules. In particular, we study those interpolatory quadrature rules with two fixed nodes. We obtain specific examples of such quadrature rules.

Szegö polynomials: quadrature rules on the unit circle and on [-1, 1]

We consider some of the relations that exist between real Szegö polynomials and certain para-orthogonal polynomials defined on the unit circle, which are again related to certain orthogonal polynomials on [-1, 1] through the transformation x = (z1/2+z1/2)/2. Using these relations we study the interpolatory quadrature rule based on the zeros of polynomials which are linear combinations of the orthogonal polynomials on [-1, 1]. In the case of any symmetric quadrature rule on [-1, 1], its associated quadrature rule on the unit circle is also given.

ANOTHER QUADRATURE RULE OF HIGHEST ALGEBRAIC DEGREE OF PRECISION

We consider certain quadrature rules of highest algebraic degree of precision that involve strong Stieltjes distributions (i.e., strong distributions on the positive real axis). The behavior of the parameters of these quadrature rules, when the distributions are strong c-inversive Stieltjes distributions, is given. A quadrature rule whose parameters have explicit expressions for their determination is presented. An application of this quadrature rule for the evaluation of a certain type of integrals is also given.

A class of hypergeometric polynomials with zeros on the unit circle: Extremal and orthogonal properties and quadrature formulas

The class of hypergeometric polynomials F12(-m,b;b+b̄;1-z) with respect to the parameter b=λ+iη, where λ>0, are known to have all their zeros simple and exactly on the unit circle |z|=1. In this note we look at some of the associated extremal and orthogonal properties on the unit circle and on the interval (-1,1). We also give the associated Gaussian type quadrature formulas. © 2012 IMACS.

Special Classes of Orthogonal Polynomials and Corresponding Quadratures of Gaussian Type

MSC 2010: 33C47, 42C05, 41A55, 65D30, 65D32

Fast numerical methods for mixed, singular Helmholtz boundary value problems and Laplace eigenvalue problems - with applications to antenna design, sloshing, electromagnetic scattering and spectral geometry

This thesis presents a novel class of algorithms for the solution of scattering and eigenvalue problems on general two-dimensional domains under a variety of boundary conditions, including non-smooth domains and certain "Zaremba" boundary conditions - for which Dirichlet and Neumann conditions are specified on various portions of the domain boundary. The theoretical basis of the methods for the Zaremba problems on smooth domains concern detailed information, which is put forth for the first time in this thesis, about the singularity structure of solutions of the Laplace operator under boundary conditions of Zaremba type. The new methods, which are based on use of Green functions and integral equations, incorporate a number of algorithmic innovations, including a fast and robust eigenvalue-search algorithm, use of the Fourier Continuation method for regularization of all smooth-domain Zaremba singularities, and newly derived quadrature rules which give rise to high-order convergence even around singular points for the Zaremba problem. The resulting algorithms enjoy high-order convergence, and they can tackle a variety of elliptic problems under general boundary conditions, including, for example, eigenvalue problems, scattering problems, and, in particular, eigenfunction expansion for time-domain problems in non-separable physical domains with mixed boundary conditions.

A Smooth Discretization Bridging Finite Element and Mesh-free Methods Using Polynomial Reproducing Simplex Splines

This work sets forth a `hybrid' discretization scheme utilizing bivariate simplex splines as kernels in a polynomial reproducing scheme constructed over a conventional Finite Element Method (FEM)-like domain discretization based on Delaunay triangulation. Careful construction of the simplex spline knotset ensures the success of the polynomial reproduction procedure at all points in the domain of interest, a significant advancement over its precursor, the DMS-FEM. The shape functions in the proposed method inherit the global continuity (Cp-1) and local supports of the simplex splines of degree p. In the proposed scheme, the triangles comprising the domain discretization also serve as background cells for numerical integration which here are near-aligned to the supports of the shape functions (and their intersections), thus considerably ameliorating an oft-cited source of inaccuracy in the numerical integration of mesh-free (MF) schemes. Numerical experiments show the proposed method requires lower order quadrature rules for accurate evaluation of integrals in the Galerkin weak form. Numerical demonstrations of optimal convergence rates for a few test cases are given and the method is also implemented to compute crack-tip fields in a gradient-enhanced elasticity model.