Dario A. Bini's home page

Dipartimento di Matematica
largo Bruno Pontecorvo, 5
56127 Pisa
Italy

D.A. Bini Dario Andrea Bini
Professor Emeritus
E-mail: dario.bini [at] unipi.it

Dario Andrea Bini on Google Scholar, Research Gate, Scopus, and MathSciNet

Books:

D.A. Bini, B. Iannazzo, B. Meini, Numerical Solution of Algebraic Riccati Equations, SIAM Book Series Fundamentals of Algorithms, 2012
D.A. Bini, G. Latouche, B. Meini, Numerical Methods for Structured Markov Chains, Oxford University Press, 2005
D. Bini and V. Pan, Polynomial and Matrix Computations, Vol 1: Fundamental Algorithms, Birkhauser, Boston 1994.
D. Bini, M. Capovani, G. Lotti, F. Romani, Complessità Numerica, Boringhieri 1981.
R. Bevilacqua, D. Bini, M. Capovani, O. Menchi, Introduzione Alla Matematica Computazionale, Zanichelli, Bologna 1987
D. Bini, M. Capovani, O. Menchi, Metodi Numerici per l'Algebra Lineare, Zanichelli, Bologna 1988. [La versione digitale dell'opera può essere scaricata ma non può in nessun modo essere commercializzata]
R. Bevilacqua, D. Bini, M. Capovani, O. Menchi, Metodi Numerici, Zanichelli, Bologna 1992. [La versione digitale dell'opera può essere scaricata ma non può in nessun modo essere commercializzata]

Papers:

Software:

Matlab files from the book: Numerical Solution of Algebraic Riccati Equations, SIAM 2012.
SMCSolver, A Fortran 90 software tool, with a user friendly GUI, for solving Structured Markov Chains
MPSolve v. 2.2, A package for computing guaranteed approximations to polynomial zeros with arbitrarily large precision
MPSolve v. 3.1.4, A package for computing guaranteed approximations to polynomial zeros with arbitrarily large precision. You can find here a picture of the roots of the Mandelbrot polynomial of degree 2^(21)-1=2.097.151 computed by MPSolve in about 10 days with a dual Xeon server. You can download the numerical values of the computed roots of this polynomial. You can find here a picture of the roots of the Mandelbrot polynomial of degree 2^(22)-1=4.194.303 computed by MPSolve in about 47 days with a dual Xeon server. You can download the numerical values of the computed roots of this polynomial.
MPSolve in Wikipedia
pzeros, A fortran77 package for computing polynomial zeros based on the Ehrlich-Aberth iteration
pzeros in Fortran 90
Eigensolve v.1.1, Solving the tridiagonal eigenvalue problem by means of the Ehrlich-Aberth iteration

Editorial: member of the editorial board of

Useful links