Skip to main content

SOLUCION ITERATIVA DE SISTEMAS LINEALES Y APLICACIONES

MTM2010-18674

•
Funding agency name Ministerio de Ciencia e Innovación
Funding agency acronym MICINN
Program Programa Nacional de Proyectos de Investigación Fundamental
Subprogram Subprograma de Proyectos de Investigación Fundamental no Orientada
Call Proyectos I+D
Call year 2010
State Plan 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Management unit Subdirección General de Proyectos de Investigación
Beneficiary centre UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 17
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Modelling Social Network Sites with PageRank and Social Competences

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
[EN] In this communication a recent method to classify the users of an SNS into Competitivity groups is recalled. This method is based on the PageRank algorithm. Competitivity groups are sets of nodes that compete among each other to gain PageRank via the personalization vector. Specific features of the SNSs (such as number of friends or activity of the users) can be considered as Social Competences. By means of these Social Competences a node can modify its ranking inside a Competitivity group., This work is supported by Spanish DGI grant MTM2010-18674.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Competitivity graphs analysis and structural comparison of rankings

  • Criado, Regino
  • García, Esther
  • Romance, Miguel
  • Sánchez-García, Victoria E.
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
[EN] A complex networks based method is introduced for comparing different complete rankings of a finite family of elements. The concepts of competitivity graph and evolutive competitivity graph are introduced as the main tools for analyzing an (ordered) family of rankings of a fixed set of elements. It is shown how the structural properties of these competitivity graphs give deep information about the competitiveness of the elements according to the rankings considered. The relationships between competitivity graphs and some other well-known families of graphs, such as permutation graphs, comparability graphs and chordal graphs are also presented. Finally some applications are presented, including the analysis of sports rankings and, more precisely, the study of European soccer leagues., This work was partially supported by Spanish MICINN Funds and FEDER Funds MTM2009-13848, MTM2010-16153 and MTM2010-18674, and Junta de Andalucía Funds FQM-264.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Nonnegative combined matrices

  • Bru García, Rafael
  • Gasso Matoses, María Teresa
  • Gimenez Manglano, María Isabel
  • Santana, Maximo
The combined matrix of a nonsingular real matrix 𝐴 is the Hadamard (entrywise) product 𝐴 ∘ (𝐴−1) 𝑇 . It is well known that row (column) sums of combined matrices are constant and equal to one. Recently, some results on combined matrices of different classes of matrices have been done. In this work, we study some classes of matrices such that their combined matrices are nonnegative and obtain the relation with the sign pattern of 𝐴. In this case the combined matrix is doubly stochastic., The authors would like to thank the referees for their suggestions that have improved the reading of this paper. This research is supported by Spanish DGI (Grant no. MTM2010-18674).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Preconditioned iterative methods for solving linear least squares problems

  • Bru García, Rafael
  • Marín Mateos-Aparicio, José|||0000-0002-7825-2836
  • Mas Marí, José|||0000-0002-2835-974X
  • Tuma, Miroslav
New preconditioning strategies for solving m × n overdetermined large and sparse linear least squares problems using the conjugate gradient for least squares (CGLS) method are described. First, direct preconditioning of the normal equations by the balanced incomplete factorization (BIF) for symmetric and positive definite matrices is studied, and a new breakdown-free strategy is proposed. Preconditioning based on the incomplete LU factors of an n × n submatrix of the system matrix is our second approach. A new way to find this submatrix based on a specific weighted transversal problem is proposed. Numerical experiments demonstrate different algebraic and implementational features of the new approaches and put them into the context of current progress in preconditioning of CGLS. It is shown, in particular, that the robustness demonstrated earlier by the BIF preconditioning strategy transfers into the linear least squares solvers and the use of the weighted transversal helps to improve the LU-based approach., This work was partially supported by Spanish grant MTM 2010-18674 and the project 13-06684S of the Grant agency of the Czech Republic.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Low-rank update of preconditioners for the nonlinear Richard&apos, s equation

  • Bergamaschi, Luca
  • Martínez Calomardo, Ángeles
  • Putti, Mario
  • Bru García, Rafael
  • Mas Marí, José|||0000-0002-2835-974X
Preconditioners for the Conjugate Gradient method are studied to solve the Newton system with symmetric positive definite (SPD) Jacobian. Following the theoretical work in Bergamaschi et al. (2011) [4] we start from a given approximation of the inverse of the initial Jacobian, and we construct a sequence of preconditioners by means of a low rank update, for the linearized systems arising in the Picard Newton solution of the nonlinear discretized Richards equation. Numerical results onto a very large and realistic test case show that the proposed approach is more efficient, in terms of iteration number and CPU time, as compared to computing the preconditioner of choice at every nonlinear iteration., The support of the CARIPARO Foundation (Grant NPDE: Non-linear Partial Differential Equations: models, analysis, and control - theoretic problems), and of the Spanish DGI grant MTM2010-18674 is acknowledged.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On the localization of the personalized PageRank of complex networks

  • García, E
  • Romance, M
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
In this paper new results on personalized PageRank are shown. We consider directed graphs that may contain dangling nodes. The main result presented gives an analytical characterization of all the possible values of the personalized PageRank for any node.We use this result to give a theoretical justification of a recent model that uses the personalized PageRank to classify users of Social Networks Sites. We introduce new concepts concerning competitivity and leadership in complex networks. We also present some theoretical techniques to locate leaders and competitors which are valid for any personalization vector and by using only information related to the adjacency matrix of the graph and the distribution of its dangling nodes. © 2012 Elsevier Inc. All rights reserved., This paper was partially supported by Spanish MICINN Funds and FEDER Funds MTM2009-13848, MTM2010-16153 and MTM2010-18674, Rey Juan Carlos University Funds 13-2010/00075/001 and Junta de Andalucia Funds FQM-264. The authors would like to thank Prof. Regino Criado, who worked in a previous version of this paper, and the referee for their valuable comments and remarks.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On some properties of the Laplacian matrix revealed by the RCM algorithm

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Palomares Chust, Alberto|||0000-0002-4583-467X
In this paper we present some theoretical results about the irreducibility of the Laplacian matrix ordered by the Reverse Cuthill-McKee (RCM) algorithm. We consider undirected graphs with no loops consisting of some connected components. RCM is a well-known scheme for numbering the nodes of a network in such a way that the corresponding adjacency matrix has a narrow bandwidth. Inspired by some properties of the eigenvectors of a Laplacian matrix, we derive some properties based on row sums of a Laplacian matrix that was reordered by the RCM algorithm. One of the theoretical results serves as a basis for writing an easy MATLAB code to detect connected components, by using the function “symrcm” of MATLAB. Some examples illustrate the theoretical results., The research has been supported by Spanish DGI grant MTM2010-18674, Consolider Ingenio CSD2007-00022, PROMETEO 2008/051, OVAMAH TIN2009-13839-C03-01, and PAID-06-11-2084.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Comparing series of rankings with ties by using complex networks: An analysis of the Spanish stock market (IBEX-35 index)

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • Criado, Regino
  • García, Esther Higueras
  • Romance, Miguel
  • Sánchez, Victoria E.
In this paper we extend the concept of Competitivity Graph to compare series of rankings with ties (partial rankings). We extend the usual method used to compute Kendall's coe cient for two partial rankings to the concept of evolutive Kendall's coe cient for a series of partial rankings. The theoretical framework consists of a four-layer multiplex network. Regarding the treatment of ties, our approach allows to de ne a tie between two values when they are close enough, depending on a threshold. We show an application using data from the Spanish Stock Market; we analyse the series of rankings de ned by 25 companies that have contributed to the IBEX-35 return and volatility values over the period 2003 to 2013., This work was partially supported by Spanish MICINN Funds and FEDER Funds MTM2009-13848, MTM2010-16153 and MTM2010-18674, and Junta de Andalucia Funds FQM-264. The authors would like to thank the referees for their valuable comments and remarks.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Some examples of detection of connected components in undirected graphs by using the Laplacian matrix and the RCM algorithm

  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Palomares Chust, Alberto|||0000-0002-4583-467X
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
[EN] In this paper we use the recent method L-RCM, developed by the authors, to detect connected components in undirected graphs. The method uses the ordering RCM as a rst step and the computation of the row sums of the Laplacian matrix as a second step. We make the computations in MATLAB. We show the use of the method in three examples., This work is supported by Spanish DGI grant MTM2010-18674, Consolider Ingenio CSD2007-00022, PROMETEO 2008/051, OVAMAH TIN2009-13839-C03-01, and PAID-06-11-2084.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Convergence of Weighted-average consensus for undirected graphs

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Palomares Chust, Alberto|||0000-0002-4583-467X
[EN] In this note we address the problem of reaching a consensus in an undirected network where the nodes interchange information with their neighbors. Each node is provided with a value X_i and a weight w_i. The specific goal of the consensus is that each node will be aware of the weighted-average consensus value, in a distributed way, that is to say without a central control. We show the applicability of a theoretical result about reaching a consensus following an iterative algorithm., This work is supported by Spanish DGI grant MTM2010-18674, Consolider Ingenio CSD2007-00022, PROMETEO 2008/051, OVAMAH TIN2009-13839-C03-01, and PAID-06-11-2084.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A model to classify users of social networks based on PageRank

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
In this paper, we present a model to classify users of Social Networks. In particular, we focus on Social Network Sites. The model is based on the PageRank algorithm. We use the personalization vector to bias the PageRank to some users. We give an explicit expression of the personalization vector that allows the introduction of some typical features of the users of SNSs. We describe the model as a seven-step process. We illustrate the applicability of the model with two examples. One example is based on real links of a Facebook network. We also indicate how to take into account real actions of Facebook users to implement the model., This work is supported by Spanish DGI grant MTM2010-18674.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Leadership groups on Social Network Sites based on Personalized PageRank

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • Moreno, Francisco
  • González, Andrés
  • Valencia, Andrés
n this paper we present a new framework to identify leaders in a Social Network Site using the Personalized PageRank vector. The methodology is based on the concept of Leadership group recently introduced by one of the authors. We show how to analyze the structure of the Leadership group as a function of a single parameter. Zachary¿s network and a Facebook university network are used to illustrate the applicability of the model., We thank an unknown referee who made some suggestive comments that improved the readability of the paper. This work is supported by Spanish DGI grant MTM2010-18674.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Matrix growth models based on centrality measures: a first analysis

  • Pedroche Sánchez, Francisco
  • Criado, Regino
  • García, Esther
  • Romance, Miguel
[EN] A general growth model of random networks based on centrality measures is introduced. This formalism extends the well-known models of preferential attachment. We propose to set the preferential attachment using a linear function of some centrality measures ranging from local to global scale. The aim is to include spectral measures, such as PageRank and Bonacich, and geodesic measures, such as betweenness and closeness. In this paper we present a first analysis using degree and Personalized PageRank., Supported by Spanish DGI grant MTM2010-18674 Supported by Spanish DGI grant MTM2009-13848
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Preconditioning the solution of the time- dependent neutron diffusion equation by recycling Krylov subspaces

  • González Pintor, Sebastián
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] Spectral preconditioners are based on the fact that the convergence rate of Krylov subspace methods is improved if the eigenvalues of smallest magnitude of the system matrix are `removed'. In this paper, two preconditioning strategies are studied to solve a set of linear systems associated with the numerical integration of the time dependent neutron di usion equation. Both strategies can be implemented using the matrix-vector product as the main operation and succeed at reducing the total number of iterations needed to solve the set of systems., This work has been partially supported by the Spanish Ministerio de Educacion y Ciencia under projects MTM2010-18674 and ENE2011-22823.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Combined matrices of sign regular matrices

  • Bru García, Rafael
  • Gasso Matoses, María Teresa
  • Gimenez Manglano, María Isabel
  • Santana-De Asis, Máximo De Jesús
The combined matrix of a nonsingular matrix A is the Hadamard (entry wise) product C(A) = A ◦ (A−1)T . Since each row and column sum of C(A) is equal to one, the combined matrix is doubly stochastic when it is nonnegative. In this work, we study the nonnegativity of the combined matrix of sign regular matrices, based upon their signature. In particular, a few coordinates of the signature ε of A play a crucial role in determining whether or not C(A) is nonnegative. © 2014 Elsevier Inc. All rights reserved., Research supported by Spanish DGI grant number MTM2010-18674.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On graphs associated to sets of rankings

  • Criado Herrero, Regino
  • García, Esther
  • Romance, Miguel
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
In this paper we analyze families of rankings by studying structural properties of graphs. Given a finite number of elements and a set of rankings of those elements, two elements compete when they exchange their relative positions in at least two rankings, and we can associate an undirected graph to a set of rankings by connecting elements that compete. We call this graph a competitivity graph. Competitivity graphs have already appeared in the literature as co-comparability graphs, f-graphs or intersection graphs associated to a concatenation of permutation diagrams. We introduce certain important sets of nodes in a competitivity graph. For example, nodes that compete among them form a competitivity set and nodes connected by chains of competitors form a set of eventual competitors. These sets are analyzed and a method to obtain sets of eventual competitors directly from a set of rankings is shown. © 2015 Elsevier B.V., This paper was partially supported by Spanish MICINN Funds and FEDER Funds MTM2009-13848, MTM2010-16153 and MTM2010-18674, and Junta de Andalucia Funds FQM-264. The authors would like to thank an anonymous referee for the valuable comments and remarks.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Consensus over Multiplex Network To Calculate User Influence in Social Networks

  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Del Val Noguera, Elena|||0000-0002-1279-3429
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Palomares Chust, Alberto|||0000-0002-4583-467X
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
[EN] User influence determines how the information is transmitted. Most of the current methods need to consider the complete network and, if it changes, the calculations have to be repeated from the scratch. This work proposes the use of a consensus algorithm to calculate the influence of the participants in a social event through their interactions in Twitter. Retweets, mentions and replies and considered and represented in a multiplex network. The algorithm determines the influence of the users using only local knowledge, This work is supported by Spanish DGI grant MTM2010-18674, Consolider Ingenio CSD2007-00022, PROMETEO 2008/051, MINECO/FEDER grant TIN2012-36586-C03-01, and PAID-06-11-2084.