Pasar al contenido principal

Resultados relacionados

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

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

Towards a parameter-free method for high Reynolds number turbulent flow simulation based on adaptive finite element approximation

  • Hoffman, J.
  • Jansson, J.
  • Jansson, N.
  • de Abreu, R.V.
This article is a review of our work towards a parameter-free method for simulation of turbulent flow at high Reynolds numbers. In a series of papers we have developed a model for turbulent flow in the form of weak solutions of the Navier-Stokes equations, approximated by an adaptive finite element method, where: (i) viscous dissipation is assumed to be dominated by turbulent dissipation proportional to the residual of the equations, and (ii) skin friction at solid walls is assumed to be negligible compared to inertial effects. The result is a computational model without empirical data, where the only model parameter is the local size of the finite element mesh. Under adaptive refinement of the mesh based on a posteriori error estimation, output quantities of interest in the form of functionals of the finite element solution converge to become independent of the mesh resolution, and thus the resulting method has no adjustable parameters. No ad hoc design of the mesh is needed, instead the mesh is optimized based on solution features, in particular no boundary layer mesh is needed. We connect the computational method to the mathematical concept of a dissipative weak solution of the Euler equations, as a model of high Reynolds number turbulent flow, and we highlight a number of benchmark problems for which the method is validated. The purpose of the article is to present the computational framework in a concise form, to report on recent progress, and to discuss open problems that are subject to ongoing research.
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

BBIPED: BCAM-Baltogar Industrial Platform for Engineering Design

  • Alonso-Montes, C.
  • Garcia, I.
  • Ramezani, A.
  • Remaki, L.
Currently, commercial software for computational fluid dynamics offers a good set of features to deal with traditional designs. Within a competitive market industrial innovation is a key factor that must be faced by companies. However, the design of solutions to deal with industrial challenges cannot be done within commercial software due to the lack of flexibility. Open source initiatives are a good option but the learning curve is high, specially for industrial engineers profiles. In this paper, we present the BBIPED platform which has been designed to deal with turbomachinery applications in a simple and friendly way. The main goal is to keep the platform as simpler as possible providing the enough flexibility to include out-of-the-box solutions to cope with industrial challenges. BBIPED platform provides links with currently existing remarkable open source initiatives altogether with our own developments. Particularly, it is remarkable a first approach for automatic mesh generation based on geometry parametrization solution, and the provision of novel techniques to deal with multiple rotating frame (MRF): Multizone MRF an Virtual MRF. Case tests were designed to test the solutions and to assess and validate the results against commercial suites with promising results.
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

A multi-objective memetic inverse solver reinforced by local optimization methods

  • Gajda-Zagórska, E.
  • Schaefer, R.
  • Smolka, M.
  • Pardo, D.
  • Alvarez-Aramberri, J.
We propose a new memetic strategy that can solve the multi-physics, complex inverse problems, formulated as the multi-objective optimization ones, in which objectives are misfits between the measured and simulated states of various governing processes. The multi-deme structure of the strategy allows for both, intensive, relatively cheap exploration with a moderate accuracy and more accurate search many regions of Pareto set in parallel. The special type of selection operator prefers the coherent alternative solutions, eliminating artifacts appearing in the particular processes. The additional accuracy increment is obtained by the parallel convex searches applied to the local scalarizations of the misfit vector. The strategy is dedicated for solving ill-conditioned problems, for which inverting the single physical process can lead to the ambiguous results. The skill of the selection in artifact elimination is shown on the benchmark problem, while the whole strategy was applied for identification of oil deposits, where the misfits are related to various frequencies of the magnetic and electric waves of the magnetotelluric measurements
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Dimensionally adaptive hp-finite element simulation and inversion of 2D magnetotelluric measurements

  • Alvarez-Aramberri, J.
  • Pardo, D.
Magnetotelluric (MT) problems often contain different subdomains where the conductivity of the media depends upon one, two, or three spatial variables. Traditionally, when a MT problem incorporates a three-dimensional (3D) subdomain, the numerical method employed for simulation and inversion was 3D over then entire domain. In here, we propose to take advantage of the possibly lower dimensionality of certain subdomains during the inversion process. By doing so, we obtain significant computational savings (up to 75% in some scenarios) and increased accuracy on the results. We numerically illustrate this method by employing two dimensional (2D) computations based on a multi-goal oriented . hp-adaptive Finite Element Method (FEM) that exhibits superior convergence properties. Additionally, we provide a formulation for implementing an efficient adjoint based method for the computation of the derivatives of the impedance, and we show the importance of the (a) proper selection of the inversion variable, and (b) the advantages of using both the Transverse Electric (TE) and Transverse Magnetic (TM) measurements for the proper inversion of MT data.
BIRD. BCAM's Institutional Repository Data
Publicación 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
Publicación Artículo científico (JournalArticle)

Predicting Pregnancy Outcomes Using Longitudinal Information: A Penalized Splines Mixed–Effects Model Approach

  • De la Cruz, R.
  • Fuentes, C.
  • Meza, C.
  • Lee, D.J.
  • Arribas-Gil, A.
We propose a semiparametric mixed–effects model (SNMM) using penalized splines to clas- sify longitudinal data and improve the prediction of a binary outcome. The work is motivated by a study in which different hormone levels were measured during the early stages of preg- nancy, and the challenge is using this information to predict normal versus abnormal pregnancy outcomes. The aim of this paper is to compare models and estimation strategies based on alternative formulations of SNMMs depending on the characteristics of the data set under con- sideration. For our motivating example, we address the classification problem using a particular case of the SNMM in which the parameter space has a finite dimensional component (fixed effects and variance components) and an infinite dimensional component (unknown function) that need to be estimated. The nonparametric component of the model is estimated using pe- nalized splines. For the parametric component, we compare the advantages of using random effects versus direct modeling of the correlation structure of the errors. Numerical studies show that our approach improves over other existing methods for the analysis of this type of data. Furthermore, the results obtained using our method support the idea that explicit modeling of the serial correlation of the error term improves the prediction accuracy with respect to a model with random effects, but independent errors., MTM2014-52184-P
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

PetIGA-MF: A multi-field high-performance toolbox for structure-preserving B-splines spaces

  • Sarmiento, A.F.
  • Côrtes , A.M.A.
  • Garcia, D.
  • Dalcin, L.
  • Collier, N.
  • Calo, V.M.
We describe a high-performance solution framework for isogeometric discrete differential forms based on B-splines: PetIGA-MF. Built on top of PetIGA, an open-source library we have built and developed over the last decade, PetIGA-MF is a general multi-field discretization tool. To test the capabilities of our implementation, we solve different viscous flow problems such as Darcy, Stokes, Brinkman, and Navier–Stokes equations. Several convergence benchmarks based on manufactured solutions are presented assuring optimal convergence rates of the approximations, showing the accuracy and robustness of our solver., National Priorities Research Program grant 7-1482-1-278 from the Qatar National Research Fund (a member of The Qatar Foundation). Agencia Nacional de Promoción Científica y Tecnológica grants PICT 2014-2660 and PICT-E 2014-019. The J. Tinsley Oden Faculty Fellowship Research Program at the Institute for Computational Engineering and Sciences (ICES) of the University of Texas at Austin.
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

A source time reversal method for seismicity induced by mining

  • Brevis, R.I.
  • Ortega, J.H.
  • Pardo, D.
In this work, we present a modified Time-Reversal Mirror (TRM) Method, called Source Time Reversal (STR), to find the spatial distribution of a seismic source induced by mining activity. This methodology is based on a known full description of the temporal dependence of the source, the Duhamel's principle, and the time-reverse property of the wave equation. We also provide an error estimate of the reconstruction when the measurements are acquired over the entire boundary, and we show experimentally the influence of measuring on a subdomain of the boundary. Numerical results indicate that the methodology is able to recover continuous and discontinuous sources, and it remains stable for partial boundary measurements.
BIRD. BCAM's Institutional Repository Data
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Acceleration strategies for elastic full waveform inversion workflows in 2D and 3D

  • Kormann, Jean
  • Rodríguez, Juan E.
  • Ferrer, Miguel
  • Farrés, Albert
  • Gutiérrez, Natalia|||0000-0001-7921-7322
  • de la Puente, Josep
  • Hanzich, Mauricio
  • Cela, José M.
Full waveform inversion (FWI) is one of the most challenging procedures to obtain quantitative information of the subsurface. For elastic inversions, when both compressional and shear velocities have to be inverted, the algorithmic issue becomes also a computational challenge due to the high cost related to modelling elastic rather than acoustic waves. This shortcoming has been moderately mitigated by using high-performance computing to accelerate 3D elastic FWI kernels. Nevertheless, there is room in the FWI workflows for obtaining large speedups at the cost of proper grid pre-processing and data decimation techniques. In the present work, we show how by making full use of frequency-adapted grids, composite shot lists and a novel dynamic offset control strategy, we can reduce by several orders of magnitude the compute time while improving the convergence of the method in the studied cases, regardless of the forward and adjoint compute kernels used., The authors thank REPSOL for the permission to publish the present research and for funding through the AURORA project. J. Kormann also thankfully acknowledges the computer resources, technical expertise and assistance provided by the Barcelona Supercomputing Center - Centro Nacional de Supercomputacti ´on together with the Spanish Supercomputing Network (RES) through grant FI-2014-2-0009. This project has received funding from the European Union’s Horizon 2020, research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 644202. The research leading to these results has received funding from the European Union’s Horizon 2020 Programme (2014–2020) and from the Brazilian Ministry of Science, Technology and Innovation through Rede Nacional de Pesquisa (RNP) under the HPC4E Project (www.hpc4e.eu), grant agreement no. 689772.We further want to thank the Editor Clint N. Dawson for his help, and Andreas Fichtner and an anonymous reviewer for their comments and suggestions to improve the manuscript., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Evaluation of parallel direct sparse linear solvers in electromagnetic geophysical problems

  • Puzyrev, Vladimir
  • Koric, Seid
  • Wilkin, Scott
High performance computing is absolutely necessary for large-scale geophysical simulations. In order to obtain a realistic image of a geologically complex area, industrial surveys collect vast amounts of data making the computational cost extremely high for the subsequent simulations. A major computational bottleneck of modeling and inversion algorithms is solving the large sparse systems of linear ill-conditioned equations in complex domains with multiple right hand sides. Recently, parallel direct solvers have been successfully applied to multi-source seismic and electromagnetic problems. These methods are robust and exhibit good performance, but often require large amounts of memory and have limited scalability. In this paper, we evaluate modern direct solvers on large-scale modeling examples that previously were considered unachievable with these methods. Performance and scalability tests utilizing up to 65,536 cores on the Blue Waters supercomputer clearly illustrate the robustness, efficiency and competitiveness of direct solvers compared to iterative techniques. Wide use of direct methods utilizing modern parallel architectures will allow modeling tools to accurately support multi-source surveys and 3D data acquisition geometries, thus promoting a more efficient use of the electromagnetic methods in geophysics., The authors would like to thank the MUMPS and PARDISO developers for providing free academic licenses and Dr. Anshul Gupta for access to his solver library which is not publicly available. We also would like to thank the Private Sector Program and the Blue Waters sustained-petascale computing project at the National Center for Supercomputing Applications (NCSA), which is supported by the National Science Foundation (awards OCI- 0725070 and ACI-1238993) and the state of Illinois. The shared-memory tests were performed on the MareNostrum supercomputer of the Barcelona Supercomputer Center. The first author acknowledges funding from the Repsol-BSC Research Center through the AURORA project and support from the RISE Horizon 2020 European Project GEAGAM (644602). The authors wish to thank Jef Caers and two anonymous reviewers for their valuable comments that significantly helped to improve this paper., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A performance analysis of a mimetic finite difference scheme for acoustic wave propagation on GPU platforms

  • Otero Calviño, Beatriz|||0000-0002-9194-559X
  • Frances, Jorge
  • Rodriguez Cruz, Robert
  • Rojas, Otilio
  • Solano, Freysimar
  • Guevara-Jordan, Juan
Realistic applications of numerical modeling of acoustic wave dynamics usually demand high-performance computing because of the large size of study domains and demanding accuracy requirements on simulation results. Forward modeling of seismic motion on a given subsurface geological structure is by itself a good example of such applications, and when used as a component of seismic inversion tools or as a guide for the design of seismic surveys, its computational cost increases enormously. In the case of finite difference methods (or any other volumen-discretization scheme), memory and computing demands rise with grid refinement, which may be necessary to reduce errors on numerical wave patterns and better capture target physical devices. In this work, we present several implementations of a mimetic finite difference method for the simulation of acoustic wave propagation on highly dense staggered grids. These implementations evolve as different optimization strategies are employed starting from appropriate setting of compilation flags, code vectorization by using streaming SIMD extensions Advanced Vector Extensions (AVX), CPU parallelization by exploiting the Open Multi-Processing framework to the final code parallelization on graphics processing unit platforms. We present and discuss the increasing processing speed up of this mimetic scheme achieved by the gradual implementation and testing of all these performance optimizations. In terms of simulation times, the performance of our graphics processing unit parallel implementations is consistently better than the best CPU version. Copyright © 2016 John Wiley & Sons, Ltd., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Elliptic harbor wave model with perfectly matched layer and exterior bathymetry effects

  • Modesto Galende, David|||0000-0001-9540-8815
  • Fernández Méndez, Sonia|||0000-0002-9305-7684
  • Huerta, Antonio|||0000-0003-4198-3798
Standard strategies for dealing with the Sommerfeld condition in elliptic mild-slope models require strong assumptions on the wave field in the region exterior to the computational domain. More precisely, constant bathymetry along (and beyond) the open boundary, and parabolic approximations–based boundary conditions are usually imposed. Generally, these restrictions require large computational domains, implying higher costs for the numerical solver. An alternative method for coastal/harbor applications is proposed here. This approach is based on a perfectly matched layer (PML) that incorporates the effects of the exterior bathymetry. The model only requires constant exterior depth in the alongshore direction, a common approach used for idealizing the exterior bathymetry in elliptic models. In opposition to standard open boundary conditions for mild-slope models, the features of the proposed PML approach include (1) completely noncollinear coastlines, (2) better representation of the real unbounded domain using two different lateral sections to define the exterior bathymetry, and (3) the generation of reliable solutions for any incoming wave direction in a small computational domain. Numerical results of synthetic tests demonstrate that solutions are not significantly perturbed when open boundaries are placed close to the area of interest. In more complex problems, this provides important performance improvements in computational time, as shown for a real application of harbor agitation., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Toward an automatic full-wave inversion: Synthetic study cases

  • Kormann, Jean
  • Rodriguez, Juan E.
  • Gutiérrez, Natalia|||0000-0001-7921-7322
  • Ferrer, Miguel
  • Rojas, Otilio
  • de la Puente, Josep
  • Hanzich, Mauricio
  • Cela, Jose M.
Full-waveform inversion (FWI) in seismic scenarios continues to be a complex procedure for subsurface imaging that might require extensive human interaction in terms of model setup, constraints, and data preconditioning. The underlying reason is the strong nonlinearity of the problem that forces the addition of a priori knowledge (or bias) in order to obtain geologically sound results. In particular, when the use of a long-offset receiver is not possible or may not favor the reconstruction of the fine structure of the model, one needs to rely on reflection data. As a consequence, the inversion process is more prone to becoming stuck in local minima. Nevertheless, misfit functionals can be devised that can either cope with missing long-wavenumber features of initial models (e.g., cross-correlation-based misfit) or invert reflection-dominated data whenever the models are sufficiently good (e.g., normalized offset-limited least-squares misfit). By combining both, high-frequency data content with poor initial models can be successfully inverted. If one can figure out simple parameterizations for such functionals, the amount of uncertainty and manual work related to tuning FWI would be substantially reduced. Thus, FWI might become a semiautomatized imaging tool., We want to thank Repsol for funding this research by means of the Aurora project. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 644202. Additionally, the research leading to these results has received funding from the European Union’s Horizon 2020 Programme (2014-2020) and from Brazilian Ministry of Science, Technology and Innovation through Rede Nacional de Pesquisa (RNP) under the HPC4E Project (www.hpc4e.eu), grant agreement No 689772. We acknowledge Chevron for the dataset that was used in our second example., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A new mimetic scheme for the acoustic wave equation

  • Solano, Freysimar
  • Guevara-Jordan, Juan
  • Rojas, Otilio
  • Otero Calviño, Beatriz|||0000-0002-9194-559X
  • Rodriguez, R.
A new mimetic finite difference scheme for solving the acoustic wave equation is presented. It combines a novel second order tensor mimetic discretizations in space and a leapfrog approximation in time to produce an explicit multidimensional scheme. Convergence analysis of the new scheme on a staggered grid shows that it can take larger time steps than standard finite difference schemes based on ghost points formulation. A set of numerical test problems gives evidence of the versatility of the new mimetic scheme for handling general boundary conditions., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Wavefield compression for adjoint methods in full-waveform inversion

  • Boehm, Christian
  • Hanzich, Mauricio
  • de la Puente, Josep
  • Fichtner, Andreas
Adjoint methods are a key ingredient of gradient-based full-waveform inversion schemes. While being conceptually elegant, they face the challenge of massive memory requirements caused by the opposite time directions of forward and adjoint simulations and the necessity to access both wavefields simultaneously for the computation of the sensitivity kernel. To overcome this bottleneck, we have developed lossy compression techniques that significantly reduce the memory requirements with only a small computational overhead. Our approach is tailored to adjoint methods and uses the fact that the computation of a sufficiently accurate sensitivity kernel does not require the fully resolved forward wavefield. The collection of methods comprises reinterpolation with a coarse temporal grid as well as adaptively chosen polynomial degree and floating-point precision to represent spatial snapshots of the forward wavefield on hierarchical grids. Furthermore, the first arrivals of adjoint waves are used to identify “shadow zones” that do not contribute to the sensitivity kernel. Numerical experiments show the high potential of this approach achieving an effective compression factor of three orders of magnitude with only a minor reduction in the rate of convergence. Moreover, it is computationally cheap and straightforward to integrate in finite-element wave propagation codes with possible extensions to finite-difference methods., The authors would like to thank Editor John Etgen, Associate Editor Anatoly Baumstein and three anonymous reviewers for their valuable comments and excellent suggestions to improve the paper. We gratefully acknowledge support by the Swiss National Supercomputing Centre (CSCS) in the form of CHRONOS project ch1 and PASC project GeoScale. The research leading to these results has received funding from the European Union's Horizon 2020 Programme (2014-2020) and from Brazilian Ministry of Science, Technology and Innovation through Rede Nacional de Pesquisa (RNP) under the HPC4E Project (www.hpc4e.eu), grant agreement n. 689772. Furthermore, the first author acknowledges funding from Shell within the project \Boosting full-waveform inversion"., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Compact finite difference modeling of 2-D acoustic wave propagation

  • Córdova, Luis
  • Rojas, Otilio
  • Otero Calviño, Beatriz|||0000-0002-9194-559X
  • Castillo, Jose
We present two fourth-order compact finite difference (CFD) discretizations of the velocity–pressure formulation of the acoustic wave equation in 2-D rectangular grids. The first method uses standard implicit CFD on nodal meshes and requires solving tridiagonal linear systems along each grid line, while the second scheme employs a novel set of mimetic CFD operators for explicit differentiation on staggered grids. Both schemes share a Crank–Nicolson time integration decoupled by the Peaceman–Rachford splitting technique to update discrete fields by alternating the coordinate direction of CFD differentiation (ADI-like iterations). For comparison purposes, we also implement a spatially fourth-order FD scheme using non compact staggered mimetic operators in combination to second-order leap-frog time discretization. We apply these three schemes to model acoustic motion under homogeneous boundary conditions and compare their experimental convergence and execution times, as grid is successively refined. Both CFD schemes show four-order convergence, with a slight superiority of the mimetic version, that leads to more accurate results on fine grids. Conversely, the mimetic leap-frog method only achieves quadratic convergence and shows similar accuracy to CFD results exclusively on coarse grids. We finally observe that computation times of nodal CFD simulations are between four and five times higher than those spent by the mimetic CFD scheme with similar grid size. This significant performance difference is attributed to solving those embedded linear systems inherent to implicit CFD., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A parallel tool for numerical approximation of 3D electromagnetic surveys in geophysics

  • Castillo Reyes, Octavio|||0000-0003-4271-5015
  • de la Puente Álvarez, Josep
  • Modesto Galende, David|||0000-0001-9540-8815
  • Puzyrev, Vladimir
  • Cela Espín, José M.|||0000-0002-0122-1468
This paper presents an edge-based parallel code for the data computation that arises when applying one of the most popular electromagnetic methods in geophysics, namely, the controlled-source electromagnetic method (CSEM). The computational implementation is based on the linear Edge Finite Element Method in 3D isotropic domains because it has the ability to eliminate spurious solutions and is claimed to yield accurate results. The framework structure is able to exploit the embarrassingly-parallel tasks and the advantages of the geometric flexibility as well as to work with three different orientations for the dipole, or excitation source, on unstructured tetrahedral meshes in order to represent complex geological bodies through a local refinement technique. We demonstrate the performance and accuracy of our tool on the Marenostrum supercomputer (Barcelona Supercomputing Center) through scaling tests and canonical tests, respectively., This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 644202. Authors gratefully acknowledge the support from the Mexican National Council for Science and Technology (CONACyT). This work benefitted from helpful suggestions of Hélène Barucq and Julien Diaz from MAGIQUE-3D team at Institut National de Recherche en Informatique et en Automatique (INRIA) and two anonymous reviewers., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A review of block Krylov subspace methods for multisource electromagnetic modelling

  • Puzyrev, Vladimir
  • Cela, José M.
Practical applications of controlled-source electromagnetic modeling require solutions for multiple sources at several frequencies, thus leading to a dramatic increase of the computational cost. In this paper we present an approach using block Krylov subspace solvers that are iterative methods especially designed for problems with multiple right hand-sides. Their main advantage is the shared subspace for approximate solutions, hence, these methods are expected to converge in less iterations than the corresponding standard solver applied to each linear system. Block solvers also share the same preconditioner, which is constructed only once. Simultaneously computed block operations have better utilization of cache due to the less frequent access to the system matrix. In this paper we implement two different block solvers for sparse matrices resulting from the finitedifference and the finite-element discretizations, discuss the computational cost of the algorithms and study their dependence on the number of right-hand sides given at once. The effectiveness of the proposed methods is demonstrated on two electromagnetic survey scenarios, including a large marine model. As the results of the simulations show, when a powerful preconditioning is employed, block methods are faster than standard iterative techniques in terms of both iterations and time., Funding for this work was provided by the Repsol-BSC Research Center and the RISE Horizon 2020 European Project GEAGAM (644602). MareNostrum Supercomputer was used for the numerical tests. The authors express their thanks to Rene-Edouard Plessix, Mikhail Zaslavsky and one anonymous reviewer for their valuable comments that significantly helped to improve the paper., Peer Reviewed
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Hölder regularity for the Moore-Gibson-Thompson equation with infinite delay

  • Abadías Ullod, Luciano
  • Lizama, Carlos
  • Murillo-Arcila, Marina
We characterize the well-posedness of a third order in time equation with infinite delay in Ho ¨lder spaces, solely in terms of spectral properties concerning the data of the problem. Our analysis includes the case of the linearized Kuznetzov and Westerwelt equations. We show in case of the Laplacian operator the new and surprising fact that for the standard memory kernel g(t) = t¿-1 e-at the third order problem is ill-posed whenever 0 < ¿ = 1 and a is inversely G(¿ ) proportional to the damping term of the given model.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Elliptic harbor wave model with perfectly matched layer and exterior bathymetry effects

  • Modesto Galende, David
  • Fernández Méndez, Sonia
  • Huerta, Antonio
Standard strategies for dealing with the Sommerfeld condition in elliptic mild-slope models require strong assumptions on the wave field in the region exterior to the computational domain. More precisely, constant bathymetry along (and beyond) the open boundary, and parabolic approximations–based boundary conditions are usually imposed. Generally, these restrictions require large computational domains, implying higher costs for the numerical solver. An alternative method for coastal/harbor applications is proposed here. This approach is based on a perfectly matched layer (PML) that incorporates the effects of the exterior bathymetry. The model only requires constant exterior depth in the alongshore direction, a common approach used for idealizing the exterior bathymetry in elliptic models. In opposition to standard open boundary conditions for mild-slope models, the features of the proposed PML approach include (1) completely noncollinear coastlines, (2) better representation of the real unbounded domain using two different lateral sections to define the exterior bathymetry, and (3) the generation of reliable solutions for any incoming wave direction in a small computational domain. Numerical results of synthetic tests demonstrate that solutions are not significantly perturbed when open boundaries are placed close to the area of interest. In more complex problems, this provides important performance improvements in computational time, as shown for a real application of harbor agitation., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A parallel tool for numerical approximation of 3D electromagnetic surveys in geophysics

  • Castillo Reyes, Octavio
  • de la Puente Álvarez, Josep
  • Modesto Galende, David
  • Puzyrev, Vladimir
  • Cela Espín, José M.
This paper presents an edge-based parallel code for the data computation that arises when applying one of the most popular electromagnetic methods in geophysics, namely, the controlled-source electromagnetic method (CSEM). The computational implementation is based on the linear Edge Finite Element Method in 3D isotropic domains because it has the ability to eliminate spurious solutions and is claimed to yield accurate results. The framework structure is able to exploit the embarrassingly-parallel tasks and the advantages of the geometric flexibility as well as to work with three different orientations for the dipole, or excitation source, on unstructured tetrahedral meshes in order to represent complex geological bodies through a local refinement technique. We demonstrate the performance and accuracy of our tool on the Marenostrum supercomputer (Barcelona Supercomputing Center) through scaling tests and canonical tests, respectively., This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 644202. Authors gratefully acknowledge the support from the Mexican National Council for Science and Technology (CONACyT). This work benefitted from helpful suggestions of Hélène Barucq and Julien Diaz from MAGIQUE-3D team at Institut National de Recherche en Informatique et en Automatique (INRIA) and two anonymous reviewers., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Wavefield compression for adjoint methods in full-waveform inversion

  • Boehm, Christian
  • Hanzich, Mauricio
  • de la Puente, Josep
  • Fichtner, Andreas
Adjoint methods are a key ingredient of gradient-based full-waveform inversion schemes. While being conceptually elegant, they face the challenge of massive memory requirements caused by the opposite time directions of forward and adjoint simulations and the necessity to access both wavefields simultaneously for the computation of the sensitivity kernel. To overcome this bottleneck, we have developed lossy compression techniques that significantly reduce the memory requirements with only a small computational overhead. Our approach is tailored to adjoint methods and uses the fact that the computation of a sufficiently accurate sensitivity kernel does not require the fully resolved forward wavefield. The collection of methods comprises reinterpolation with a coarse temporal grid as well as adaptively chosen polynomial degree and floating-point precision to represent spatial snapshots of the forward wavefield on hierarchical grids. Furthermore, the first arrivals of adjoint waves are used to identify “shadow zones” that do not contribute to the sensitivity kernel. Numerical experiments show the high potential of this approach achieving an effective compression factor of three orders of magnitude with only a minor reduction in the rate of convergence. Moreover, it is computationally cheap and straightforward to integrate in finite-element wave propagation codes with possible extensions to finite-difference methods., The authors would like to thank Editor John Etgen, Associate Editor Anatoly Baumstein and three anonymous reviewers for their valuable comments and excellent suggestions to improve the paper. We gratefully acknowledge support by the Swiss National Supercomputing Centre (CSCS) in the form of CHRONOS project ch1 and PASC project GeoScale. The research leading to these results has received funding from the European Union's Horizon 2020 Programme (2014-2020) and from Brazilian Ministry of Science, Technology and Innovation through Rede Nacional de Pesquisa (RNP) under the HPC4E Project (www.hpc4e.eu), grant agreement n. 689772. Furthermore, the first author acknowledges funding from Shell within the project \Boosting full-waveform inversion"., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A review of block Krylov subspace methods for multisource electromagnetic modelling

  • Puzyrev, Vladimir
  • Cela, José M.
Practical applications of controlled-source electromagnetic modeling require solutions for multiple sources at several frequencies, thus leading to a dramatic increase of the computational cost. In this paper we present an approach using block Krylov subspace solvers that are iterative methods especially designed for problems with multiple right hand-sides. Their main advantage is the shared subspace for approximate solutions, hence, these methods are expected to converge in less iterations than the corresponding standard solver applied to each linear system. Block solvers also share the same preconditioner, which is constructed only once. Simultaneously computed block operations have better utilization of cache due to the less frequent access to the system matrix. In this paper we implement two different block solvers for sparse matrices resulting from the finitedifference and the finite-element discretizations, discuss the computational cost of the algorithms and study their dependence on the number of right-hand sides given at once. The effectiveness of the proposed methods is demonstrated on two electromagnetic survey scenarios, including a large marine model. As the results of the simulations show, when a powerful preconditioning is employed, block methods are faster than standard iterative techniques in terms of both iterations and time., Funding for this work was provided by the Repsol-BSC Research Center and the RISE Horizon 2020 European Project GEAGAM (644602). MareNostrum Supercomputer was used for the numerical tests. The authors express their thanks to Rene-Edouard Plessix, Mikhail Zaslavsky and one anonymous reviewer for their valuable comments that significantly helped to improve the paper., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Evaluation of parallel direct sparse linear solvers in electromagnetic geophysical problems

  • Puzyrev, Vladimir
  • Koric, Seid
  • Wilkin, Scott
High performance computing is absolutely necessary for large-scale geophysical simulations. In order to obtain a realistic image of a geologically complex area, industrial surveys collect vast amounts of data making the computational cost extremely high for the subsequent simulations. A major computational bottleneck of modeling and inversion algorithms is solving the large sparse systems of linear ill-conditioned equations in complex domains with multiple right hand sides. Recently, parallel direct solvers have been successfully applied to multi-source seismic and electromagnetic problems. These methods are robust and exhibit good performance, but often require large amounts of memory and have limited scalability. In this paper, we evaluate modern direct solvers on large-scale modeling examples that previously were considered unachievable with these methods. Performance and scalability tests utilizing up to 65,536 cores on the Blue Waters supercomputer clearly illustrate the robustness, efficiency and competitiveness of direct solvers compared to iterative techniques. Wide use of direct methods utilizing modern parallel architectures will allow modeling tools to accurately support multi-source surveys and 3D data acquisition geometries, thus promoting a more efficient use of the electromagnetic methods in geophysics., The authors would like to thank the MUMPS and PARDISO developers for providing free academic licenses and Dr. Anshul Gupta for access to his solver library which is not publicly available. We also would like to thank the Private Sector Program and the Blue Waters sustained-petascale computing project at the National Center for Supercomputing Applications (NCSA), which is supported by the National Science Foundation (awards OCI- 0725070 and ACI-1238993) and the state of Illinois. The shared-memory tests were performed on the MareNostrum supercomputer of the Barcelona Supercomputer Center. The first author acknowledges funding from the Repsol-BSC Research Center through the AURORA project and support from the RISE Horizon 2020 European Project GEAGAM (644602). The authors wish to thank Jef Caers and two anonymous reviewers for their valuable comments that significantly helped to improve this paper., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Toward an automatic full-wave inversion: Synthetic study cases

  • Kormann, Jean
  • Rodriguez, Juan E.
  • Gutiérrez, Natalia
  • Ferrer, Miguel
  • Rojas, Otilio
  • de la Puente, Josep
  • Hanzich, Mauricio
  • Cela, Jose M.
Full-waveform inversion (FWI) in seismic scenarios continues to be a complex procedure for subsurface imaging that might require extensive human interaction in terms of model setup, constraints, and data preconditioning. The underlying reason is the strong nonlinearity of the problem that forces the addition of a priori knowledge (or bias) in order to obtain geologically sound results. In particular, when the use of a long-offset receiver is not possible or may not favor the reconstruction of the fine structure of the model, one needs to rely on reflection data. As a consequence, the inversion process is more prone to becoming stuck in local minima. Nevertheless, misfit functionals can be devised that can either cope with missing long-wavenumber features of initial models (e.g., cross-correlation-based misfit) or invert reflection-dominated data whenever the models are sufficiently good (e.g., normalized offset-limited least-squares misfit). By combining both, high-frequency data content with poor initial models can be successfully inverted. If one can figure out simple parameterizations for such functionals, the amount of uncertainty and manual work related to tuning FWI would be substantially reduced. Thus, FWI might become a semiautomatized imaging tool., We want to thank Repsol for funding this research by means of the Aurora project. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 644202. Additionally, the research leading to these results has received funding from the European Union’s Horizon 2020 Programme (2014-2020) and from Brazilian Ministry of Science, Technology and Innovation through Rede Nacional de Pesquisa (RNP) under the HPC4E Project (www.hpc4e.eu), grant agreement No 689772. We acknowledge Chevron for the dataset that was used in our second example., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Compact finite difference modeling of 2-D acoustic wave propagation

  • Córdova, Luis
  • Rojas, Otilio
  • Otero Calviño, Beatriz
  • Castillo, Jose
We present two fourth-order compact finite difference (CFD) discretizations of the velocity–pressure formulation of the acoustic wave equation in 2-D rectangular grids. The first method uses standard implicit CFD on nodal meshes and requires solving tridiagonal linear systems along each grid line, while the second scheme employs a novel set of mimetic CFD operators for explicit differentiation on staggered grids. Both schemes share a Crank–Nicolson time integration decoupled by the Peaceman–Rachford splitting technique to update discrete fields by alternating the coordinate direction of CFD differentiation (ADI-like iterations). For comparison purposes, we also implement a spatially fourth-order FD scheme using non compact staggered mimetic operators in combination to second-order leap-frog time discretization. We apply these three schemes to model acoustic motion under homogeneous boundary conditions and compare their experimental convergence and execution times, as grid is successively refined. Both CFD schemes show four-order convergence, with a slight superiority of the mimetic version, that leads to more accurate results on fine grids. Conversely, the mimetic leap-frog method only achieves quadratic convergence and shows similar accuracy to CFD results exclusively on coarse grids. We finally observe that computation times of nodal CFD simulations are between four and five times higher than those spent by the mimetic CFD scheme with similar grid size. This significant performance difference is attributed to solving those embedded linear systems inherent to implicit CFD., Peer Reviewed, Preprint
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A new mimetic scheme for the acoustic wave equation

  • Solano, Freysimar
  • Guevara-Jordan, Juan
  • Rojas, Otilio
  • Otero Calviño, Beatriz
  • Rodriguez, R.
A new mimetic finite difference scheme for solving the acoustic wave equation is presented. It combines a novel second order tensor mimetic discretizations in space and a leapfrog approximation in time to produce an explicit multidimensional scheme. Convergence analysis of the new scheme on a staggered grid shows that it can take larger time steps than standard finite difference schemes based on ghost points formulation. A set of numerical test problems gives evidence of the versatility of the new mimetic scheme for handling general boundary conditions., Peer Reviewed, Preprint
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Acceleration strategies for elastic full waveform inversion workflows in 2D and 3D

  • Kormann, Jean
  • Rodríguez, Juan E.
  • Ferrer, Miguel
  • Farrés, Albert
  • Gutiérrez, Natalia
  • de la Puente, Josep
  • Hanzich, Mauricio
  • Cela, José M.
Full waveform inversion (FWI) is one of the most challenging procedures to obtain quantitative information of the subsurface. For elastic inversions, when both compressional and shear velocities have to be inverted, the algorithmic issue becomes also a computational challenge due to the high cost related to modelling elastic rather than acoustic waves. This shortcoming has been moderately mitigated by using high-performance computing to accelerate 3D elastic FWI kernels. Nevertheless, there is room in the FWI workflows for obtaining large speedups at the cost of proper grid pre-processing and data decimation techniques. In the present work, we show how by making full use of frequency-adapted grids, composite shot lists and a novel dynamic offset control strategy, we can reduce by several orders of magnitude the compute time while improving the convergence of the method in the studied cases, regardless of the forward and adjoint compute kernels used., The authors thank REPSOL for the permission to publish the present research and for funding through the AURORA project. J. Kormann also thankfully acknowledges the computer resources, technical expertise and assistance provided by the Barcelona Supercomputing Center - Centro Nacional de Supercomputacti ´on together with the Spanish Supercomputing Network (RES) through grant FI-2014-2-0009. This project has received funding from the European Union’s Horizon 2020, research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 644202. The research leading to these results has received funding from the European Union’s Horizon 2020 Programme (2014–2020) and from the Brazilian Ministry of Science, Technology and Innovation through Rede Nacional de Pesquisa (RNP) under the HPC4E Project (www.hpc4e.eu), grant agreement no. 689772.We further want to thank the Editor Clint N. Dawson for his help, and Andreas Fichtner and an anonymous reviewer for their comments and suggestions to improve the manuscript., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A performance analysis of a mimetic finite difference scheme for acoustic wave propagation on GPU platforms

  • Otero Calviño, Beatriz
  • Frances, Jorge
  • Rodriguez Cruz, Robert
  • Rojas, Otilio
  • Solano, Freysimar
  • Guevara-Jordan, Juan
Realistic applications of numerical modeling of acoustic wave dynamics usually demand high-performance computing because of the large size of study domains and demanding accuracy requirements on simulation results. Forward modeling of seismic motion on a given subsurface geological structure is by itself a good example of such applications, and when used as a component of seismic inversion tools or as a guide for the design of seismic surveys, its computational cost increases enormously. In the case of finite difference methods (or any other volumen-discretization scheme), memory and computing demands rise with grid refinement, which may be necessary to reduce errors on numerical wave patterns and better capture target physical devices. In this work, we present several implementations of a mimetic finite difference method for the simulation of acoustic wave propagation on highly dense staggered grids. These implementations evolve as different optimization strategies are employed starting from appropriate setting of compilation flags, code vectorization by using streaming SIMD extensions Advanced Vector Extensions (AVX), CPU parallelization by exploiting the Open Multi-Processing framework to the final code parallelization on graphics processing unit platforms. We present and discuss the increasing processing speed up of this mimetic scheme achieved by the gradual implementation and testing of all these performance optimizations. In terms of simulation times, the performance of our graphics processing unit parallel implementations is consistently better than the best CPU version. Copyright © 2016 John Wiley & Sons, Ltd., Peer Reviewed, Postprint (author's final draft)
Addi. Archivo Digital para la Docencia y la Investigación
Publicación Artículo científico (JournalArticle)

Significant implications of permafrost thawing for climate change control

  • González-Eguino, Mikel
  • Neumann, Marc B.
© The Author(s) 2016 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made., Large amounts of carbon are stored as permafrost within the Arctic and sub-Arctic regions. As permafrost thaws due to climate warming, carbon dioxide and methane are released. Recent studies indicate that the pool of carbon susceptible to future thaw is higher than was previously thought and that more carbon could be released by 2100, even under low emission pathways. We use an integrated model of the climate and the economy to study how including these new estimates influence the control of climate change to levels that will likely keep the temperature increase below 2 °C (radiative forcing of 2.6 Wm−2). According to our simulations, the fossil fuel and industrial CO2 emissions need to peak 5–10 years earlier and the carbon budget needs to be reduced by 6–17 % to offset this additional source of warming. The required increase in carbon price implies a 6–21 % higher mitigation cost to society compared to a situation where emissions from permafrost are not considered. Including other positive climate feedbacks, currently not accounted for in integrated assessment models, could further increase these numbers., The authors thank Iñigo Capellán-Perez, Juan-Carlos Ciscar, Thomas Schneider von Deimling, Jon Sampedro, Paul Sztorc, Dirk-Jan. van de Ven and two anonymous referees for valuable comments that helped us improve the manuscript. This study received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 642260 (TRANSrisk project). Mikel Gonzalez-Eguino also acknowledges financial support from the Ministry of Economy and Competitiveness of Spain (ECO2015-68023) and the Basque Government (IT-799-13). Marc B. Neumann acknowledges financial support from the Ramón y Cajal Research Fellowship of the Ministry of Economy and Competitiveness of Spain (no. RYC-2013-13628). The authors declare that there are no conflicts of interest.