• Non ci sono risultati.

Elenco lavori pubblicati su rivista.

N/A
N/A
Protected

Academic year: 2022

Condividi "Elenco lavori pubblicati su rivista."

Copied!
2
0
0

Testo completo

(1)

Elenco lavori pubblicati su rivista.

1. M. Ancona, C. Fassino, V. Giannuzzi: Optimization of LR(k) Reduced Parsers. Information Processing Letters, 41 (1992).

2. B. Codenotti, C. Fassino: Error Analysis of Two Algorithms for the Computation of the Matrix Exponential.Calcolo, 1-2 (1992).

3. M. Arioli, B. Codenotti, C. Fassino: The Pade’ Method for Computing the Matrix Exponential.Linear Algebra and Its Applications, 240, p.

111-130 (1996).

4. M. Arioli, C. Fassino: Roundoff Error Analysis of Algorithms Based on Krylov Subspace Methods.BIT, 36, (2), p.189-205 (1996).

5. C. Fassino, G. Manzini: Fast-Secant Algorithms for the Non-Linear Richards’ Equation. Communications in Numerical Methods in Engi- neering, 14 (10), p. 921-930 (1998).

6. C. Fassino: On Updating the Least Singular Value: a Lower Bound.

Calcolo, Volume 40, Number 4, 213-229, (December 2003).

7. C. Fassino: ”On the belonging of a perturbed vector to a subspace from a numerical point of view”. Applied mathemtics e-Notes (AMEN) Volume 7 (2007), 65–70

8. J. Abbott, C. Fassino, M. Torrente: ”Thinning Out Redundant Em- pirical Data.” Mathematics in Computer Science, 1(2):375-392. (2007) 9. J. Abbott, C. Fassino, M. Torrente: ”Stable border basis for ideals of

points.” Journal of symbolic computation, 43 (2008) 883–894

10. C. Fassino: ”Almost Vanishing Polynomials for Sets of Limited Pre- cision Points.” Journal of symbolic computation, 45, Issue 1, (2010) 19–37

11. F. Ricceri, C. Fassino, G. Matullo, M. Roggero, M.-L. Torrente, P.

Vineis, L. Terracini:”Algebraic Methods for Studying Interactions Be- tween Epidemiological Variables” Math. Model. Nat. Phenom. Vol.

7, No. 3, (2012), 227252

(2)

12. C. Fassino, M. Torrente: ”Simple varieties for limited precision points

” Theoretical Computer Science, 479 (2013) 174–186

13. 13. C. Fassino, G. Pistone, E. Riccomagno:” The algebra of interpo- latory cubature formul for generic nodes” Statistics and Computing – IN STAMPA (2013)

Elenco lavori presentati a convegni.

1. B. Codenotti, C. Fassino: “Numerical Computation of the Matrix Exponential”.The Seventh Haifa Matrix Theory Conference, (1991), Haifa.

2. M. Arioli, B. Codenotti, C. Fassino: “Error Analysis of Three Methods for Computing the Matrix Exponential”.ERCIM Workshop on Numer- ical Linear Algebra, (1992) Pisa.

3. C. Fassino, G. Manzini: “Newton and Quasi-Newton Methods for the Non-Linear Richards’ Equation”.Computational Methods in Water Re- sources Proceedings (CMWR) (1998).

4. C. Fassino:“A robust monomial quotient basis for approximate points.”

ACM Commun. Comput. Algebra, volume 40, n. 2, 2006, ACM Press, New York, NY, USA

5. 5. C. Fassino, M. Popoviciu, M. Torrente (2009). “Approximate vari- eties for empirical points.” MEGA 2009. Barcellona (Spagna), (2009) 6. C. Fassino, M. Torrente” “Zero-dimensional ideals of limited precision

points.” ACM Communications in Computer Algebra, Issue 181, 90-91.

Grenoble –Francia (2012)

Tesi di Dottorato

1. C. Fassino:“Computation of Matrix Function”. Dottorato in Informat- ica, Universita‘ di Pisa, (1993).

Riferimenti

Documenti correlati

Keywords: Backward error estimate for the matrix exponential, overscaling, multiple precision floating point computation, scaling and squaring algorithm, Paterson–Stockmeyer

[r]

The scheme is presented in the format of Discontinuous Galerkin methods, and error bounds are given, proving O(h 1/2 ) convergence in the L 2 -norm for the scalar variable, which

[Context and motivation] The outbreak of the COVID-19 pandemic has highlighted the general unpre- paredness of the research community to face biological data challenges in a

lento veloce debole forte piccolo grande stretto largo cattivo buono brutto bello chiuso aperto ricco povero basso alto corto lungo morto vivo femminile maschile vuoto pieno amaro

Porter “ Strategy and society: the link between competitive advantage and corporate social responsibility ” Harvard business review, 2006..

Indeed, at any time during the construction of the Branch-and-Bound tree we know a lower bound LB (given by the value of the incumbent solution), but also an upper bound U B, given