Antony N. Spyropoulos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Antony N. Spyropoulos has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Andreas G. Boudouvis
National Technical University of Athens
7 shared publications - Athanasios G. Papathanasiou
School of Chemical Engineering, National Technical University of Athens, 15780 Athens, Greece
3 shared publications George Pashos
School of Chemical Engineering, National Technical University of Athens, Athens 15780, Greece
2 shared publicationsJ.A. Palyvos
School of Chemical Engineering, National Technical University of Athens, Zografou Campus, 15780 Athens, Greece
2 shared publications- Christian Gollwitzer
Physikalisch-Technische Bundesanstalt (PTB), Abbestr. 2-12, 10587 Berlin, Germany
1 shared publication - Christos D. Antonopoulos
University of Thessaly
1 shared publication
Latest Publications
- Open Access
- 24 May 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 101 (4) , 2631-2657
Numerical study of mixed precision GMRES(m) preconditioned by deflation
We present a numerical investigation on the mixed precision Generalized Minimal Residual (GMRES) method, preconditioned by deflation. GMRES is a widely used iterative solver for sparse, non-symmetric linear systems. The mixed precision version of restarted GMRES, or mixed precision GMRES(m), is known to achieve double precision accuracy while delivering substantial speedups by using single precision (32-bit) arithmetic for most computations and double precision (64-bit) for key corrective steps only. In this study, the mixed precision GMRES(m) is enhanced with a deflation-based preconditioner to accelerate its convergence. All preconditioning operations are carried out in single precision. We demonstrate the effectiveness of the mixed precision GMRES(m) preconditioned by deflation in terms of both convergence (iterations required) and computational performance. This is validated through numerical experiments on a multi-core environment using a variety of matrices. The results show that the preconditioner remains highly effective in reducing iterations even under reduced precision. Additionally, we compare the speedups achieved by mixed precision over double precision in the preconditioned GMRES(m) with those in the non-preconditioned version. For the majority of tested matrices, the speedups in the preconditioned and non-preconditioned cases are comparable.
- 24 May 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 101 (4) , 2631-2657
Open AccessNumerical study of mixed precision GMRES(m) preconditioned by deflation
We present a numerical investigation on the mixed precision Generalized Minimal Residual (GMRES) method, preconditioned by deflation. GMRES is a widely used iterative solver for sparse, non-symmetric linear systems. The mixed precision version of restarted GMRES, or mixed precision GMRES(m), is known to achieve double precision accuracy while delivering substantial speedups by using single precision (32-bit) arithmetic for most computations and double precision (64-bit) for key corrective steps only. In this study, the mixed precision GMRES(m) is enhanced with a deflation-based preconditioner to accelerate its convergence. All preconditioning operations are carried out in single precision. We demonstrate the effectiveness of the mixed precision GMRES(m) preconditioned by deflation in terms of both convergence (iterations required) and computational performance. This is validated through numerical experiments on a multi-core environment using a variety of matrices. The results show that the preconditioner remains highly effective in reducing iterations even under reduced precision. Additionally, we compare the speedups achieved by mixed precision over double precision in the preconditioned GMRES(m) with those in the non-preconditioned version. For the majority of tested matrices, the speedups in the preconditioned and non-preconditioned cases are comparable.
- 10 May 2019
- Published by Cambridge University Press (CUP) in Journal of Fluid Mechanics
- Vol. 870, 389-404
The 2-3-4 spike competition in the Rosensweig instability
The horizontal free surface of a magnetic liquid (ferrofluid) pool turns unstable when the strength of a vertically applied uniform magnetic field exceeds a threshold. The instability, known as normal field instability or Rosensweig’s instability, is accompanied by the formation of liquid spikes either few, in small diameter pools, or many, in large diameter pools; in the latter case, the spikes are arranged in hexagonal or square patterns. In small pools where only few spikes – 2, 3 or 4 in this work – can be accommodated, their appearance/disappearance/re-appearance observed in experiments, as applied field strength varies, is investigated by computer-aided bifurcation and linear stability analysis. The equations of three-dimensional capillary magneto-hydrostatics give rise to a three-dimensional free boundary problem which is discretized by the Galerkin/finite element method and solved for multi-spike surface deformation coupled with magnetic field distribution simultaneously with a compact numerical scheme based on Newton iteration. Standard eigenvalue problems are solved in the course of parameter continuation to reveal the multiplicity and the stability of the emerging deformations. The computational predictions reveal selection mechanisms among equilibrium states and explain the corresponding experimental observations and measurements.
- 10 May 2019
- Published by Cambridge University Press (CUP) in Journal of Fluid Mechanics
- Vol. 870, 389-404
The 2-3-4 spike competition in the Rosensweig instability
The horizontal free surface of a magnetic liquid (ferrofluid) pool turns unstable when the strength of a vertically applied uniform magnetic field exceeds a threshold. The instability, known as normal field instability or Rosensweig’s instability, is accompanied by the formation of liquid spikes either few, in small diameter pools, or many, in large diameter pools; in the latter case, the spikes are arranged in hexagonal or square patterns. In small pools where only few spikes – 2, 3 or 4 in this work – can be accommodated, their appearance/disappearance/re-appearance observed in experiments, as applied field strength varies, is investigated by computer-aided bifurcation and linear stability analysis. The equations of three-dimensional capillary magneto-hydrostatics give rise to a three-dimensional free boundary problem which is discretized by the Galerkin/finite element method and solved for multi-spike surface deformation coupled with magnetic field distribution simultaneously with a compact numerical scheme based on Newton iteration. Standard eigenvalue problems are solved in the course of parameter continuation to reveal the multiplicity and the stability of the emerging deformations. The computational predictions reveal selection mechanisms among equilibrium states and explain the corresponding experimental observations and measurements.
- 29 April 2019
- Published by American Chemical Society (ACS) in Langmuir
- Vol. 35 (20) , 6793-6802
Optimization of Patterned Surfaces for Improved Superhydrophobicity through Cost-Effective Large-Scale Computations
The pattern design of superhydrophobic surfaces can be significantly aided by computations that predict the Cassie-Baxter (CB) to Wenzel (W) transition, which is responsible for the break-down of superhydrophobic behavior. We present a computational framework for the optimization of patterned surfaces, based on the energy barriers of the CB-W transitions that comprises the following elements: a) Design of structured surface patterns, e.g. arrays of pillars, with parameterized geometric features such as size, pitch, slope and roundness. b) Computation of the wetting states with a modified Young-Laplace equation that facilitates the introduction of solid-liquid interactions for complex surface patterns and has significantly lower computational cost than other commonly used methods, such as the volume-of-fluid, phase-field, etc. c) Incorporation of the modified Young-Laplace in the simplified string method, allowing the calculation of the minimum energy paths (MEPs) of wetting transitions, which apart from the energy barriers, also reveal the transition mechanisms (CB failure modes). d) Accommodation of large-scale problems with good parallel performance and scalability, on multi-core distributed memory systems, using fast iterative solvers and the Message Passing Interface (MPI) communication protocol. We demonstrate the computational framework, with a shape optimization study of inverted conical frustum pillars. The optimization objective function is the resistance to the CB-W transition, which is quantified by the energy barrier – a relatively large energy barrier suggests improved superhydrophobicity. We also report the parallel performance, in terms of parallel speedup for problems ranging from three hundred thousands to twelve million degrees of freedom, solved using up to forty processing cores.
- 29 April 2019
- Published by American Chemical Society (ACS) in Langmuir
- Vol. 35 (20) , 6793-6802
Optimization of Patterned Surfaces for Improved Superhydrophobicity through Cost-Effective Large-Scale Computations
The pattern design of superhydrophobic surfaces can be significantly aided by computations that predict the Cassie-Baxter (CB) to Wenzel (W) transition, which is responsible for the break-down of superhydrophobic behavior. We present a computational framework for the optimization of patterned surfaces, based on the energy barriers of the CB-W transitions that comprises the following elements: a) Design of structured surface patterns, e.g. arrays of pillars, with parameterized geometric features such as size, pitch, slope and roundness. b) Computation of the wetting states with a modified Young-Laplace equation that facilitates the introduction of solid-liquid interactions for complex surface patterns and has significantly lower computational cost than other commonly used methods, such as the volume-of-fluid, phase-field, etc. c) Incorporation of the modified Young-Laplace in the simplified string method, allowing the calculation of the minimum energy paths (MEPs) of wetting transitions, which apart from the energy barriers, also reveal the transition mechanisms (CB failure modes). d) Accommodation of large-scale problems with good parallel performance and scalability, on multi-core distributed memory systems, using fast iterative solvers and the Message Passing Interface (MPI) communication protocol. We demonstrate the computational framework, with a shape optimization study of inverted conical frustum pillars. The optimization objective function is the resistance to the CB-W transition, which is quantified by the energy barrier – a relatively large energy barrier suggests improved superhydrophobicity. We also report the parallel performance, in terms of parallel speedup for problems ranging from three hundred thousands to twelve million degrees of freedom, solved using up to forty processing cores.
- 30 April 2010
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 60 (4) , 397-410
Accelerating an inexact Newton/GMRES scheme by subspace decomposition
- 30 April 2010
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 60 (4) , 397-410
Accelerating an inexact Newton/GMRES scheme by subspace decomposition
- 1 May 2009
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 227 (1) , 196-205
Simultaneous solution of large-scale linear systems and eigenvalue problems with a parallel GMRES method
- 1 May 2009
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 227 (1) , 196-205
Simultaneous solution of large-scale linear systems and eigenvalue problems with a parallel GMRES method
- 1 May 2009
- Published by IOP Publishing in New Journal of Physics
- Vol. 11 (5)
The normal field instability under side-wall effects: comparison of experiments and computations
- 1 May 2009
- Published by IOP Publishing in New Journal of Physics
- Vol. 11 (5)
The normal field instability under side-wall effects: comparison of experiments and computations
- 1 October 2004
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 193 (42-44) , 4707-4716
Bifurcation detection with the (un)preconditioned GMRES(m)
- 1 October 2004
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 193 (42-44) , 4707-4716
Bifurcation detection with the (un)preconditioned GMRES(m)
- 7 November 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 56-61
Finite element computations on cluster of PCs and workstations
In the last decade distributed processing on clusters of PCs and workstations have become a popular alternative way for parallel computations due to their low cost compared to parallel supercomputers. The most important factor that limits the parallel efficiency of an algorithm running on a cluster is the low bandwidth and high latency of the network that interconnects the computers. Specially designed parallel algorithms must be applied that have low communication overhead. A parallel method on Galerkin/finite element computations on clusters of PCs and workstations is presented. This method is based on a parallel preconditioned Krylov-type iterative solver for the solution of large, sparse and nonsymmetric equation systems. Two important aspects of the method are addressed: the storage of the coefficient matrix of the system and of the preconditioning matrix, and the performance of the preconditioner. The matrix storage affects the parallel efficiency of the matrix vector product. The preconditioner contributes to the parallel efficiency and is of critical importance for the convergence rate of the iterative method. The performance of the method is analysed in terms of parallel speedup, storage efficiency and convergence rate Author(s) Spyropoulos, A.N. Dept. of Chem. Eng., Nat. Tech. Univ. of Athens, Greece Palyvos, J.A. ; Boudouvis, A.G.
- 7 November 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 56-61
Finite element computations on cluster of PCs and workstations
In the last decade distributed processing on clusters of PCs and workstations have become a popular alternative way for parallel computations due to their low cost compared to parallel supercomputers. The most important factor that limits the parallel efficiency of an algorithm running on a cluster is the low bandwidth and high latency of the network that interconnects the computers. Specially designed parallel algorithms must be applied that have low communication overhead. A parallel method on Galerkin/finite element computations on clusters of PCs and workstations is presented. This method is based on a parallel preconditioned Krylov-type iterative solver for the solution of large, sparse and nonsymmetric equation systems. Two important aspects of the method are addressed: the storage of the coefficient matrix of the system and of the preconditioning matrix, and the performance of the preconditioner. The matrix storage affects the parallel efficiency of the matrix vector product. The preconditioner contributes to the parallel efficiency and is of critical importance for the convergence rate of the iterative method. The performance of the method is analysed in terms of parallel speedup, storage efficiency and convergence rate Author(s) Spyropoulos, A.N. Dept. of Chem. Eng., Nat. Tech. Univ. of Athens, Greece Palyvos, J.A. ; Boudouvis, A.G.