Mathematical modelling in engineering: an alternative way to teach Linear Algebra

Technological advances require that basic science courses for engineering, including Linear Algebra, emphasize the development of mathematical strengths associated with modelling and interpretation of results, which are not limited only to calculus abilities. Based on this consideration, we have proposed a project-based learning, giving a dynamic classroom approach in which students modelled real-world problems and turn gain a deeper knowledge of the Linear Algebra subject. Considering that most students are digital natives, we use the e-portfolio as a tool of communication between students and teachers, besides being a good place making the work visible. In this article, we present an overview of the design and implementation of a project-based learning for a Linear Algebra course taught during the 2014–2015 at the ‘ETSEIB'of Universitat Politècnica de Catalunya (UPC).     

The automorphism group of certain higher degree forms

We consider symmetric indecomposable d-linear (d>2) spaces of dimension n over an algebraically closed field k of characteristic 0, whose center (the analog of the space of symmetric matrices of a bilinear form) is cyclic, as introduced by Reichstein [B. Reichstein, On Waring’s problem for cubic forms, Linear Algebra Appl. 160 (1992) 1-61]. The automorphism group of these spaces is determined through the action on the center and through the determination of the Lie algebra. Furthermore, we relate the Lie algebra to the Witt algebra.     

无扭算子李代数g(G,M)的子代数

由算子构成的李代数在李代数理论中具有重要的应用,因而研究算子李代数及其子代数的代数结构就显得尤为重要.首先构造了无扭算子李代数g(G,M)的子代数L_1,L_2,g1,g2,然后给出了这些子代数的代数结构及一些重要应用.     

A note on k-generalized projections

In this note, we investigate characterizations for k-generalized projections (i.e., A^k = A^*) on Hilbert spaces. The obtained results generalize those for generalized projections on Hilbert spaces in [Hong-Ke Du, Yuan Li, The spectral characterization of generalized projections, Linear Algebra Appl. 400 (2005) 313–318] and those for matrices in [J. Benítez, N. Thome, Characterizations and linear combinations of k-generalized projectors, Linear Algebra Appl. 410 (2005) 150–159].     

Mathematisches Denken in der Linearen Algebra

How can first years students learn to think and act mathematically by learning Linear Algebra? We want to present an approach that considers reflection of mathematical acting and its connections to general thinking to be an important part of learning. By understanding mathematics as a specific conventionalization of general thinking, patterns of general thinking can become the starting point for learning mathematics. This points out the specific contribution that mathematics can give to describe reality. By example of Linear Algebra, we discuss the common ground and differences between thinking in mathematics and in non-mathematical subjects. Based on this discussion, we analyse why and how these reflections can be objects of learning.     

对一道例题的纠错

针对某线性代数教材中的一道例题,即求4个平面相交于一点的充分必要条件,分析并反例说明原解法存在错误之处,给出该例题的正确结果,并进一步将其推广到n个平面的情形.     

G2型2-Toroidal李代数的顶点表示

在[4]和[5]中已经研究了sim p ly-laced型T oro idal李代数的顶点表示,[6]文据此给出了Bl型T oro idal李代数顶点表示的构造.受[6]文启发,本文给出了G2型T oro idal李代数的顶点表示的构造,这种构造方式与D(41)的D ynk in图的顶点粘合和一个2上循环有着紧密联系.     

L-structured quaternion matrices and quaternion linear matrix equations

This paper focuses on L-structured quaternion matrices. L-structured real matrices, conditions for the existence of solutions and the general solution of linear matrix equations were studied in the paper [Magnus JR. L-structured matrices and linear matrix equations, Linear Multilinear Algebra 1983;14:67–88]. In this paper, we present a theoretical study extending L-structured real matrices to L-structured quaternion matrices, and introduce some L-structured quaternion matrices. Based on them, we then discuss their applications in quaternion matrix equations.     

On diagonal-Schur complements of block diagonally dominant matrices

It is known that the diagonal-Schur complements of strictly diagonally dominant matrices are strictly diagonally dominant matrices [J.Z. Liu, Y.Q. Huang, Some properties on Schur complements of H-matrices and diagonally dominant matrices, Linear Algebra Appl. 389 (2004) 365-380], and the same is true for nonsingular H-matrices [J.Z. Liu, J.C. Li, Z.T. Huang, X. Kong, Some properties of Schur complements and diagonal-Schur complements of diagonally dominant matrices, Linear Algebra Appl. 428 (2008) 1009-1030]. In this paper, we research the properties on diagonal-Schur complements of block diagonally dominant matrices and prove that the diagonal-Schur complements of block strictly diagonally dominant matrices are block strictly diagonally dominant matrices, and the same holds for generalized block strictly diagonally dominant matrices.     

Bounds on the kth multi-g base index of nearly reducible sign pattern matrices

Li et al. [On the period and base of a sign pattern matrix, Linear Algebra Appl. 212/213 (1994) 101-120.] extended the concepts of the base and period from nonnegative matrices to powerful sign pattern matrices. Then, Shao and You [Bound on the basis of irreducible generalized sign pattern matrices, Linear Algebra Appl. 427 (2007) 285-300.] extended the concepts of the base from powerful sign pattern matrices to non-powerful irreducible sign pattern matrices. In this paper we mainly study the kth multi-g base index for non-powerful primitive nearly reducible sign pattern matrices. We obtain sharp upper bounds, together with a complete characterization of the equality cases of the kth multi-g base index for primitive nearly reducible generalized sign pattern matrices. We also show that there exist “gaps” in the kth multi-g base index set of the classes of such matrices.     

An optimization approach for real time evacuation reroute planning

In this article, we study the properties of some matrix classes using principal pivot transform (PPT). These matrices with some additional conditions have nonnegative principal minors. We show that a subclass of almost fully copositive matrices intorduced in (Linear Algebra Appl 400:243–252 2005) with \(Q_{0}\)-property is captured by sufficient matrices introduced by Cottle et al. in (Linear Algebra Appl 114/115:231–249 1989) and the solution set of a linear complementarity problem is the same as the set of Karush–Kuhn–Tucker stationary points of the corresponding quadratic programming problem. We introduce some more PPT based matrix classes in continuation of (Linear Algebra Appl 400:243–252 2005) and study the properties of these classes.     

一个涉及“高等代数”几乎所有主要内容的习题

分别借助矩阵代数、线性空间、线性变换和λ-矩阵等四套相关理论用五种方法解答"高等代数"课程中的一个典型习题.     

《线性代数》内容的关联性研究

《线性代数》学科知识点关联性强、相互交叉相互引证的情况比较多.清晰把握知识点之间的关系成为有效教学的重要前提.本文通过建构知识点关联层次图,试图理顺知识点关系、把握好内容格局,并结合教学经验提出一种教学时序.     

交换环上一类完备李代数

In this paper, we obtain a new kind of complete Lie algebra over a commutative ring, which is the Lie algebra consisting of all n × n anti-symmetric matrices over a 2-torsionfree commutative ring with identity.     

The numerical range of positive operators on Hilbert lattices

We show symmetry properties of the numerical range of positive operators on Hilbert lattices. These results generalise the respective properties for positive matrices shown in Li et al. (Linear Algebra Appl 350:1–23, 2002) and Maroulas et al. (Linear Algebra Appl 348:49–62, 2002). Similar assertions are also valid for the block numerical range of positive operators.     

经管类高校《线性代数》教学改革的初步探讨

结合教学实践，对经管类高校中《线性代数》中教学方法的改革与探索进行了初步的探讨．     

Minimum rank problems

A graph describes the zero-nonzero pattern of a family of matrices, with the type of graph (undirected or directed, simple or allowing loops) determining what type of matrices (symmetric or not necessarily symmetric, diagonal entries free or constrained) are described by the graph. The minimum rank problem of the graph is to determine the minimum among the ranks of the matrices in this family; the determination of maximum nullity is equivalent. This problem has been solved for simple trees [P.M. Nylen, Minimum-rank matrices with prescribed graph, Linear Algebra Appl. 248 (1996) 303-316, C.R. Johnson, A. Leal Duarte, The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, Linear and Multilinear Algebra 46 (1999) 139-144], trees allowing loops [L.M. DeAlba, T.L. Hardy, I.R. Hentzel, L. Hogben, A. Wangsness. Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns, Linear Algebra Appl. 418 (2006) 389-415], and directed trees allowing loops [F. Barioli, S. Fallat, D. Hershkowitz, H.T. Hall, L. Hogben, H. van der Holst, B. Shader, On the minimum rank of not necessarily symmetric matrices: a preliminary study, Electron. J. Linear Algebra 18 (2000) 126-145]. We survey these results from a unified perspective and solve the minimum rank problem for simple directed trees.     

谈线性代数与空间解析几何的整合

线性代数与空间解析几何的产生、发展,意味着它们是不可分割的两部分,本文分析和论述了线性代数与空间解析几何整合的必要性和可行性.     

Primitive zero-symmetric sign pattern matrices with the maximum base

In [B. Cheng, B. Liu, The base sets of primitive zero-symmetric sign pattern matrices, Linear Algebra Appl. 428 (2008) 715-731], Cheng and Liu studied the bases of primitive zero-symmetric sign pattern matrices. The sharp upper bound of the bases was obtained. In this paper, we characterize the sign pattern matrices with the sharp bound.     

Comment on ‘Preconditioning of matrices partitioned in 2 Œ 2 block form: Eigenvalue estimates and Schwarz DD for mixed FEM’ by Owe Axelsson,Radim Blaheta

In this note, we discuss the inverse representations of regularized saddle point matrices and point out that some conclusions given by Axelsson and Blaheta in [Numerical Linear Algebra with Applications, 2010,17:787–810 ] are not true.Copyright © 2011 John Wiley & Sons, Ltd.