default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDario Bini
Dario A. Bini – Dario Andrea Bini
Person information
- affiliation: University of Pisa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i16]Dario Bini, Beatrice Meini:
On certain matrix algebras related to quasi-Toeplitz matrices. CoRR abs/2405.03483 (2024)- 2023
- [j65]Dario A. Bini, Bruno Iannazzo, Beatrice Meini, Jie Meng, Leonardo Robol:
Computing eigenvalues of semi-infinite quasi-Toeplitz matrices. Numer. Algorithms 92(1): 89-118 (2023) - [j64]Diego Altafini
, Dario A. Bini, Valerio Cutini, Beatrice Meini, Federico Poloni:
An Edge Centrality Measure Based on the Kemeny Constant. SIAM J. Matrix Anal. Appl. 44(2): 648-669 (2023) - [i15]Dario A. Bini:
Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis. CoRR abs/2307.12009 (2023) - [i14]Dario Andrea Bini, Fabio Durastante, Sooyeong Kim, Beatrice Meini:
On Kemeny's constant and stochastic complement. CoRR abs/2312.13201 (2023) - 2022
- [j63]Dario Bini, Guy Latouche, Beatrice Meini:
Numerical Solution of a Matrix Integral Equation Arising in Markov-Modulated Lévy Processes. SIAM J. Sci. Comput. 44(4): 2669- (2022) - [i13]Diego Altafini, Dario Andrea Bini, Valerio Cutini, Beatrice Meini, Federico Poloni:
An edge centrality measure based on the Kemeny constant. CoRR abs/2203.06459 (2022) - [i12]Dario A. Bini, Bruno Iannazzo, Beatrice Meini, Jie Meng, Leonardo Robol:
Computing eigenvalues of semi-infinite quasi-Toeplitz matrices. CoRR abs/2203.06484 (2022) - [i11]Dario Bini, Beatrice Meini:
A defect-correction algorithm for quadratic matrix equations, with applications to quasi-Toeplitz matrices. CoRR abs/2212.09491 (2022) - 2021
- [c17]Dario A. Bini, Bruno Iannazzo, Jie Meng:
Algorithms for Approximating Means of Semi-infinite Quasi-Toeplitz Matrices. GSI 2021: 405-414 - [i10]Dario A. Bini, Bruno Iannazzo, Jie Meng:
Geometric means of quasi-Toeplitz matrices. CoRR abs/2102.04302 (2021) - [i9]Dario A. Bini, Guy Latouche, Beatrice Meini:
Numerical solution of a matrix integral equation arising in Markov Modulated Lévy processes. CoRR abs/2107.11611 (2021) - 2020
- [j62]Dario Bini, Khalide Jbilou, Marilena Mitrouli, Lothar Reichel:
Numerical Analysis and Scientific Computation (NASCA18). J. Comput. Appl. Math. 373: 112612 (2020) - [j61]Dario A. Bini, Beatrice Meini, Jie Meng:
Solving Quadratic Matrix Equations Arising in Random Walks in the Quarter Plane. SIAM J. Matrix Anal. Appl. 41(2): 691-714 (2020) - [j60]Dario A. Bini, Stefano Massei, Beatrice Meini, Leonardo Robol:
A Computational Framework for Two-Dimensional Random Walks With Restarts. SIAM J. Sci. Comput. 42(4): A2108-A2133 (2020) - [i8]Dario Andrea Bini, Guy Latouche, Beatrice Meini:
A family of fast fixed point iterations for M/G/1-type Markov chains. CoRR abs/2008.11051 (2020)
2010 – 2019
- 2019
- [j59]Dario A. Bini, Stefano Massei, Leonardo Robol:
Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox. Numer. Algorithms 81(2): 741-769 (2019) - [j58]Dario A. Bini, Beatrice Meini:
On the exponential of semi-infinite quasi-Toeplitz matrices. Numerische Mathematik 141(2): 319-351 (2019) - [i7]Dario A. Bini, Beatrice Meini, Jie Meng:
Solving quadratic matrix equations arising in random walks in the quarter plane. CoRR abs/1907.09796 (2019) - [i6]Dario A. Bini, Stefano Massei, Beatrice Meini, Leonardo Robol:
A computational framework for two-dimensional random walks with restarts. CoRR abs/1909.11372 (2019) - 2018
- [j57]Dario Bini, Jeffrey J. Hunter, Guy Latouche, Beatrice Meini, Peter G. Taylor:
Why is Kemeny's constant a constant? J. Appl. Probab. 55(4): 1025-1036 (2018) - [j56]Dario A. Bini, Stefano Massei, Beatrice Meini:
Semi-infinite quasi-Toeplitz matrices with applications to QBD stochastic processes. Math. Comput. 87(314): 2811-2830 (2018) - [j55]Dario A. Bini, Stefano Massei, Beatrice Meini, Leonardo Robol:
On quadratic matrix equations with infinite size coefficients encountered in QBD stochastic processes. Numer. Linear Algebra Appl. 25(6) (2018) - 2016
- [j54]Dario Bini, Sarah Dendievel, Guy Latouche, Beatrice Meini:
General Solution of the Poisson Equation for Quasi-Birth-and-Death Processes. SIAM J. Appl. Math. 76(6): 2397-2417 (2016) - 2014
- [j53]Dario A. Bini, Lieven De Lathauwer, Nicola Mastronardi, Marc Van Barel, Raf Vandebril, Paul Van Dooren:
Introduction to the special issue. J. Comput. Appl. Math. 272: 275 (2014) - [j52]Dario A. Bini, Leonardo Robol:
Solving secular and polynomial equations: A multiprecision algorithm. J. Comput. Appl. Math. 272: 276-292 (2014) - [c16]Dario A. Bini, Leonardo Robol:
A multiprecision algorithm for the solution of polynomials and polynomial eigenvalue problems. SNC 2014: 17-18 - 2013
- [j51]Dario A. Bini, Vanni Noferini, Meisam Sharify:
Locating the Eigenvalues of Matrix Polynomials. SIAM J. Matrix Anal. Appl. 34(4): 1708-1727 (2013) - 2012
- [b2]Dario Bini, Bruno Iannazzo, Beatrice Meini:
Numerical Solution of Algebraic Riccati Equations. Fundamentals of algorithms 9, SIAM 2012, ISBN 978-1-611972-08-5, pp. I-XVI, 1-250 - [j50]Dario Andrea Bini, Paola Favati, Beatrice Meini:
A compressed cyclic reduction for QBDs with low rank upper and lower transitions. SIGMETRICS Perform. Evaluation Rev. 39(4): 33 (2012) - [j49]Dario Bini, Beatrice Meini, S. Steffé, Juan F. Pérez, Benny Van Houdt:
SMCSolver and Q-MAM: tools for matrix-analytic methods. SIGMETRICS Perform. Evaluation Rev. 39(4): 46 (2012) - 2011
- [j48]Dario Andrea Bini, Bruno Iannazzo:
A note on computing matrix geometric means. Adv. Comput. Math. 35(2-4): 175-192 (2011) - [j47]Dario A. Bini, Beatrice Meini, Federico Poloni:
On the solution of a quadratic vector equation arising in Markovian Binary Trees. Numer. Linear Algebra Appl. 18(6): 981-991 (2011) - [c15]Dario A. Bini, Paola Favati, Beatrice Meini:
A Compressed Cyclic Reduction for QBD processes with Low-Rank Upper and Lower Transitions. MAM 2011: 25-40 - 2010
- [j46]Michael W. Berry, Dario Andrea Bini, Nicola Mastronardi, Stefano Serra-Capizzano:
Preface. J. Comput. Appl. Math. 234(11): 3073-3074 (2010) - [j45]Dario Bini, Gianna M. Del Corso, Francesco Romani:
A combined approach for evaluating papers, authors and scientific journals. J. Comput. Appl. Math. 234(11): 3104-3121 (2010) - [j44]Dario Andrea Bini, Beatrice Meini, Federico Poloni:
An effective matrix geometric mean satisfying the Ando-Li-Mathias properties. Math. Comput. 79(269): 437-452 (2010) - [j43]Dario A. Bini, Beatrice Meini, Federico Poloni:
Transforming algebraic Riccati equations into unilateral quadratic matrix equations. Numerische Mathematik 116(4): 553-578 (2010)
2000 – 2009
- 2009
- [j42]Dario Andrea Bini, Beatrice Meini:
The cyclic reduction algorithm: from Poisson equation to stochastic processes and beyond. Numer. Algorithms 51(1): 23-60 (2009) - [c14]Dario Bini, Beatrice Meini, S. Steffé, Benny Van Houdt:
Structured Markov chains solver: tool extension. VALUETOOLS 2009: 20 - 2008
- [j41]Dario Andrea Bini, Yuli Eidelman, Luca Gemignani, Israel Gohberg:
The unitary completion and QR iterations for a class of structured matrices. Math. Comput. 77(261): 353-378 (2008) - [j40]Dario Bini, Bruno Iannazzo, Federico Poloni:
A Fast Newton's Method for a Nonsymmetric Algebraic Riccati Equation. SIAM J. Matrix Anal. Appl. 30(1): 276-290 (2008) - [j39]Dario Andrea Bini, Victor Y. Pan, Jan Verschelde:
Preface. Theor. Comput. Sci. 409(2): 155-157 (2008) - [e1]Dario Bini, Beatrice Meini, Vaidyanathan Ramaswami, Marie-Ange Remiche, Peter G. Taylor:
Numerical Methods for Structured Markov Chains, 11.11. - 14.11.2007. Dagstuhl Seminar Proceedings 07461, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - 2007
- [j38]Dario Andrea Bini, Yuli Eidelman, Luca Gemignani, Israel Gohberg:
Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank-One Perturbations of Unitary Matrices. SIAM J. Matrix Anal. Appl. 29(2): 566-585 (2007) - [c13]Dario Andrea Bini, Paola Boito:
Structured matrix-based methods for polynomial in-gcd: analysis and comparisons. ISSAC 2007: 9-16 - [i5]Dario Andrea Bini, Bruno Iannazzo, Beatrice Meini, Federico Poloni:
Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms. Numerical Methods for Structured Markov Chains 2007 - [i4]Dario Andrea Bini, Beatrice Meini, Federico Poloni:
From Algebraic Riccati equations to unilateral quadratic matrix equations: old and new algorithms. Numerical Methods for Structured Markov Chains 2007 - [i3]Dario Andrea Bini, Beatrice Meini, Vaidyanathan Ramaswami:
On the tail decay of M/G/1-type Markov renewal processes. Numerical Methods for Structured Markov Chains 2007 - [i2]Dario Andrea Bini, Beatrice Meini, Vaidyanathan Ramaswami, Marie-Ange Remiche, Peter G. Taylor:
07461 Executive Summary -- Numerical Methods for Structured Markov Chains. Numerical Methods for Structured Markov Chains 2007 - [i1]Dario Andrea Bini, Beatrice Meini, Vaidyanathan Ramaswami, Marie-Ange Remiche, Peter G. Taylor:
07461 Abstracts Collection -- Numerical Methods for Structured Markov Chains. Numerical Methods for Structured Markov Chains 2007 - 2006
- [j37]Dario Andrea Bini, Ana Marco:
Computing curve intersection by means of simultaneous iterations. Numer. Algorithms 43(2): 151-175 (2006) - 2005
- [j36]Dario Andrea Bini, Nicholas J. Higham, Beatrice Meini:
Algorithms for the matrix pth root. Numer. Algorithms 39(4): 349-378 (2005) - [j35]Dario A. Bini, Luca Gemignani:
Solving quadratic matrix equations and factoring polynomials: new fixed point iterations based on Schur complements of Toeplitz matrices. Numer. Linear Algebra Appl. 12(2-3): 181-189 (2005) - [j34]Dario A. Bini, Luca Gemignani, Joab R. Winkler:
Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis. Numer. Linear Algebra Appl. 12(8): 685-698 (2005) - [j33]Dario A. Bini, Luca Gemignani, Victor Y. Pan:
Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations. Numerische Mathematik 100(3): 373-408 (2005) - [j32]Dario Andrea Bini, Luca Gemignani, Françoise Tisseur:
The Ehrlich-Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem. SIAM J. Matrix Anal. Appl. 27(1): 153-175 (2005) - 2004
- [j31]Dario Bini, Luca Gemignani:
Bernstein-Bezoutian matrices. Theor. Comput. Sci. 315(2-3): 319-333 (2004) - 2003
- [j30]Dario A. Bini, Gianni Codevico, Marc Van Barel:
Solving Toeplitz Least Squares Problems by Means of Newton's Iteration. Numer. Algorithms 33(1-4): 93-103 (2003) - [j29]Dario Andrea Bini, Giuseppe Fiorentino, Luca Gemignani, Beatrice Meini:
Effective Fast Algorithms for Polynomial Spectral Factorization. Numer. Algorithms 34(2-4): 217-227 (2003) - 2001
- [j28]Dario Bini, Gianna M. Del Corso, Giovanni Manzini, Luciano Margara:
Inversion of circulant matrices over Zm. Math. Comput. 70(235): 1169-1182 (2001) - [j27]Dario Andrea Bini, Luca Gemignani, Beatrice Meini:
Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations. Numerische Mathematik 89(1): 49-82 (2001) - 2000
- [j26]Dario Andrea Bini, Giuseppe Fiorentino:
Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numer. Algorithms 23(2-3): 127-173 (2000) - [j25]Giuseppe Alì, Dario Bini, Salvatore Rionero:
Global Existence and Relaxation Limit for Smooth Solutions to the Euler-Poisson Model for Semiconductors. SIAM J. Math. Anal. 32(3): 572-587 (2000)
1990 – 1999
- 1999
- [j24]Dario Andrea Bini, Giuseppe Fiorentino:
On the parallel evaluation of a sparse polynomial at a point. Numer. Algorithms 20(4): 323-329 (1999) - [j23]Dario Andrea Bini, Beatrice Meini:
Effective Methods for Solving Banded Toeplitz Systems. SIAM J. Matrix Anal. Appl. 20(3): 700-719 (1999) - [c12]Dario Bini, Beatrice Meini:
Solving Block Banded Block Toeplitz Systems with Structured Blocks: New Algorithms and Open Problems. LSSC 1999: 15-24 - 1998
- [j22]Dario Bini, Victor Y. Pan:
Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real. SIAM J. Comput. 27(4): 1099-1115 (1998) - [c11]Dario Bini, Gianna M. Del Corso, Giovanni Manzini, Luciano Margara:
Inversion of Circulant Matrices over Zm. ICALP 1998: 719-730 - 1997
- [j21]Dario Andrea Bini, Beatrice Meini:
Improved cyclic reduction for solving queueing problems. Numer. Algorithms 15(1): 57-74 (1997) - 1996
- [j20]Dario Bini, Victor Y. Pan:
Graeffe's, Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors. J. Complex. 12(4): 492-511 (1996) - [j19]Dario Andrea Bini:
Numerical computation of polynomial zeros by means of Aberth's method. Numer. Algorithms 13(2): 179-200 (1996) - [j18]Dario Bini, Luca Gemignani:
Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel Matrices. SIAM J. Comput. 25(6): 1358 (1996) - [j17]Dario Bini, Beatrice Meini:
On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems. SIAM J. Matrix Anal. Appl. 17(4): 906-926 (1996) - 1995
- [j16]Dario Bini, Luca Gemignani:
Fast Parallel Computation of the Polynomial Remainder Sequence Via Bezout and Hankel Matrices. SIAM J. Comput. 24(1): 63-77 (1995) - 1994
- [b1]Dario Bini, Victor Y. Pan:
Polynomial and matrix computations, 1st Edition. Progress in theoretical computer science 12, Birkhäuser 1994, ISBN 3764337869, pp. I-XVI, 1-415 - 1993
- [j15]Dario Bini, Victor Y. Pan:
Improved Parallel Polynomial Division. SIAM J. Comput. 22(3): 617-626 (1993) - [j14]Dario Bini, Paola Favati:
On a Matrix Algebra Related to the Discrete Hartley Transform. SIAM J. Matrix Anal. Appl. 14(2): 500-507 (1993) - [c10]Dario Bini, Victor Y. Pan:
Parallel Computations with Toeplitz-like and Hankel-like Matrices. ISSAC 1993: 193-200 - 1992
- [j13]Dario Bini, Victor Y. Pan:
Practical improvement of the divide-and-conquer eigenvalue algorithms. Computing 48(1): 109-123 (1992) - [j12]Dario Bini, Luca Gemignani:
On the Complexity of Polynomial Zeros. SIAM J. Comput. 21(4): 781-799 (1992) - [c9]Dario Bini, Victor Y. Pan:
Improved Parallel Polynomial Division and Its Extensions. FOCS 1992: 131-136 - 1991
- [j11]Dario Bini, Victor Y. Pan:
On the evaluation of the Eigenvalues of a banded toeplitz block matrix. J. Complex. 7(4): 408-424 (1991) - [c8]Dario Bini, Luca Gemignani, Victor Y. Pan:
Improved Parallel Computations with Matrices and Polynomials. ICALP 1991: 520-531 - [c7]Dario Bini, Victor Y. Pan:
Parallel Complexity of Tridiagonal Symmetric Eigenvalue Problem. SODA 1991: 384-393 - 1990
- [c6]Dario Bini, Victor Y. Pan:
Parallel Polynomial Computations by Recursive Processes. ISSAC 1990: 294 - [c5]Dario Bini, Fabio Di Benedetto:
A New Preconditioner for the Parallel Solution of Positive Definite Toeplitz Systems. SPAA 1990: 220-223 - [c4]Dario Bini, Luca Gemignani:
On the Euclidean Scheme for Polynomials Having Interlaced Real Zeros. SPAA 1990: 254-258
1980 – 1989
- 1987
- [j10]Dario Bini, Victor Y. Pan:
A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division. Inf. Process. Lett. 24(4): 233-237 (1987) - [j9]Dario Bini, Milvio Capovani:
Tensor Rank and Border Rank of Band Toeplitz Matrices. SIAM J. Comput. 16(2): 252-258 (1987) - 1986
- [j8]Dario Bini, Victor Y. Pan:
Polynomial division and its computational complexity. J. Complex. 2(3): 179-203 (1986) - [c3]Dario Bini, Victor Y. Pan:
A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division. Aegean Workshop on Computing 1986: 246-251 - 1985
- [j7]Dario Bini, Victor Y. Pan:
Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power. Inf. Process. Lett. 21(2): 79-81 (1985) - [c2]Dario Bini, Victor Y. Pan:
Algorithms for Polynominal Division. European Conference on Computer Algebra (2) 1985: 1-3 - 1984
- [j6]Dario Bini:
Parallel Solution of Certain Toeplitz Linear Systems. SIAM J. Comput. 13(2): 268-276 (1984) - [j5]Dario Bini:
On Commutativity and Approximation. Theor. Comput. Sci. 28: 135-150 (1984) - 1982
- [j4]Dario Bini:
Reply to the Paper "The Numerical Instability of Bini's Algorithm". Inf. Process. Lett. 14(3): 144-145 (1982) - 1980
- [j3]Dario Bini, Grazia Lotti, Francesco Romani:
Approximate Solutions for the Bilinear Form Computational Problem. SIAM J. Comput. 9(4): 692-697 (1980) - [c1]Dario Bini:
Border Rank of a pxqx2 Tensor and the Optimal Approximation od a Pair of Bilinear Forms. ICALP 1980: 98-108
1970 – 1979
- 1979
- [j2]Dario Bini, Milvio Capovani, Francesco Romani, Grazia Lotti:
O(n2.7799) Complexity for n*n Approximate Matrix Multiplication. Inf. Process. Lett. 8(5): 234-235 (1979) - [j1]Dario Bini, Milvio Capovani:
Lower Bounds of the Complexity of Linear Algebras. Inf. Process. Lett. 9(1): 46-47 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-17 23:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
