![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Beatrice Meini
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j36]Fabio Durastante
, Beatrice Meini
:
Stochastic \({p}\)th Root Approximation of a Stochastic Matrix: A Riemannian Optimization Approach. SIAM J. Matrix Anal. Appl. 45(2): 875-904 (2024) - [i18]Dario Bini, Beatrice Meini:
On certain matrix algebras related to quasi-Toeplitz matrices. CoRR abs/2405.03483 (2024) - 2023
- [j35]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) - [j34]Luca Gemignani, Beatrice Meini:
Relaxed fixed point iterations for matrix equations arising in Markov chain modeling. Numer. Algorithms 94(1): 149-173 (2023) - [j33]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) - [i17]Bruno Iannazzo, Beatrice Meini, Federico Poloni:
Invariant subspaces of T-palindromic pencils and algebraic T-Riccati equations. CoRR abs/2302.10604 (2023) - [i16]Fabio Durastante, Beatrice Meini:
Stochastic pth root approximation of a stochastic matrix: A Riemannian optimization approach. CoRR abs/2307.14040 (2023) - [i15]Dario Andrea Bini, Fabio Durastante, Sooyeong Kim, Beatrice Meini:
On Kemeny's constant and stochastic complement. CoRR abs/2312.13201 (2023) - 2022
- [j32]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) - [i14]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) - [i13]Dario A. Bini, Bruno Iannazzo, Beatrice Meini, Jie Meng, Leonardo Robol:
Computing eigenvalues of semi-infinite quasi-Toeplitz matrices. CoRR abs/2203.06484 (2022) - [i12]Luca Gemignani, Beatrice Meini:
An Acceleration of Fixed Point Iterations for M/G/1-type Markov Chains by Means of Relaxation Techniques. CoRR abs/2205.13187 (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
- [i10]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) - [i9]Peter Benner, Bruno Iannazzo, Beatrice Meini, Davide Palitta:
Palindromic linearization and numerical solution of nonsymmetric algebraic T-Riccati equations. CoRR abs/2110.03254 (2021) - 2020
- [j31]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) - [j30]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
- [j29]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
- [j28]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) - [j27]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) - [j26]Peter Benner, Heike Faßbender, Lars Grasedyck, Daniel Kressner
, Beatrice Meini
, Valeria Simoncini:
7th Workshop on Matrix Equations and Tensor Techniques. Numer. Linear Algebra Appl. 25(6) (2018) - [j25]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) - [j24]Beatrice Meini
, Federico Poloni
:
Perron-based algorithms for the multilinear PageRank. Numer. Linear Algebra Appl. 25(6) (2018) - 2016
- [j23]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) - 2013
- [j22]Udo R. Krieger, Beatrice Meini
, Peter G. Taylor
, Miklós Telek
:
Guest editorial. Perform. Evaluation 70(9): 549-550 (2013) - [j21]Beatrice Meini
:
On the numerical solution of a structured nonsymmetric algebraic Riccati equation. Perform. Evaluation 70(9): 682-690 (2013) - 2012
- [b1]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 - [j20]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) - [j19]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
- [j18]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) - [j17]Beatrice Meini
, Federico Poloni:
A Perron Iteration for the Solution of a Quadratic Vector Equation Arising in Markovian Binary Trees. SIAM J. Matrix Anal. Appl. 32(1): 248-261 (2011) - [c5]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
- [j16]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) - [j15]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
- [j14]Dario Andrea Bini, Beatrice Meini
:
The cyclic reduction algorithm: from Poisson equation to stochastic processes and beyond. Numer. Algorithms 51(1): 23-60 (2009) - [c4]Dario Bini, Beatrice Meini, S. Steffé, Benny Van Houdt:
Structured Markov chains solver: tool extension. VALUETOOLS 2009: 20 - 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
- [j13]Chun-Hua Guo, Bruno Iannazzo
, Beatrice Meini
:
On the Doubling Algorithm for a (Shifted) Nonsymmetric Algebraic Riccati Equation. SIAM J. Matrix Anal. Appl. 29(4): 1083-1100 (2007) - [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 - 2005
- [j12]Dario Andrea Bini, Nicholas J. Higham
, Beatrice Meini
:
Algorithms for the matrix pth root. Numer. Algorithms 39(4): 349-378 (2005) - 2004
- [j11]Beatrice Meini
:
The Matrix Square Root from a New Functional Perspective: Theoretical Results and Computational Issues. SIAM J. Matrix Anal. Appl. 26(2): 362-376 (2004) - 2003
- [j10]Dario Andrea Bini, Giuseppe Fiorentino, Luca Gemignani
, Beatrice Meini:
Effective Fast Algorithms for Polynomial Spectral Factorization. Numer. Algorithms 34(2-4): 217-227 (2003) - [c3]Luciano Lenzini, Beatrice Meini, Enzo Mingozzi, Giovanni Stea:
An M/G/1 Queuing System with Multiple Vacations to Assess the Performance of a Simplified Deficit Round Robin Model. Computer Performance Evaluation / TOOLS 2003: 134-151 - 2002
- [j9]Beatrice Meini
:
Efficient computation of the extreme solutions of X + A*X-1A = Q and X - A*X-1A = Q. Math. Comput. 71(239): 1189-1204 (2002) - [j8]C. He, Beatrice Meini
, Noah H. Rhee:
A Shifted Cyclic Reduction Algorithm for Quasi-Birth-Death Problems. SIAM J. Matrix Anal. Appl. 23(3): 673-691 (2002) - 2001
- [j7]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
- [j6]Paola Favati, Beatrice Meini:
Solving certain queueing problems by means of regular splittings. Appl. Math. Lett. 13(7): 99-105 (2000) - [c2]Beatrice Meini:
Matrix Equations and Structures: Efficient Solution of Special Discrete Algebraic Riccati Equations. NAA 2000: 578-585
1990 – 1999
- 1999
- [j5]Dario Andrea Bini, Beatrice Meini:
Effective Methods for Solving Banded Toeplitz Systems. SIAM J. Matrix Anal. Appl. 20(3): 700-719 (1999) - [c1]Dario Bini, Beatrice Meini:
Solving Block Banded Block Toeplitz Systems with Structured Blocks: New Algorithms and Open Problems. LSSC 1999: 15-24 - 1998
- [j4]Luciano Lenzini, Beatrice Meini
, Enzo Mingozzi:
An efficient numerical method for performance analysis of contention MAC protocols: a case study (PRMA++). IEEE J. Sel. Areas Commun. 16(5): 653-667 (1998) - 1997
- [j3]Dario Andrea Bini, Beatrice Meini:
Improved cyclic reduction for solving queueing problems. Numer. Algorithms 15(1): 57-74 (1997) - [j2]Giuseppe Anastasi, Luciano Lenzini, Beatrice Meini:
Performance Evaluation of a Worst Case Model of the MetaRing MAC Protocol With Global Fairness. Perform. Evaluation 29(2): 127-151 (1997) - 1996
- [j1]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)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-05 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint