default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos Beltrán 0001
Person information
- affiliation (PhD): University of Cantabria (UC), Department of Mathematics, Statistics and Computation, Santander, Spain
Other persons with the same name
- Carlos Beltrán (aka: Carlos Beltran) — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Diego Cuevas
, Javier Álvarez-Vizoso, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters:
Constellations on the Sphere With Efficient Encoding-Decoding for Noncoherent Communications. IEEE Trans. Wirel. Commun. 23(3): 1886-1898 (2024)- [c8]Diego Cuevas, Carlos Beltrán, Mikel Gutiérrez, Ignacio Santamaría, Vít Tucek:
Structured Multi-Antenna Grassmannian Constellations for Noncoherent Communications. SAM 2024: 1-5 - 2023
- [j29]Carlos Beltrán, Paul Breiding, Nick Vannieuwenhoven:
The Average Condition Number of Most Tensor Rank Decomposition Problems is Infinite. Found. Comput. Math. 23(2): 433-491 (2023) - [j28]Carlos Beltrán, Ujué Etayo, Pedro R. López-Gómez:
Low-energy points on the sphere and the real projective plane. J. Complex. 76: 101742 (2023) - [j27]Diego Cuevas, Javier Álvarez-Vizoso, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters:
Union Bound Minimization Approach for Designing Grassmannian Constellations. IEEE Trans. Commun. 71(4): 1940-1952 (2023) - [j26]Javier Álvarez-Vizoso, Diego Cuevas, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters:
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel. IEEE Trans. Inf. Theory 69(7): 4559-4578 (2023) - [c7]Javier Álvarez-Vizoso, Diego Cuevas, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters:
Noncoherent Multiuser Grassmannian Constellations for the Mimo Multiple Access Channel. ICASSP 2023: 1-5 - 2022
- [j25]Carlos Beltrán, Laurent Bétermin, Peter Grabner, Stefan Steinerberger:
How well-conditioned can the eigenvector problem be? Math. Comput. 91(335): 1237-1245 (2022) - [c6]Javier Álvarez-Vizoso, Diego Cuevas, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters:
Coherence-based Subspace Packings for MIMO Noncoherent Communications. EUSIPCO 2022: 1906-1910 - [c5]Diego Cuevas, Javier Álvarez-Vizoso, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters:
A Measure Preserving Mapping for Structured Grassmannian Constellations in SIMO Channels. GLOBECOM 2022: 2394-2399 - [i8]Javier Álvarez-Vizoso, Diego Cuevas, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters:
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel. CoRR abs/2209.00901 (2022) - [i7]Javier Álvarez-Vizoso, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters:
Constellations on the Sphere with Efficient Encoding-Decoding for Noncoherent Communications. CoRR abs/2209.04172 (2022) - [i6]Javier Álvarez-Vizoso, Carlos Beltrán, Diego Cuevas, Ignacio Santamaría, Vít Tucek, Gunnar Peters:
Statistical characterization of the chordal product determinant of Grassmannian codes. CoRR abs/2210.02125 (2022) - 2021
- [c4]Diego Cuevas, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters:
A Fast Algorithm for Designing Grassmannian Constellations. WSA 2021: 1-6 - [i5]Carlos Beltrán, Laurent Bétermin, Peter Grabner, Stefan Steinerberger:
How well-conditioned can the eigenvalue problem be? CoRR abs/2105.07922 (2021) - [i4]Carlos Beltrán, Vanni Noferini, Nick Vannieuwenhoven:
Relative-error stability of numerical algorithms. CoRR abs/2109.10610 (2021) - [i3]Carlos Beltrán, Antonia M. Delgado, Lidia Fernández, Joaquín F. Sánchez Lara:
On Gegenbauer Point Processes on the unit interval. CoRR abs/2110.05918 (2021) - 2020
- [j24]Carlos Beltrán, Khazhgali Kozhasov:
The Real Polynomial Eigenvalue Problem is Well Conditioned on the Average. Found. Comput. Math. 20(2): 291-309 (2020) - [j23]Carlos Beltrán, Ujué Etayo:
The Diamond ensemble: A constructive set of spherical points with small logarithmic energy. J. Complex. 59: 101471 (2020)
2010 – 2019
- 2019
- [j22]Carlos Beltrán, Nuria Corral, Juan G. Criado del Rey:
Discrete and continuous green energy on compact manifolds. J. Approx. Theory 237: 160-185 (2019) - [j21]Diego Armentano, Carlos Beltrán:
The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs. SIAM J. Matrix Anal. Appl. 40(1): 175-193 (2019) - [j20]Carlos Beltrán, Paul Breiding, Nick Vannieuwenhoven:
Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable. SIAM J. Matrix Anal. Appl. 40(2): 739-773 (2019) - 2017
- [j19]Jacobo Fanjul, Oscar Gonzalez, Ignacio Santamaría, Carlos Beltrán:
Homotopy Continuation for Spatial Interference Alignment in Arbitrary MIMO X Networks. IEEE Trans. Signal Process. 65(7): 1752-1764 (2017) - 2016
- [j18]Diego Armentano, Carlos Beltrán, Peter Bürgisser, Felipe Cucker, Michael Shub:
Condition Length and Complexity for the Solution of Polynomial Systems. Found. Comput. Math. 16(6): 1401-1422 (2016) - [j17]Carlos Beltrán, Jordi Marzo, Joaquim Ortega-Cerdà:
Energy and discrepancy of rotationally invariant determinantal point processes in high dimensional spheres. J. Complex. 37: 76-109 (2016) - 2015
- [j16]Carlos Beltrán:
A Facility Location Formulation for Stable Polynomials and Elliptic Fekete Points. Found. Comput. Math. 15(1): 125-157 (2015) - [j15]Oscar Gonzalez, Carlos Beltrán, Ignacio Santamaría:
On the Number of Interference Alignment Solutions for the K-User MIMO Channel With Constant Coefficients. IEEE Trans. Inf. Theory 61(11): 6028-6048 (2015) - 2014
- [j14]Oscar Gonzalez, Carlos Beltrán, Ignacio Santamaría:
A Feasibility Test for Linear Interference Alignment in MIMO Channels With Constant Coefficients. IEEE Trans. Inf. Theory 60(3): 1840-1856 (2014) - 2013
- [j13]Carlos Beltrán, Anton Leykin:
Robust Certified Numerical Homotopy Tracking. Found. Comput. Math. 13(2): 253-295 (2013) - [c3]Oscar Gonzalez, Cristian Lameiro, Javier Vía, Carlos Beltrán, Ignacio Santamaría:
Computing the degrees of freedom for arbitrary MIMO interference channels. ICASSP 2013: 4399-4403 - [c2]Oscar Gonzalez, Ignacio Santamaría, Carlos Beltrán:
Finding the number of feasible solutions for linear interference alignment problems. ISIT 2013: 384-388 - [i2]Óscar González, Carlos Beltrán, Ignacio Santamaría:
On the Number of Interference Alignment Solutions for the K-User MIMO Channel with Constant Coefficients. CoRR abs/1301.6196 (2013) - 2012
- [j12]Carlos Beltrán, Anton Leykin:
Certified Numerical Homotopy Tracking. Exp. Math. 21(1): 69-83 (2012) - [j11]Carlos Beltrán, Michael Shub:
On the Geometry and Topology of the Solution Variety for Polynomial System Solving. Found. Comput. Math. 12(6): 719-763 (2012) - [j10]Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub:
Convexity Properties of the Condition Number II. SIAM J. Matrix Anal. Appl. 33(3): 905-939 (2012) - [c1]Oscar Gonzalez, Ignacio Santamaría, Carlos Beltrán:
A general test to check the feasibility of linear interference alignment. ISIT 2012: 2481-2485 - [i1]Oscar Gonzalez, Carlos Beltrán, Ignacio Santamaría:
On the Feasibility of Interference Alignment for the K-User MIMO Channel with Constant Coefficients. CoRR abs/1202.0186 (2012) - 2011
- [j9]Carlos Beltrán, Luis Miguel Pardo:
Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems. Found. Comput. Math. 11(1): 95-129 (2011) - [j8]Carlos Beltrán:
A continuation method to solve polynomial systems and its complexity. Numerische Mathematik 117(1): 89-113 (2011) - 2010
- [j7]Carlos Beltrán, Michael Shub:
A Note on the Finite Variance of the Averaging Function for Polynomial System Solving. Found. Comput. Math. 10(1): 115-125 (2010)
2000 – 2009
- 2009
- [j6]Carlos Beltrán, Michael Shub:
Complexity of Bezout's Theorem VII: Distance Estimates in the Condition Metric. Found. Comput. Math. 9(2): 179-195 (2009) - [j5]Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub:
Convexity Properties of the Condition Number. SIAM J. Matrix Anal. Appl. 31(3): 1491-1506 (2009) - 2008
- [j4]Carlos Beltrán, Luis Miguel Pardo:
On Smale's 17th Problem: A Probabilistic Positive Solution. Found. Comput. Math. 8(1): 1-43 (2008) - 2007
- [j3]Carlos Beltrán, Luis Miguel Pardo:
Estimates on the Distribution of the Condition Number of Singular Matrices. Found. Comput. Math. 7(1): 87-134 (2007) - [j2]Carlos Beltrán, Luis Miguel Pardo:
On the probability distribution of singular varieties of given corank. J. Symb. Comput. 42(1-2): 4-29 (2007) - [j1]Carlos Beltrán, Luis Miguel Pardo:
On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case. Math. Comput. 76(259): 1393-1424 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
