Normalized Frobenius condition number of the orthogonal projections of the identity

[EN]This paper deals with the orthogonal projection (in the Frobenius sense) AN of the identity matrix I onto the matrix subspace AS (A ? Rn×n, S being an arbitrary subspace of Rn×n). Lower and upper bounds on the normalized Frobenius condition number of matrix AN are given. Furthermore, for every matrix subspace S ? Rn×n, a new index bF (A, S), which generalizes the normalized Frobenius condition number of matrix A, is defined and analyzed...

Improving approximate inverses based on Frobenius norm minimization

[EN]Approximate inverses, based on Frobenius norm minimization, of real nonsingular matrices are analyzed from a purely theoretical point of view. In this context, this paper provides several sufficient conditions, that assure us the possibility of improving (in the sense of the Frobenius norm) some given approximate inverses. Moreover, the optimal approximate inverses of matrix A ∈ R n×n , among all matrices belonging to certain subspaces of R n×n , are obtained. Particularly, a natural generalization of the classical normal equations of the system Ax = b is given, when searching for approximate inverses N 6= AT such that AN is symmetric and kAN − IkF < AAT − I F …

Un tema de álgebra lineal : sistemas de ecuaciones lineales

Lección introductoria al Álgebra Lineal a nivel de Primer curso de Universidad, poniendo énfasis en los aspectos genéticos. Se prueban varias versiones del teorema de Alternativa de Fredholm (versión "Teorema de Rouché-Fröbenius") para Sistemas lineales.

Prediseño de modelos a escala para el estudio de fenómenos dinámicos de interacción suelo-estructura en aerogeneradores off-shore sobre monopilotes

Máster Universitario en Eficiencia Energética (SIANI)

Fixed point theorems in partially ordered spaces and aplications

[ES]Recientemente, en la Teoría del punto fijo, han aparecido muchos resultados que obtienen condiciones suficientes para la existencia de un punto fijo si trabajamos con aplicaciones en un conjunto dotado de un orden parcial. Generalmente, estos resultados combinan dos teoremas del punto fijo fundamentales: el Teorema de la contracción de Banach y el Teorema de Knaster-Tarski.

A generalization of the Moore-Penrose inverse related to matrix subspaces of C(nxm)

[EN]A natural generalization of the classical Moore-Penrose inverse is presented. The so-called S-Moore-Penrose inverse of a m x n complex matrix A, denoted by As, is defined for any linear subspace S of the matrix vector space Cnxm. The S-Moore-Penrose inverse As is characterized using either the singular value decomposition or (for the nonsingular square case) the orthogonal complements with respect to the Frobenius inner product. These results are applied to the preconditioning of linear systems based on Frobenius norm minimization and to the linearly constrained linear least squares problem.

A generalization of the optimal diagonal approximate inverse preconditioner

[EN ]The classical optimal (in the Frobenius sense) diagonal preconditioner for large sparse linear systems Ax = b is generalized and improved. The new proposed approximate inverse preconditioner N is based on the minimization of the Frobenius norm of the residual matrix AM − I, where M runs over a certain linear subspace of n × n real matrices, defined by a prescribed sparsity pattern. The number of nonzero entries of the n×n preconditioning matrix N is less than or equal to 2n, and n of them are selected as the optimal positions in each of the n columns of matrix N. All theoretical results are justified in detail…