Claude Brezinski
Research Subjects
Claude Brezinski has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Michela Redivo-Zaglia
Department of Mathematics “Tullio Levi-Civita”, University of Padua, Via Trieste 63, 35121 Padua, Italy
20 shared publications - Giuseppe Rodriguez
Department of Mathematics and Computer Science, University of Cagliari, via Ospedale 72, 09124 Cagliari, Italy
3 shared publications - Hassane Sadok
Université du Littoral Côte d’Opale
2 shared publications - Paolo Novati
Department of Mathematics, Informatics and Geosciences, University of Trieste, Trieste, Italy
2 shared publications - Sebastiano Seatzu
University of Cagliari
2 shared publications - Xing-Biao Hu
LSEC, ICMSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 1 July 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 100 (4) , 1435-1438
Preface
- 1 July 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 100 (4) , 1435-1438
Open AccessPreface
- 1 June 2017
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 116, 57-63
Shanks function transformations in a vector space
- 1 June 2017
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 116, 57-63
Shanks function transformations in a vector space
- 21 November 2015
- Published by Springer Nature
- p. 1223-1225
Rational Approximation
- Open Access
New representations of Padé and Padé-type approximants
Pad\'e approximants are rational functions whose series expansion match a given series as far as possible. These approximants are usually written under a rational form. In this paper, we will show how to write them also under two different barycentric forms, and under a partial fraction form, depending on free parameters. According to the choice of these parameters, Pad\'e-type approximants can be obtained under a barycentric or a partial fraction form.
Open AccessNew representations of Padé and Padé-type approximants
Pad\'e approximants are rational functions whose series expansion match a given series as far as possible. These approximants are usually written under a rational form. In this paper, we will show how to write them also under two different barycentric forms, and under a partial fraction form, depending on free parameters. According to the choice of these parameters, Pad\'e-type approximants can be obtained under a barycentric or a partial fraction form.
- Open Access
The simplified topological $\varepsilon$--algorithms for accelerating sequences in a vector space
When a sequence of numbers is slowly converging, it can be transformed into a new sequence which, under some assumptions, could converge faster to the same limit. One of the most well--known sequence transformation is Shanks transformation which can be recursively implemented by the $\varepsilon$--algorithm of Wynn. This transformation and this algorithm have been extended (in two different ways) to sequence of elements of a topological vector space $E$. In this paper, we present new algorithms of implementing these topological Shanks transformations. They no longer require the manipulation of elements of the algebraic dual space $E^*$ of $E$, nor using the duality product into the rules of the algorithms, they need the storage of less elements of $E$, and the stability is improved. They also allow us to prove convergence and acceleration results for some types of sequences. Various applications involving sequences of vectors or matrices show the interest of the new algorithms.Open AccessThe simplified topological $\varepsilon$--algorithms for accelerating sequences in a vector space
When a sequence of numbers is slowly converging, it can be transformed into a new sequence which, under some assumptions, could converge faster to the same limit. One of the most well--known sequence transformation is Shanks transformation which can be recursively implemented by the $\varepsilon$--algorithm of Wynn. This transformation and this algorithm have been extended (in two different ways) to sequence of elements of a topological vector space $E$. In this paper, we present new algorithms of implementing these topological Shanks transformations. They no longer require the manipulation of elements of the algebraic dual space $E^*$ of $E$, nor using the duality product into the rules of the algorithms, they need the storage of less elements of $E$, and the stability is improved. They also allow us to prove convergence and acceleration results for some types of sequences. Various applications involving sequences of vectors or matrices show the interest of the new algorithms. - 28 August 2013
- Published by Springer Nature in Journal of Engineering Mathematics
- Vol. 93 (1) , 3-19
Convergence acceleration of Kaczmarz’s method
- 28 August 2013
- Published by Springer Nature in Journal of Engineering Mathematics
- Vol. 93 (1) , 3-19
Convergence acceleration of Kaczmarz’s method
- 19 February 2013
- Published by Springer Nature in Numerische Mathematik
- Vol. 125 (1) , 89-113
Padé–type rational and barycentric interpolation
- 19 February 2013
- Published by Springer Nature in Numerische Mathematik
- Vol. 125 (1) , 89-113
Padé–type rational and barycentric interpolation
- Open Access
Convergence acceleration of Kaczmarz's method
The method of alternation projections (MAP) is an iterative procedure for finding the projection of a point on the intersection of closed subspaces of an Hilbert space. The convergence of this method is usually slow, and several methods for its acceleration have already been proposed. In this work, we consider a special MAP, namely Kaczmarz' method for solving systems of linear equations. The convergence of this method is discussed. After giving its matrix formulation and its projection properties, we consider several procedures for accelerating its convergence. They are based on sequence transformations whose kernels contain sequences of the same form as the sequence of vectors generated by Kaczmarz' method. Acceleration can be achieved either directly, that is without modifying the sequence obtained by the method, or by restarting it from the vector obtained by acceleration. Numerical examples show the effectiveness of both procedures.
Open AccessConvergence acceleration of Kaczmarz's method
The method of alternation projections (MAP) is an iterative procedure for finding the projection of a point on the intersection of closed subspaces of an Hilbert space. The convergence of this method is usually slow, and several methods for its acceleration have already been proposed. In this work, we consider a special MAP, namely Kaczmarz' method for solving systems of linear equations. The convergence of this method is discussed. After giving its matrix formulation and its projection properties, we consider several procedures for accelerating its convergence. They are based on sequence transformations whose kernels contain sequences of the same form as the sequence of vectors generated by Kaczmarz' method. Acceleration can be achieved either directly, that is without modifying the sequence obtained by the method, or by restarting it from the vector obtained by acceleration. Numerical examples show the effectiveness of both procedures.
- Open Access
Padé-type rational and barycentric interpolation
In this paper, we consider the particular case of the general rational Hermite interpolation problem where only the value of the function is interpolated at some points, and where the function and its first derivatives agree at the origin. Thus, the interpolants constructed in this way possess a Pad\'e--type property at 0. Numerical examples show the interest of the procedure. The interpolation procedure can be easily modified to introduce a partial knowledge on the poles and the zeros of the function to approximated. A strategy for removing the spurious poles is explained. A formula for the error is proved in the real case. Applications are given.
Open AccessPadé-type rational and barycentric interpolation
In this paper, we consider the particular case of the general rational Hermite interpolation problem where only the value of the function is interpolated at some points, and where the function and its first derivatives agree at the origin. Thus, the interpolants constructed in this way possess a Pad\'e--type property at 0. Numerical examples show the interest of the procedure. The interpolation procedure can be easily modified to introduce a partial knowledge on the poles and the zeros of the function to approximated. A strategy for removing the spurious poles is explained. A formula for the error is proved in the real case. Applications are given.
- 1 September 2012
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 81 (279) , 1527-1549
Multistep $𝜖$–algorithm, Shanks’ transformation, and the Lotka–Volterra system by Hirota’s method
In this paper, we propose a multistep extension of the Shanks sequence transformation. It is defined as a ratio of determinants. Then, we show that this transformation can be recursively implemented by a multistep extension of the <!-- MATH $\varepsilon$ --> -algorithm of Wynn. Some of their properties are specified. Thereafter, the multistep <!-- MATH $\varepsilon$ --> -algorithm and the multistep Shanks transformation are proved to be related to an extended discrete Lotka-Volterra system. These results are obtained by using Hirota's bilinear method, a procedure quite useful in the solution of nonlinear partial differential and difference equations.- 1 September 2012
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 81 (279) , 1527-1549
Multistep $𝜖$–algorithm, Shanks’ transformation, and the Lotka–Volterra system by Hirota’s method
In this paper, we propose a multistep extension of the Shanks sequence transformation. It is defined as a ratio of determinants. Then, we show that this transformation can be recursively implemented by a multistep extension of the <!-- MATH $\varepsilon$ --> -algorithm of Wynn. Some of their properties are specified. Thereafter, the multistep <!-- MATH $\varepsilon$ --> -algorithm and the multistep Shanks transformation are proved to be related to an extended discrete Lotka-Volterra system. These results are obtained by using Hirota's bilinear method, a procedure quite useful in the solution of nonlinear partial differential and difference equations.