IIT Home Page CNR Home Page

Numerical Methods for Large Problems

This activity is aimed at the analysis and development of algorithms for the solution of very large linear systems (i.e., 10,000 equations and 10,000 variables). These problems are often associated to queue problems or arise in the discretization of infinite domain differential equations. A second topic concerns the study of iterative methods for ill-conditioned problems, like in some problems of image reconstruction. A third reseach activity concerns the analysis of the stability properties of “fast” methods for the solution of structured linear systems.

05-2009

Research theme: Algorithms and Computational Mathematics

Partecipants:

Representative: Paola Favati

Foto di Paola Favati
Publication
Favati P., Lotti G., Menchi O.
A Divide and Conquer Algorithm for the Superfast solution of Toeplitz-like Systems
2012, SIAM. J. Matrix Anal. & Appl.
D.A. Bini; F. Brezzi; B. Codenotti; P. Favati; S. Seatzu, editori
Calcolo, A Quarterly on Numerical Analysis and Theory of Computation Vol. 49
2012
Dario Bini, Paola Favati, Beatrice Meini
A compressed cyclic reduction for QBDs with low rank upper and lower transitions
2011, The Seventh International Conference on Matrix-Analytic Methods in Stochastic Models (MAM7)
Franco Brezzi, Dario Bini, Sebastiano Seatzu, Gianfranco Capriz, Bruno Codenotti, Paola Favati, editori
Calcolo. a Quarterly on Numerical Analysis and Theory of Computation, Vol. 48 n.1,n.2, n.3, n.4
2011
Paola Favati, Grazia Lotti, Ornella Menchi, Francesco Romani
Stopping rules for iterative methods in nonnegatively constrained deconvolution
2011
Paola Favati, Grazia Lotti, Ornella Menchi
Superfast solution of Toeplitz-like systems
2011
Favati P., Lotti G., Menchi O., Romani F.
A coupled model for the indegree and outdegree analysis of the Web
2010, Internet Mathematics