Preconditioning spectral element schemes for definite and indefinite problems

Spectral element schemes for the solution of elliptic boundary value problems are considered. Preconditioning methods based on finite difference and finite element schemes are implemented. Numerical experiments show that inverting the preconditioner by a single multigrid iteration is most efficient and that the finite difference preconditioner is superior to the finite element one for both definite and indefinite problems. A multigrid preconditioner is also derived from the finite difference preconditioner and is found suitable for the CGS acceleration method. It is pointed out that, for the finite difference and finite element preconditioners, CGS does not always converge to the accurate algebraic solution. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 535–543, 1999     

The isomorphism problem for some universal operator algebras

This paper addresses the isomorphism problem for the universal (non-self-adjoint) operator algebras generated by a row contraction subject to homogeneous polynomial relations. We find that two such algebras are isometrically isomorphic if and only if the defining polynomial relations are the same up to a unitary change of variables, and that this happens if and only if the associated subproduct systems are isomorphic. The proof makes use of the complex analytic structure of the character space, together with some recent results on subproduct systems. Restricting attention to commutative operator algebras defined by a radical ideal of relations yields strong resemblances with classical algebraic geometry. These commutative operator algebras turn out to be algebras of analytic functions on algebraic varieties. We prove a projective Nullstellensatz connecting closed ideals and their zero sets. Under some technical assumptions, we find that two such algebras are isomorphic as algebras if and only if they are similar, and we obtain a clear geometrical picture of when this happens. This result is obtained with tools from algebraic geometry, reproducing kernel Hilbert spaces, and some new complex-geometric rigidity results of independent interest. The C^?-envelopes of these algebras are also determined. The Banach-algebraic and the algebraic classification results are shown to hold for the wot-closures of these algebras as well.     

An Analysis of a Dynamic Project Cost Problem

This paper presents a stochastic allocation model for a sequential financial problem involving the allocation of funds to uncertain future payments. It is shown that under certain conditions the optimal allocation policies are piece-wise linear with the budget available, and that there exists an intimate relationship between these policies and the myopic policies obtained from the solution of a sequence of single-payment problems. A numerical example is provided and, finally, certain technical and methodological issues associated with a chance constraint version of the problem are discussed.     

On parallel asynchronous high-order solutions of parabolic PDEs

In achieving significant speed-up on parallel machines, a major obstacle is the overhead associated with synchronizing the concurrent processes. This paper presents high-orderparallel asynchronous schemes, which are schemes that are specifically designed to minimize the associated synchronization overhead of a parallel machine in solving parabolic PDEs. They are asynchronous in the sense that each processor is allowed to advance at its own speed. Thus, these schemes are suitable for single (or multi) user shared memory or (message passing) MIMD multiprocessors. Our approach is demonstrated for the solution of the multidimensional heat equation, of which we present a spatial second-order Parametric Asynchronous Finite-Difference (PAFD) scheme. The well-known synchronous schemes are obtained as its special cases. This is a generalization and expansion of the results in [5] and [7]. The consistency, stability and convergence of this scheme are investigated in detail. Numerical tests show that although PAFD provides the desired order of accuracy, its efficiency is inadequate when performed on each grid point.In an alternative approach that uses domain decomposition, the problem domain is divided among the processors. Each processor computes its subdomain mostly independently, while the PAFD scheme provides the solutions at the subdomains' boundaries. We use high-order finite-difference implicit scheme within each subdomain and determine the values at subdomains' boundaries by the PAFD scheme. Moreover, in order to allow larger time-step, we use remote neighbors' values rather than those of the immediate neighbors. Numerical tests show that this approach provides high efficiency and in the case which uses remote neighbors' values an almost linear speedup is achieved. Schemes similar to the PAFD can be developed for other types of equations [3].This research was supported by the fund for promotion of research at the Technion.     

The numerical radius and specttural matrices

In this paper we investigate spectral matrices, i.e., matrices with equal spectral and numerical radii. Various characterizations and properties of these matrices are given.     

Bessel identities in the waldspurger correspondence over the real numbers

We prove certain identities between Bessel functions attached to irreducible unitary representations ofPGL ₂(R) and Bessel functions attached to irreducible unitary representations of the double cover ofSL ₂(R). These identities give a correspondence between such representations which turns out to be the Waldspurger correspondence. In the process we prove several regularity theorems for Bessel distributions which appear in the relative trace formula. In the heart of the proof lies a classical result of Weber and Hardy on a Fourier transform of classical Bessel functions. This paper constitutes the local (real) spectral theory of the relative trace formula for the Waldspurger correspondence for which the global part was developed by Jacquet. Research of first author was partially supported by NSF grant DMS-0070762. Research of second author was partially supported by NSF grant DMS-9729992 and DMS 9971003.     

Policies for biodefense revisited: The prioritized vaccination process for smallpox

Handling bioterror events that involve contagious agents is a major concern for authorities and a cause for debate among policymakers about the best response policy. At the core of this debate stands the question which of the two post-event policies to adopt: mass vaccination or trace (also called ring or targeted) vaccination. We present a new dynamic epidemic-intervention model that captures key features of the situation and generalizes some previous assumptions regarding the probability distributions of inter-temporal parameters. It is shown that a mixture of mass and trace vaccination policies—the prioritized vaccination policy—is more effective than either of the two aforementioned policies.