On rank, underdetermined systems and consistency

The concepts of rank, underdetermined systems and consistency in linear algebra are discussed in the context of a puzzle. The article begins with a specific example, moving on to a generalization of the example and then to the general n x n case. As well as providing a solution of the puzzle, the article aims to provide students with a greater understanding of these abstract ideas in linear algebra through the study of the puzzle.

On the stability radius of a generalized state-space system

The concept of “distance to instability” of a system matrix is generalized to system pencils which arise in descriptor (semistate) systems. Difficulties arise in the case of singular systems, because the pencil can be made unstable by an infinitesimal perturbation. It is necessary to measure the distance subject to restricted, or structured, perturbations. In this paper a suitable measure for the stability radius of a generalized state-space system is defined, and a computable expression for the distance to instability is derived for regular pencils of index less than or equal to one. For systems which are strongly controllable it is shown that this measure is related to the sensitivity of the poles of the system over all feedback matrices assigning the poles.

Regularization of time-varying descriptor systems by the asvd

We study linear variable coefficient control problems in descriptor form. Based on a behaviour approach and the general theory for linear differential algebraic systems we give the theoretical analysis and describe numerically stable methods to determine the structural properties of the system.

Spectra of a class of non-self-adjoint matrices

We consider a new class of non-self-adjoint matrices that arise from an indefinite self- adjoint linear pencil of matrices, and obtain the spectral asymptotics of the spectra as the size of the matrices diverges to infinity. We prove that the spectrum is qualitatively different when a certain parameter c equals 0, and when it is non-zero, and that certain features of the spectrum depend on Diophantine properties of c.

An optimization problem concerning multiplicative functions

In this paper we study the problem of maximizing a quadratic form 〈Ax,x〉 subject to ‖x‖q=1, where A has matrix entries View the MathML source with i,j|k and q≥1. We investigate when the optimum is achieved at a ‘multiplicative’ point; i.e. where x1xmn=xmxn. This turns out to depend on both f and q, with a marked difference appearing as q varies between 1 and 2. We prove some partial results and conjecture that for f multiplicative such that 0

Zero attracting recursive least squares algorithms

The l1-norm sparsity constraint is a widely used technique for constructing sparse models. In this contribution, two zero-attracting recursive least squares algorithms, referred to as ZA-RLS-I and ZA-RLS-II, are derived by employing the l1-norm of parameter vector constraint to facilitate the model sparsity. In order to achieve a closed-form solution, the l1-norm of the parameter vector is approximated by an adaptively weighted l2-norm, in which the weighting factors are set as the inversion of the associated l1-norm of parameter estimates that are readily available in the adaptive learning environment. ZA-RLS-II is computationally more efficient than ZA-RLS-I by exploiting the known results from linear algebra as well as the sparsity of the system. The proposed algorithms are proven to converge, and adaptive sparse channel estimation is used to demonstrate the effectiveness of the proposed approach.

Numerical modelling of two-way propagation of non-linear dispersive waves

We describe and implement a fully discrete spectral method for the numerical solution of a class of non-linear, dispersive systems of Boussinesq type, modelling two-way propagation of long water waves of small amplitude in a channel. For three particular systems, we investigate properties of the numerically computed solutions; in particular we study the generation and interaction of approximate solitary waves.

Consistent Dirichlet Boundary Conditions for Numerical Solution of Moving Boundary Problems

We consider the imposition of Dirichlet boundary conditions in the finite element modelling of moving boundary problems in one and two dimensions for which the total mass is prescribed. A modification of the standard linear finite element test space allows the boundary conditions to be imposed strongly whilst simultaneously conserving a discrete mass. The validity of the technique is assessed for a specific moving mesh finite element method, although the approach is more general. Numerical comparisons are carried out for mass-conserving solutions of the porous medium equation with Dirichlet boundary conditions and for a moving boundary problem with a source term and time-varying mass.