Wavelet sparse approximate inverse preconditioners

We show how to use wavelet compression ideas to improve the performance of approximate inverse preconditioners. Our main idea is to first transform the inverse of the coefficient matrix into a wavelet basis, before applying standard approximate inverse techniques. In this process, smoothness in the entries ofA ⁻¹ are converted into small wavelet coefficients, thus allowing a more efficient approximate inverse approximation. We shall justify theoretically and numerically that our approach is effective for matrices with smooth inverses. Supported by grants from ONR: ONR-N00014-92-J-1890, and the Army Research Office: DAAL-03-91-C-0047 (Univ. of Tenn. subcontract ORA4466.04 Amendment 1 and 2). The first and the third author also acknowledge support from RIACS/NASA Ames NAS 2-96027 and the Alfred P. Sloan Foundation as Doctoral Dissertation Fellows, respectively. the work was supported by the Natural Sciences and Engineering Research Council of Canada, the Information Technology Research Centre (which is funded by the Province of Ontario), and RIACS/NASA Ames NAS 2-96027.     

A cone programming approach to the bilinear matrix inequality problem and its geometry

We discuss an approach for solving the Bilinear Matrix Inequality (BMI) based on its connections with certain problems defined over matrix cones. These problems are, among others, the cone generalization of the linear programming (LP) and the linear complementarity problem (LCP) (referred to as the Cone-LP and the Cone-LCP, respectively). Specifically, we show that solving a given BMI is equivalent to examining the solution set of a suitably constructed Cone-LP or Cone-LCP. This approach facilitates our understanding of the geometry of the BMI and opens up new avenues for the development of the computational procedures for its solution. Research supported in part by the National Science Foundation under Grant CCR-9222734.     

A Lower Bound for Congruence Representations

G. Grätzer, H. Lakser, and E. T. Schmidt proved that every finite distributive lattice D with n join-irreducible elements can be represented as the congruence lattice of a lattice L with O(n2) elements. G. Grätzer, I. Rival, and N. Zaguia gave kn, < 2, as a lower bound for the size of such a lattice L; a sharper form, 1/64(n/log2n)2, of this result was given by Y. Zhang.In this note, we apply a recent result of R. Freese, to obtain 1/16 n2/log2n as a lower bound. We also give a direct proof of Freese's result.     

Spectral Analysis for HSS Preconditioners

In this paper,we are interested in HSS preconditioners for saddle point lin- ear systems with a nonzero(2,2)-th block.We study an approximation of the spectra of HSS preconditioned matrices and use these results to illustrate and explain the spectra obtained from numerical examples,where the previous spectral analysis of HSS precon- ditioned matrices does not cover.     

Arrangement Increasing Resource Allocation

Consider a system composed of several units. The performance of each unit can be affected by providing a portion of a limited amount of costly resources available. An allocation of resources to a unit results in a unit’s response that depends on the level of resources allocated to it and some of its random parameters. In this paper we consider cases where each unit has one or two random parameters. The overall performance of the system is mapped by a function on the vector of responses generated by all the units in the system. Our interest is in identifying the conditions on the response function of the units, the system performance function and the random parameters under which the random system performance as a function of the resource allocation has stochastic arrangement increasing property. This allows one to substantially reduce the number of allocation that needs to be searched to identify an optimal allocation that maximizes the expected utility derived from the system response as a result of the resource allocation.     

Resale price maintenance in supply chains with general multiplicative demand

We analyze a supply chain with a Resale Price Maintenance (RPM) contract in which the manufacturer sets the retail price with a general multiplicative price–demand function and prove the existence/uniqueness of an equilibrium. We also compare the equilibrium prices and quantities, consumer surplus and total system welfare for the RPM and wholesale price contracts. We conclude that a manufacturer may capture a smaller share of the total supply chain profit despite her ability to set the retail price.     

Group Theory,Computational Thinking,and Young Mathematicians

In this article, we investigate the artistic puzzle of designing mathematics experiences (MEs) to engage young children with ideas of group theory, using a combination of hands-on and computational thinking (CT) tools. We elaborate on: (1) group theory and why we chose it as a context for young mathematicians’ experiences with symmetry and transformations; (2) our ME design principles of agency, access, surprise and audience; (3) the affordances of CT that complement our design principles; and (4) three ME variations we tested in grades 3–6 classrooms. We then reflect on the ME variations based on our design principles and the affordances of CT, and consider how the MEs may be further adapted and improved.     

Some Methods of Computing First Extensions Between Modules of Graded Hecke Algebras

In this paper, we establish connections between the first extensions of simple modules and certain filtrations of of standard modules in the setting of graded Hecke algebras. The filtrations involved are radical filtrations and Jantzen filtrations. Our approach involves the use of information from the Langlands classification as well as some deeper understanding on some structure of some modules. Such module arises from the image of a Knapp-Stein type intertwining operator and is a quotient of a generalized standard module. As an application, we compute the Ext-groups for irreducible modules in a block for the graded Hecke algebra of type C ₃, assuming the truth of a version of Jantzen conjecture.