Uniform algebra isomorphisms and peripheral multiplicativity

Let be a surjective operator between two uniform algebras with . We show that if satisfies the peripheral multiplicativity condition for all , where is the peripheral spectrum of , then is an isometric algebra isomorphism from onto . One of the consequences of this result is that any surjective, unital, and multiplicative operator that preserves the peripheral ranges of algebra elements is an isometric algebra isomorphism. We describe also the structure of general, not necessarily unital, surjective and peripherally multiplicative operators between uniform algebras.

     

New Optimal Self-Dual Codes over GF(7)

In this paper, double circulant self-dual codes over GF(7) are presented, including [12,6,6] codes which are new optimal codes. It is shown that the supports of the codewords of weights 9, 10 and 11 in double circulant [20,10,9] codes form 3-designs. For larger lengths, some good self-dual codes are constructed from weighing matrices. Received: June 24, 1996 / Revised: February 28, 1997     

Some considerations for high‐order ‘incremental remap’‐based transport schemes: edges,reconstructions, and area integration

The problem of two‐dimensional tracer advection on the sphere is extremely important in modeling of geophysical fluids and has been tackled using a variety of approaches. A class of popular approaches for tracer advection include ‘incremental remap’ or cell‐integrated semi‐Lagrangian‐type schemes. These schemes achieve high‐order accuracy without the need for multistage integration in time, are capable of large time steps, and tend to be more efficient than other high‐order transport schemes when applied to a large number of tracers over a single velocity field. In this paper, the simplified flux‐form implementation of the Conservative Semi‐LAgrangian Multi‐tracer scheme (CSLAM) is reformulated using quadratic curves to approximate the upstream flux volumes and Gaussian quadrature for integrating the edge flux. The high‐order treatment of edge fluxes is motivated because of poor accuracy of the CSLAM scheme in the presence of strong nonlinear shear, such as one might observe in the midlatitudes near an atmospheric jet. Without the quadratic treatment of upstream edges, we observe at most second‐order accuracy under convergence of grid resolution, which is returned to third‐order accuracy under the improved treatment. A shallow‐water barotropic instability also reveals clear evidence of grid imprinting without the quadratic correction. Consequently, these tests reveal a problem that might arise in tracer transport near nonlinearly sheared regions of the real atmosphere, particularly near cubed‐sphere panel edges. Although CSLAM is used as the foundation for this analysis, the conclusions of this paper are applicable to the general class of incremental remap schemes. Copyright © 2012 John Wiley & Sons, Ltd.     

Microsoft Excel as a supplement in a high school statistics course

This study was conducted in the spring of 2002 at Arlington High School in a Probability and Statistics course for junior and senior level students. Two sections of the class were compared with respect to the use/non-use of EXCEL in the course. The experimental group (the one using EXCEL) outperformed the control group on five of the six teacher-created unit tests and on both of the criterion referenced assessments used by the district; however, the differences were not statistically significant at the 0.05 level. Furthermore, the experimental group expressed very positive feelings towards the use of the software in a survey administered at the conclusion of the course.     

A note on conjugate gradient convergence – Part III

Summary. In this paper we again consider the rate of convergence of the conjugate gradient method. We start with a general analysis of the conjugate gradient method for uniformly bounded solutions vectors and matrices whose eigenvalues are uniformly bounded and positive. We show that in such cases a fixed finite number of iterations of the method gives some fixed amount of improvement as the the size of the matrix tends to infinity. Then we specialize to the finite element (or finite difference) scheme for the problem . We show that for some classes of function we see this same effect. For other functions we show that the gain made by performing a fixed number of iterations of the method tends to zero as the size of the matrix tends to infinity. Received July 9, 1998 / Published online March 16, 2000     

A Penalized Likelihood Method for Classification With Matrix-Valued Predictors

We propose a penalized likelihood method to fit the linear discriminant analysis model when the predictor is matrix valued. We simultaneously estimate the means and the precision matrix, which we assume has a Kronecker product decomposition. Our penalties encourage pairs of response category mean matrix estimators to have equal entries and also encourage zeros in the precision matrix estimator. To compute our estimators, we use a blockwise coordinate descent algorithm. To update the optimization variables corresponding to response category mean matrices, we use an alternating minimization algorithm that takes advantage of the Kronecker structure of the precision matrix. We show that our method can outperform relevant competitors in classification, even when our modeling assumptions are violated. We analyze three real datasets to demonstrate our method’s applicability. Supplementary materials, including an R package implementing our method, are available online.     

Optimal Ternary Linear Rate 1/2 Codes

In this paper, we classify all optimal linear[n, n/2] codes up to length 12. We show that thereis a unique optimal [10, 5, 5] code up to equivalence.     

A parallel computational method for simulating two‐phase gel dynamics on a staggered grid

We develop a parallel computational algorithm for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of transport equations for the two phases, two coupled momentum equations, and a volume‐averaged incompressibility constraint. Multigrid with Vanka‐type box‐relaxation scheme is used as preconditioner for the Krylov subspace solver (GMRES) to solve the momentum and incompressibility equations. Through numerical experiments of a model problem, the efficiency, robustness and scalability of the algorithm are illustrated. Copyright © 2008 John Wiley & Sons, Ltd.