86 citations · 188 across the 17 of their papers we have counts for
18 papers
Implementation of the hybrid exchange-correlation functionals in the SIESTA code
Yann Pouillon, Bill Clintone Oyomo, James Sifuna +6
We present an efficient and accurate implementation of hybrid exchange-correlation (XC) functionals in the SIESTA code, enabling large-scale simulations based on Hartree-Fock-type…
Pencil-based algorithms for tensor rank decomposition are not stable
Carlos Beltrán, Paul Breiding, Nick Vannieuwenhoven
We prove the existence of an open set of tensors of rank on which a popular and efficient class of algorithms for computing tensor rank decomposition…
Energy of the Coulomb gas on the sphere at low temperature
Carlos Beltrán, Adrien Hardy
We consider the Coulomb gas of particles on the sphere and show that the logarithmic energy of the configurations approaches the minimal energy up to an error of order …
The real polynomial eigenvalue problem is well conditioned on the average
Carlos Beltran, Khazhgali Kozhasov
We study the average condition number for polynomial eigenvalues of collections of matrices drawn from various random matrix ensembles. In particular, we prove that polynomial eige…
The polynomial eigenvalue problem is well conditioned for random inputs
Carlos Beltrán, Diego Armentano
We compute the exact value of the squared condition number for the polynomial eigenvalue problem, when the input matrices have entries coming from the standard complex Gaussian dis…
The projective ensemble and distribution of points in odd-dimensional spheres
Carlos Beltrán, Ujué Etayo
We define a determinantal point process on the complex projective space that reduces to the so-called spherical ensemble for complex dimension 1 under identification of the 2-spher…
Discrete and Continuous Green Energy on Compact Manifolds
Carlos Beltrán, Nuria Corral, Juan G. Criado del Rey
In this article we study the role of the Green function for the Laplacian in a compact Riemannian manifold as a tool for obtaining well-distributed points. In particular, we prove…
Energy and discrepancy of rotationally invariant determinantal point processes in high dimensional spheres
Carlos Beltrán, Jordi Marzo, Joaquim Ortega-Cerdà
We study expected Riesz s-energies and linear statistics of some determinantal processes on the sphere. In particular, we compute the expected Riesz and logarithmic energies of the…
Condition length and complexity for the solution of polynomial systems
Diego Armentano, Carlos Beltrán, Peter Bürgisser +2
Smale's 17th problem asks for an algorithm which finds an approximate zero of polynomial systems in average polynomial time (see Smale 2000). The main progress on Smale's problem i…
A stable, polynomial-time algorithm for the eigenpair problem
Diego Armentano, Carlos Beltrán, Peter Bürgisser +2
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex matrix . These algorithms are numerically stable, strongly accurate, and…
A stable, polynomial-time algorithm for the eigenpair problem
Peter Bürgisser, Felipe Cucker
We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex matrix . These algorithms are numerically stable, strongly accurate, and theor…
On the Number of Interference Alignment Solutions for the K-User MIMO Channel with Constant Coefficients
Óscar González, Carlos Beltrán, Ignacio Santamaría
In this paper, we study the number of different interference alignment (IA) solutions in a K-user multiple-input multiple-output (MIMO) interference channel, when the alignment is…
The complexity and geometry of numerically solving polynomial systems
Carlos Beltran, Michael Shub
These pages contain a short overview on the state of the art of efficient numerical analysis methods that solve systems of multivariate polynomial equations. We focus on the work o…
A Feasibility Test for Linear Interference Alignment in MIMO Channels with Constant Coefficients
Oscar Gonzalez, Carlos Beltran, Ignacio Santamaria
In this paper, we consider the feasibility of linear interference alignment (IA) for multiple-input multiple-output (MIMO) channels with constant coefficients for any number of use…
Robust certified numerical homotopy tracking
Carlos Beltrán, Anton Leykin
We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equatio…
Certified numerical homotopy tracking
Carlos Beltrán, Anton Leykin
Given a homotopy connecting two polynomial systems we provide a rigorous algorithm for tracking a regular homotopy path connecting an approximate zero of the start system to an app…
Convexity properties of the condition number II
Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich +1
In our previous paper [SIMAX 31 n.3 1491-1506(2010)], we studied the condition metric in the space of maximal rank matrices. Here, we show that this condition metric induces a Lips…
Convexity properties of the condition number
Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich +1
We define in the space of n by m matrices of rank n, n less or equal than m, the condition Riemannian structure as follows: For a given matrix A the tangent space of A is equipped…