Juan I. Montijano

According to our database1, Juan I. Montijano authored at least 34 papers between 1993 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A note on the stability of time-accurate and highly-stable explicit operators for stiff differential equations.
J. Comput. Phys., 2021

2020
Variable Step-Size Control Based on Two-Steps for Radau IIA Methods.
ACM Trans. Math. Softw., 2020

On the numerical stability of the exponentially fitted methods for first order IVPs.
Appl. Math. Comput., 2020

2019
On the effectiveness of spectral methods for the numerical solution of multi-frequency highly oscillatory Hamiltonian problems.
Numer. Algorithms, 2019

Spectrally accurate space-time solution of Hamiltonian PDEs.
Numer. Algorithms, 2019

High-order energy-conserving Line Integral Methods for charged particle dynamics.
J. Comput. Phys., 2019

2018
A viscous modified Gompertz model for the analysis of the kinetics of tumors under electrochemical therapy.
Math. Comput. Simul., 2018

Explicit Runge-Kutta Methods for Stiff Problems with a Gap in Their Eigenvalue Spectrum.
J. Sci. Comput., 2018

2017
Algorithm 968: DISODE45: A Matlab Runge-Kutta Solver for Piecewise Smooth IVPs of Filippov Type.
ACM Trans. Math. Softw., 2017

Fast distributed algebraic connectivity estimation in large scale networks.
J. Frankl. Inst., 2017

2015
Functionally Fitted Explicit Two Step Peer Methods.
J. Sci. Comput., 2015

Numerical methods for non conservative perturbations of conservative problems.
Comput. Phys. Commun., 2015

Runge-Kutta projection methods with low dispersion and dissipation errors.
Adv. Comput. Math., 2015

2014
Robust discrete time dynamic average consensus.
Autom., 2014

Step size analysis in discrete-time dynamic average consensus.
Proceedings of the American Control Conference, 2014

2013
Chebyshev Polynomials in Distributed Consensus Applications.
IEEE Trans. Signal Process., 2013

2012
On some new low storage implementations of time advancing Runge-Kutta methods.
J. Comput. Appl. Math., 2012

Energy-preserving methods for Poisson systems.
J. Comput. Appl. Math., 2012

2011
Error growth in the numerical integration of periodic orbits.
Math. Comput. Simul., 2011

Adaptive consensus and algebraic connectivity estimation in sensor networks with chebyshev polynomials.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

2010
An efficient family of strongly A-stable Runge-Kutta collocation methods for stiff systems and DAEs. Part I: Stability and order results.
J. Comput. Appl. Math., 2010

Symmetric and symplectic exponentially fitted Runge-Kutta methods of high order.
Comput. Phys. Commun., 2010

Approximate preservation of quadratic first integrals by explicit Runge-Kutta methods.
Adv. Comput. Math., 2010

2008
Sixth-order symmetric and symplectic exponentially fitted modified Runge-Kutta methods of Gauss type.
Comput. Phys. Commun., 2008

2007
On explicit multi-revolution Runge-Kutta schemes.
Adv. Comput. Math., 2007

2006
On the Preservation of Invariants by Explicit Runge-Kutta Methods.
SIAM J. Sci. Comput., 2006

2004
Two-step error estimators for implicit Runge-Kutta methods applied to stiff systems.
ACM Trans. Math. Softw., 2004

Approximate compositions of a near identity map by multi-revolution Runge-Kutta methods.
Numerische Mathematik, 2004

2003
On the Solution of Discontinuous IVPs by Adaptive Runge-Kutta Codes.
Numer. Algorithms, 2003

Two-Step High Order Starting Values for Implicit Runge-Kutta Methods.
Adv. Comput. Math., 2003

2000
On the iterative solution of the algebraic equations in fully implicit Runge-Kutta methods.
Numer. Algorithms, 2000

1998
On the convergence of Runge-Kutta methods for stiff non linear differential equations.
Numerische Mathematik, 1998

1997
Stepsize selection for tolerance proportionality in explicit Runge-Kutta codes.
Adv. Comput. Math., 1997

1993
On the change of step size in multistep codes.
Numer. Algorithms, 1993


  Loading...