Dario Bini

CoRR, 2023

2022

Numerical Solution of a Matrix Integral Equation Arising in Markov-Modulated Lévy Processes.

[BibT_eX]

[DOI]

Guy Latouche

SIAM J. Sci. Comput., August, 2022

A defect-correction algorithm for quadratic matrix equations, with applications to quasi-Toeplitz matrices.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Geometric means of quasi-Toeplitz matrices.

[BibT_eX]

[DOI]

Jie Meng

CoRR, 2021

Algorithms for Approximating Means of Semi-infinite Quasi-Toeplitz Matrices.

[BibT_eX]

[DOI]

Jie Meng

Proceedings of the Geometric Science of Information - 5th International Conference, 2021

2020

A Computational Framework for Two-Dimensional Random Walks With Restarts.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2020

Solving Quadratic Matrix Equations Arising in Random Walks in the Quarter Plane.

[BibT_eX]

[DOI]

Jie Meng

SIAM J. Matrix Anal. Appl., 2020

Numerical Analysis and Scientific Computation (NASCA18).

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2020

A family of fast fixed point iterations for M/G/1-type Markov chains.

[BibT_eX]

[DOI]

Guy Latouche

CoRR, 2020

2019

On the exponential of semi-infinite quasi-Toeplitz matrices.

[BibT_eX]

[DOI]

Numerische Mathematik, 2019

Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox.

[BibT_eX]

[DOI]

Stefano Massei

Leonardo Robol

Numer. Algorithms, 2019

2018

On quadratic matrix equations with infinite size coefficients encountered in QBD stochastic processes.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2018

Semi-infinite quasi-Toeplitz matrices with applications to QBD stochastic processes.

[BibT_eX]

[DOI]

Stefano Massei

Math. Comput., 2018

Why is Kemeny's constant a constant?

[BibT_eX]

[DOI]

J. Appl. Probab., 2018

2016

General Solution of the Poisson Equation for Quasi-Birth-and-Death Processes.

[BibT_eX]

[DOI]

SIAM J. Appl. Math., 2016

2014

Solving secular and polynomial equations: A multiprecision algorithm.

[BibT_eX]

[DOI]

Leonardo Robol

J. Comput. Appl. Math., 2014

Introduction to the special issue.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2014

A multiprecision algorithm for the solution of polynomials and polynomial eigenvalue problems.

[BibT_eX]

[DOI]

Leonardo Robol

Proceedings of the Symbolic-Numeric Computation 2014, 2014

2013

Locating the Eigenvalues of Matrix Polynomials.

[BibT_eX]

[DOI]

Vanni Noferini

Meisam Sharify

SIAM J. Matrix Anal. Appl., 2013

2012

SMCSolver and Q-MAM: tools for matrix-analytic methods.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2012

A compressed cyclic reduction for QBDs with low rank upper and lower transitions.

[BibT_eX]

[DOI]

Paola Favati

SIGMETRICS Perform. Evaluation Rev., 2012

Numerical Solution of Algebraic Riccati Equations.

[BibT_eX]

[DOI]

Fundamentals of algorithms 9, SIAM, ISBN: 978-1-611972-08-5, 2012

2011

On the solution of a quadratic vector equation arising in Markovian Binary Trees.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2011

A note on computing matrix geometric means.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2011

A Compressed Cyclic Reduction for QBD processes with Low-Rank Upper and Lower Transitions.

[BibT_eX]

[DOI]

Paola Favati

Proceedings of the Matrix-Analytic Methods in Stochastic Models, 2011

2010

Transforming algebraic Riccati equations into unilateral quadratic matrix equations.

[BibT_eX]

[DOI]

Numerische Mathematik, 2010

An effective matrix geometric mean satisfying the Ando-Li-Mathias properties.

[BibT_eX]

[DOI]

Math. Comput., 2010

A combined approach for evaluating papers, authors and scientific journals.

[BibT_eX]

[DOI]

Gianna M. Del Corso

Francesco Romani

J. Comput. Appl. Math., 2010

Preface.

[BibT_eX]

[DOI]

Michael W. Berry

Nicola Mastronardi

Stefano Serra Capizzano

J. Comput. Appl. Math., 2010

2009

The cyclic reduction algorithm: from Poisson equation to stochastic processes and beyond.

[BibT_eX]

[DOI]

Numer. Algorithms, 2009

Structured Markov chains solver: tool extension.

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, 2009

2008

Preface.

[BibT_eX]

[DOI]

Jan Verschelde

Theor. Comput. Sci., 2008

A Fast Newton's Method for a Nonsymmetric Algebraic Riccati Equation.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2008

The unitary completion and QR iterations for a class of structured matrices.

[BibT_eX]

[DOI]

Math. Comput., 2008

2007

Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank-One Perturbations of Unitary Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2007

Structured matrix-based methods for polynomial in-gcd: analysis and comparisons.

[BibT_eX]

[DOI]

Paola Boito

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

07461 Abstracts Collection -- Numerical Methods for Structured Markov Chains.

[BibT_eX]

[DOI]

Vaidyanathan Ramaswami

Marie-Ange Remiche

Peter G. Taylor

Proceedings of the Numerical Methods for Structured Markov Chains, 11.11. - 14.11.2007, 2007

07461 Executive Summary -- Numerical Methods for Structured Markov Chains.

[BibT_eX]

[DOI]

Vaidyanathan Ramaswami

Marie-Ange Remiche

Peter G. Taylor

Proceedings of the Numerical Methods for Structured Markov Chains, 11.11. - 14.11.2007, 2007

On the tail decay of M/G/1-type Markov renewal processes.

[BibT_eX]

[DOI]

Vaidyanathan Ramaswami

Proceedings of the Numerical Methods for Structured Markov Chains, 11.11. - 14.11.2007, 2007

From Algebraic Riccati equations to unilateral quadratic matrix equations: old and new algorithms.

[BibT_eX]

[DOI]

Proceedings of the Numerical Methods for Structured Markov Chains, 11.11. - 14.11.2007, 2007

Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms.

[BibT_eX]

[DOI]

Proceedings of the Numerical Methods for Structured Markov Chains, 11.11. - 14.11.2007, 2007

2006

Computing curve intersection by means of simultaneous iterations.

[BibT_eX]

[DOI]

Ana Marco

Numer. Algorithms, 2006

2005

The Ehrlich-Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem.

[BibT_eX]

[DOI]

Françoise Tisseur

SIAM J. Matrix Anal. Appl., 2005

Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations.

[BibT_eX]

[DOI]

Numerische Mathematik, 2005

Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis.

[BibT_eX]

[DOI]

Joab R. Winkler

Numer. Linear Algebra Appl., 2005

Solving quadratic matrix equations and factoring polynomials: new fixed point iterations based on Schur complements of Toeplitz matrices.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2005

Algorithms for the matrix pth root.

[BibT_eX]

[DOI]

Nicholas J. Higham

Numer. Algorithms, 2005

2004

Bernstein-Bezoutian matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

2003

Effective Fast Algorithms for Polynomial Spectral Factorization.

[BibT_eX]

[DOI]

Numer. Algorithms, 2003

Solving Toeplitz Least Squares Problems by Means of Newton's Iteration.

[BibT_eX]

[DOI]

Gianni Codevico

Marc Van Barel

Numer. Algorithms, 2003

2001

Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations.

[BibT_eX]

[DOI]

Numerische Mathematik, 2001

Inversion of circulant matrices over Zm.

[BibT_eX]

[DOI]

Math. Comput., 2001

2000

Global Existence and Relaxation Limit for Smooth Solutions to the Euler-Poisson Model for Semiconductors.

[BibT_eX]

[DOI]

Giuseppe Alì

Salvatore Rionero

SIAM J. Math. Anal., 2000

Design, analysis, and implementation of a multiprecision polynomial rootfinder.

[BibT_eX]

[DOI]

Giuseppe Fiorentino

Numer. Algorithms, 2000

1999

Effective Methods for Solving Banded Toeplitz Systems.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1999

On the parallel evaluation of a sparse polynomial at a point.

[BibT_eX]

[DOI]

Giuseppe Fiorentino

Numer. Algorithms, 1999

Solving Block Banded Block Toeplitz Systems with Structured Blocks: New Algorithms and Open Problems.

[BibT_eX]

Proceedings of the Large-Scale Scientific Computation for Engineering and Environmental Problems, 1999

1998

Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

1997

Improved cyclic reduction for solving queueing problems.

[BibT_eX]

[DOI]

Numer. Algorithms, 1997

1996

On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1996

Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel Matrices.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

Numerical computation of polynomial zeros by means of Aberth's method.

[BibT_eX]

[DOI]

Numer. Algorithms, 1996

Graeffe's, Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors.

[BibT_eX]

[DOI]

J. Complex., 1996

1995

Fast Parallel Computation of the Polynomial Remainder Sequence Via Bezout and Hankel Matrices.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

1994

Polynomial and matrix computations, 1st Edition.

[BibT_eX]

[DOI]

Progress in theoretical computer science 12, Birkhäuser, ISBN: 3764337869, 1994

1993

On a Matrix Algebra Related to the Discrete Hartley Transform.

[BibT_eX]

[DOI]

Paola Favati

SIAM J. Matrix Anal. Appl., April, 1993

Improved Parallel Polynomial Division.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Parallel Computations with Toeplitz-like and Hankel-like Matrices.

[BibT_eX]

[DOI]

Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1992

On the Complexity of Polynomial Zeros.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Practical improvement of the divide-and-conquer eigenvalue algorithms.

[BibT_eX]

[DOI]

Computing, 1992

Improved Parallel Polynomial Division and Its Extensions

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

On the evaluation of the Eigenvalues of a banded toeplitz block matrix.

[BibT_eX]

[DOI]

J. Complex., 1991

Parallel Complexity of Tridiagonal Symmetric Eigenvalue Problem.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Improved Parallel Computations with Matrices and Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

On the Euclidean Scheme for Polynomials Having Interlaced Real Zeros.

[BibT_eX]

[DOI]

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

A New Preconditioner for the Parallel Solution of Positive Definite Toeplitz Systems.

[BibT_eX]

[DOI]

Fabio Di Benedetto

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

Parallel Polynomial Computations by Recursive Processes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

1987

Tensor Rank and Border Rank of Band Toeplitz Matrices.

[BibT_eX]

[DOI]

Milvio Capovani

SIAM J. Comput., 1987

A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

1986

Polynomial division and its computational complexity.

[BibT_eX]

[DOI]

J. Complex., 1986

1985

Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

Algorithms for Polynominal Division.

[BibT_eX]

[DOI]

Proceedings of the EUROCAL '85, 1985

1984

On Commutativity and Approximation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

Parallel Solution of Certain Toeplitz Linear Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1984

1982

Reply to the Paper "The Numerical Instability of Bini's Algorithm".

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

1980

Approximate Solutions for the Bilinear Form Computational Problem.

[BibT_eX]

[DOI]

Grazia Lotti

Francesco Romani

SIAM J. Comput., 1980

Border Rank of a pxqx2 Tensor and the Optimal Approximation od a Pair of Bilinear Forms.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

O(n2.7799) Complexity for n*n Approximate Matrix Multiplication.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1979

Lower Bounds of the Complexity of Linear Algebras.

[BibT_eX]

[DOI]