Skew-symmetric identities of octonions

Quadratic alternative superalgebras are introduced and their super-identities and central functions on one odd generator are described. As a corollary, all multilinear skew-symmetric identities and central polynomials of octonions are classified. (C) 2008 Elsevier B.V. All rights reserved.

Asymptotics for Gegenbauer-Sobolev orthogonal polynomials associated with non-coherent pairs of measures

Inner products of the type < f, g >(S) = < f, g >psi(0) + < f', g'>psi(1), where one of the measures psi(0) or psi(1) is the measure associated with the Gegenbauer polynomials, are usually referred to as Gegenbauer-Sobolev inner products. This paper deals with some asymptotic relations for the orthogonal polynomials with respect to a class of Gegenbauer-Sobolev inner products. The inner products are such that the associated pairs of symmetric measures (psi(0), psi(1)) are not within the concept of symmetrically coherent pairs of measures.

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.

The discriminants associated to isotropy representations of symmetric spaces

We consider a generalized discriminant associated to a symmetric space which generalizes the discriminant of real symmetric matrices, and note that it can be written as a sum of squares of real polynomials. A method to estimate the minimum number of squares required to represent the discrimininant is developed and applied in examples.

Symmetric Interior Penalty DG Methods for the Compressible Navier-Stokes Equations I: Method Formulation

In this article we consider the development of discontinuous Galerkin finite element methods for the numerical approximation of the compressible Navier-Stokes equations. For the discretization of the leading order terms, we propose employing the generalization of the symmetric version of the interior penalty method, originally developed for the numerical approximation of linear self-adjoint second-order elliptic partial differential equations. In order to solve the resulting system of nonlinear equations, we exploit a (damped) Newton-GMRES algorithm. Numerical experiments demonstrating the practical performance of the proposed discontinuous Galerkin method with higher-order polynomials are presented.

On polynomials with given Hilbert function and applications

Using Macaulay's correspondence we study the family of Artinian Gorenstein local algebras with fixed symmetric Hilbert function decomposition. As an application we give a new lower bound for the dimension of cactus varieties of the third Veronese embedding. We discuss the case of cubic surfaces, where interesting phenomena occur.

Krylov subspace methods for approximating functions of symmetric positive definite matrices with applications to applied statistics and anomalous diffusion

Matrix function approximation is a current focus of worldwide interest and finds application in a variety of areas of applied mathematics and statistics. In this thesis we focus on the approximation of A^(-α/2)b, where A ∈ ℝ^(n×n) is a large, sparse symmetric positive definite matrix and b ∈ ℝ^n is a vector. In particular, we will focus on matrix function techniques for sampling from Gaussian Markov random fields in applied statistics and the solution of fractional-in-space partial differential equations. Gaussian Markov random fields (GMRFs) are multivariate normal random variables characterised by a sparse precision (inverse covariance) matrix. GMRFs are popular models in computational spatial statistics as the sparse structure can be exploited, typically through the use of the sparse Cholesky decomposition, to construct fast sampling methods. It is well known, however, that for sufficiently large problems, iterative methods for solving linear systems outperform direct methods. Fractional-in-space partial differential equations arise in models of processes undergoing anomalous diffusion. Unfortunately, as the fractional Laplacian is a non-local operator, numerical methods based on the direct discretisation of these equations typically requires the solution of dense linear systems, which is impractical for fine discretisations. In this thesis, novel applications of Krylov subspace approximations to matrix functions for both of these problems are investigated. Matrix functions arise when sampling from a GMRF by noting that the Cholesky decomposition A = LL^T is, essentially, a `square root' of the precision matrix A. Therefore, we can replace the usual sampling method, which forms x = L^(-T)z, with x = A^(-1/2)z, where z is a vector of independent and identically distributed standard normal random variables. Similarly, the matrix transfer technique can be used to build solutions to the fractional Poisson equation of the form ϕn = A^(-α/2)b, where A is the finite difference approximation to the Laplacian. Hence both applications require the approximation of f(A)b, where f(t) = t^(-α/2) and A is sparse. In this thesis we will compare the Lanczos approximation, the shift-and-invert Lanczos approximation, the extended Krylov subspace method, rational approximations and the restarted Lanczos approximation for approximating matrix functions of this form. A number of new and novel results are presented in this thesis. Firstly, we prove the convergence of the matrix transfer technique for the solution of the fractional Poisson equation and we give conditions by which the finite difference discretisation can be replaced by other methods for discretising the Laplacian. We then investigate a number of methods for approximating matrix functions of the form A^(-α/2)b and investigate stopping criteria for these methods. In particular, we derive a new method for restarting the Lanczos approximation to f(A)b. We then apply these techniques to the problem of sampling from a GMRF and construct a full suite of methods for sampling conditioned on linear constraints and approximating the likelihood. Finally, we consider the problem of sampling from a generalised Matern random field, which combines our techniques for solving fractional-in-space partial differential equations with our method for sampling from GMRFs.

Design of Mono-symmetric LiteSteel Beam Floor Joists with Web Openings

The new cold-formed LiteSteel beam (LSB) sections have found increasing popularity in residential, industrial and commercial buildings due to their lightweight and cost-effectiveness. They have the beneficial characteristics of including torsionally rigid rectangular flanges combined with economical fabrication processes. Currently there is significant interest in using LSB sections as flexural members in floor joist systems. When used as floor joists, the LSB sections require holes in the web to provide access for inspection and various services. But there are no design methods that provide accurate predictions of the moment capacities of LSBs with web holes. In this study, the buckling and ultimate strength behaviour of LSB flexural members with web holes was investigated in detail by using a detailed parametric study based on finite element analyses with an aim to develop appropriate design rules and recommendations for the safe design of LSB floor joists. Moment capacity curves were obtained using finite element analyses including all the significant behavioural effects affecting their ultimate member capacity. The parametric study produced the required moment capacity curves of LSB section with a range of web hole combinations and spans. A suitable design method for predicting the ultimate moment capacity of LSB with web holes was finally developed. This paper presents the details of this investigation and the results

Zernike radial slope polynomials for wavefront reconstruction and refraction

Ophthalmic wavefront sensors typically measure wavefront slope, from which wavefront phase is reconstructed. We show that ophthalmic prescriptions (in power-vector format) can be obtained directly from slope measurements without wavefront reconstruction. This is achieved by fitting the measurement data with a new set of orthonormal basis functions called Zernike radial slope polynomials. Coefficients of this expansion can be used to specify the ophthalmic power vector using explicit formulas derived by a variety of methods. Zernike coefficients for wavefront error can be recovered from the coefficients of radial slope polynomials, thereby offering an alternative way to perform wavefront reconstruction.