Query Player : a component for Triskel architecture

[ES] Uno de los cinco componentes de la arquitectura triskel,  una base de datos NoSQL que trata de dar solución al problema de Big data de la web semántica, el  gran número de identificadores de recursos que se necesitarían debido al creciente número de sitios web, concretamente el motor de gestión de ejecución de patrones basados en tripletas y en la tecnología RDF. Se encarga de recoger la petición de consulta por parte del intérprete, analizar los patrones que intervienen en la consulta en busca de dependencias explotables entre ellos, y así poder realizar la consulta con mayor rapidez además de ir resolviendo los diferentes patrones contra el almacenamiento, un TripleStore, y devolver el resultado de la petición en una tabla.

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 …

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…