Francisco Bernal
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
Francisco Bernal has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Juan Acebron
INESC-ID, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal
7 shared publications Manuel Kindelan
G Millán Institute of Modeling, Simulation and Industrial Mathematics, Universidad Carlos III de Madrid, Leganés, Spain
6 shared publications- Goncalo dos Reis
University of Edinburgh
3 shared publications - Manuel Kindelan
Department of Mathematics Carlos III University of Madrid Avenida de la Universidad 30 28911 Leganés Spain
3 shared publications - Elisabeth Larsson
Uppsala University
2 shared publications - Greig Smith
Centro de Matemática e Aplicações Institute for Mathematical Sciences School of Mathematics University of Edinburgh University of Edinburgh Maxwell the University of Edinburgh and Heriot-Watt University
2 shared publications
Latest Publications
- 5 September 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 105 (1) , 1-29
Analysis and Preconditioning of a Probabilistic Domain Decomposition Algorithm for Elliptic Boundary Value Problems
- 5 September 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 105 (1) , 1-29
Analysis and Preconditioning of a Probabilistic Domain Decomposition Algorithm for Elliptic Boundary Value Problems
- Open Access
- 22 February 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 466
An iterative method for Helmholtz boundary value problems arising in wave propagation
- 22 February 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 466
Open AccessAn iterative method for Helmholtz boundary value problems arising in wave propagation
- 13 July 2024
- Published by Springer Nature
- p. 191-207
Heuristics for the Probabilistic Solution of BVPs with Mixed Boundary Conditions
- 13 July 2024
- Published by Springer Nature
- p. 191-207
Heuristics for the Probabilistic Solution of BVPs with Mixed Boundary Conditions
- Open Access
- 21 February 2024
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 208, 340-355
An explicit substructuring method for overlapping domain decomposition based on stochastic calculus
- 21 February 2024
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 208, 340-355
Open AccessAn explicit substructuring method for overlapping domain decomposition based on stochastic calculus
- Open Access
- 13 February 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 503
A radial basis function partition of unity method for steady flow simulations
- 13 February 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 503
Open AccessA radial basis function partition of unity method for steady flow simulations
- 14 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 46 (2) , S280-S297
Iterative Schemes for Probabilistic Domain Decomposition
Probabilistic domain decomposition (PDD) is an alternative paradigm for solving boundary value problems (BVPs) in parallel with excellent scalability properties, thanks to its reliance on stochastic representations of the BVP. However, there are cases when the latter is less numerically convenient, or unknown. Semilinear elliptic BVPs and the Helmholtz equation are prominent examples of either class. In this paper, we overcome this issue by designing suitable iterative schemes for either problem. These schemes not only retain the desirable properties of PDD but also are optimally suited for pathwise variance reduction, resulting in a systematic, nearly cost-free reduction of the statistical error through the iterations. Numerical tests carried out on the supercomputer Marconi100 are presented.
- 14 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 46 (2) , S280-S297
Iterative Schemes for Probabilistic Domain Decomposition
Probabilistic domain decomposition (PDD) is an alternative paradigm for solving boundary value problems (BVPs) in parallel with excellent scalability properties, thanks to its reliance on stochastic representations of the BVP. However, there are cases when the latter is less numerically convenient, or unknown. Semilinear elliptic BVPs and the Helmholtz equation are prominent examples of either class. In this paper, we overcome this issue by designing suitable iterative schemes for either problem. These schemes not only retain the desirable properties of PDD but also are optimally suited for pathwise variance reduction, resulting in a systematic, nearly cost-free reduction of the statistical error through the iterations. Numerical tests carried out on the supercomputer Marconi100 are presented.
- Open Access
- 25 July 2023
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 146, 294-308
A hybrid probabilistic domain decomposition algorithm suited for very large-scale elliptic PDEs
- 25 July 2023
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 146, 294-308
Open AccessA hybrid probabilistic domain decomposition algorithm suited for very large-scale elliptic PDEs
- Open Access
A Radial Basis Function Partition of Unity Method for Steady Flow Simulations
A methodology is presented for the numerical solution of nonlinear elliptic systems in unbounded domains, consisting of three elements. First, the problem is posed on a finite domain by means of a proper nonlinear change of variables. The compressed domain is then discretised, regardless of its final shape, via the radial basis function partition of unity method. Finally, the system of nonlinear algebraic collocation equations is solved with the trust-region algorithm, taking advantage of analytically derived Jacobians. We validate the methodology on a benchmark of computational fluid mechanics: the steady viscous flow past a circular cylinder. The resulting flow characteristics compare very well with the literature. Then, we stress-test the methodology on less smooth obstacles - rounded and sharp square cylinders. As expected, in the latter scenario the solution is polluted by spurious oscillations, owing to the presence of boundary singularities.
Open AccessA Radial Basis Function Partition of Unity Method for Steady Flow Simulations
A methodology is presented for the numerical solution of nonlinear elliptic systems in unbounded domains, consisting of three elements. First, the problem is posed on a finite domain by means of a proper nonlinear change of variables. The compressed domain is then discretised, regardless of its final shape, via the radial basis function partition of unity method. Finally, the system of nonlinear algebraic collocation equations is solved with the trust-region algorithm, taking advantage of analytically derived Jacobians. We validate the methodology on a benchmark of computational fluid mechanics: the steady viscous flow past a circular cylinder. The resulting flow characteristics compare very well with the literature. Then, we stress-test the methodology on less smooth obstacles - rounded and sharp square cylinders. As expected, in the latter scenario the solution is polluted by spurious oscillations, owing to the presence of boundary singularities.
- 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. - Open Access
- 2 April 2019
- Published by EDP Sciences in ESAIM: Proceedings and Surveys
- Vol. 65, 27-45
A policy iteration algorithm for nonzero-sum stochastic impulse games
This work presents a novel policy iteration algorithm to tackle nonzero-sum stochastic impulse games arising naturally in many applications. Despite the obvious impact of solving such problems, there are no suitable numerical methods available, to the best of our knowledge. Our method relies on the recently introduced characterisation of the value functions and Nash equilibrium via a system of quasi-variational inequalities. While our algorithm is heuristic and we do not provide a convergence analysis, numerical tests show that it performs convincingly in a wide range of situations, including the only analytically solvable example available in the literature at the time of writing. Ce travail présente un nouvel algorithme d’itération sur les politiques pour approximer numériquement les fonctions valeurs d’un problème de jeux impulsionnels stochastiques á somme non nulle. Ces problèmes apparaissent naturellement de nombreuses situations économiques de concurrence entre acteurs. A notre connaissance, malgré l’intérêt pratique de solutions numériques á de tels problèmes, il n’existe pas d’algorithmes appropriées. Notre méthode repose sur la caractérisation récemment introduite des fonctions valeur et de l’équilibre de Nash par un système d’inégalités quasivariationnelles. Bien que l’on ne fournisse pas d’analyse de convergence, des tests numériques effectués dans un large éventail de situations illustrent l’effcacité de notre algorithme. Enfin, nous montrons qu’il converge á la solution dans le seul cas connu de solution analytique.
- 2 April 2019
- Published by EDP Sciences in ESAIM: Proceedings and Surveys
- Vol. 65, 27-45
Open AccessA policy iteration algorithm for nonzero-sum stochastic impulse games
This work presents a novel policy iteration algorithm to tackle nonzero-sum stochastic impulse games arising naturally in many applications. Despite the obvious impact of solving such problems, there are no suitable numerical methods available, to the best of our knowledge. Our method relies on the recently introduced characterisation of the value functions and Nash equilibrium via a system of quasi-variational inequalities. While our algorithm is heuristic and we do not provide a convergence analysis, numerical tests show that it performs convincingly in a wide range of situations, including the only analytically solvable example available in the literature at the time of writing. Ce travail présente un nouvel algorithme d’itération sur les politiques pour approximer numériquement les fonctions valeurs d’un problème de jeux impulsionnels stochastiques á somme non nulle. Ces problèmes apparaissent naturellement de nombreuses situations économiques de concurrence entre acteurs. A notre connaissance, malgré l’intérêt pratique de solutions numériques á de tels problèmes, il n’existe pas d’algorithmes appropriées. Notre méthode repose sur la caractérisation récemment introduite des fonctions valeur et de l’équilibre de Nash par un système d’inégalités quasivariationnelles. Bien que l’on ne fournisse pas d’analyse de convergence, des tests numériques effectués dans un large éventail de situations illustrent l’effcacité de notre algorithme. Enfin, nous montrons qu’il converge á la solution dans le seul cas connu de solution analytique.