Using linear algebra for protein structural comparison and classification.

In this article, we describe a novel methodology to extract semantic characteristics from protein structures using linear algebra in order to compose structural signature vectors which may be used efficiently to compare and classify protein structures into fold families. These signatures are built from the pattern of hydrophobic intrachain interactions using Singular Value Decomposition (SVD) and Latent Semantic Indexing (LSI) techniques. Considering proteins as documents and contacts as terms, we have built a retrieval system which is able to find conserved contacts in samples of myoglobin fold family and to retrieve these proteins among proteins of varied folds with precision of up to 80%. The classifier is a web tool available at our laboratory website. Users can search for similar chains from a specific PDB, view and compare their contact maps and browse their structures using a JMol plug-in.

PySSM : a Python module for Bayesian inference of linear Gaussian state space models

PySSM is a Python package that has been developed for the analysis of time series using linear Gaussian state space models (SSM). PySSM is easy to use; models can be set up quickly and efficiently and a variety of different settings are available to the user. It also takes advantage of scientific libraries Numpy and Scipy and other high level features of the Python language. PySSM is also used as a platform for interfacing between optimised and parallelised Fortran routines. These Fortran routines heavily utilise Basic Linear Algebra (BLAS) and Linear Algebra Package (LAPACK) functions for maximum performance. PySSM contains classes for filtering, classical smoothing as well as simulation smoothing.

Variable Elimination in Linear Constraints

Gauss and Fourier have together provided us with the essential techniques for symbolic computation with linear arithmetic constraints over the reals and the rationals. These variable elimination techniques for linear constraints have particular significance in the context of constraint logic programming languages that have been developed in recent years. Variable elimination in linear equations (Guassian Elimination) is a fundamental technique in computational linear algebra and is therefore quite familiar to most of us. Elimination in linear inequalities (Fourier Elimination), on the other hand, is intimately related to polyhedral theory and aspects of linear programming that are not quite as familiar. In addition, the high complexity of elimination in inequalities has forces the consideration of intricate specializations of Fourier's original method. The intent of this survey article is to acquaint the reader with these connections and developments. The latter part of the article dwells on the thesis that variable elimination in linear constraints over the reals extends quite naturally to constraints in certain discrete domains.

Algebra Llinol - Cyflwyniad

Cyfieithiad yw'r llyfr hwn o Linear Algebra - An Introduction a ymddangosodd gyntaf yn 1978 ac a gyhoeddwyd gan y cwmni Van Nostrand Reinhold. Cafwyd Ail Argraffiad yn 1982 a dros y blynyddoedd bu nifer o ail brintiadau. Yn y cyfamser cyfieithwyd y llyfr i'r Groeg a Thwrceg. Er i'r llyfr gael ei ddefnyddio dros y blynyddoedd gan nifer o fyfyrwyr yn Aberystwyth a oedd yn cyflwyno eu gwaith yn Gymraeg, nid oedd ar gael yn y Gymraeg. Dyma, o'r diwedd, ymgais i wneud rhyw fath o iawn am hynny. Er bod y llyfr wedi bod allan o brint yn y Saesneg ers rhai blynyddoedd yn awr, mae'n amlwg ei fod yn dal i gael ei gymeradwyo mewn nifer o brifysgolion. Felly, y gobaith yw y bydd o ddefnydd. Efallai mai'r peth nesaf bydd ei gyfiethu'n ?l i'r Saesneg! Mae nifer o newidiadau yn y fersiwn hwn. Mae'n siwr bod nifer o gamgymeriadau ac efallai gwelliannau posibl i'r cyfieithu - byddwn yn ddiolchgar dderbyn unrhyw awgrymiadau. Gellir eu cyflwyno hefyd drwy Dr Gwion Evans o'r Adran Fathemateg, Prifysgol Aberystwyth.

Spectral Analysis of Bounded Self-adjoint operators - A Linear Algebraic Approach

This thesis Entitled Spectral theory of bounded self-adjoint operators -A linear algebraic approach.The main results of the thesis can be classified as three different approaches to the spectral approximation problems. The truncation method and its perturbed versions are part of the classical linear algebraic approach to the subject. The usage of block Toeplitz-Laurent operators and the matrix valued symbols is considered as a particular example where the linear algebraic techniques are effective in simplifying problems in inverse spectral theory. The abstract approach to the spectral approximation problems via pre-conditioners and Korovkin-type theorems is an attempt to make the computations involved, well conditioned. However, in all these approaches, linear algebra comes as the central object. The objective of this study is to discuss the linear algebraic techniques in the spectral theory of bounded self-adjoint operators on a separable Hilbert space. The usage of truncation method in approximating the bounds of essential spectrum and the discrete spectral values outside these bounds is well known. The spectral gap prediction and related results was proved in the second chapter. The discrete versions of Borg-type theorems, proved in the third chapter, partly overlap with some known results in operator theory. The pure linear algebraic approach is the main novelty of the results proved here.

Modal coupling in linear control systems using robust eigenstructure assignment

Eigenvalue assignment methods are used widely in the design of control and state-estimation systems. The corresponding eigenvectors can be selected to ensure robustness. For specific applications, eigenstructure assignment can also be applied to achieve more general performance criteria. In this paper a new output feedback design approach using robust eigenstructure assignment to achieve prescribed mode input and output coupling is described. A minimisation technique is developed to improve both the mode coupling and the robustness of the system, whilst allowing the precision of the eigenvalue placement to be relaxed. An application to the design of an automatic flight control system is demonstrated.

On the solution of the extended linear complementarity problem

The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasarian and Pang. In the present research, minimization problems with simple bounds associated to this problem are defined. When the XLCP is solvable, their solutions are global minimizers of the associated problems. Sufficient conditions that guarantee that stationary points of the associated problems are solutions of the XLCP will be proved. These theoretical results support the conjecture that local methods for box constrained optimization applied to the associated problems could be efficient tools for solving the XLCP. (C) 1998 Elsevier B.V. All rights reserved.

On non-linear W-infinity symmetry of generalized Liouville and conformal Toda models

Invariance under non-linear Ŵ∞ algebra is shown for the two-boson Liouville type of model and its algebraic generalizations, the extended conformal Toda models. The realization of the corresponding generators in terms of two boson currents within KP hierarchy is presented.

Sobre a produção de significados para a noção de transformação linear em álgebra linear

Pós-graduação em Educação Matemática - IGCE

Alguns aspectos problemáticos relacionados ao ensino-aprendizagem da álgebra linear

Este trabalho aborda alguns aspectos que considero como possíveis dificuldades ao ensino-aprendizagem da disciplina Álgebra Linear. Trata-se de uma disciplina de grande importância para muitos cursos de graduação da universidade e considero que qualquer estudo que objetive melhorar este ensino é importante. Contém diversas considerações sobre dificuldades que os alunos podem enfrentar no estudo da disciplina, como aquelas relacionadas ao conhecimento que já trazem do curso médio que tanto podem ser usados como auxilio como também podem causar dificuldades de entendimento dos conceitos mais gerais da disciplina, dificuldades com o uso da geometria, dificuldades com termos conhecidos de outras disciplinas, dificuldades lógicas e outras dificuldades.

Aplicações de ágebra linear aos códigos corretos de erros e ao ensino médio

Pós-graduação em Matemática em Rede Nacional - IBILCE

O papel das tecnologias digitais em disciplinas de álgebra linear a distância: possibilidades, limites e desafios

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Linear instability of orthogonal compressible leading-edge boundary layer flow

Instability analysis of compressible orthogonal swept leading-edge boundary layer flow was performed in the context of BiGlobal linear theory. 1, 2 An algorithm was developed exploiting the sparsity characteristics of the matrix discretizing the PDE-based eigenvalue problem. This allowed use of the MUMPS sparse linear algebra package 3 to obtain a direct solution of the linear systems associated with the Arnoldi iteration. The developed algorithm was then applied to efficiently analyze the effect of compressibility on the stability of the swept leading-edge boundary layer and obtain neutral curves of this flow as a function of the Mach number in the range 0 ≤ Ma ≤ 1. The present numerical results fully confirmed the asymptotic theory results of Theofilis et al. 4 Up to the maximum Mach number value studied, it was found that an increase of this parameter reduces the critical Reynolds number and the range of the unstable spanwise wavenumbers.