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.

Linear Sparse Differential Resultant Formulas

Let P be a system of n linear nonhomogeneous ordinary differential polynomials in a set U of n-1 differential indeterminates. Differential resultant formulas are presented to eliminate the differential indeterminates in U from P. These formulas are determinants of coefficient matrices of appropriate sets of derivatives of the differential polynomials in P, or in a linear perturbation Pe of P. In particular, the formula dfres(P) is the determinant of a matrix M(P) having no zero columns if the system P is ``super essential". As an application, if the system PP is sparse generic, such formulas can be used to compute the differential resultant dres(PP) introduced by Li, Gao and Yuan.

Voronoi cells via linear inequality systems

The theory and methods of linear algebra are a useful alternative to those of convex geometry in the framework of Voronoi cells and diagrams, which constitute basic tools of computational geometry. As shown by Voigt and Weis in 2010, the Voronoi cells of a given set of sites T, which provide a tesselation of the space called Voronoi diagram when T is finite, are solution sets of linear inequality systems indexed by T. This paper exploits systematically this fact in order to obtain geometrical information on Voronoi cells from sets associated with T (convex and conical hulls, tangent cones and the characteristic cones of their linear representations). The particular cases of T being a curve, a closed convex set and a discrete set are analyzed in detail. We also include conclusions on Voronoi diagrams of arbitrary sets.

Prontidão de alunos do ensino superior para a aprendizagem de álgebra linear

Neste artigo estuda-se a prontidão de alunos do ensino superior para a aprendizagem de álgebra linear, salientando a natureza teórica desta área de conhecimento. Participaram no estudo alunos do ensino superior, de uma turma do 1.º ano, de um Instituto Politécnico do norte de Portugal. Os alunos responderam a um teste diagnóstico, cujas questões incorporavam conteúdos lecionados durante os anos escolares anteriores à entrada no ensino superior, considerados como pré-requisito para a aprendizagem de álgebra linear numa vertente mais teórica. Dos resultados do estudo, destacam-se as grandes dificuldades dos alunos em todos os conteúdos avaliados, verificando-se que mais de metade apresentou respostas incorretas ou não respondeu às questões colocadas, donde se conclui que os alunos não apresentam um grau de prontidão adequado para aprendizagem de álgebra linear.

Lectures in abstract algebra.

v. 1. Basic concepts.--v. 2. Linear algebra.--v. 3. Theory of fields and Galois theory.

Energy consumption of parallel algorithms for solving linear systems on HPC architecture

Modern High-Performance Computing HPC systems are gradually increasing in size and complexity due to the correspondent demand of larger simulations requiring more complicated tasks and higher accuracy. However, as side effects of the Dennard’s scaling approaching its ultimate power limit, the efficiency of software plays also an important role in increasing the overall performance of a computation. Tools to measure application performance in these increasingly complex environments provide insights into the intricate ways in which software and hardware interact. The monitoring of the power consumption in order to save energy is possible through processors interfaces like Intel Running Average Power Limit RAPL. Given the low level of these interfaces, they are often paired with an application-level tool like Performance Application Programming Interface PAPI. Since several problems in many heterogeneous fields can be represented as a complex linear system, an optimized and scalable linear system solver algorithm can decrease significantly the time spent to compute its resolution. One of the most widely used algorithms deployed for the resolution of large simulation is the Gaussian Elimination, which has its most popular implementation for HPC systems in the Scalable Linear Algebra PACKage ScaLAPACK library. However, another relevant algorithm, which is increasing in popularity in the academic field, is the Inhibition Method. This thesis compares the energy consumption of the Inhibition Method and Gaussian Elimination from ScaLAPACK to profile their execution during the resolution of linear systems above the HPC architecture offered by CINECA. Moreover, it also collates the energy and power values for different ranks, nodes, and sockets configurations. The monitoring tools employed to track the energy consumption of these algorithms are PAPI and RAPL, that will be integrated with the parallel execution of the algorithms managed with the Message Passing Interface MPI.

Extended GCD and Hermite normal form algorithms via lattice basis reduction

Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x(1), ..., x(m) for the equation s = gcd (s(1), ..., s(m)) = x(1)s(1) + ... + x(m)s(m), where s1, ... , s(m) are given integers. The method generalises to produce small unimodular transformation matrices for computing the Hermite normal form of an integer matrix.

Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.