Teo Roldán
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Teo Roldán has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Inmaculada Higueras
Universidad Pública de Navarra
14 shared publications - Dajana Conte
Department of Mathematics, University of Salerno, Fisciano, Italy
2 shared publications - Giovanni Pagano
Dipartimento di Agraria, Università di Napoli Federico II
2 shared publications Berta García-Celayeta
1 shared publicationJosé Miguel Mantas
1 shared publication
Latest Publications
- Open Access
- 5 November 2026
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 60 (6) , 2741-2767
High-order nonstandard methods preserving mass and positivity for production-destruction systems
Nonstandard finite difference (NSFD) methods are widely regarded for their efficiency and ability to unconditionally preserve a priori known properties of the solution of differential problems, such as positivity and elementary stability, generally at the cost of not being able to achieve order of convergence greater than one. In a recent paper, we proposed explicit high-order NSFD methods that ensure the above-mentioned properties. In the current manuscript, by appropriately modifying these schemes and including some parameters, we obtain explicit second-order methods that, in addition to positivity, also preserve the mass when applied to a broad type of production–destruction systems. Numerical experiments, performed on a wide range of stiff problems, confirm the theoretical findings and highlight the good performance of the new methods, also through comparisons with well-known positivity-preserving schemes.
- 5 November 2026
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 60 (6) , 2741-2767
Open AccessHigh-order nonstandard methods preserving mass and positivity for production-destruction systems
Nonstandard finite difference (NSFD) methods are widely regarded for their efficiency and ability to unconditionally preserve a priori known properties of the solution of differential problems, such as positivity and elementary stability, generally at the cost of not being able to achieve order of convergence greater than one. In a recent paper, we proposed explicit high-order NSFD methods that ensure the above-mentioned properties. In the current manuscript, by appropriately modifying these schemes and including some parameters, we obtain explicit second-order methods that, in addition to positivity, also preserve the mass when applied to a broad type of production–destruction systems. Numerical experiments, performed on a wide range of stiff problems, confirm the theoretical findings and highlight the good performance of the new methods, also through comparisons with well-known positivity-preserving schemes.
- Open Access
- 21 August 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 510
High order nonstandard finite-difference methods
- 21 August 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 510
Open AccessHigh order nonstandard finite-difference methods
- Open Access
A new insight on positivity and contractivity of the Crank-Nicolson scheme for the heat equation
In this paper we study numerical positivity and contractivity in the infinite norm of Crank-Nicolson method when it is applied to the diffusion equation with homogeneous Dirichlet boundary conditions. For this purpose, the amplification matrices are written in terms of three kinds of Chebyshev-like polynomials, and necessary and sufficient bounds to preserve the desired qualitative properties are obtained. For each spatial mesh, we provide the equations that must be solved as well as the intervals that contain these bounds; consequently, they can be easily obtained by a bisection process. Besides, differences between numerical positivity and contractivity are highlighted. This problem has also been addressed by some other authors in the literature and some known results are recovered in our study. Our approach gives a new insight on the problem that completes the panorama and that can be used to study qualitative properties for other problems.
Open AccessA new insight on positivity and contractivity of the Crank-Nicolson scheme for the heat equation
In this paper we study numerical positivity and contractivity in the infinite norm of Crank-Nicolson method when it is applied to the diffusion equation with homogeneous Dirichlet boundary conditions. For this purpose, the amplification matrices are written in terms of three kinds of Chebyshev-like polynomials, and necessary and sufficient bounds to preserve the desired qualitative properties are obtained. For each spatial mesh, we provide the equations that must be solved as well as the intervals that contain these bounds; consequently, they can be easily obtained by a bisection process. Besides, differences between numerical positivity and contractivity are highlighted. This problem has also been addressed by some other authors in the literature and some known results are recovered in our study. Our approach gives a new insight on the problem that completes the panorama and that can be used to study qualitative properties for other problems.
- 1 May 2021
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 387
Efficient SSP low-storage Runge–Kutta methods
- 1 May 2021
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 387
Efficient SSP low-storage Runge–Kutta methods
- 9 April 2019
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 80 (2) , 784-807
Strong Stability Preserving Properties of Composition Runge–Kutta Schemes
- 9 April 2019
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 80 (2) , 784-807
Strong Stability Preserving Properties of Composition Runge–Kutta Schemes
- 2 February 2019
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 79 (3) , 1882-1906
New Third Order Low-Storage SSP Explicit Runge–Kutta Methods
- 2 February 2019
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 79 (3) , 1882-1906
New Third Order Low-Storage SSP Explicit Runge–Kutta Methods
- 18 August 2017
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 75 (1) , 395-404
Order Barrier for Low-Storage DIRK Methods with Positive Weights
- 18 August 2017
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 75 (1) , 395-404
Order Barrier for Low-Storage DIRK Methods with Positive Weights
- 5 October 2015
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 67 (3) , 1019-1042
Construction of Additive Semi-Implicit Runge–Kutta Methods with Low-Storage Requirements
- 5 October 2015
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 67 (3) , 1019-1042
Construction of Additive Semi-Implicit Runge–Kutta Methods with Low-Storage Requirements
- Open Access
Construction of Additive Semi-Implicit Runge-Kutta methods with low-storage requirements
Space discretization of some time-dependent partial differential equations gives rise to systems of ordinary differential equations in additive form whose terms have different stiffness properties. In these cases, implicit methods should be used to integrate the stiff terms while efficient explicit methods can be used for the non-stiff part of the problem. However, for systems with a large number of equations, memory storage requirement is also an important issue. When the high dimension of the problem compromises the computer memory capacity, it is important to incorporate low memory usage to some other properties of the scheme. In this paper we consider Additive Semi-Implicit Runge-Kutta (ASIRK) methods, a class of implicitexplicit Runge-Kutta methods for additive differential systems. We construct two second order 3-stage ASIRK schemes with low-storage requirements. Having in mind problems with stiffness parameters, besides accuracy and stability properties, we also impose stiff accuracy conditions. The numerical experiments done show the advantages of the new methods.
Open AccessConstruction of Additive Semi-Implicit Runge-Kutta methods with low-storage requirements
Space discretization of some time-dependent partial differential equations gives rise to systems of ordinary differential equations in additive form whose terms have different stiffness properties. In these cases, implicit methods should be used to integrate the stiff terms while efficient explicit methods can be used for the non-stiff part of the problem. However, for systems with a large number of equations, memory storage requirement is also an important issue. When the high dimension of the problem compromises the computer memory capacity, it is important to incorporate low memory usage to some other properties of the scheme. In this paper we consider Additive Semi-Implicit Runge-Kutta (ASIRK) methods, a class of implicitexplicit Runge-Kutta methods for additive differential systems. We construct two second order 3-stage ASIRK schemes with low-storage requirements. Having in mind problems with stiffness parameters, besides accuracy and stability properties, we also impose stiff accuracy conditions. The numerical experiments done show the advantages of the new methods.
- 1 January 2009
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 31 (3) , 2131-2150
Design and Implementation of Predictors for Additive Semi-Implicit Runge–Kutta Methods
Space discretization of some time-dependent partial differential equations gives rise to stiff systems of ordinary differential equations. In this case, implicit methods should be used, and therefore, in general, nonlinear systems must be solved. The solutions to these systems are approximated by iterative schemes, and, in order to obtain an efficient code, good initializers should be used. Recently, a parallel code based on some Runge–Kutta and additive Runge–Kutta methods has been constructed, focusing especially on additive semi-implicit Runge–Kutta (ASIRK) methods. The aim of the present paper is to develop efficient initializers for these methods.
- 1 January 2009
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 31 (3) , 2131-2150
Design and Implementation of Predictors for Additive Semi-Implicit Runge–Kutta Methods
Space discretization of some time-dependent partial differential equations gives rise to stiff systems of ordinary differential equations. In this case, implicit methods should be used, and therefore, in general, nonlinear systems must be solved. The solutions to these systems are approximated by iterative schemes, and, in order to obtain an efficient code, good initializers should be used. Recently, a parallel code based on some Runge–Kutta and additive Runge–Kutta methods has been constructed, focusing especially on additive semi-implicit Runge–Kutta (ASIRK) methods. The aim of the present paper is to develop efficient initializers for these methods.