Juan Acebron
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Juan Acebron has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Renato Spigler
Department of Mathematics and Physics Roma Tre University Rome Italy
23 shared publications - Francisco Bernal
Universidad Carlos III de Madrid
7 shared publications - José Monteiro
INESC-ID, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal
7 shared publications - Ángel Rodríguez-Rozas
Instituto Superior Técnico
7 shared publications - Luis L. Bonilla
Universidad Carlos III de Madrid
4 shared publications - Inês A. Ferreira
INESC-ID, Lisbon, Portugal
3 shared publications
Latest Publications
- Open Access
- 27 November 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 102 (1) , 1-2
Correction to: A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
- 27 November 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 102 (1) , 1-2
Open AccessCorrection to: A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
- Open Access
- 11 October 2024
- Published by Springer Nature in Numerical Algorithms
- p. 1
Correction to: Survey of a class of iterative row-action methods: The Kaczmarz method
- 11 October 2024
- Published by Springer Nature in Numerical Algorithms
- p. 1
Open AccessCorrection to: Survey of a class of iterative row-action methods: The Kaczmarz method
- Open Access
- 26 September 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 99 (4) , 2097-2135
Survey of a class of iterative row-action methods: The Kaczmarz method
The Kaczmarz algorithm is an iterative method that solves linear systems of equations. It stands out among iterative algorithms when dealing with large systems for two reasons. First, at each iteration, the Kaczmarz algorithm uses a single equation, resulting in minimal computational work per iteration. Second, solving the entire system may only require the use of a small subset of the equations. These characteristics have attracted significant attention to the Kaczmarz algorithm. Researchers have observed that randomly choosing equations can improve the convergence rate of the algorithm. This insight led to the development of the Randomized Kaczmarz algorithm and, subsequently, several other variations emerged. In this paper, we extensively analyze the native Kaczmarz algorithm and many of its variations using large-scale systems as benchmarks. Through our investigation, we have verified that, for consistent systems, various row sampling schemes can outperform both the original and Randomized Kaczmarz method. Specifically, sampling without replacement and using quasirandom numbers are the fastest techniques. However, for inconsistent systems, the Conjugate Gradient method for Least-Squares problems overcomes all variations of the Kaczmarz method for these types of systems.
- 26 September 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 99 (4) , 2097-2135
Open AccessSurvey of a class of iterative row-action methods: The Kaczmarz method
The Kaczmarz algorithm is an iterative method that solves linear systems of equations. It stands out among iterative algorithms when dealing with large systems for two reasons. First, at each iteration, the Kaczmarz algorithm uses a single equation, resulting in minimal computational work per iteration. Second, solving the entire system may only require the use of a small subset of the equations. These characteristics have attracted significant attention to the Kaczmarz algorithm. Researchers have observed that randomly choosing equations can improve the convergence rate of the algorithm. This insight led to the development of the Randomized Kaczmarz algorithm and, subsequently, several other variations emerged. In this paper, we extensively analyze the native Kaczmarz algorithm and many of its variations using large-scale systems as benchmarks. Through our investigation, we have verified that, for consistent systems, various row sampling schemes can outperform both the original and Randomized Kaczmarz method. Specifically, sampling without replacement and using quasirandom numbers are the fastest techniques. However, for inconsistent systems, the Conjugate Gradient method for Least-Squares problems overcomes all variations of the Kaczmarz method for these types of systems.
- Open Access
Survey of a Class of Iterative Row-Action Methods: The Kaczmarz Method
The Kaczmarz algorithm is an iterative method that solves linear systems of equations. It stands out among iterative algorithms when dealing with large systems for two reasons. First, at each iteration, the Kaczmarz algorithm uses a single equation, resulting in minimal computational work per iteration. Second, solving the entire system may only require the use of a small subset of the equations. These characteristics have attracted significant attention to the Kaczmarz algorithm. Researchers have observed that randomly choosing equations can improve the convergence rate of the algorithm. This insight led to the development of the Randomized Kaczmarz algorithm and, subsequently, several other variations emerged. In this paper, we extensively analyze the native Kaczmarz algorithm and many of its variations using large-scale dense random systems as benchmarks. Through our investigation, we have verified that, for consistent systems, various row sampling schemes can outperform both the original and Randomized Kaczmarz method. Specifically, sampling without replacement and using quasirandom numbers are the fastest techniques. However, for inconsistent systems, the Conjugate Gradient method for Least-Squares problems overcomes all variations of the Kaczmarz method for these types of systems.
Open AccessSurvey of a Class of Iterative Row-Action Methods: The Kaczmarz Method
The Kaczmarz algorithm is an iterative method that solves linear systems of equations. It stands out among iterative algorithms when dealing with large systems for two reasons. First, at each iteration, the Kaczmarz algorithm uses a single equation, resulting in minimal computational work per iteration. Second, solving the entire system may only require the use of a small subset of the equations. These characteristics have attracted significant attention to the Kaczmarz algorithm. Researchers have observed that randomly choosing equations can improve the convergence rate of the algorithm. This insight led to the development of the Randomized Kaczmarz algorithm and, subsequently, several other variations emerged. In this paper, we extensively analyze the native Kaczmarz algorithm and many of its variations using large-scale dense random systems as benchmarks. Through our investigation, we have verified that, for consistent systems, various row sampling schemes can outperform both the original and Randomized Kaczmarz method. Specifically, sampling without replacement and using quasirandom numbers are the fastest techniques. However, for inconsistent systems, the Conjugate Gradient method for Least-Squares problems overcomes all variations of the Kaczmarz method for these types of systems.
- Open Access
- 1 April 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 99 (2) , 1-26
A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
We propose a novel stochastic algorithm that randomly samples entire rows and columns of the matrix as a way to approximate an arbitrary matrix function using the power series expansion. This contrasts with existing Monte Carlo methods, which only work with one entry at a time, resulting in a significantly better convergence rate than the original approach. To assess the applicability of our method, we compute the subgraph centrality and total communicability of several large networks. In all benchmarks analyzed so far, the performance of our method was significantly superior to the competition, being able to scale up to 64 CPU cores with remarkable efficiency.
- 1 April 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 99 (2) , 1-26
Open AccessA Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
We propose a novel stochastic algorithm that randomly samples entire rows and columns of the matrix as a way to approximate an arbitrary matrix function using the power series expansion. This contrasts with existing Monte Carlo methods, which only work with one entry at a time, resulting in a significantly better convergence rate than the original approach. To assess the applicability of our method, we compute the subgraph centrality and total communicability of several large networks. In all benchmarks analyzed so far, the performance of our method was significantly superior to the competition, being able to scale up to 64 CPU cores with remarkable efficiency.
- 26 February 2024
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 159, 240-253
A stochastic method for solving time-fractional differential equations
- 26 February 2024
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 159, 240-253
A stochastic method for solving time-fractional differential equations
- Open Access
A new parallel solver suited for arbitrary semilinear parabolic partial differential equations based on generalized random trees
A probabilistic representation for initial value semilinear parabolic problems based on generalized random trees has been derived. Two different strategies have been proposed, both requiring generating suitable random trees combined with a Pade approximant for approximating accurately a given divergent series. Such series are obtained by summing the partial contribution to the solution coming from trees with arbitrary number of branches. The new representation greatly expands the class of problems amenable to be solved probabilistically, and was used successfully to develop a generalized probabilistic domain decomposition method. Such a method has been shown to be suited for massively parallel computers, enjoying full scalability and fault tolerance. Finally, a few numerical examples are given to illustrate the remarkable performance of the algorithm, comparing the results with those obtained with a classical method.
Open AccessA new parallel solver suited for arbitrary semilinear parabolic partial differential equations based on generalized random trees
A probabilistic representation for initial value semilinear parabolic problems based on generalized random trees has been derived. Two different strategies have been proposed, both requiring generating suitable random trees combined with a Pade approximant for approximating accurately a given divergent series. Such series are obtained by summing the partial contribution to the solution coming from trees with arbitrary number of branches. The new representation greatly expands the class of problems amenable to be solved probabilistically, and was used successfully to develop a generalized probabilistic domain decomposition method. Such a method has been shown to be suited for massively parallel computers, enjoying full scalability and fault tolerance. Finally, a few numerical examples are given to illustrate the remarkable performance of the algorithm, comparing the results with those obtained with a classical method.
- Open Access
A hybrid probabilistic domain decomposition algorithm suited for very large-scale elliptic PDEs
State of the art domain decomposition algorithms for large-scale boundary value problems (with $M\gg 1$ degrees of freedom) suffer from bounded strong scalability because they involve the synchronisation and communication of workers inherent to iterative linear algebra. Here, we introduce PDDSparse, a different approach to scientific supercomputing which relies on a "Feynman-Kac formula for domain decomposition". Concretely, the interfacial values (only) are determined by a stochastic, highly sparse linear system $G(ω){\vec u}={\vec b}(ω)$ of size ${\cal O}(\sqrt{M})$, whose coefficients are constructed with Monte Carlo simulations-hence embarrassingly in parallel. In addition to a wider scope for strong scalability in the deep supercomputing regime, PDDSparse has built-in fault tolerance and is ideally suited for GPUs. A proof of concept example with up to 1536 cores is discussed in detail.Open AccessA hybrid probabilistic domain decomposition algorithm suited for very large-scale elliptic PDEs
State of the art domain decomposition algorithms for large-scale boundary value problems (with $M\gg 1$ degrees of freedom) suffer from bounded strong scalability because they involve the synchronisation and communication of workers inherent to iterative linear algebra. Here, we introduce PDDSparse, a different approach to scientific supercomputing which relies on a "Feynman-Kac formula for domain decomposition". Concretely, the interfacial values (only) are determined by a stochastic, highly sparse linear system $G(ω){\vec u}={\vec b}(ω)$ of size ${\cal O}(\sqrt{M})$, whose coefficients are constructed with Monte Carlo simulations-hence embarrassingly in parallel. In addition to a wider scope for strong scalability in the deep supercomputing regime, PDDSparse has built-in fault tolerance and is ideally suited for GPUs. A proof of concept example with up to 1536 cores is discussed in detail. - 1 June 2020
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 79 (12) , 3495-3515
A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
- 1 June 2020
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 79 (12) , 3495-3515
A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
- 22 February 2020
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 82 (3) , 1-22
A Probabilistic Linear Solver Based on a Multilevel Monte Carlo Method
- 22 February 2020
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 82 (3) , 1-22
A Probabilistic Linear Solver Based on a Multilevel Monte Carlo Method