CAS-supported multiple representations in elementary linear algebra

Usually the Gaussian algorithm (GA) is presented at school as a method of solving a given system of linear equations by reducing it to a “triangular form”. In contrast to this technically oriented view, I will demonstrate a CAS-supported learning environment which includes a visual representation of GA and an activity-oriented «Gauss-game». This game stresses the concept of elementary matrices and leads directly to a partial, implementation of GA in the form of a «semi-automatic” functional CAS-program. These multiple representation of GA tries to take into consideration the research results on mental representations, to design rich variations of student activities and thereby to lead leading to webbeb concepts around GA. The CAS MuPAD is used.     

Ranks of Solutions of the Matrix Equation AXB = C

The purpose of this article is to solve two problems related to solutions of a consistent complex matrix equation AXB = C : (I) the maximal and minimal ranks of solution to AXB = C , and (II) the maximal and minimal ranks of two real matrices X₀ and X₁ in solution X = X₀ + iX₁ to AXB = C . As applications, the maximal and minimal ranks of two real matrices C and D in generalized inverse (A + iB)^- = C + iD of a complex matrix A + iB are also examined.     

Fixed point of multivalued mapping in uniform spaces

In this paper we prove some new fixed point theorems for multivalued mappings on orbitally complete uniform spaces.     

Upper and lower bounds for the fixed spectrum frequency assignment problem

A survey of the results described in the authors PhD thesis (Montemanni 2001) is presented. The thesis, which was supervised by Prof. Derek H. Smith and Dr. Stuart M. Allen, has been defended in January 2002 at the University of Glamorgan (U.K.). The thesis proposes new heuristic algorithms, based on well-known meta-heuristic paradigms, and new lower bounding techniques, based on linear programming, for the fixed spectrum frequency assignment problem.Received: May 2003, Revised: May 2003, AMS classification: 90C27, 90C59,05C90, 90C05Roberto Montemanni: Present address: Istituto Dalle Molle di Studi sullIntelligenza Artificiale (IDSIA), Galleria 2, 6928 Manno-Lugano, Switzerland (e-mail: roberto@idsia.ch)     

Boundary Element Methods for Maxwell Transmission Problems in Lipschitz Domains

Summary. We consider the Maxwell equations in a domain with Lipschitz boundary and the boundary integral operator A occuring in the Calderón projector. We prove an inf-sup condition for A using a Hodge decomposition. We apply this to two types of boundary value problems: the exterior scattering problem by a perfectly conducting body, and the dielectric problem with two different materials in the interior and exterior domain. In both cases we obtain an equivalent boundary equation which has a unique solution. We then consider Galerkin discretizations with Raviart-Thomas spaces. We show that these spaces have discrete Hodge decompositions which are in some sense close to the continuous Hodge decomposition. This property allows us to prove quasioptimal convergence of the resulting boundary element methods. Mathematics Subject Classification (2000):65N30     

One-dimensional non-nearest-neighbor random walks in the presence of traps

A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site.