#### Filter Results:

- Full text PDF available (89)

#### Publication Year

1982

2018

- This year (2)
- Last 5 years (30)
- Last 10 years (66)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michele Benzi
- 2002

This article surveys preconditioning techniques for the iterative solution of large linear systems, with a focus on algebraic methods suitable for general sparse matrices. Covered topics includeâ€¦ (More)

- Michele Benzi, Gene H. Golub
- SIAM J. Matrix Analysis Applications
- 2004

In this paper we consider the solution of linear systems of saddle point type by preconditioned Krylov subspace methods. A preconditioning strategy based on the symmetric/ skew-symmetric splitting ofâ€¦ (More)

- Zhong-Zhi Bai, Michele Benzi, Fang Chen
- Computing
- 2010

In this paper, we introduce and analyze a modification of the Hermitian and skew-Hermitian splitting iteration method for solving a broad class of complex symmetric linear systems. We show that theâ€¦ (More)

- Michele Benzi, Jane Cullum, Miroslav Tuma
- SIAM J. Scientific Computing
- 2000

We present a variant of the AINV factorized sparse approximate inverse algorithm which is applicable to any symmetric positive definite matrix. The new preconditioner is breakdownfree and, when usedâ€¦ (More)

- Michele Benzi, Carl Dean Meyer, Miroslav Tuma
- SIAM J. Scientific Computing
- 1996

A method for computing a sparse incomplete factorization of the inverse of a symmetric positive de nite matrix A is developed and the resulting factorized sparse approximate inverse is used as anâ€¦ (More)

- Zhong-Zhi Bai, Michele Benzi, Fang Chen
- Numerical Algorithms
- 2010

We propose a preconditioned variant of the modified HSS (MHSS) iteration method for solving a class of complex symmetric systems of linear equations. Under suitable conditions, we prove theâ€¦ (More)

- Michele Benzi, Maxim A. Olshanskii
- SIAM J. Scientific Computing
- 2006

We describe an effective solver for the discrete Oseen problem based on an augmented Lagrangian formulation of the corresponding saddle point system. The proposed method is a block triangularâ€¦ (More)

We establish decay bounds for the entries of f(A), where A is a sparse (in particular, banded) nÃ—n diagonalizable matrix and f is smooth on a subset of the complex plane containing the spectrum of A.â€¦ (More)

We study different variants of the augmented Lagrangian (AL)-based block-triangular preconditioner introduced by the first two authors in [SIAM J. Sci. Comput. 2006; 28: 2095â€“2113]. Theâ€¦ (More)

- Michele Benzi, Christine Klymko
- J. Complex Networks
- 2013

We examine node centrality measures based on the notion of total communicability, defined in terms of the row sums of matrix functions of the adjacency matrix of the network. Our main focus is on theâ€¦ (More)