| 2009 |
|---|
| 11 | EE | R. D'Ambrosio,
M. Ferro,
Beatrice Paternoster:
Two-step hybrid collocation methods for y"=f(x, y).
Appl. Math. Lett. 22(7): 1076-1080 (2009) |
| 2008 |
|---|
| 10 | EE | R. D'Ambrosio,
M. Ferro,
Beatrice Paternoster:
Collocation-Based Two Step Runge-Kutta Methods for Ordinary Differential Equations.
ICCSA (2) 2008: 736-751 |
| 9 | EE | D. Conte,
Zdzislaw Jackiewicz,
Beatrice Paternoster:
Two-step almost collocation methods for Volterra integral equations.
Applied Mathematics and Computation 204(2): 839-853 (2008) |
| 2006 |
|---|
| 8 | EE | Beatrice Paternoster:
A General Family of Two Step Runge-Kutta-Nyström Methods for y" = f(x, y) Based on Algebraic Polynomials.
International Conference on Computational Science (4) 2006: 700-707 |
| 7 | EE | Marco Carpentieri,
Beatrice Paternoster:
Stability analysis of frequency and step length dependent Runge-Kutta-Nyström methods.
Future Generation Comp. Syst. 22(4): 395-402 (2006) |
| 2004 |
|---|
| 6 | EE | Silvana Martucci,
Beatrice Paternoster:
Vandermonde-Type Matrices in Two Step Collocation Methods for Special Second Order Ordinary Differential Equations.
International Conference on Computational Science 2004: 418-425 |
| 5 | EE | Liviu Gr. Ixaru,
Beatrice Paternoster:
Function Fitting Two-Step BDF Algorithms for ODEs.
International Conference on Computational Science 2004: 443-450 |
| 2003 |
|---|
| 4 | EE | Beatrice Paternoster:
Two Step Runge-Kutta-Nyström Methods for Oscillatory Problems Based on Mixed Polynomials.
International Conference on Computational Science 2003: 131-138 |
| 2002 |
|---|
| 3 | EE | Beatrice Paternoster:
Two Step Runge-Kutta-Nyström Methods for y'' = f(x, y) and P-Stability.
International Conference on Computational Science (3) 2002: 459-466 |
| 1998 |
|---|
| 2 | | Beatrice Paternoster,
M. Sessa:
A Workload Characterization by Clustering Technique.
Computers and Artificial Intelligence 17(4): (1998) |
| 1 | | Beatrice Paternoster,
Massimo Cafaro:
Computation of the Interval of Stability of Runge-Kutta-Nyström Methods.
J. Symb. Comput. 25(3): 383-394 (1998) |
