Luc Giraud
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Luc Giraud has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- A. Marrocco
INRIA, Rocquencourt, France
1 shared publication - F. Guevara Vasquez
CAAM Department, Rice University, 6100 Main St.-MS 134, Houston, TX 77005-1892, U.S.A.
1 shared publication - G. Meurant
CEA/DIF, DCSA, BP12, 91680 Bruyeres le Chatel, France
1 shared publication - Gianmarco Manzini
Theoretical Division, Los Alamos National Laboratory, Los Alamos, NM 87545, USA
1 shared publication Hatim Kharraz-Aroussi
ENSIAS
1 shared publication- J.-C. Rioual
CERFACS, 42 av. Gaspard Coriolis, 31057 Toulouse Cedex, France
1 shared publication
Latest Publications
- 23 November 2005
- Published by Springer Nature
- p. 151-156
Parallel distributed implementations of 2D explicit euler solvers
- 23 November 2005
- Published by Springer Nature
- p. 151-156
Parallel distributed implementations of 2D explicit euler solvers
- 25 May 2005
- Published by Springer Nature in Numerische Mathematik
- Vol. 101 (1) , 87-100
Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- 25 May 2005
- Published by Springer Nature in Numerische Mathematik
- Vol. 101 (1) , 87-100
Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- 17 June 2004
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 12 (1) , 33-53
Iterative versus direct parallel substructuring methods in semiconductor device modelling
- 17 June 2004
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 12 (1) , 33-53
Iterative versus direct parallel substructuring methods in semiconductor device modelling
- 7 May 2003
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 10 (5-6) , 467-484
Grid transfer operators for highly variable coefficient problems in two‐level non‐overlapping domain decomposition methods
We propose a robust interpolation scheme for non‐overlapping two‐level domain decomposition methods applied to two‐dimensional elliptic problems with discontinuous coefficients. This interpolation is used to design a preconditioner closely related to the BPS scheme proposed in [Bramble et al. (Math. Comput. 1986; 47(175):103)]. Through numerical experiments, we show on structured and unstructured finite element problems that the new preconditioning scheme reduces to the BPS method on smooth problems but outperforms it on problems with discontinuous coefficients. In particular it maintains good scalable convergence behaviour even when the jumps in the coefficients are not aligned with subdomain interfaces. Copyright © 2003 John Wiley & Sons, Ltd.
- 7 May 2003
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 10 (5-6) , 467-484
Grid transfer operators for highly variable coefficient problems in two‐level non‐overlapping domain decomposition methods
We propose a robust interpolation scheme for non‐overlapping two‐level domain decomposition methods applied to two‐dimensional elliptic problems with discontinuous coefficients. This interpolation is used to design a preconditioner closely related to the BPS scheme proposed in [Bramble et al. (Math. Comput. 1986; 47(175):103)]. Through numerical experiments, we show on structured and unstructured finite element problems that the new preconditioning scheme reduces to the BPS method on smooth problems but outperforms it on problems with discontinuous coefficients. In particular it maintains good scalable convergence behaviour even when the jumps in the coefficients are not aligned with subdomain interfaces. Copyright © 2003 John Wiley & Sons, Ltd.
- 26 January 2001
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 8 (4) , 207-227
Local preconditioners for two‐level non‐overlapping domain decomposition methods
We consider additive two‐level preconditioners, with a local and a global component, for the Schur complement system arising in non‐overlapping domain decomposition methods. We propose two new parallelizable local preconditioners. The first one is a computationally cheap but numerically relevant alternative to the classical block Jacobi preconditioner. The second one exploits all the information from the local Schur complement matrices and demonstrates an attractive numerical behaviour on heterogeneous and anisotropic problems. We also propose two implementations based on approximate Schur complement matrices that are cheaper alternatives to construct the given preconditioners but that preserve their good numerical behaviour. Through extensive computational experiments we study the numerical scalability and the robustness of the proposed preconditioners and compare their numerical performance with well‐known robust preconditioners such as BPS and the balancing Neumann–Neumann method. Finally, we describe a parallel implementation on distributed memory computers of some of the proposed techniques and report parallel performances. Copyright © 2001 John Wiley & Sons, Ltd.
- 26 January 2001
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 8 (4) , 207-227
Local preconditioners for two‐level non‐overlapping domain decomposition methods
We consider additive two‐level preconditioners, with a local and a global component, for the Schur complement system arising in non‐overlapping domain decomposition methods. We propose two new parallelizable local preconditioners. The first one is a computationally cheap but numerically relevant alternative to the classical block Jacobi preconditioner. The second one exploits all the information from the local Schur complement matrices and demonstrates an attractive numerical behaviour on heterogeneous and anisotropic problems. We also propose two implementations based on approximate Schur complement matrices that are cheaper alternatives to construct the given preconditioners but that preserve their good numerical behaviour. Through extensive computational experiments we study the numerical scalability and the robustness of the proposed preconditioners and compare their numerical performance with well‐known robust preconditioners such as BPS and the balancing Neumann–Neumann method. Finally, we describe a parallel implementation on distributed memory computers of some of the proposed techniques and report parallel performances. Copyright © 2001 John Wiley & Sons, Ltd.
- 1 January 1998
- Published by Springer Nature
- p. 751-762
On the influence of the orthogonalization scheme on the parallel performance of GMRES
- 1 January 1998
- Published by Springer Nature
- p. 751-762
On the influence of the orthogonalization scheme on the parallel performance of GMRES
- 1 January 1997
- Published by Springer Nature
- p. 51-59
HIPERCOMBATS: A parallel industrial tool for two-wheeler suspensions design
- 1 January 1997
- Published by Springer Nature
- p. 51-59
HIPERCOMBATS: A parallel industrial tool for two-wheeler suspensions design