Skip to main content

IMAGENES ELECTROMAGNETICAS DEL SUBSUELO TERRESTRE UTILIZANDO METODOS AVANZADOS DE GALERKIN

MTM2016-76329-R

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos I+D+i Retos de Investigación
Call year 2016
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DEL PAIS VASCO EUSKAL HERRIKO UNIBERTSITATEA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 50
Encontrada(s) 1 página(s)

BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

The value of continuity: Refined isogeometric analysis and fast direct solvers

  • Garcia, D.
  • Pardo, D.
  • Dalcin, L.
  • Paszynski, M.
  • Collier, N.
  • Calo, V.M.
We propose the use of highly continuous finite element spaces interconnected with low continuity hyperplanes to maximize the performance of direct solvers. Starting from a highly continuous Isogeometric Analysis (IGA) discretization, we introduce $C^0$-separators to reduce the interconnection between degrees of freedom in the mesh. By doing so, both the solution time and best approximation errors are simultaneously improved. We call the resulting method ``refined Isogeometric Analysis (rIGA)". To illustrate the impact of the continuity reduction, we analyze the number of Floating Point Operations (FLOPs), computational times, and memory required to solve the linear system obtained by discretizing the Laplace problem with structured meshes and uniform polynomial orders. Theoretical estimates demonstrate that an optimal continuity reduction may decrease the total computational time by a factor between $p^2$ and $p^3$, with $p$ being the polynomial order of the discretization. Numerical results indicate that our proposed rIGA method delivers a speed-up factor proportional to $p^2$. In a $2D$ mesh with four million elements and $p = 5$, the linear system resulting from rIGA is solved $22$ times faster than the one from highly continuous IGA. In a $3D$ mesh with one million elements and $p = 3$, the linear rIGA system is solved $15$ times faster than the IGA one., The Project of the Spanish Ministry of Economy and Competitiveness MTM2016-76329-R. The Consolidated Research Group Grant IT649-13 on "Mathematical Modeling, Simulation, and Industrial Applications (M2SI)", The ICERMAR Project KK-2015/0000097.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

An even simpler understanding of quantum weak values

BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Towards optimal advection using stretch-maximizing stream surfaces

  • Barton, M.
  • Kosinka, J.
We investigate a class of stream surfaces that expand in time as much as possible. Given a vector field, we look for seed curves that locally propagate in time in a stretch-maximizing manner, i.e., curves that infinitesimally expand most progressively. We show that such a curve is generically unique at every point in an incompressible flow and offers a very good initial guess for a stretch-maximizing stream surface. With the application of efficient fluid advection-diffusion in mind, we optimize fluid injection towards optimal advection and show several examples on benchmark datasets.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Gaussian quadrature rules for

C^1
  • Barton, M.
  • Ait-Haddou, R.
  • Calo, V.M.
We provide explicit quadrature rules for spaces of $C^1$ quintic splines with uniform knot sequences over finite domains. The quadrature nodes and weights are derived via an explicit recursion that avoids numerical solvers. Each rule is optimal, that is, requires the minimal number of nodes, for a given function space. For each of $n$ subintervals, generically, only two nodes are required which reduces the evaluation cost by $2/3$ when compared to the classical Gaussian quadrature for polynomials over each knot span. Numerical experiments show fast convergence, as $n$ grows, to the ``two-third'' quadrature rule of Hughes et al. [23] for infinite domains.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Reexamination of continuous fuzzy measurement on two-level systems

  • Sokolovski, D.
  • Rusconi, S.
  • Brouard, S.
  • Akhmatskaya, E.
Imposing restrictions on the Feynman paths of the monitored system has in the past been proposed as a universal model-free approach to continuous quantum measurements. Here we revisit this proposition and demonstrate that a Gaussian restriction, resulting in a sequence of many highly inaccurate (weak) von Neumann measurements, is not sufficiently strong to ensure proximity between a readout and the Feynman paths along which the monitored system evolves. Rather, in the continuous limit, the variations of a typical readout become much larger than the separation between the eigenvalues of the measured quantity. Thus, a typical readout is not represented by a nearly constant curve, correlating with one of the eigenvalues of the measured quantity $\hat{A}$, even when decoherence or Zeno effect is achieved for the observed two-level system, and does not point directly to the system's final state. We show that the decoherence in a ``free'' system can be seen as induced by a Gaussian random walk with a drift, eventually directing the system towards one of the eigenstates of $\hat{A}$. A similar mechanism appears to be responsible for the Zeno effect in a driven system, when its Rabi oscillations are quenched by monitoring. Alongside the Gaussian case, which can only be studied numerically, we also consider a fully tractable model with a ``hard wall'' restriction and show the results to be similar., MINECO, Fondo Europeo de Desarrollo Regional FEDER, Grant No. FIS2015-67161-P (MINECO/FEDER) (D.S.), MINECO Grant No. SVP-2014-068451 (S.R.), MINECO Grant No. MTM2013-46553-C3-1-P (E.A.), SGI/IZOSGIker UPV/EHU, i2BASQUE academic network,
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Low-traffic limit and first-passage times for a simple model of the continuous double auction

  • Scalas, E.
  • Rapallo, F.
  • Radivojevic, T.
We consider a simplified model of the continuous double auction where prices are integers varying from 1 to $N$ with limit orders and market orders, but quantity per order limited to a single share. For this model, the order process is equivalent to two $M/M/1$ queues. We study the behaviour of the auction in the low-traffic limit where limit orders are immediately matched by market orders. In this limit, the distribution of prices can be computed exactly and gives a reasonable approximation of the price distribution when the ratio between the rate of order arrivals and the rate of order executions is below 1/2. This is further confirmed by the analysis of the first-passage time in 1 or $N$.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Adaptive Splitting Integrators for Enhancing Sampling Efficiency of Modified Hamiltonian Monte Carlo Methods in Molecular Simulation

  • Akhmatskaya, E.
  • Fernández-Pendás, M.
  • Radivojevic, T.
  • Sanz-Serna, J.M.
The modified Hamiltonian Monte Carlo (MHMC) methods, i.e., importance sampling methods that use modified Hamiltonians within a Hybrid Monte Carlo (HMC) framework, often outperform in sampling efficiency standard techniques such as molecular dynamics (MD) and HMC. The performance of MHMC may be enhanced further through the rational choice of the simulation parameters and by replacing the standard Verlet integrator with more sophisticated splitting algorithms. Unfortunately, it is not easy to identify the appropriate values of the parameters that appear in those algorithms. We propose a technique, that we call MAIA (Modified Adaptive Integration Approach), which, for a given simulation system and a given time step, automatically selects the optimal integrator within a useful family of two-stage splitting formulas. Extended MAIA (or e-MAIA) is an enhanced version of MAIA, which additionally supplies a value of the method-specific parameter that, for the problem under consideration, keeps the momentum acceptance rate at a user-desired level. The MAIA and e-MAIA algorithms have been implemented, with no computational overhead during simulations, in MultiHMC-GROMACS, a modified version of the popular software package GROMACS. Tests performed on well-known molecular models demonstrate the superiority of the suggested approaches over a range of integrators (both standard and recently developed), as well as their capacity to improve the sampling efficiency of GSHMC, a noticeable method for molecular simulation in the MHMC family. GSHMC combined with e-MAIA shows a remarkably good performance when compared to MD and HMC coupled with the appropriate adaptive integrators., MTM2013-46553-C3-1-P MTM2016-77660-P
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Optimally refined isogeometric analysis

  • Garcia, D.
  • Barton, M.
  • Pardo, D.
Performance of direct solvers strongly depends upon the employed discretization method. In particular, it is possible to improve the performance of solving Isogeometric Analysis (IGA) discretizations by introducing multiple $C^0$-continuity hyperplanes that act as separators during LU factorization \cite{rIGA1}. In here, we further explore this venue by introducing separators of arbitrary continuity. Moreover, we develop an efficient method to obtain optimal discretizations in the sense that they minimize the time employed by the direct solver of linear equations. The search space consists of all possible discretizations obtained by enriching a given IGA mesh. Thus, the best approximation error is always reduced with respect to its IGA counterpart, while the solution time is decreased by up to a factor of 60., ICERMAR Project KK-2015/0000097 Consolidated Research Group Grant IT649-13
BIRD. BCAM's Institutional Repository Data
Publication Contribución de congreso (ConferenceOutput)

ICCS 2017 Workshop on Agent-Based Simulations, Adaptive Algorithms and Solvers

  • Byrski, A.
  • Paszynski, M.
  • Schaefer, R.
  • Calo, V.M.
  • Pardo, D.
This workshop seeks to integrate results from different domains of computer science, computational science, and mathematics. We welcome simulation papers, either hard simulations using finite element or finite difference methods, or soft simulations by means of evolutionary computations, and related methods. The workshop focuses on simulations performed by using (a) agent-oriented systems; or (b) adaptive algorithms. Simulations performed by other kind of systems are also welcome. An agent-oriented system seems are attractive tools useful for numerous domains of applications. Adaptive algorithms significantly decrease on the computational cost by investing computational resources when needed by the problem.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Goal-Oriented p-Adaptivity using Unconventional Error Representations for a 1D Steady State Convection-Diffusion Problem

  • Pardo, D.
  • Darrigrand, V.
  • Rodríguez-Rozas, A.
  • Muga, I.
This work proposes the use of an alternative error representation for Goal-Oriented Adaptivity (GOA) in context of steady state convection dominated diffusion problems. It introduces an arbitrary operator for the computation of the error of an alternative dual problem. From the new representation, we derive element-wise estimators to drive the adaptive algorithm. The method is applied to a one dimensional (1D) steady state convection dominated diffusion problem with homogeneous Dirichlet boundary conditions. This problem exhibits a boundary layer that produces a loss of numerical stability. The new error representation delivers sharper error bounds. When applied to a $p$-GOA Finite Element Method (FEM), the alternative error representation captures earlier the boundary layer, despite the existing spurious numerical oscillations., Basque Government Consolidated Research Group Grant IT649-13 Spanish Ministry under Grant No. FPDI- 2013-17098 ICERMAR Project KK-2015/0000097 CYTED 2011 project 712RT0449 FONDECYT project 1160774
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Dispersion-minimizing quadrature rules for

C^1
  • Deng, Q.
  • Barton, M.
  • Puzyrev, V.
  • Calo, V.M.
We develop quadrature rules for the isogeometric analysis of wave propagation and structural vibrations that minimize the discrete dispersion error of the approximation. The rules are optimal in the sense that they only require two quadrature points per element to minimize the dispersion error [1], and they are equivalent to the optimized blending rules we recently described. Our approach further simplifies the numerical integration: instead of blending two three-point standard quadrature rules, we construct directly a single two-point quadrature rule that reduces the dispersion error to the same order for uniform meshes with periodic boundary conditions. Also, we present a 2.5-point rule for both uniform and non-uniform meshes with arbitrary boundary conditions. Consequently, we reduce the computational cost by using the proposed quadrature rules. Various numerical examples demonstrate the performance of these quadrature rules.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Goal-Oriented Adaptivity using Unconventional Error Representations

  • Darrigrand, V.
In Goal-Oriented Adaptivity (GOA), the error in a Quantity of Interest (QoI) is represented using global error functions of the direct and adjoint problems. This error representation is subsequently bounded above by element-wise error indicators that are used to drive optimal refinements. In this work, we propose to replace, in the error representation, the adjoint problem by an alternative operator. The main advantage of the proposed approach is that, when judiciously selecting such alternative operator, the corresponding upper bound of the error representation becomes sharper, leading to a more efficient GOA. These representations can be employed to design novel h, p, and hp energy-norm and goal-oriented adaptive algorithms. While the method can be applied to a variety of problems, in this Dissertation we first focus on one-dimensional (1D) problems, including Helmholtz and steady-state convection-dominated diffusion problems. Numerical results in 1D show that for the Helmholtz problem, it is advantageous to select the Laplace operator for the alternative error representation. Specifically, the upper bounds of the new error representation are sharper than the classical ones used in both energy-norm and goal-oriented adaptive methods, especially when the dispersion (pollution) error is significant. The 1D steady-state convection-dominated diffusion problem with homogeneous Dirichlet boundary conditions exhibits a boundary layer that produces a loss of numerical stability. The new error representation based on the Laplace operator delivers sharper error upper bounds. When applied to a p-GOA, the alternative error representation captures earlier the boundary layer, despite the existing spurious numerical oscillations. We then focus on the two- and three-dimensional (2D and 3D) Helmholtz equation. We show via extensive numerical experimentation that the upper bounds provided by the alternative error representations are sharper than the classical ones. When using the alternative error indicators, a naive p-adaptive process converges, whereas under the same conditions, the classical method fails and requires the use of the so-called Projection Based Interpolation (PBI) operator or some other technique to regain convergence. We also provide guidelines for finding operators delivering sharp error representation upper bounds., Basque Government Consolidated Research Group Grant IT649-13
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Super Abrasive Machining of Integral Rotary Components Using Grinding Flank Tools

  • González, H.
  • Calleja, A.
  • Pereira, O.
  • Ortega, N.
  • Lopez de Lacalle, N.
  • Barton, M.
Manufacturing techniques that are applied to turbomachinery components represent a challenge in the aeronautic sector. These components require high resistant super-alloys in order to satisfy the extreme working conditions they have to support during their useful life. Besides, in the particular case of Integrally Bladed Rotors (IBR), usually present complex geometries that need to be roughed and finished by milling and grinding processes, respectively. In order to improve their manufacturing processes, Super Abrasive Machining (SAM) is presented as a solution because it combines the advantages of the use of grinding tools with milling feed rates. However, this innovative technique usually needed high tool rotary speed and pure cutting oils cooling. These issues implied that SAM technique was not feasible in conventional machining centers. In this work, these matters were tackled and the possibility of using SAM in these five-axis centers with emulsion coolants was achieved. To verify this approach, Inconel 718 single blades with non-ruled surfaces were manufactured with Flank-SAM technique and conventional milling process, analyzing cutting forces, surface roughness, and dimension accuracy in both cases. The results show that SAM implies a suitable, controllable, and predictable process to improve the manufacture of aeronautical critical components, such as IBR., FEDER
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Revealing the Mechanism of Sodium Diffusion in NaxFePO4 Using an Improved Force Field

  • Rincón, M.
  • Lozano, A.
  • Escribano, B.
  • Carrasco, J.
  • Akhmatskaya, E.
Olivine NaFePO4 is a promising cathode material for Na-ion batteries. Intermediate phases such as Na0.66FePO4 govern phase stability during intercalation-deintercalation processes, yet little is known about Na+ diffusion in NaxFePO4 (0 < x < 1). Here we use an advanced simulation technique, Randomized Shell Mass Generalized Shadow Hybrid Monte Carlo Method (RSM-GSHMC) in combination with a specifically developed force field for describing NaxFePO4 over the whole range of sodium compositions, to thoroughly examine Na+ diffusion in this material. We reveal a novel mechanism through which Na+/Fe2+ antisite defect formation halts transport of Na+ in the main diffusion direction [010], while simultaneously activating diffusion in the [001] channels. A similar mechanism was reported for Li+ in LiFePO4, suggesting that a transition from one- to two-dimensional diffusion prompted by antisite defect formation is common to olivine structures, in general., MTM2013-46553-C3-1-P ENE2016-81020-R SGI/IZO-SGIker UPV/EHU i2BASQUE academic network Barcelona Supercomputer Center
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Adapting Hybrid Monte Carlo methods for solving complex problems in life and materials sciences

  • Fernández-Pendás, M.
Efficient sampling is the key to success of molecular simulation of complex physical systems. Still, a unique recipe for achieving this goal is unavailable. Hybrid Monte Carlo (HMC) is a promising sampling tool offering a smart, free of discretization errors, propagation in phase space, rigorous temperature control, and flexibility. However, its inability to provide dynamical information and its weakness in simulations of reasonably large systems do not allow HMC to become a sampler of choice in molecular simulation of complex systems. In this thesis, we show that performance of HMC can be dramatically improved by introducing in the method the splitting numerical integrators and importance sampling. We propose a novel splitting integration scheme called Adaptive Integration Approach or AIA, which leads to very promising improvements in accuracy and sampling in HMC simulations. Given a simulation problem and a time step, AIA automatically chooses the optimal scheme out of the family of two-stage splitting integrators. A system-specific integrator identified by our approach is optimal in the sense that it provides the best conservation of energy for harmonic forces. The role of importance sampling on the performance of HMC is studied through the modified Hamiltonian Monte Carlo (MHMC) methods, sampling with respect to a modified or shadow Hamiltonian. The particular attention is paid to Generalized Shadow Hybrid Monte Carlo (GSHMC), introduced by Akhmatskaya and Reich in 2008. To improve the performance of MHMC in general and GSHMC in particular, we develop and test the new multi-stage splitting integrators, specially formulated for sampling with respect to modified Hamiltonians. The novel adaptive two-stage integration approach or MAIA, specifically derived for MHMC is presented. We also discuss in detail the adaptation of GSHMC to the NPT ensemble and provide the thorough analysis of its performance. Moreover, for the first time, we formulate GSHMC in the grand canonical ensemble. A general framework, useful for an extension of other Hybrid Monte Carlo methods to the grand canonical ensemble, is also provided. The software development is another fundamental part of the present work. The algorithms presented in this thesis are implemented in MultiHMC-GROMACS, an in-house version of the popular software package GROMACS. We explain the details of such implementation and give useful recommendations and hints for implementation of the new algorithms in other software packages. In summary, in this thesis, we propose the new numerical algorithms that are capable of improving the accuracy and sampling efficiency of molecular simulations with Hybrid Monte Carlo methods. We show that equipping the Hybrid Monte Carlo algorithm with extra features makes it even a “smarter” sampler and, no doubts, a strong competitor to the well-established molecular simulation techniques such as molecular dynamics (MD) and Monte Carlo. The up to 60 times increase in sampling efficiency of GSHMC over MD, due to the new algorithms in simulations of selected systems, supports such a belief., MTM2013-46553-C3-1-P
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Finite Element Simulations of Logging-While-Drilling and Extra-Deep Azimuthal Resistivity Measurements using Non-Fitting Grids

  • Chaumont-Frelet, T.
  • Pardo, D.
  • Rodriguez-Rozas, A.
We propose a discretization technique using non-fitting grids to simulate magnetic field-based resistivity logging measurements. Non-fitting grids are convenient because they are simpler to generate and handle than fitting grids when the geometry is complex. On the other side, fitting grids have been historically preferred because they offer additional accuracy for a fixed problem size in the general case. In this work, we analyse the use of non-fitting grids to simulate the response of logging instruments that are based on magnetic field resistivity measurements using 2.5D Maxwell’s equations. We provide various examples demonstrating that, for these applications, if the finite element matrix coefficients are properly integrated, the accuracy loss due to the use of non-fitting grids is negligible compared to the case where fitting grids are employed.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Fast 2.5D Finite Element Simulations of Borehole Resistivity Measurements

  • Rodriguez-Rozas, A.
  • Pardo, D.
  • Torres-Verdin, C.
We develop a rapid 2.5-dimensional (2.5D) finite element method for simulation of borehole resistivity measurements in transversely isotropic (TI) media. The method combines arbitrary high-order $H^1$ - and $H$ (curl)-conforming spatial discretizations. It solves problems where material properties remain constant along one spatial direction, over which we consider a Fourier series expansion and each Fourier mode is solved independently. We propose a novel a priori method to construct quasi-optimal discretizations in physical and Fourier space. This construction is based on examining the analytical (fundamental) solution of the 2.5D formulation over multiple homogeneous spaces and assuming that some of its properties still hold for the 2.5D problem over a spatially heterogeneous formation. In addition, a simple parallelization scheme over multiple measurement positions provides efficient scalability. Our method yields accurate borehole logging simulations for realistic synthetic examples, delivering simulations of borehole resistivity measurements at a rate faster than 0.05 s per measurement location along the well trajectory on a 96-core computer.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Probabilistic Modelling of Classical and Quantum Systems

  • Rusconi, S.
While probabilistic modelling has been widely used in the last decades, the quantitative prediction in stochastic modelling of real physical problems remains a great challenge and requires sophisticated mathematical models and advanced numerical algorithms. In this study, we developed the mathematical tools for solving three long-standing problems in Polymer Science and Quantum Measurement theory. The question, “Why kinetic models cannot reproduce experimental observations in Controlled Radical Polymerization (CRP)?” has been answered by introducing in the kinetic model a delay and treating CRP as a non-Markovian process. The efficient stochastic simulation (SS) approach allowing for an accurate description of CRP has been formulated, theoretically grounded and tested using experimental data and the less advanced SS algorithms. An accurate prediction of a morphology development in multi-phase polymers is vital for synthesis of new materials but still not feasible due to its complexity. We proposed a Population Balance Equations (PBE)-based model and derived a conceptually new and computationally tractable numerical approach for its solution in order to provide a systematic tool for a morphology prediction in composite polymers. Finally, we designed a stochastic simulation framework for continuous measurements performed on quantum systems of theoretical and experimental interest, which helped us to re-examine the “fuzzy continuous measurements” theory by Audretsch and Mensky (1997) and expose some of its deficiencies, while making amendments where necessary. All developed modelling approaches are general enough to be applied to the broad range of physical applications and thus ultimately to contribute to the understanding and prediction of complex chemical and physical processes., BES-2014-06864, MTM2013-46553-C3-1-P
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Efficient quadrature rules for subdivision surfaces in isogeometric analysis

  • Barendrecht, P.
  • Kosinka, J.
  • Barton, M.
We introduce a new approach to numerical quadrature on geometries defined by subdivision surfaces based on quad meshes in the context of isogeometric analysis. Starting with a sparse control mesh, the subdivision process generates a sequence of finer and finer quad meshes that in the limit defines a smooth subdivision surface, which can be of any manifold topology. Traditional approaches to quadrature on such surfaces rely on per-quad integration, which is inefficient and typically also inaccurate near vertices where other than four quads meet. Instead, we explore the space of possible groupings of quads and identify the optimal macro-quads in terms of the number of quadrature points needed. We show that macro-quads consisting of quads from one or several consecutive levels of subdivision considerably reduce the cost of numerical integration. Our rules possess a tensor product structure and the underlying univariate rules are Gaussian, i.e., they require the minimum possible number of integration points in both univariate directions. The optimal quad groupings differ depending on the particular application. For instance, computing surface areas, volumes, or solving the Laplace problem lead to different spline spaces with specific structures in terms of degree and continuity. We show that in most cases the optimal groupings are quad-strips consisting of $(1\times n)$ quads, while in some cases a special macro-quad spanning more than one subdivision level offers the most economical integration. Additionally, we extend existing results on exact integration of subdivision splines. This allows us to validate our approach by computing surface areas and volumes with known exact values. We demonstrate on several examples that our quadratures use fewer quadrature points than traditional quadratures. We illustrate our approach to subdivision spline quadrature on the well-known Catmull-Clark scheme based on bicubic splines, but our ideas apply also to subdivision schemes of arbitrary bidegree, including non-uniform and hierarchical variants. Specifically, we address the problems of computing areas and volumes of Catmull-Clark subdivision surfaces, as well as solving the Laplace and Poisson PDEs defined over planar unstructured quadrilateral meshes in the context of isogeometric analysis.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

On the Analysis of Trajectory-Based Search Algorithms: When is it Beneficial to Reject Improvements?

  • Nallaperuma, S.
  • Oliveto, P.S.
  • Pérez Heredia, J.
  • Sudholt, D.
We investigate popular trajectory-based algorithms inspired by biology and physics to answer a question of general significance: when is it beneficial to reject improvements? A distinguishing factor of SSWM (Strong Selection Weak Mutation), a popular model from population genetics, compared to the Metropolis algorithm (MA), is that the former can reject improvements, while the latter always accepts them. We investigate when one strategy outperforms the other. Since we prove that both algorithms converge to the same stationary distribution, we concentrate on identifying a class of functions inducing large mixing times, where the algorithms will outperform each other over a long period of time. The outcome of the analysis is the definition of a function where SSWM is efficient, while Metropolis requires at least exponential time. The identified function favours algorithms that prefer high quality improvements over smaller ones, revealing similarities in the optimisation strategies of SSWM and Metropolis respectively with best-improvement (BILS) and first-improvement (FILS) local search. We conclude the paper with a comparison of the performance of these algorithms and a (1,$\lambda$)~RLS on the identified function. The algorithm favours the steepest gradient with a probability that increases with the size of its offspring population. The results confirm that BILS excels and that the (1,$\lambda$)~RLS is efficient only for large enough population sizes., The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under Grant Agreement No 618091 (SAGE) and from the EPSRC under Grant Agreement No EP/M004252/1.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

REFINED ISOGEOMETRIC ANALYSIS: A SOLVER-BASED DISCRETIZATION METHOD

  • Garcia, D.
Isogeometric analysis (IGA) is a computational approach frequently employed nowadays to study problems governed by partial differential equations (PDEs). This approach defines the geometry using conventional computer-aided design (CAD) functions and, in particular, NURBS. These functions represent complex geometries commonly found in engineering design and are capable of preserving exactly the geometry description under refinement as required in the analysis. Moreover, the use of NURBS as basis functions is compatible with the isoparametric concept, allowing to build algebraic systems directly from the computational domain representation based on spline functions, which arise from CAD. Therefore, it avoids to define a second space for the numerical analysis resulting in huge reductions in the total analysis time. To perform the numerical analysis, we can use either direct or iterative solvers. Direct solvers are preferred to study stiff linear problems that are not solvable with iterative solvers, as well as another type of problems, e.g., problems with multiple right-hand side (RHS). Moreover, when the problem size and the floating point operations (FLOPs) required to solve the problem are enormous, and the direct solvers become excessively expensive, the iterative solver turns into a more suitable alternative. For the case of direct solvers, the performance strongly depends upon the employed discretization method. In particular, on IGA, the continuity of the solution spaces plays a significant role in their performance. High continuous spaces degrade the direct solver's performance, increasing the solution times by a factor up to $\mathcal{O}(p^3)$ with respect to traditional finite element analysis (FEA) per unknown, being $p$ the polynomial order. In this work, we propose a solver-based discretization that employs highly continuous finite element spaces interconnected with low continuity hyperplanes to maximize the performance of direct solvers. Starting from a highly continuous (IGA) discretization, we introduce $C^0$ hyperplanes, which act as separators for the direct solver, to reduce the interconnection between the degrees of freedom (DoF) in the mesh. By doing so, both the solution time and best approximation errors are simultaneously improved. We call the resulting method ``refined Isogeometric Analysis (rIGA)". While this method can be applied to a variety of problems, in this Dissertation we focus on analyzing the impact of the continuity reduction when solving a Laplace problem with structured meshes and uniform polynomial orders in both 2D and 3D. Numerical results indicate that rIGA delivers speed-up factors proportional to $p^2$. For instance, in a 2D mesh with four million elements and $p=5$, the linear system resulting from rIGA is solved $22$ times faster than the one from highly continuous IGA. In a 3D mesh with one million elements and $p=3$, the linear rIGA system is solved $15$ times faster than the IGA one. We then develop a version of the rIGA strategy that introduces hyperplanes of arbitrary continuity ($C^k$ hyperplanes with $0\leq k\leq p-1$). This strategy, called Optimally refined Isogeometric Analysis (OrIGA), leads to more efficient discretization than those obtained with the original version of rIGA. By using separators of arbitrary continuity degree, we achieve a performance boost of up to 25$\%$ in the direct solvers with respect to rIGA. Thus, the savings with respect to IGA are larger than in rIGA. We have also designed and implemented a similar rIGA strategy for iterative solvers. This strategy splits the mesh into subdomains using $C^0$-hyperplanes and constructs the Schur complements of the subdomains (macro-elements) using a direct solver. We then assemble those Schur complements into a global skeleton system, which is only composed of the DoF located along the boundaries of all the subdomains. Subsequently, we solve this system iteratively using conjugate gradient method (CG) with an incomplete LU (ILU) preconditioner. Lastly, a backward substitution is performed to recover the eliminated DoF and obtain the solution of the original system. Thus, rIGA for iterative solvers is a hybrid solver strategy that combines a direct solver (static condensation step) to eliminate the internal macro-elements DoF, with an iterative method to solve the skeleton system. The hybrid solver strategy achieves moderate savings with respect to IGA when solving a 2D Poisson problem with a structured mesh and a uniform polynomial degree of approximation. For instance, for a mesh with four million elements and polynomial degree $p=3$, the iterative solver is approximately $2.6$ times faster (in time) when applied to the rIGA system than to the IGA one. These savings occur because the skeleton rIGA system contains fewer non-zero entries than the IGA one. The opposite situation occurs for 3D problems, and as a result, 3D rIGA discretizations provide no gains with respect to their IGA counterparts. In this work, we also apply rIGA to solve incompressible fluid flow problems on an enclosed domain. To satisfy the inf-sup stability condition and guarantee divergence-free discrete solutions, the implemented rIGA employs a combination of $C^0$ and $C^1$ hyperplanes to reduce the continuity on the solution spaces. Numerical results show that the $L^2$ norm of the discretization error improves as we reduce the continuity. Therefore, rIGA delivers smaller errors than $C^{p-1}$ IGA discretizations. In terms of the computational savings, rIGA provides a reduction in the computational cost of the direct solvers by a factor of $\mathcal{O}(p^2)$ in both 2D and 3D., Texas Advanced Computing Center (TACC) at The University of Texas at Austin which provides the HPC resources.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Multi-stage splitting integrators for sampling with modified Hamiltonian Monte Carlo methods

  • Radivojevic, T.
  • Fernández-Pendás, M.
  • Sanz-Serna, J.M.
  • Akhmatskaya, E.
Modified Hamiltonian Monte Carlo (MHMC) methods combine the ideas behind two popular sampling approaches: Hamiltonian Monte Carlo (HMC) and importance sampling. As in the HMC case, the bulk of the computational cost of MHMC algorithms lies in the numerical integration of a Hamiltonian system of differential equations. We suggest novel integrators designed to enhance accuracy and sampling performance of MHMC methods. The novel integrators belong to families of splitting algorithms and are therefore easily implemented. We identify optimal integrators within the families by minimizing the energy error or the average energy error. We derive and discuss in detail the modified Hamiltonians of the new integrators, as the evaluation of those Hamiltonians is key to the efficiency of the overall algorithms. Numerical experiments show that the use of the new integrators may improve very significantly the sampling performance of MHMC methods, in both statistical and molecular dynamics problems., MTM2013-46553-C3-1-P, MTM2016-77660-P, VA024P17, BES-2014-068640
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

On numerical quadrature for

C^1
  • Barton, M.
  • Kosinka, J.
The quadrature rule of Hammer and Stroud [16] for cubic polynomials has been shown to be exact for a larger space of functions, namely the $C^1$ cubic Clough-Tocher spline space over a macro-triangle if and only if the split-point is the barycentre of the macro-triangle [21]. We continue the study of quadrature rules for spline spaces over macro-triangles, now focusing on the case of $C^1$ quadratic Powell-Sabin 6-split macro-triangles. We show that the $3$-node Gaussian quadrature(s) for quadratics can be generalised to the $C^1$ quadratic Powell-Sabin 6-split spline space over a macro-triangle for a two-parameter family of inner split-points, not just the barycentre as in [21]. The choice of the inner split-point uniquely determines the positions of the edge split-points such that the whole spline space is integrated exactly by a corresponding polynomial quadrature. Consequently, the number of quadrature points needed to exactly integrate this special spline space reduces from twelve to three. For the inner split-point at the barycentre, we prove that the two 3-node quadratic polynomial quadratures of Hammer and Stroud exactly integrate also the $C^1$ quadratic Powell-Sabin spline space if and only if the edge split-points are at their respective edge midpoints. For other positions of the inner and edge split-points we provide numerical examples showing that three nodes suffice to integrate the space exactly, but a full classification and a closed-form solution in the generic case remain elusive.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Refined Isogeometric Analysis for a Preconditioned Conjugate Gradient Solver

  • Garcia, D.
  • Pardo, D.
  • Dalcin, L.
  • Calo, V.M.
Starting from a highly continuous Isogeometric Analysis (IGA) discretization, refined Isogeometric Analysis (rIGA) introduces $C^0$ hyperplanes that act as separators for the direct LU factorization solver. As a result, the total computational cost required to solve the corresponding system of equations using a direct LU factorization solver dramatically reduces (up to a factor of 55). At the same time, rIGA enriches the IGA spaces, thus improving the best approximation error. In this work, we extend the complexity analysis of rIGA to the case of iterative solvers. We build an iterative solver as follows: we first construct the Schur complements using a direct solver over small subdomains (macro-elements). We then assemble those Schur complements into a global skeleton system. Subsequently, we solve this system iteratively using Conjugate Gradients (CG) with an incomplete LU (ILU) preconditioner. For a 2D Poisson model problem with a structured mesh and a uniform polynomial degree of approximation, rIGA achieves moderate savings with respect to IGA in terms of the number of Floating Point Operations (FLOPs) and computational time (in seconds) required to solve the resulting system of linear equations. For instance, for a mesh with four million elements and polynomial degree $p=3$, the iterative solver is approximately $2.6$ times faster (in time) when applied to the rIGA system than to the IGA one. These savings occur because the skeleton rIGA system contains fewer non-zero entries than the IGA one. The opposite situation occurs for 3D problems, and as a result, 3D rIGA discretizations provide no gains with respect to their IGA counterparts when considering iterative solvers., David Pardo has received funding from the Project of the Spanish Ministry of Economy and Competitiveness with reference MTM2016-76329-R (AEI/FEDER, EU), and MTM2016-81697-ERC/AEI, the BCAM “Severo Ocho” accreditation of excellence SEV-2013-0323, and the Basque Government through the BERC 2014-2017 program and the Consolidated Research Group Grant IT649-13 on “Mathematical Modeling, Simulation, and Industrial Applica- tions (M2SI)”. This publication was also made possible in part by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 644602, the CSIRO Professorial Chair in Computational Geoscience at Curtin University, the Deep Earth Imaging Enterprise Future Science Platforms of the Commonwealth Scientific Industrial Research Organisation, CSIRO, of Australia, the Mega-grant of the Russian Federation Government (N14.Y26.31.0013) and the Curtin Institute for Computation. The J. Tinsley Oden Faculty Fellowship Research Program at the Institute for Computational Engineering and Sciences (ICES) of the University of Texas at Austin has partially supported the visits of VMC to ICES. The authors acknowledge the Texas Advanced Computing Center (TACC) at The University of Texas at Austin for providing HPC resources that have contributed to the research results reported within this paper
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Goal-oriented adaptivity using unconventional error representations for the multi-dimensional Helmholtz equation

  • Darrigrand, V.
  • Rodríguez-Rozas, A.
  • Muga, I.
  • Pardo, D.
  • Romkes, A.
  • Prudhomme, S.
In goal‐oriented adaptivity, the error in the quantity of interest is represented using the error functions of the direct and adjoint problems. This error representation is subsequently bounded above by element‐wise error indicators that are used to drive optimal refinements. In this work, we propose to replace, in the error representation, the adjoint problem by an alternative operator. The main advantage of the proposed approach is that, when judiciously selecting such alternative operator, the corresponding upper bound of the error representation becomes sharper, leading to a more efficient goal‐oriented adaptivity. While the method can be applied to a variety of problems, we focus here on two‐ and three‐dimensional (2‐D and 3‐D) Helmholtz problems. We show via extensive numerical experimentation that the upper bounds provided by the alternative error representations are sharper than the classical ones and lead to a more robust p‐adaptive process. We also provide guidelines for finding operators delivering sharp error representation upper bounds. We further extend the results to a convection‐dominated diffusion problem as well as to problems with discontinuous material coefficients. Finally, we consider a sonic logging‐while‐drilling problem to illustrate the applicability of the proposed method., V. Darrigrand, A. Rodriguez-Rozas and D. Pardo were partially funded by the Projects of the Spanish Ministry of Economy and Competitiveness with reference MTM2013-40824-P, MTM2016-76329-R (AEI/FEDER, EU), MTM2016-81697-ERC and the Basque Government Consolidated Research Group Grant IT649- 13 on “Mathematical Modeling, Simulation, and Industrial Applications (M2SI)”. A. Rodriguez-Rozas and D.Pardo were also partially funded by the BCAM “Severo Ochoa” accreditation of excellence SEV-2013-0323 and the Basque Government through the BERC2014-2017 program. A. Rodriguez-Rozas acknowledges support from Spanish Ministry under Grant No. FPDI- 2013-17098. I. Muga was partially funded by the FONDECYT project 1160774. The first four authors were also partially funded by the European Union’s Horizon 2020, research and innovation program under the Marie Sklodowska-Curie grant agreement No 644202. Serge Prudhomme is grateful for the support by a Discovery Grant from the Natural Sciences and Engineering Research Council of Canada.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

No Time at the End of the Tunnel

  • Sokolovski, D.
  • Akhmatskaya, E.
Modern atto-second experiments seek to provide an insight into a long standing question: “how much time does a tunnelling particle spend in the barrier?” Traditionally, quantum theory relates this duration to the delay with which the particle emerges from the barrier. The link between these two times is self-evident in classical mechanics, but may or may not exist in the quantum case. Here we show that it does not, and give a detailed explanation why. The tunnelling process does not lend itself to classical analogies, and its duration cannot, in general, be guessed by observing the behaviour of the transmitted particle.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

A Numerical 1.5D Method for the Rapid Simulation of Geophysical Resistivity Measurements

  • Shahriari, M.
  • Rojas, S.
  • Pardo, D.
  • Rodríguez-Rozas, A.
  • Bakr, S.A.
  • Calo, V.M.
  • Muga, I.
In some geological formations, borehole resistivity measurements can be simulated using a sequence of 1D models. By considering a 1D layered media, we can reduce the dimensionality of the problem from 3D to 1.5D via a Hankel transform. The resulting formulation is often solved via a semi-analytic method, mainly due to its high performance. However, semi-analytic methods have important limitations such as, for example, their inability to model piecewise linear variations on the resistivity. Herein, we develop a multi-scale finite element method (FEM) to solve the secondary field formulation. This numerical scheme overcomes the limitations of semi-analytic methods while still delivering high performance. We illustrate the performance of the method with numerical synthetic examples based on two symmetric logging-while-drilling (LWD) induction devices operating at 2 MHz and 500 KHz, respectively.
BIRD. BCAM's Institutional Repository Data
Publication Capítulo o parte de un libro (BookPart)

Generalization of the Pythagorean Eigenvalue Error Theorem and its Application to Isogeometric Analysis

  • Barton, M.
  • Calo, V.M.
  • Deng, Q.
  • Puzyrev, V.
This chapter studies the effect of the quadrature on the isogeometric analysis of the wave propagation and structural vibration problems. The dispersion error of the isogeometric elements is minimized by optimally blending two standard Gauss-type quadrature rules. These blending rules approximate the inner products and increase the convergence rate by two extra orders when compared to those with fully-integrated inner products. To quantify the approximation errors, we generalize the Pythagorean eigenvalue error theorem of Strang and Fix. To reduce the computational cost, we further propose a two-point rule for $C^1$ quadratic isogeometric elements which produces equivalent inner products on uniform meshes and yet requires fewer quadrature points than the optimally-blended rules.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Gaussian quadrature for

C^1
  • Kosinka, J.
  • Barton, M.
A numerical integration rule for multivariate cubic polynomials over n-dimensional simplices was designed by Hammer and Stroud [14]. The quadrature rule requires n + 2 quadrature points: the barycentre of the simplex and n + 1 points that lie on the connecting lines between the barycentre and the vertices of the simplex. In the planar case, this particular rule belongs to a two-parameter family of quadrature rules that admit exact integration of bivariate polynomials of total degree three over triangles. We prove that this rule is exact for a larger space, namely the C1 cubic Clough-Tocher spline space over macro-triangles if and only if the split-point is the barycentre. This results into a factor of three reduction in the number of quadrature points needed to integrate the Clough-Tocher spline space exactly.
BIRD. BCAM's Institutional Repository Data
Publication Tesis doctoral (DoctoralThesis)

Fast One-dimensional Finite Element Approximation of Geophysical Measurements

  • Shahriari, M.
There exist a wide variety of geophysical prospection methods. In this work, we focus on resistivity methods. We categorize these resistivity prospection methods according to their acquisition location as (a) on the surface, such as the ones obtained using Controlled Source Electromagnetics (CSEM) and magnetotelluric, and (b) in the borehole, such as the ones obtained using Logging-While-Drilling (LWD) devices. LWD devices are useful both for reservoir characterization and geosteering purposes, which is the act of adjusting the tool direction to travel within a specific zone. When inverting LWD resistivity measurements, it is a common practice to consider a one-dimensional (1D) layered media to reduce the problem dimensionality using a Hankel transform. Using orthogonality of Bessel functions, we arrive at a system of Ordinary Differential Equations (ODEs); one system of ODEs per Hankel mode. The dimensionality of the resulting problem is referred to as 1.5D since the computational cost to resolve it is in between that needed to solve a 1D problem and a 2D problem. When material properties (namely, resistivity, permittivity, and magnetic permeability) are piecewise-constant, we can solve the resulting ODEs either (a) analytically, which leads to a so-called semi-analytic method after performing a numerical inverse Hankel transform or (b) numerically. Semi-analytic methods are faster, but they also have important limitations, for example, (a) the analytical solution can only account for piecewise constant material properties, and other resistivity distributions cannot be solved analytically, which prevents to accurately model, for example, an Oil-Water Transition (OWT) zone when fluids are considered to be immiscible; (b) a specific set of cumbersome formulas has to be derived for each physical process (e.g., electromagnetism, elasticity, etc.), anisotropy type, etc.; (c) analytical derivatives of specific models (e.g., cross-bedded formations, or derivatives with respect to the bed boundary positions) are often difficult to obtain and have not been published to the best of our knowledge. In view of the above limitations, we propose to solve our forward problems using a numerical solver. A traditional Finite Element Method (FEM) is slow, which makes it unfeasible for our application. To achieve high performance, we developed a multiscale FEM that pre-computes a set of optimal local basis functions that are used at all logging positions. The resulting method is slow when compared to a semi-analytic approach for a single logging position, but it becomes highly competitive for a large number of logging positions, as needed for LWD geosteering applications. Moreover, we can compute the derivatives using an adjoint state method at almost zero additional cost in time. We describe an adjoint-based formulation for computing the derivatives of the electromagnetic fields with respect to the bed boundary positions. The key idea to obtain this adjoint-based formulation is to separate the tangential and normal components of the field, and treat them differently. We then apply this method to a 1.5D borehole resistivity problem. Moreover, we compute the adjoint-state formulation to compute the derivative of the magnetic field with respect to the resistivity value of each layer. We verify the accuracy of our formulations via synthetic examples. When simulating borehole resistivity measurements in a reservoir, it is common to consider an Oil-Water Contact (OWC) planar interface. However, this consideration can lead to an unrealistic model since, in the presence of capillary pressure, the mix of two immiscible fluids (oil and water) often appears as an OWT zone. These transition zones may be large in the vertical direction (20 meters or above), and in context of geosteering, an efficient method to simulate an OWT zone can maximize the production of an oil reservoir. In this work, we prove that by using our proposed 1.5D numerical method, we can easily consider arbitrary resistivity distributions in the vertical direction, as it occurs in an OWT zone. Numerical results on synthetic examples demonstrate significant differences between the results recorded by a geosteering device when considering a realistic OWT zone vs. an OWC sharp interface. As an additional piece of work of this Ph.D. Dissertation, we explore the possibility of using a Deep Neural Network (DNN) to perform a rapid inversion of borehole resistivity measurements. Herein, we build a DNN that approximates the following inverse problem: given a set of borehole resistivity measurements, the DNN is designed to deliver a physically meaningful and data-consistent piecewise one-dimensional layered model of the surrounding subsurface. Once the DNN is built, the actual inversion of the field measurements is efficiently performed in real time. We illustrate the performance of a DNN designed to invert LWD measurements acquired on high-angle wells via synthetic examples.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Source time reversal (STR) method for linear elasticity

  • Brevis, R.I.
  • Rodríguez-Rozas, A.
  • Ortega, J.H.
  • Pardo, D.
We study the problem of source reconstruction for a linear elasticity problem applied to seismicity induced by mining. We assume the source is written as a variable separable function $\mathbf{f(x)}\>g(t)$ . We first present a simple proof a local decay result for elasticity in the case of homogeneous media. We then extend the source time reversal method, originally developed for acoustic waves, to an elastic system of waves. Additionally, we present a fast reconstruction implementation for large data sets. This is especially useful in the elastic case, in which the numerical cost is higher than in fluid acoustics. We complement this work with several 2D and 3D numerical experiments and an analysis of the results, This work was partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant No 644602 GEAGAM (Spain) and CONICYT, Chile - PIA/Concurso de Apoyo a Centros Científicos y Tecnológicos de Excelencia con Financiamiento Basal AFB170001. Additionally, the first author was supported by CONICYT Doctoral fellowship number (Chile), Fondecyt11161033 (Chile), ICMP09-015-F (Chile), and EQM140119. Jaime H. Ortega was partially supported by Fondecyt1111012 and 1171854 (Chile). Ángel Rodríguez-Rozas and David Pardo were partially funded by the Projects of the Spanish Ministry of Economy and Competitiveness with reference MTM2016-76329-R (AEI/FEDER, EU) and MTM2016-81697-ERC/AEI, the BCAM “Severo Ochoa” accreditation of excellence SEV-2017-0718, the Basque Government through the BERC 2018-2021 program, the Consolidated Research Group Grant IT649-13 on “Mathematical Modeling, Simulation, and Industrial Applications (M2SI)”. David Pardo has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 777778.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Atomistic Insight into Ion Transport and Conductivity in Ga/Al-Substituted Li

_7
  • García Daza, F.A.
  • Rincón, M.
  • Llordés, A.
  • Carrasco, J.
  • Akhmatskaya, E.
Garnet-structured Li$_{7}$La$_{3}$Zr$_{2}$O$_{12}$ is a promising solid electrolyte for next-generation solid-state Li batteries. However, sufficiently fast Li-ion mobility required for battery applications only emerges at high temperatures, upon a phase transition to cubic structure. A well-known strategy to stabilize the cubic phase at room temperature relies on aliovalent substitution; in particular, the substitution of Li$^{+}$ by Al$^{3+}$ and Ga$^{3+}$ ions. Yet, despite having the same formal charge, Ga$^{3+}$ substitution yields higher conductivities ($10^{-3}$~S/cm) than Al$^{3+}$ ($10^{-4}$~S/cm). The reason of such difference in ionic conductivity remains a mystery. Here we use molecular dynamic simulations and advanced sampling techniques to precisely unveil the atomistic origin of this phenomenon. Our results show that Li$^{+}$ vacancies generated by Al$^{3+}$ and Ga$^{3+}$ substitution remain adjacent to Ga$^{3+}$ and Al$^{3+}$ ions, without contributing to the promotion of Li$^{+}$ mobility. However, while Ga$^{3+}$ ions tend to allow limited Li$^{+}$ diffusion within their immediate surroundings, the less repulsive interactions associated with Al$^{3+}$ ions lead to a complete blockage of neighboring Li$^{+}$ diffusion paths. This effect is magnified at lower temperatures, and explains the higher conductivities observed for Ga-substituted systems. Overall this study provides a valuable insight into the fundamental ion transport mechanism in the bulk of Ga/Al-substituted Li$_{7}$La$_{3}$Zr$_{2}$O$_{12}$ and paves the way for rationalizing aliovalent substitution design strategies for enhancing ionic transport in these materials., ENE2016-81020-R (MINECO)
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Explicit-in-Time Goal-Oriented Adaptivity

  • Muñoz-Matute, J.
  • Calo, V.M.
  • Pardo, D.
  • Alberdi, E.
  • Van der Zee, K.G.
Goal-oriented adaptivity is a powerful tool to accurately approximate physically relevant solution features for partial differential equations. In time dependent problems, we seek to represent the error in the quantity of interest as an integral over the whole space–time domain. A full space–time variational formulation allows such representation. Most authors employ implicit time marching schemes to perform goal-oriented adaptivity as it is known that they can be reinterpreted as Galerkin methods. In this work, we consider variational forms for explicit methods in time. We derive an appropriate error representation and propose a goal-oriented adaptive algorithm in space. For that, we derive the forward Euler method in time employing a discontinuous-in-time Petrov–Galerkin formulation. In terms of time domain adaptivity, we impose the Courant–Friedrichs–Lewy condition to ensure the stability of the method. We provide some numerical results in 1D space + time for the diffusion and advection–diffusion equations to show the performance of the proposed explicit-in-time goal-oriented adaptive algorithm., The first four authors have received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska- Curie grant agreement No 777778. David Pardo, Elisabete Alberdi and Judit Muñoz-Matute were partially funded by the Basque Government Consolidated Research Group Grant IT649-13 on “Mathematical Modeling, Simulation, and Industrial Appli- cations (M2SI)” and the Projects of the Spanish Ministry of Economy and Competitiveness with reference MTM2016-76329-R (AEI/FEDER, EU), and MTM2016-81697-ERC/AEI. David Pardo has also received funding from the BCAM “Severo Ochoa” accreditation of excellence SEV-2013-0323 and the Basque Government through the BERC 2014-2017 program. Victor M. Calo was partially funded by the CSIRO Professorial Chair in Computational Geoscience at Curtin University, the Mega-grant of the Russian Federation Government (N 14.Y26.31.0013) and the Deep Earth Imaging Enterprise Future Science Platforms of the Commonwealth Sci- entific Industrial Research Organisation, CSIRO, of Australia. Additional support was provided at Curtin University by The Institute for Geoscience Research (TIGeR) and by the Curtin Institute for Computation. Kristoffer G. van der Zee has received funding from the School of Math- ematical Sciences at University of Nottingham. Judit Muñoz-Matute has received funding from the University of the Basque Country (UPV/EHU) grant No. PIF15/346.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Determination of convection terms and quasi-linearities appearing in diffusion equations

  • Caro, P.
  • Kian, Y.
We consider the highly nonlinear and ill posed inverse problem of determining some general expression appearing in the a diffusion equation from measurements of solutions on the lateral boundary. We consider both linear and nonlinear expression. In the linear case, the equation is a convection-diffusion equation and our inverse problem corresponds to the unique recovery, in some suitable sense, of a time evolving velocity field associated with the moving quantity as well as the density of the medium in some rough setting described by non-smooth coefficients on a Lipschitz domain. In the nonlinear case, we prove the recovery of more general quasilinear expression appearing in a non-linear parabolic equation. Our result give a positive answer to the unique recovery of a general vector valued first order coefficient, depending on both time and space variable, and to the unique recovery inside the domain of quasilinear terms, from measurements restricted to the lateral boundary, for diffusion equations.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Finite element approximation of electromagnetic fields using nonfitting meshes for Geophysics

  • Chaumont-Frelet, T.
  • Nicaise, S.
  • Pardo, D.
We analyze the use of nonfitting meshes for simulating the propagation of electromagnetic waves inside the earth with applications to borehole logging. We avoid the use of parameter homogenization and employ standard edge finite element basis functions. For our geophysical applications, we consider a 3D Maxwell’s system with piecewise constant conductivity and globally constant permittivity and permeability. The model is analyzed and discretized using both the Eand H-formulations. Our main contribution is to develop a sharp error estimate for both the electric and magnetic fields. In the presence of singularities, our estimate shows that the magnetic field approximation is converging faster than the electric field approximation. As a result, we conclude that error estimates available in the literature are sharp with respect to the electric field error but provide pessimistic convergence rates for the magnetic field in our geophysical applications. Another surprising consequence of our analysis is that nonfitting meshes deliver the same convergence rate as fitting meshes to approximate the magnetic field. Our theoretical results are numerically illustrated via 2D experiments. For the analyzed cases, the accuracy loss due to the use of nonfitting meshes islimited, even for high conductivity contrasts.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Fast inversion of logging-while-drilling resistivity measurements acquired in multiple wells

  • Bakr, S.A.
  • Pardo, D.
  • Torres-Verdin, C.
This paper introduces a new method for the fast inversion of borehole resistivity measurements acquired in multiple wells using logging-while-drilling (LWD) instruments. There are two key novel contributions. First, we approximate general three-dimensional (3D) transversely isotropic (TI) formations with a sequence of several \stitched" one-dimensional (1D) planarly layered TI sections. This allows us to approximate the solution of rather complex 3D formations using only 1.5D simulations. Second, the developed method supports the simultaneous inversion of measurements acquired in different neighboring wells and/or with different logging instruments. Numerical experiments performed with realistic 3D synthetic formations confirm the flexibility of the method and the reliability of inversion products. The method yields relative errors below 5% on the model space, and it enables the interpretation of resistivity measurements acquired in multiple wells (e.g., an exploratory, an offset, and a geosteering well) and with any combination of co-axial and/or tri-axial commercial logging measurements acquired with known antennae configurations. Numerical results also indicate that thinly-bedded resistive formations are very sensitive to the presence of noise on the measurements and/or to possible errors on bed boundary locations, while conductive layers are only weakly sensitive to those effects.
BIRD. BCAM's Institutional Repository Data
Publication Capítulo o parte de un libro (BookPart)

A space-time DPG method for the wave equation in multiple dimensions

  • Sepúlveda, P.
  • Gopalakrishnan, J.
A space-time discontinuous Petrov–Galerkin (DPG) method for the linear wave equation is presented. This method is based on a weak formulation that uses a broken graph space. The well-posedness of this formulation is established using a previously presented abstract framework. One of the main tasks in the verification of the conditions of this framework is proving a density result. This is done in detail for a simple domain in arbitrary dimensions. The DPG method based on the weak formulation is then studied theoretically and numerically. Error estimates and numerical results are presented for triangular, rectangular, tetrahedral, and hexahedral meshes of the space-time domain. The potential for using the built-in error estimator of the DPG method for an adaptive mesh refinement strategy in two and three dimensions is also presented, This work was partly supported by AFOSR grant FA9550–17–1–0090. Numerical studies were partially facilitated by the Portland Institute of Sciences (PICS) established under NSF grant DMS–1624776.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Asymptotic Models for the Electric Potential across a Highly Conductive Casing

  • Erdozain, A.
  • Péron, V.
  • Pardo, D.
We analyze a configuration that involves a steel-cased borehole, where the casing that covers the borehole is considered as a highly conductive thin layer. We develop an asymptotic method for deriving reduced problems capable of efficiently dealing with the numerical difficulties caused by the casing when applying traditional numerical methods. We derive several reduced models by employing two different approaches, each of them leading to different classes of models. We prove stability and convergence results for these models. The theoretical orders of convergence are supported by numerical results obtained with the finite element method.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Parallel refined Isogeometric Analysis in 3D

  • Siwik, L.
  • Wozniak, M.
  • Trujillo, V.
  • Pardo, D.
  • Calo, V.M.
  • Paszynski, M.
We study three-dimensional isogeometric analysis (IGA) and the solution of the resulting system of linear equations via a direct solver. IGA uses highly continuous $C^{p-1}$ basis functions, which provide multiple benefits in terms of stability and convergence properties. However, smooth basis significantly deteriorate the direct solver performance and its parallel scalability. As a partial remedy for this, refined Isogeometric Analysis (rIGA) method improves the sequential execution of direct solvers. The refinement strategy enriches traditional highly-continuous $C^{p-1}$ IGA spaces by introducing low-continuity $C^{0}$ 0-hyperplanes along the boundaries of certain pre-defined macro-elements. In this work, propose a solution strategy for rIGA for parallel distributed memory machines and compare the computational costs of solving rIGA vs IGA discretizations. We verify our estimates with parallel numerical experiments. Results show that the weak parallel scalability of the direct solver improves approximately by a factor of $p^{2}$ when considering rIGA discretizations rather than highly-continuous IGA spaces.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Modified Hamiltonian Monte Carlo for Bayesian Inference

  • Radivojevic, T.
  • Akhmatskaya, E.
The Hamiltonian Monte Carlo (HMC) method has been recognized as a powerful sampling tool in computational statistics. We show that performance of HMC can be significantly improved by incorporating importance sampling and an irreversible part of the dynamics into a chain. This is achieved by replacing Hamiltonians in the Metropolis test with modified Hamiltonians, and a complete momentum update with a partial momentum refreshment. We call the resulting generalized HMC importance sampler—Mix & Match Hamiltonian Monte Carlo (MMHMC). The method is irreversible by construction and further benefits from (i) the efficient algorithms for computation of modified Hamiltonians; (ii) the implicit momentum update procedure and (iii) the multi-stage splitting integrators specially derived for the methods sampling with modified Hamiltonians. MMHMC has been implemented, tested on the popular statistical models and compared in sampling efficiency with HMC, Riemann Manifold Hamiltonian Monte Carlo, Generalized Hybrid Monte Carlo, Generalized Shadow Hybrid Monte Carlo, Metropolis Adjusted Langevin Algorithm and Random Walk Metropolis-Hastings. To make a fair comparison, we propose a metric that accounts for correlations among samples and weights, and can be readily used for all methods which generate such samples. The experiments reveal the superiority of MMHMC over popular sampling techniques, especially in solving high dimensional problems., Agile BioFoundry (http://agilebiofoundry.org) supported by the U.S. Department of Energy, Energy Efficiency and Renewable Energy, Bioenergy Technologies Office, through contract DE-AC02-05CH11231 between Lawrence Berkeley National Laboratory and the U.S. Department of Energy.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Variational Formulations for Explicit Runge-Kutta Methods

  • Muñoz-Matute, J.
  • Pardo, D.
  • Calo, V.M.
  • Alberdi, E.
Variational space-time formulations for partial di fferential equations have been of great interest in the last decades, among other things, because they allow to develop mesh-adaptive algorithms. Since it is known that implicit time marching schemes have variational structure, they are often employed for adaptivity. Previously, Galerkin formulations of explicit methods were introduced for ordinary di fferential equations employing speci fic inexact quadrature rules. In this work, we prove that the explicit Runge-Kutta methods can be expressed as discontinuous-in-time Petrov-Galerkin methods for the linear di ffusion equation. We systematically build trial and test functions that, after exact integration in time, lead to one, two, and general stage explicit Runge-Kutta methods. This approach enables us to reproduce the existing time-domain (goal-oriented) adaptive algorithms using explicit methods in time.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Refined Isogeometric Analysis for fluid mechanics and electromagnetism

  • Garcia, D.
  • Pardo, D.
  • Calo, V.M.
Starting from a highly continuous isogeometric analysis discretization, we introduce hyperplanes that partition the domain into subdomains and reduce the continuity of the discretization spaces at these hyperplanes. As the continuity is reduced, the number of degrees of freedom in the system grows. The resulting discretization spaces are finer than standard maximal continuity IGA spaces. Despite the increase in the number of degrees of freedom, these finer spaces deliver simulation results faster with direct solvers than both traditional finite element and isogeometric analysis for meshes with a fixed number of elements. In this work, we analyze the impact of continuity reduction on the number of Floating Point Operations (FLOPs) and computational times required to solve fluid flow and electromagnetic problems with structured meshes and uniform polynomial orders. Theoretical estimates show that for sufficiently large grids, an optimal continuity reduction decreases the computational cost by a factor of . Numerical results confirm these theoretical estimates. In a 2D mesh with one million elements and polynomial order equal to five, the discretization including an optimal continuity pattern allows to solve the vector electric field, the scalar magnetic field, and the fluid flow problems an order of magnitude faster than when using a highly continuous IGA discretization. 3D numerical results exhibit more moderate savings due to the limited mesh sizes considered in this work.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

An optimal scaling to computationally tractable dimensionless models: Study of latex particles morphology formation

  • Rusconi, S.
  • Dutykh, D.
  • Zarnescu, A.
  • Sokolovski, D.
  • Akhmatskaya, E.
In modelling of chemical, physical or biological systems it may occur that the coefficients, multiplying various terms in the equation of interest, differ greatly in magnitude, if a particular system of units is used. Such is, for instance, the case of the Population Balance Equations (PBE) proposed to model the Latex Particles Morphology formation. The obvious way out of this difficulty is the use of dimensionless scaled quantities, although often the scaling procedure is not unique. In this paper, we introduce a conceptually new general approach, called Optimal Scaling (OS). The method is tested on the known examples from classical and quantum mechanics, and applied to the Latex Particles Morphology model, where it allows us to reduce the variation of the relevant coefficients from 49 to just 4 orders of magnitudes. The PBE are then solved by a novel Generalised Method Of Characteristics, and the OS is shown to help reduce numerical error, and avoid unphysical behaviour of the solution. Although inspired by a particular application, the proposed scaling algorithm is expected find application in a wide range of chemical, physical and biological problems.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Adjoint-based formulation for computing derivatives with respect to bed boundary positions in resistivity geophysics

  • Chaumont-Frelet, T.
  • Shahriari, M.
  • Pardo, D.
In inverse geophysical resistivity problems, it is common to optimize for specific resistivity values and bed boundary positions, as needed, for example, in geosteering applications. When using gradient-based inversion methods such as Gauss-Newton, we need to estimate the derivatives of the recorded measurements with respect to the inversion parameters. In this article, we describe an adjoint-based formulation for computing the derivatives of the electromagnetic fields withrespect to the bed boundary positions. The key idea to obtain this adjoint-based formulation is to separate the tangential and normal components of the field, and treat them differently. We then apply this method to a 1.5D borehole resistivity problem. We illustrate its accuracy and some of its convergence properties via numerical experimentation by comparing the results obtained with our proposed adjoint-based method vs. both the analytical results when available and a finite differences approximation of the derivative.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Forward-in-Time Goal-Oriented Adaptivity

  • Muñoz-Matute, J.
  • Pardo, D.
  • Calo, V.M.
  • Alberdi, E.
In goal-oriented adaptive algorithms for partial differential equations, we adapt the finite element mesh in order to reduce the error of the solution in some quantity of interest. In time-dependent problems, this adaptive algorithm involves solving a dual problem that runs backward in time. This process is, in general, computationally expensive in terms of memory storage. In this work, we define a pseudo-dual problem that runs forward in time. We also describe a forward-in-time adaptive algorithm that works for some specific problems. Although it is not possible to define a general dual problem running forwards in time that provides information about future states, we provide numerical evidence via one-dimensional problems in space to illustrate the efficiency of our algorithm as well as its limitations. Finally, we propose a hybrid algorithm that employs the classical backward-in-time dual problem once and then performs the adaptive process forwards in time.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Exploring Li-ion conductivity in cubic, tetragonal and mixed-phase Al-substituted Li7La3Zr2O12 using atomistic simulations and effective medium theory

  • Rincón, M.
  • García Daza, F.A.
  • Carrasco, J.
  • Akhmatskaya, E.
Garnet Li7La3Zr2O12 (LLZO) is a promising solid electrolyte candidate for solid-state Li-ion batteries, but at room temperature it crystallizes in a poorly Li-ion conductive tetragonal phase. To this end, partial substitution of Li+ by Al3+ ions is an effective way to stabilize the highly conductive cubic phase at room temperature. Yet, fundamental aspects regarding this aliovalent substitution remain poorly understood. In this work, we use molecular dynamics and advanced hybrid Monte Carlo methods for systematic study of the room temperature Li-ion diffusion in tetragonal and cubic LLZO to shed light on important open questions. We find that Al substitution in tetrahedral sites of the tetragonal LLZO allows previously inaccessible sites to become available, which enhances Li-ion conductivity. In contrast, in the cubic phase Li-ion diffusion paths become blocked in the vicinity of Al ions, resulting in a decrease of Li-ion conductivity. Moreover, combining the conductivities of individual phases through an effective medium approximation allowed us to estimate the conductivities of cubic/tetragonal phase mixtures that are in good agreement with those reported in several experimental works. This suggests that phase coexistence (due to phase equilibrium or gradients in Al content within a sample) could have a significant impact on the conductivity of Al-substituted LLZO, particularly at low contents of Al3+. Overall, by making a thorough comparison with reported experimental data, the theoretical study and simulations of this work advance our current understanding of Li-ion mobility in Al-substituted LLZO garnets and might guide future in-depth characterization experiments of this relevant energy storage material., MINECO ENE2016-81020-R. SGI/IZO-SGIker UPV/EHU. the i2BASQUE academic network. Barcelona Supercomputer Center (QCM-2016-450 3-0002).
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

A Deep Neural Network as Surrogate Model for Forward Simulation of Borehole Resistivity Measurements

  • Shahriari, M.
  • Pardo, D.
  • Moser, B.
Inverse problems appear in multiple industrial applications. Solving such inverse problems require the repeated solution of the forward problem. This is the most time-consuming stage when employing inversion techniques, and it constitutes a severe limitation when the inversion needs to be performed in real-time. In here, we focus on the real-time inversion of resistivity measurements for geosteering. We investigate the use of a deep neural network (DNN) to approximate the forward function arising from Maxwell's equations, which govern the electromagnetic wave propagation through a media. By doing so, the evaluation of the forward problems is performed offline, allowing for the online real-time evaluation (inversion) of the DNN.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

A DPG-based time-marching scheme for linear hyperbolic problems

  • Muñoz-Matute, J.
  • Pardo, D.
  • Demkowicz, L.
The Discontinuous Petrov-Galerkin (DPG) method is a widely employed discretization method for Partial Di fferential Equations (PDEs). In a recent work, we applied the DPG method with optimal test functions for the time integration of transient parabolic PDEs. We showed that the resulting DPG-based time-marching scheme is equivalent to exponential integrators for the trace variables. In this work, we extend the aforementioned method to time-dependent hyperbolic PDEs. For that, we reduce the second order system in time to first order and we calculate the optimal testing analytically. We also relate our method with exponential integrators of Gautschi-type. Finally, we validate our method for 1D/2D + time linear wave equation after semidiscretization in space with a standard Bubnov-Galerkin method. The presented DPG-based time integrator provides expressions for the solution in the element interiors in addition to those on the traces. This allows to design di fferent error estimators to perform adaptivity.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

Error Control and Loss Functions for the Deep Learning Inversion of Borehole Resistivity Measurements

  • Shahriari, M.
  • Pardo, D.
  • Rivera, J.A.
  • Torres-Verdín, C.
  • Picon, A.
  • Ossandón, S.
  • Calo, V.M.
  • Del Ser, J.
Deep learning (DL) is a numerical method that approximates functions. Recently, its use has become attractive for the simulation and inversion of multiple problems in computational mechanics, including the inversion of borehole logging measurements for oil and gas applications. In this context, DL methods exhibit two key attractive features: a) once trained, they enable to solve an inverse problem in a fraction of a second, which is convenient for borehole geosteering operations as well as in other real-time inversion applications. b) DL methods exhibit a superior capability for approximating highly-complex functions across different areas of knowledge. Nevertheless, as it occurs with most numerical methods, DL also relies on expert design decisions that are problem specific to achieve reliable and robust results. Herein, we investigate two key aspects of deep neural networks (DNNs) when applied to the inversion of borehole resistivity measurements: error control and adequate selection of the loss function. As we illustrate via theoretical considerations and extensive numerical experiments, these interrelated aspects are critical to recover accurate inversion results.
BIRD. BCAM's Institutional Repository Data
Publication Artículo científico (JournalArticle)

A Simulation Method for the Computation of the E

  • Omella, A. J.
  • Alvarez-Aramberri, J.
  • Strugaru, M.
  • Darrigrand, V.
  • Pardo, D.
  • Gonzalez, H.
  • Santos, C.
We propose a set of numerical methods for the computation of the frequency-dependent eff ective primary wave velocity of heterogeneous rocks. We assume the rocks' internal microstructure is given by micro-computed tomography images. In the low/medium frequency regime, we propose to solve the acoustic equation in the frequency domain by a Finite Element Method (FEM). We employ a Perfectly Matched Layer to truncate the computational domain and we show the need to repeat the domain a su cient number of times to obtain accurate results. To make this problem computationally tractable, we equip the FEM with non-fitting meshes and we precompute multiple blocks of the sti ffness matrix. In the high-frequency range, we solve the eikonal equation with a Fast Marching Method. Numerical results con rm the validity of the proposed methods and illustrate the e ffect of density, porosity, and the size and distribution of the pores on the e ective compressional wave velocity.