Dolores Barrios Rolania
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dolores Barrios Rolania has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Manrique
Universidad Politécnica de Madrid, Spain
11 shared publications - Guillermo Lopez Lagomasino
Department of Mathematics, Universidad Carlos III de Madrid, Leganés, Spain
6 shared publications - Amílcar Branquinho
CMUC, Departamento de Matemática Universidade de Coimbra Coimbra Portugal
4 shared publications - Ana Foulquié-Moreno
Departamento de Matemática, Universidade de Aveiro, Aveiro, Portugal
3 shared publications - L. M. Anguas
Saint Louis University, Madrid, Spain
3 shared publications Alberto Carrascal
Facultad de Informática, Dpto. Inteligencia Artificial
2 shared publications
Latest Publications
- 9 February 2026
- Published by Springer Nature in Rendiconti del Circolo Matematico di Palermo Series 2
- Vol. 75 (2) , 60
New tools for the study of Bochner differential operators
- 9 February 2026
- Published by Springer Nature in Rendiconti del Circolo Matematico di Palermo Series 2
- Vol. 75 (2) , 60
New tools for the study of Bochner differential operators
- 2 December 2024
- Published by MIT Press in Evolutionary Computation
- Vol. 32 (4) , 339-370
Estimation of Distribution Algorithm for Grammar-Guided Genetic Programming
Genetic variation operators in grammar-guided genetic programming are fundamental to guide the evolutionary process in search and optimization problems. However, they show some limitations, mainly derived from an unbalanced exploration and local-search trade-off. This paper presents an estimation of distribution algorithm for grammar-guided genetic programming to overcome this difficulty and thus increase the performance of the evolutionary algorithm. Our proposal employs an extended dynamic stochastic context-free grammar to encode and calculate the estimation of the distribution of the search space from some promising individuals in the population. Unlike traditional estimation of distribution algorithms, the proposed approach improves exploratory behavior by smoothing the estimated distribution model. Therefore, this algorithm is referred to as SEDA, smoothed estimation of distribution algorithm. Experiments have been conducted to compare overall performance using a typical genetic programming crossover operator, an incremental estimation of distribution algorithm, and the proposed approach after tuning their hyperparameters. These experiments involve challenging problems to test the local search and exploration features of the three evolutionary systems. The results show that grammar-guided genetic programming with SEDA achieves the most accurate solutions with an intermediate convergence speed.
- 2 December 2024
- Published by MIT Press in Evolutionary Computation
- Vol. 32 (4) , 339-370
Estimation of Distribution Algorithm for Grammar-Guided Genetic Programming
Genetic variation operators in grammar-guided genetic programming are fundamental to guide the evolutionary process in search and optimization problems. However, they show some limitations, mainly derived from an unbalanced exploration and local-search trade-off. This paper presents an estimation of distribution algorithm for grammar-guided genetic programming to overcome this difficulty and thus increase the performance of the evolutionary algorithm. Our proposal employs an extended dynamic stochastic context-free grammar to encode and calculate the estimation of the distribution of the search space from some promising individuals in the population. Unlike traditional estimation of distribution algorithms, the proposed approach improves exploratory behavior by smoothing the estimated distribution model. Therefore, this algorithm is referred to as SEDA, smoothed estimation of distribution algorithm. Experiments have been conducted to compare overall performance using a typical genetic programming crossover operator, an incremental estimation of distribution algorithm, and the proposed approach after tuning their hyperparameters. These experiments involve challenging problems to test the local search and exploration features of the three evolutionary systems. The results show that grammar-guided genetic programming with SEDA achieves the most accurate solutions with an intermediate convergence speed.
- Open Access
New tools for the study of Bochner differential operators
A sequence $\{δ_n^{(k)}\}$ associated to a Bochner differential operator is introduced as an effective tool to study this kind of operators. Some properties of this sequence are proven and used to deduce that a particular operator leads to solutions of a bispectral problem. In addition, the inverse problem is studied; that is, given a sequence $\{λ_n\}$ of complex numbers and a sequence $\{P_n\}$ of polynomials with complex coefficients, $°{P_n}=n$, we find a necessary and sufficient condition for the existence of a Bochner differential operator that has those sequences as eigenvalues and eigenpolynomials, respectively. The mentioned condition also depends on $\{δ_n^{(k)}\}$.Open AccessNew tools for the study of Bochner differential operators
A sequence $\{δ_n^{(k)}\}$ associated to a Bochner differential operator is introduced as an effective tool to study this kind of operators. Some properties of this sequence are proven and used to deduce that a particular operator leads to solutions of a bispectral problem. In addition, the inverse problem is studied; that is, given a sequence $\{λ_n\}$ of complex numbers and a sequence $\{P_n\}$ of polynomials with complex coefficients, $°{P_n}=n$, we find a necessary and sufficient condition for the existence of a Bochner differential operator that has those sequences as eigenvalues and eigenpolynomials, respectively. The mentioned condition also depends on $\{δ_n^{(k)}\}$. - 5 February 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 721, 122-148
On polynomial solutions of certain finite order ordinary differential equations
- 5 February 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 721, 122-148
On polynomial solutions of certain finite order ordinary differential equations
- Open Access
On polynomial solutions of certain finite order ordinary differential equations
Some properties and relations satisfied by the polynomial solutions of a bispectral problem are studied. Given a finite order differential operator, under certain restrictions, its polynomial eigenfunctions are explicitly obtained, as well as the corresponding eigenvalues. Also, some linear transformations are applied to sequences of eigenfunctions and a necessary condition for this to be a sequence of eigenfunctions of a new differential operator is obtained. These results are applied to the particular case of classical Hermite polynomials.
Open AccessOn polynomial solutions of certain finite order ordinary differential equations
Some properties and relations satisfied by the polynomial solutions of a bispectral problem are studied. Given a finite order differential operator, under certain restrictions, its polynomial eigenfunctions are explicitly obtained, as well as the corresponding eigenvalues. Also, some linear transformations are applied to sequences of eigenfunctions and a necessary condition for this to be a sequence of eigenfunctions of a new differential operator is obtained. These results are applied to the particular case of classical Hermite polynomials.
- Open Access
- 15 April 2023
- Published by Scientific Advances Publishers in Journal of Pure and Applied Mathematics: Advances and Applications
- p. 1-23
A NOTE ON BANDED LINEAR SYSTEMS
In previous works, we studied and analized the Darboux factorization for semi-infinite Hessenberg banded matrices. In this note, we prove that this kind of factorization can be used also for finite matrices. In addition, a new method for solving banded linear systems is provided. Finally, some numerical experiments are reported to show the effectiveness of the proposed method.
- 15 April 2023
- Published by Scientific Advances Publishers in Journal of Pure and Applied Mathematics: Advances and Applications
- p. 1-23
Open AccessA NOTE ON BANDED LINEAR SYSTEMS
In previous works, we studied and analized the Darboux factorization for semi-infinite Hessenberg banded matrices. In this note, we prove that this kind of factorization can be used also for finite matrices. In addition, a new method for solving banded linear systems is provided. Finally, some numerical experiments are reported to show the effectiveness of the proposed method.
- 1 October 2020
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 382
On the Darboux transformations and sequences of p-orthogonal polynomials
- 1 October 2020
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 382
On the Darboux transformations and sequences of p-orthogonal polynomials
- 12 June 2020
- Published by Springer Nature in Soft Computing
- Vol. 24 (15) , 11265-11282
Grammatically uniform population initialization for grammar-guided genetic programming
- 12 June 2020
- Published by Springer Nature in Soft Computing
- Vol. 24 (15) , 11265-11282
Grammatically uniform population initialization for grammar-guided genetic programming
- 7 December 2019
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 114 (1) , 26
Geronimus transformations for sequences of d-orthogonal polynomials
- 7 December 2019
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 114 (1) , 26
Geronimus transformations for sequences of d-orthogonal polynomials
- 18 September 2018
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 84 (3-4) , 161-184
Multilayered neural architectures evolution for computing sequences of orthogonal polynomials
- 18 September 2018
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 84 (3-4) , 161-184
Multilayered neural architectures evolution for computing sequences of orthogonal polynomials