Inmaculada Higueras
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
Inmaculada Higueras has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Teo Roldán
Universidad Pública de Navarra
14 shared publications R. März
3 shared publications- Anna Martínez-Gavara
Universidad de Valencia
2 shared publications Berta Garcia-Celayeta
2 shared publicationsC. Tischendorf
Humboldt-University of Berlin, Institute of Mathematics, 10099 Berlin, Germany
2 shared publications- David I. Ketcheson
Computer, Electrical, and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia
2 shared publications
Latest Publications
- Open Access
- 5 July 2025
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 217, 372-389
Low-storage exponentially fitted explicit Runge-Kutta methods
- 5 July 2025
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 217, 372-389
Open AccessLow-storage exponentially fitted explicit Runge-Kutta 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
- Open Access
Optimal monotonicity-preserving perturbations of a given Runge-Kutta method
Perturbed Runge--Kutta methods (also referred to as downwind Runge--Kutta methods) can guarantee monotonicity preservation under larger step sizes relative to their traditional Runge--Kutta counterparts. In this paper we study, the question of how to optimally perturb a given method in order to increase the radius of absolute monotonicity (a.m.). We prove that for methods with zero radius of a.m., it is always possible to give a perturbation with positive radius. We first study methods for linear problems and then methods for nonlinear problems. In each case, we prove upper bounds on the radius of a.m., and provide algorithms to compute optimal perturbations. We also provide optimal perturbations for many known methods.
Open AccessOptimal monotonicity-preserving perturbations of a given Runge-Kutta method
Perturbed Runge--Kutta methods (also referred to as downwind Runge--Kutta methods) can guarantee monotonicity preservation under larger step sizes relative to their traditional Runge--Kutta counterparts. In this paper we study, the question of how to optimally perturb a given method in order to increase the radius of absolute monotonicity (a.m.). We prove that for methods with zero radius of a.m., it is always possible to give a perturbation with positive radius. We first study methods for linear problems and then methods for nonlinear problems. In each case, we prove upper bounds on the radius of a.m., and provide algorithms to compute optimal perturbations. We also provide optimal perturbations for many known methods.
- 14 February 2018
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 76 (3) , 1337-1369
Optimal Monotonicity-Preserving Perturbations of a Given Runge–Kutta Method
- 14 February 2018
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 76 (3) , 1337-1369
Optimal Monotonicity-Preserving Perturbations of a Given Runge–Kutta Method
- 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.