<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Collection:</title>
    <link>http://hdl.handle.net/2117/3741</link>
    <description />
    <pubDate>Thu, 23 May 2013 12:29:47 GMT</pubDate>
    <dc:date>2013-05-23T12:29:47Z</dc:date>
    <itunes:owner>
      <itunes:email>webmaster.bupc@upc.edu</itunes:email>
      <itunes:name>Universitat Politècnica de Catalunya. Servei de Biblioteques i Documentació</itunes:name>
    </itunes:owner>
    <itunes:explicit>no</itunes:explicit>
    <itunes:keywords />
    <item>
      <title>Kirchhoff indexes of a network</title>
      <link>http://hdl.handle.net/2117/8290</link>
      <description>Title: Kirchhoff indexes of a network
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel; Mitjana Riera, Margarida
Abstract: In this work we define the effective resistance between any pair of vertices with respect to a value λ ≥ 0 and a weight ω on the vertex set. This allows us to consider a generalization of the Kirchhoff Index of a finite network. It turns out that λ is the lowest eigenvalue of a suitable semi-definite positive Schrödinger operator and ω is the associated eigenfunction. We obtain the relation between the effective resistance, and hence between the Kirchhoff Index, with respect to λ and ω and the eigenvalues of the associated Schrödinger&#xD;
operator. However, our main aim in this work is to get explicit expressions of the above parameters in terms of equilibrium measures&#xD;
of the network. From these expressions, we derive a full generalization of Foster’s formulae that incorporate a positive probability of remaining in each vertex in every step of a random walk. Finally, we compute the effective resistances and the generalized Kirchhoff Index with respect to a λ and ω for some families of networks with&#xD;
symmetries, specifically for weighted wagon-wheels and circular ladders.</description>
      <pubDate>Wed, 21 Jul 2010 08:33:04 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/8290</guid>
      <dc:date>2010-07-21T08:33:04Z</dc:date>
      <itunes:author>Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel; Mitjana Riera, Margarida</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>In this work we define the effective resistance between any pair of vertices with respect to a value λ ≥ 0 and a weight ω on the vertex set. This allows us to consider a generalization of the Kirchhoff Index of a finite network. It turns out that λ is the lowest eigenvalue of a suitable semi-definite positive Schrödinger operator and ω is the associated eigenfunction. We obtain the relation between the effective resistance, and hence between the Kirchhoff Index, with respect to λ and ω and the eigenvalues of the associated Schrödinger&#xD;
operator. However, our main aim in this work is to get explicit expressions of the above parameters in terms of equilibrium measures&#xD;
of the network. From these expressions, we derive a full generalization of Foster’s formulae that incorporate a positive probability of remaining in each vertex in every step of a random walk. Finally, we compute the effective resistances and the generalized Kirchhoff Index with respect to a λ and ω for some families of networks with&#xD;
symmetries, specifically for weighted wagon-wheels and circular ladders.</itunes:summary>
    </item>
    <item>
      <title>A formula for the Kirchhoff index</title>
      <link>http://hdl.handle.net/2117/1247</link>
      <description>Title: A formula for the Kirchhoff index
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel
Abstract: We show here that the Kirchhoff index of a network is the average of the Wiener capacities of its vertices. Moreover, we obtain a closed-form formula for the effective resistance between any pair of vertices when the considered network has some symmetries which allows us to give the corresponding formulas for the Kirchhoff index. In addition, we find the expression for the  Foster's n-th Formula.</description>
      <pubDate>Wed, 17 Oct 2007 14:55:49 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/1247</guid>
      <dc:date>2007-10-17T14:55:49Z</dc:date>
      <itunes:author>Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Kirchhoff index, effective resistance, equilibrium measure</itunes:keywords>
      <itunes:summary>We show here that the Kirchhoff index of a network is the average of the Wiener capacities of its vertices. Moreover, we obtain a closed-form formula for the effective resistance between any pair of vertices when the considered network has some symmetries which allows us to give the corresponding formulas for the Kirchhoff index. In addition, we find the expression for the  Foster's n-th Formula.</itunes:summary>
    </item>
    <item>
      <title>Application of the forces' method in dynamic systems</title>
      <link>http://hdl.handle.net/2117/1246</link>
      <description>Title: Application of the forces' method in dynamic systems
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel
Abstract: We present here some applications of the Forces's method in dynamic systems. In particular, we consider the problem of the approximation of the trajectories of a conservative system of point masses by means of the minimization of the action integral and the computation of planar central configurations.</description>
      <pubDate>Wed, 17 Oct 2007 14:33:10 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/1246</guid>
      <dc:date>2007-10-17T14:33:10Z</dc:date>
      <itunes:author>Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>dynamic systems, forces' method, choreographies</itunes:keywords>
      <itunes:summary>We present here some applications of the Forces's method in dynamic systems. In particular, we consider the problem of the approximation of the trajectories of a conservative system of point masses by means of the minimization of the action integral and the computation of planar central configurations.</itunes:summary>
    </item>
    <item>
      <title>Computational cost of the Fekete problem</title>
      <link>http://hdl.handle.net/2117/1241</link>
      <description>Title: Computational cost of the Fekete problem
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel
Abstract: We present here strong numerical and statistical evidence of the fact that the Smale's 7th problem can be answered affirmatively. In particular, we show that a local minimum for the logarithmic potential energy in the 2-sphere satisfying the Smale's conditions can be identified with a computational cost of approximately O(N^10})</description>
      <pubDate>Thu, 11 Oct 2007 16:42:31 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/1241</guid>
      <dc:date>2007-10-11T16:42:31Z</dc:date>
      <itunes:author>Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Fekete points, Smale's 7th problem</itunes:keywords>
      <itunes:summary>We present here strong numerical and statistical evidence of the fact that the Smale's 7th problem can be answered affirmatively. In particular, we show that a local minimum for the logarithmic potential energy in the 2-sphere satisfying the Smale's conditions can be identified with a computational cost of approximately O(N^10})</itunes:summary>
    </item>
    <item>
      <title>Characterization of symmetric M-matrices as resistive inverses</title>
      <link>http://hdl.handle.net/2117/1168</link>
      <description>Title: Characterization of symmetric M-matrices as resistive inverses
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel
Abstract: We aim here at characterizing those nonnegative matrices whose inverse is an irreducible Stieltjes matrix. Specifically, we prove that any irreducible Stieltjes matrix is a resistive inverse. To do that we consider the network defined by the off-diagonal entries of the matrix and we identify the matrix with a positive definite&#xD;
Schrödinger operator which ground state is determined by the its lowest eigenvalue and the corresponding positive eigenvector. We also analyze the case in which the operator is positive semidefinite which corresponds to the study of singular irreducible symmetric M-matrices. The key tool is the definition of the effective resistance with respect to a nonnegative value and a weight.  We prove that these effective resistances verify similar properties to those satisfied by the standard effective resistances which leads us to carry out an exhaustive analysis of the generalized inverses of singular irreducible symmetric M-matrices. Moreover we pay special attention on those generalized inverses identified with Green operators, which in particular&#xD;
includes the analysis of the Moore-Penrose inverse.</description>
      <pubDate>Wed, 01 Aug 2007 19:30:23 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/1168</guid>
      <dc:date>2007-08-01T19:30:23Z</dc:date>
      <itunes:author>Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Schrödinger operator, M-matrices, generalized inverses, Green kernels, Moore-Penrose inverse, effective resistance, Kirchhoff index</itunes:keywords>
      <itunes:summary>We aim here at characterizing those nonnegative matrices whose inverse is an irreducible Stieltjes matrix. Specifically, we prove that any irreducible Stieltjes matrix is a resistive inverse. To do that we consider the network defined by the off-diagonal entries of the matrix and we identify the matrix with a positive definite&#xD;
Schrödinger operator which ground state is determined by the its lowest eigenvalue and the corresponding positive eigenvector. We also analyze the case in which the operator is positive semidefinite which corresponds to the study of singular irreducible symmetric M-matrices. The key tool is the definition of the effective resistance with respect to a nonnegative value and a weight.  We prove that these effective resistances verify similar properties to those satisfied by the standard effective resistances which leads us to carry out an exhaustive analysis of the generalized inverses of singular irreducible symmetric M-matrices. Moreover we pay special attention on those generalized inverses identified with Green operators, which in particular&#xD;
includes the analysis of the Moore-Penrose inverse.</itunes:summary>
    </item>
    <item>
      <title>Potential Theory for boundary value problems on finite networks</title>
      <link>http://hdl.handle.net/2117/589</link>
      <description>Title: Potential Theory for boundary value problems on finite networks
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel
Abstract: We aim here at analyzing self-adjoint boundary value problems&#xD;
on finite networks associated with positive semi-definite&#xD;
Schrödinger operators.  In addition, we study the existence&#xD;
and uniqueness of solutions and its  variational formulation.&#xD;
Moreover, we will tackle a well-known problem in the framework&#xD;
of Potential Theory, the so-called  condenser principle. Then,&#xD;
we generalize of the concept of effective resistance between&#xD;
two vertices of the network and we characterize the Green&#xD;
function of some BVP in terms of effective resistances.</description>
      <pubDate>Fri, 01 Dec 2006 17:44:29 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/589</guid>
      <dc:date>2006-12-01T17:44:29Z</dc:date>
      <itunes:author>Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Discrete Potential Theory, Combinatorial Laplacian, Schrödinger operator, Boundary value problems, Effective resistance, Green function</itunes:keywords>
      <itunes:summary>We aim here at analyzing self-adjoint boundary value problems&#xD;
on finite networks associated with positive semi-definite&#xD;
Schrödinger operators.  In addition, we study the existence&#xD;
and uniqueness of solutions and its  variational formulation.&#xD;
Moreover, we will tackle a well-known problem in the framework&#xD;
of Potential Theory, the so-called  condenser principle. Then,&#xD;
we generalize of the concept of effective resistance between&#xD;
two vertices of the network and we characterize the Green&#xD;
function of some BVP in terms of effective resistances.</itunes:summary>
    </item>
    <item>
      <title>Bounds on the first non-null eigenvalue for self-adjoint boundary value problems on networks</title>
      <link>http://hdl.handle.net/2117/588</link>
      <description>Title: Bounds on the first non-null eigenvalue for self-adjoint boundary value problems on networks
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel
Abstract: We aim here at obtaining bounds on the first non-null eigenvalue for self-adjoint boundary value problems on a weighted network by means of equilibrium measures, that includes the study of Dirichlet, Neumann and Mixed problems. We also show the sharpness of these bounds throughout the analysis of some known examples. In particular, we emphasize the case of&#xD;
distance-regular graphs, and we show that the bounds obtained are better than the known until now.</description>
      <pubDate>Fri, 01 Dec 2006 17:29:22 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/588</guid>
      <dc:date>2006-12-01T17:29:22Z</dc:date>
      <itunes:author>Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Networks, Self-adjoint eigenvalue problems, Discrete laplacian, Equilibrium measures, Distance-regular graphs</itunes:keywords>
      <itunes:summary>We aim here at obtaining bounds on the first non-null eigenvalue for self-adjoint boundary value problems on a weighted network by means of equilibrium measures, that includes the study of Dirichlet, Neumann and Mixed problems. We also show the sharpness of these bounds throughout the analysis of some known examples. In particular, we emphasize the case of&#xD;
distance-regular graphs, and we show that the bounds obtained are better than the known until now.</itunes:summary>
    </item>
    <item>
      <title>Regular boundary value problems on a path throughout Chebyshev Polynomials</title>
      <link>http://hdl.handle.net/2117/587</link>
      <description>Title: Regular boundary value problems on a path throughout Chebyshev Polynomials
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel
Abstract: In this work we study the different types of regular boundary value&#xD;
problems on a path associated with the Schrödinger operator. In&#xD;
particular, we obtain the Green function for each problem and we&#xD;
emphasize the case of Sturm-Liouville boundary conditions. In&#xD;
addition, we study the periodic boundary value problem that&#xD;
corresponds to the Poisson equation in a cycle. In any case, the&#xD;
Green functions are given in terms of Chebyshev polynomials since&#xD;
they verify a recurrence law similar to the one verified by the&#xD;
Schrödinger operator on a path.</description>
      <pubDate>Fri, 01 Dec 2006 17:06:32 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/587</guid>
      <dc:date>2006-12-01T17:06:32Z</dc:date>
      <itunes:author>Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Discrete Schrödinger operator, boundary value problems, paths, Chebyshev polynomials, Green functions</itunes:keywords>
      <itunes:summary>In this work we study the different types of regular boundary value&#xD;
problems on a path associated with the Schrödinger operator. In&#xD;
particular, we obtain the Green function for each problem and we&#xD;
emphasize the case of Sturm-Liouville boundary conditions. In&#xD;
addition, we study the periodic boundary value problem that&#xD;
corresponds to the Poisson equation in a cycle. In any case, the&#xD;
Green functions are given in terms of Chebyshev polynomials since&#xD;
they verify a recurrence law similar to the one verified by the&#xD;
Schrödinger operator on a path.</itunes:summary>
    </item>
    <item>
      <title>Vector Calculus on weighted networks</title>
      <link>http://hdl.handle.net/2117/494</link>
      <description>Title: Vector Calculus on weighted networks
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos
Abstract: In this work we study the different type of regular boundary value&#xD;
problems on a path associated with the Schr\"odinger operator. In&#xD;
particular, we get the Poisson kernel and the Green function for&#xD;
each problem and we emphasize the cases of Dirichlet, Neumann, Mixed&#xD;
and periodic problems. In any case, the Poisson kernel and the Green&#xD;
function are given in terms of second and third kind Chebyshev&#xD;
polynomials since they verify a recurrence law similar to the one&#xD;
verified by the Sch\"odinger operator on a path.</description>
      <pubDate>Mon, 02 Oct 2006 17:59:53 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/494</guid>
      <dc:date>2006-10-02T17:59:53Z</dc:date>
      <itunes:author>Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Discrete operators, Discrete green identity, Vector calculus, Network cohomology</itunes:keywords>
      <itunes:summary>In this work we study the different type of regular boundary value&#xD;
problems on a path associated with the Schr\"odinger operator. In&#xD;
particular, we get the Poisson kernel and the Green function for&#xD;
each problem and we emphasize the cases of Dirichlet, Neumann, Mixed&#xD;
and periodic problems. In any case, the Poisson kernel and the Green&#xD;
function are given in terms of second and third kind Chebyshev&#xD;
polynomials since they verify a recurrence law similar to the one&#xD;
verified by the Sch\"odinger operator on a path.</itunes:summary>
    </item>
    <item>
      <title>Fekete points in non-smooth surfaces</title>
      <link>http://hdl.handle.net/2117/493</link>
      <description>Title: Fekete points in non-smooth surfaces
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel
Abstract: In this paper we present a procedure for the estimation of the Fekete points on a&#xD;
wide variety of non-regular objects in $R^3$. We understand the problem of the Fekete&#xD;
points in terms of the identification of good equilibrium configurations for a potential energy that depends on the relative position of N particles. Although the procedure that we present here works well for different potential energies, the examples showed refer to the electrostatic potential energy, that plays an special role in Potential Theory and Physics. The objects for which our procedure has been designed can be described basically as the finite union of piecewise regular surfaces and curves. For the determination of a good starting configuration for the search of the Fekete points on such objects, a sequence of approximating regular surfaces must be constructed.&#xD;
The numerical experience carried out until now suggests that the total computational&#xD;
cost of the obtaining of a nearly optimal configuration with the procedure&#xD;
introduced here is less than $N^3$ independently of the object considered.</description>
      <pubDate>Mon, 02 Oct 2006 17:34:51 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/493</guid>
      <dc:date>2006-10-02T17:34:51Z</dc:date>
      <itunes:author>Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Fekete points, Optimization, Non-smooth surfaces, Riesz Kernels</itunes:keywords>
      <itunes:summary>In this paper we present a procedure for the estimation of the Fekete points on a&#xD;
wide variety of non-regular objects in $R^3$. We understand the problem of the Fekete&#xD;
points in terms of the identification of good equilibrium configurations for a potential energy that depends on the relative position of N particles. Although the procedure that we present here works well for different potential energies, the examples showed refer to the electrostatic potential energy, that plays an special role in Potential Theory and Physics. The objects for which our procedure has been designed can be described basically as the finite union of piecewise regular surfaces and curves. For the determination of a good starting configuration for the search of the Fekete points on such objects, a sequence of approximating regular surfaces must be constructed.&#xD;
The numerical experience carried out until now suggests that the total computational&#xD;
cost of the obtaining of a nearly optimal configuration with the procedure&#xD;
introduced here is less than $N^3$ independently of the object considered.</itunes:summary>
    </item>
    <item>
      <title>Estimation of Fekete points</title>
      <link>http://hdl.handle.net/2117/492</link>
      <description>Title: Estimation of Fekete points
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel
Abstract: In this paper we present a new method to estimate Fekete points on surfaces.&#xD;
Although our method works in a general setting, we concentrate on its application to&#xD;
the unit sphere because it is the prototype problem and in the unit cube because its&#xD;
singularity. The algorithm we present here is very simple and it is based in a physical&#xD;
interpretation of the behavior of a system of particles when they search for a minimal&#xD;
energy configuration. Moreover, the algorithm is efficient and robust independently of the surface and the kernel used to define the energy. The algorithm allows us to work with a great number of particles, for instance, in less than a day of calculation time, we have obtained a good configuration for 50000 particles in the unit sphere without using symmetry properties and with a conventional PC.</description>
      <pubDate>Mon, 02 Oct 2006 17:20:08 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/492</guid>
      <dc:date>2006-10-02T17:20:08Z</dc:date>
      <itunes:author>Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Fekete points, Optimization, Equilibrium distributions, Regular surfaces</itunes:keywords>
      <itunes:summary>In this paper we present a new method to estimate Fekete points on surfaces.&#xD;
Although our method works in a general setting, we concentrate on its application to&#xD;
the unit sphere because it is the prototype problem and in the unit cube because its&#xD;
singularity. The algorithm we present here is very simple and it is based in a physical&#xD;
interpretation of the behavior of a system of particles when they search for a minimal&#xD;
energy configuration. Moreover, the algorithm is efficient and robust independently of the surface and the kernel used to define the energy. The algorithm allows us to work with a great number of particles, for instance, in less than a day of calculation time, we have obtained a good configuration for 50000 particles in the unit sphere without using symmetry properties and with a conventional PC.</itunes:summary>
    </item>
  </channel>
</rss>

