Pasar al contenido principal

Resultados relacionados

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

BIRD. BCAM's Institutional Repository Data
Publicación 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
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 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
Publicación Tesis doctoral (DoctoralThesis)

Singular Perturbation of the Dirac Hamiltonian

  • Pizzichillo, F.
This thesis is devoted to the study of the Dirac Hamiltonian perturbed by delta-type potentials and Coulomb-type potentials. We analysed the delta-shell interaction on bounded and smooth domains and its approximation by the coupling of the free Dirac operator with shrinking short-range potentials. Under certain hypothesis of smallness of a regular potential, in three dimensions, we prove that the Dirac operator coupled with a suitable rescaling of the potential converges to the Hamiltonian coupled with the delta-shell potential, in the strong resolvent sense. Nevertheless, the coupling constant depends non-linearly on the potential: Klein's Paradox comes into play. As a particular case, we pay to focus on the Dirac Operator with spherical delta-shell interactions. We characterise the eigenstates of the couplings by finding sharp constants and minimisers of some precise inequalities related to an uncertainty principle. We also explore the spectral relation between the shell interaction and its approximation by short-range potentials with shrinking support, improving previous results. Finally, we investigate the Dirac operator perturbed by a particular class of Coulomb-type spherically symmetric potentials. We describe the self-adjoint realisations of this operator in terms of the behaviour of the functions of the domain in the origin, and we provide Hardy-type estimates on them. At the end, we describe the distinguished extension.
BIRD. BCAM's Institutional Repository Data
Publicación 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
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 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
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.
BIRD. BCAM's Institutional Repository Data
Publicación 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
Publicación Artículo científico (JournalArticle)

Time-Domain Goal-Oriented Adaptivity Using Pseudo-Dual Error Representations

  • Muñoz-Matute, J.
  • Alberdi, E.
  • Pardo, D.
  • Calo, V.M.
Goal-oriented adaptive algorithms produce optimal grids to solve challenging engineering problems. Recently, a novel error representation using (unconventional) pseudo-dual problems for goal-oriented adaptivity in the context of frequency-domain wave-propagation problems has been developed. In this paper, we extend this error representation to the case of time-domain problems. We express the entire problem in weak form in order to derive the adjoint formulation and apply goal-oriented adaptivity. One dimensional (1D) numerical results show that upper bounds for the new error representation are sharper than the classical ones. Therefore, this new error representation can be used to design more efficient goal-oriented adaptive methodologies.
BIRD. BCAM's Institutional Repository Data
Publicación 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
Publicación 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
Publicación 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.