Luca Gemignani

CoRR, 2024

2023

Relaxed fixed point iterations for matrix equations arising in Markov chain modeling.

[BibT_eX]

[DOI]

Beatrice Meini

Numer. Algorithms, September, 2023

Efficient Inversion of Matrix φ-Functions of Low Order.

[BibT_eX]

[DOI]

CoRR, 2023

Experimental Study of a Parallel Iterative Solver for Markov Chain Modeling.

[BibT_eX]

[DOI]

Valerio Besozzi

M. Della Bartola

Proceedings of the Computational Science - ICCS 2023, 2023

2022

Orthogonal Iterations on Companion-Like Pencils.

[BibT_eX]

[DOI]

J. Sci. Comput., 2022

An Acceleration of Fixed Point Iterations for M/G/1-type Markov Chains by Means of Relaxation Techniques.

[BibT_eX]

[DOI]

Beatrice Meini

CoRR, 2022

Bezout-like polynomial equations associated with dual univariate interpolating subdivision schemes.

[BibT_eX]

[DOI]

Alberto Viscardi

Adv. Comput. Math., 2022

Computing the reciprocal of a ϕ-function by rational approximation.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2022

2021

Comparison Theorems for Splittings of M-matrices in (block) Hessenberg Form.

[BibT_eX]

[DOI]

Federico Poloni

CoRR, 2021

Orthogonal iterations on Structured Pencils.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2020

Fast QR iterations for unitary plus low rank matrices.

[BibT_eX]

[DOI]

Numerische Mathematik, 2020

2018

Efficient solution of parameter-dependent quasiseparable systems and computation of meromorphic matrix functions.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2018

2017

Fast Hessenberg Reduction of Some Rank Structured Matrices.

[BibT_eX]

[DOI]

Leonardo Robol

SIAM J. Matrix Anal. Appl., 2017

2016

Implicit QR for companion-like pencils.

[BibT_eX]

[DOI]

Math. Comput., 2016

Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2016

2015

A CMV-Based Eigensolver for Companion Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2015

Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2015

2014

On the simultaneous refinement of the zeros of H-palindromic polynomials.

[BibT_eX]

[DOI]

Simone Brugiapaglia

J. Comput. Appl. Math., 2014

2013

A constructive algebraic strategy for interpolatory subdivision schemes induced by bivariate box splines.

[BibT_eX]

[DOI]

Costanza Conti

Adv. Comput. Math., 2013

2012

Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials.

[BibT_eX]

[DOI]

Vanni Noferini

Numer. Algorithms, 2012

2011

On some classes of structured matrices with algebraic trigonometric eigenvalues.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2011

From approximating to interpolatory non-stationary subdivision schemes with the same generation properties.

[BibT_eX]

[DOI]

Costanza Conti

Adv. Comput. Math., 2011

2010

Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes.

[BibT_eX]

[DOI]

Costanza Conti

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

2008

Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations.

[BibT_eX]

[DOI]

Israel Gohberg

Numer. Algorithms, 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 eigenvalue problems for rational gauss quadrature.

[BibT_eX]

[DOI]

Dario Fasino

Numer. Algorithms, 2007

Structured matrix methods for polynomial root-finding.

[BibT_eX]

[DOI]

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

2005

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

[BibT_eX]

[DOI]

Dario Andrea Bini

Françoise Tisseur

SIAM J. Matrix Anal. Appl., 2005

Orthogonal Rational Functions and Structured Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2005

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

[BibT_eX]

[DOI]

Dario A. Bini

Victor Y. Pan

Numerische Mathematik, 2005

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

[BibT_eX]

[DOI]

Dario A. Bini

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]

Dario A. Bini

Numer. Linear Algebra Appl., 2005

2004

Bernstein-Bezoutian matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Rounding Error Analysis in Solving M-Matrix Linear Systems of Block Hessenberg Form.

[BibT_eX]

[DOI]

Grazia Lotti

Numer. Algorithms, 2004

2003

Efficient and Stable Solution of M-Matrix Linear Systems of (Block) Hessenberg Form.

[BibT_eX]

[DOI]

Grazia Lotti

SIAM J. Matrix Anal. Appl., 2003

Direct and Inverse Eigenvalue Problems for Diagonal-Plus-Semiseparable Matrices.

[BibT_eX]

[DOI]

Dario Fasino

Numer. Algorithms, 2003

Effective Fast Algorithms for Polynomial Spectral Factorization.

[BibT_eX]

[DOI]

Numer. Algorithms, 2003

2002

A Lanczos-type algorithm for the QR factorization of regular Cauchy matrices.

[BibT_eX]

[DOI]

Dario Fasino

Numer. Linear Algebra Appl., 2002

2001

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

[BibT_eX]

[DOI]

Dario Andrea Bini

Beatrice Meini

Numerische Mathematik, 2001

A generalized Graeffe's iteration for evaluating polynomials and rational functions.

[BibT_eX]

[DOI]

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

2000

Efficient and stable solution of structured Hessenberg linear systems arising from difference equations.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2000

1998

Computing a Factor of a Polynomial by Means of Multishift LR Algorithms.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., January, 1998

1997

Chebyshev rational interpolation.

[BibT_eX]

[DOI]

Numer. Algorithms, 1997

GCD of Polynomials and Bezout Matrices.

[BibT_eX]

[DOI]

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

1996

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

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

1995

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

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

1994

Solving Hankel Systems over the Integers.

[BibT_eX]

[DOI]

J. Symb. Comput., 1994

1992

On the Complexity of Polynomial Zeros.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Fast Inversion of Hankel and Toeplitz Matrices.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

1991

Improved Parallel Computations with Matrices and Polynomials.

[BibT_eX]

[DOI]

Victor Y. Pan

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]