Search

We use blended quadrature rules to reduce the phase error of isogeometric analysis discretizations. To explain the observed behavior and quantify the approximation errors, we use the generalized Pythagorean eigenvalue error theorem to account for quadrature errors on the resulting weak forms [28]. The proposed blended techniques improve the spectral accuracy of isogeometric analysis on uniform and non-uniform meshes for different polynomial orders and continuity of the basis functions. The convergence rate of the optimally blended schemes is increased by two orders with respect to the case when standard quadratures are applied. Our technique can be applied to arbitrary high-order isogeometric elements. [ABSTRACT FROM AUTHOR]

In this work, we present a novel isogeometric analysis discretization for the Navier-Stokes- Cahn-Hilliard equation, which uses divergence-conforming spaces. Basis functions generated with this method can have higher-order continuity, and allow to directly discretize the higher- order operators present in the equation. The discretization is implemented in PetIGA-MF, a high-performance framework for discrete differential forms. We present solutions in a two- dimensional annulus, and model spinodal decomposition under shear flow. [ABSTRACT FROM AUTHOR]

This paper describes a telescopic solver for two dimensional h adaptive grids with point singularities. The input for the telescopic solver is an h refined two dimensional computational mesh with rectangular finite elements. The candidates for point singularities are first localized over the mesh by using a greedy algorithm. Having the candidates for point singularities, we execute either a direct solver, that performs multiple refinements towards selected point singularities and executes a parallel direct solver algorithm which has logarithmic cost with respect to refinement level. The direct solvers executed over each candidate for point singularity return local Schur complement matrices that can be merged together and submitted to iterative solver. In this paper we utilize a parallel multi-thread GALOIS solver as a direct solver. We use Incomplete LU Preconditioned Conjugated Gradients (ILUPCG) as an iterative solver. We also show that elimination of point singularities from the refined mesh reduces significantly the number of iterations to be performed by the ILUPCG iterative solver. [ABSTRACT FROM AUTHOR]

In this paper we present an application of Alternating Direction Implicit (ADI) algorithm for solution of non-stationary PDE-s using isogeometric finite element method. We show that ADI algorithm has a linear computational cost at every time step. We illustrate this approach by solving two example non-stationary three-dimensional problems using explicit Euler and Newmark time-stepping scheme: heat equation and linear elasticity equations for a cube. The stability of the simulation is controlled by monitoring the energy of the solution. [ABSTRACT FROM AUTHOR]

Abstract: We discretized the two-dimensional linear momentum, microrotation, energy and mass conservation equations from micropolar fluids theory, with the finite element method, creating divergence conforming spaces based on B-spline basis functions to obtain pointwise divergence free solutions [8]. Weak boundary conditions were imposed using Nitsche's method for tangential conditions, while normal conditions were imposed strongly. Once the exact mass conservation was provided by the divergence free formulation, we focused on evaluating the differences between micropolar fluids and conventional fluids, to show the advantages of using the micropolar fluid model to capture the features of complex fluids. A square and an arc heat driven cavities were solved as test cases. A variation of the parameters of the model, along with the variation of Rayleigh number were performed for a better understanding of the system. The divergence free formulation was used to guarantee an accurate solution of the flow. This formulation was implemented using the framework PetIGA as a basis, using its parallel stuctures to achieve high scalability. The results of the square heat driven cavity test case are in good agreement with those reported earlier. [Copyright &y& Elsevier]

Abstract: In this paper, we present a high-performance framework for solving partial differential equations using Isogeometric Analysis, called PetIGA, and show how it can be used to solve phase-field problems. We specifically chose the Cahn-Hilliard equation, and the phase-field crystal equation as test cases. These two models allow us to highlight some of the main advantages that we have access to while using PetIGA for scientific computing. [Copyright &y& Elsevier]

Abstract: In this paper we present a dynamic programming algorithm for finding optimal elimination trees for computational grids refined towards point or edge singularities. The elimination tree is utilized to guide the multi-frontal direct solver algorithm. Thus, the criterion for the optimization of the elimination tree is the computational cost associated with the multi-frontal solver algorithm executed over such tree. We illustrate the paper with several examples of optimal trees found for grids with point, isotropic edge and anisotropic edge mixed with point singularity. We show the comparison of the execution time of the multi-frontal solver algorithm with results of MUMPS solver with METIS library, implementing the nested dissection algorithm. [Copyright &y& Elsevier]

Abstract: We model high molecular weight homopolymers in semidilute concentration via Dissipative Particle Dynamics (DPD). We show that in model reduction methodologies for polymers it is not enough to preserve system properties (i.e., density ρ, pressure p, temperature T, radial distribution function g(r)) but preserving also the characteristic shape and length scale of the polymer chain model is necessary. In this work we apply a DPD-model-reduction methodology for linear polymers recently proposed; and demonstrate why the applicability of this methodology is limited upto certain maximum polymer length, and not suitable for solvent coarse graining. [Copyright &y& Elsevier]

Abstract: A variational multi scale approach to model blood flow through arteries is proposed. A finite element discretization to represent the coarse scales (macro size), is coupled to smoothed dissipative particle dynamics that captures the fine scale features (micro scale). Blood is assumed to be incompressible, and flow is described through the Navier Stokes equation. The proposed cou- pling is tested with two benchmark problems, in fully coupled systems. Further refinements of the model can be incorporated in order to explicitly include blood constituents and non-Newtonian behavior. The suggested algorithm can be used with any particle-based method able to solve the Navier-Stokes equation. [Copyright &y& Elsevier]

Abstract: Shape Memory Alloys (SMAs) are capable of changing their crystallographic structure due to changes of either stress or temperature. SMAs are used in a number of aerospace devices and are required in some devices in exotic environments. We are developing dynamic data driven application system (DDDAS) tools to monitor and change SMAs in real time for delivering payloads by aerospace vehicles. We must be able to turn on and off the sensors and heating units, change the stress on the SMA, monitor on-line data streams, change scales based on incoming data, and control what type of data is generated. The application must have the capability to be run and steered remotely as an unmanned feedback control loop. [Copyright &y& Elsevier]

Abstract: Phase field modeling has become a widely used framework in the computational material science community. Its ability to model different problems by defining appropriate phase field parameters and relating it to a free energy functional makes it highly versatile. Thermodynamically consistent partial differential equations can then be generated by assuming dissipative dynamics, and setting up the problem as one of minimizing this free energy. The equations are nonetheless challenging to solve, and having a highly efficient and parallel framework to solve them is necessary. In this work, a brief review on phase field models is given, followed by a short analysis of the Phase Field Crystal Model solved with Isogeometric Analysis us- ing PetIGA. We end with an introduction to a new modeling concept, where free energy functions are built with a periodic equilibrium structure in mind. [Copyright &y& Elsevier]

Abstract: In this work different nonlinear hyperelastic models for slightly compressible materials are implemented in an isogeometric finite element model. This is done within the recently developed computational framework called PetIGA, which uses isoge- ometric analysis and modern computational tools to solve systems of equations directly and iteratively. A flexible theoretical background is described to implement other hyperelastic models and possibly transient problems in future work. Results show quadratic convergence of the nonlinear solution consistent with the Newton-Raphson method that was used. Finally, PetIGA proves to be a powerful and versatile tool to solve these types of problems efficiently. [Copyright &y& Elsevier]

Abstract: This paper introduces a grammar-based model for developing a multi-thread multi-frontal parallel direct solver for one- dimensional isogeometric finite element method. The model includes the integration of B-splines for construction of the element local matrices and the multi-frontal solver algorithm. The integration and the solver algorithm are partitioned into basic indivisible tasks, namely the grammar productions, that can be executed squentially. The partial order of execution of the basic tasks is analyzed to provide the scheduling for the execution of the concurrent integration and multi-frontal solver algo- rithm. This graph grammar analysis allows for optimal concurrent execution of all tasks. The model has been implemented and tested on NVIDIA CUDA GPU, delivering logarithmic execution time for linear, quadratic, cubic and higher order B-splines. Thus, the CUDA implementation delivers the optimal performance predicted by our graph grammar analysis. We utilize the solver for multiple right hand sides related to the solution of non-stationary or inverse problems. [Copyright &y& Elsevier]

Abstract: Round-off error analysis has been historically studied by analyzing the condition number of the associated matrix. By controlling the size of the condition number, it is possible to guarantee a prescribed round-off error tolerance. However, the opposite is not true, since it is possible to have a system of linear equations with an arbitrarily large condition number that still delivers a small round-off error. In this paper, we perform a round-off error analysis in context of 1D and 2D hp-adaptive Finite Element simulations for the case of Poisson equation. We conclude that boundary conditions play a fundamental role on the round-off error analysis, specially for the so-called ‘radical meshes’. Moreover, we illustrate the importance of the right-hand side when analyzing the round-off error, which is independent of the condition number of the matrix. [Copyright &y& Elsevier]

Abstract: This paper introduces the graph grammar based model for developing multi-thread multi-frontal parallel direct solver for two dimensional isogeometric finite element method. Execution of the solver algorithm has been expressed as the sequence of graph grammar productions. At the beginning productions construct the elimination tree with leaves corresponding to finite elements. Following sequence of graph grammar productions generates element frontal matri-ces at leaf nodes, merges matrices at parent nodes and eliminates rows corresponding to fully assembled degrees of freedom. Finally, there are graph grammar productions responsible for root problem solution and recursive backward substitutions. Expressing the solver algorithm by graph grammar productions allows us to explore the concurrency of the algorithm. The graph grammar productions are grouped into sets of independent tasks that can be executed concurrently. The resulting concurrent multi-frontal solver algorithm is implemented and tested on NVIDIA GPU, providing O(NlogN) execution time complexity where N is the number of degrees of freedom. We have confirmed this complexity by solving up to 1 million of degrees of freedom with 448 cores GPU. [Copyright &y& Elsevier]

Abstract: Shape Memory Alloys are capable of changing their crystallographic structure due to changes of temperature and/or stress. Our research focuses on three points: (1) Iterative Homogenization of Porous SMAs: Development of a Multiscale Model of porous SMAs utilizing iterative homogenization and based on existing knowledge of constitutive modeling of polycrystalline SMAs. (2) DDDAS: Develop tools to turn on and off the sensors and heating unit(s), to monitor on-line data streams, to change scales based on incoming data, and to control what type of data is generated. The application must have the capability to be run and steered remotely. (3) Modeling and applications of porous SMA: Vibration isolation devices with SMA and porous SMA components for aerospace applications will be analyzed and tested. Numerical tools for modeling porous SMAs with a second viscous phase will be developed.The outcome will be a robust, three-dimensional, multiscale model of porous SMA that can be used in complicated, real-life structural analysis of SMA components using a DDDAS framework. [Copyright &y& Elsevier]

Abstract: In this paper we present a twin adaptive strategy hp-HGS for solving inverse problems related to 3D DC borehole resistivity measurement simulations. The term “simulation of measurements” is widely used by the geophysical community. A quantity of interest, voltage, is measured at a receiver electrode located in the logging instrument. We use the self-adaptive goal-oriented hp-Finite Element Method (hp-FEM) computer simulations of the process of measurements in deviated wells (when the angle between the borehole and formation layers are < 90 deg). We also employ the hierarchical genetic search (HGS) algorithm to solve the inverse problem. Each individual in the population represents a single configuration of the formation layers. The evaluation of the individual is performed by solving the direct problem by means of the hp-FEM algorithm and by comparison with measured logging curve. We conclude the paper with some discussion on the parallelization of the algorithm. [Copyright &y& Elsevier]

Abstract: We discuss the use of time adaptivity applied to the one dimensional di_usive wave approximation to the shallow water equations. A simple and computationally economical error estimator is discussed which enables time-step size adaptivity. This robust adaptive time discretization corrects the initial time step size to achieve a user specified bound on the discretization error and allows time step size variations of several orders of magnitude. In particular, in the one dimensional results presented in this work feature a change of four orders of magnitudes for the time step over the entire simulation. [Copyright &y& Elsevier]

Abstract: In this paper we present a goal-oriented self-adaptive hp Finite Element Method (hp-FEM) with shared data structures and a parallel multi-frontal direct solver. The algorithm automatically generates (without any user interaction) a sequence of meshes delivering exponential convergence of a prescribed quantity of interest with respect to the number of degrees of freedom. The sequence of meshes is generated from a given initial mesh, by performing h (breaking elements into smaller elements), p (adjusting polynomial orders of approximation) or hp (both) refinements on the finite elements. The new parallel implementation utilizes a computational mesh shared between multiple processors. All computational algorithms, including automatic hp goal-oriented adaptivity and the solver work fully in parallel. We describe the parallel self-adaptive hp-FEM algorithm with shared computational domain, as well as its efficiency measurements. We apply the methodology described to the three-dimensional simulation of the borehole resistivity measurement of direct current through casing in the presence of invasion. [Copyright &y& Elsevier]

Abstract: We revisit the finite element analysis of convection dominated flow problems within the recently developed Discontinuous Petrov-Galerkin (DPG) variational framework. We demonstrate how test function spaces that guarantee numerical stability can be computed automatically with respect to the so called optimal test space norm by using an element subgrid discretization. This should make the DPG method not only stable but also robust, that is, uniformly stable with respect to the Ṕeclet number in the current application. The e_ectiveness of the algorithm is demonstrated on two problems for the linear advection-di_usion equation. [Copyright &y& Elsevier]

Abstract: The multi-frontal direct solver is the state of the art for the direct solution of linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct solver algorithm on linear systems resulting from p finite elements. Specifically we provide the estimates for systems resulting from C0 polynomial spaces spanned by B-splines. The structured grid and uniform polynomial order used in isogeometric meshes simplifies the analysis. [Copyright &y& Elsevier]

Abstract: An automatic procedure for modeling terrain is developed based on L2 projection-based interpolation of discrete terrain data onto transfinite function spaces. The function space is refined automatically by the use of image processing techniques to detect regions of high error and the flexibility of the transfinite interpolation to add degrees of freedom to these areas. Examples are shown of a section of the Palo Duro Canyon in northern Texas. [ABSTRACT FROM AUTHOR]

This workshop seeks to integrate results from different domains of computer science, computational science, and mathematics. We welcome simulation papers, either hard simulations using finite element or finite difference methods, or soft simulations by means of evolutionary computations, and related methods. The workshop focuses on simulations performed by using (a) agent-oriented systems; or (b) adaptive algorithms. Simulations performed by other kind of systems are also welcome. An agent-oriented system seems are attractive tools useful for numerous domains of applications. Adaptive algorithms significantly decrease on the computational cost by investing computational resources when needed by the problem. [ABSTRACT FROM AUTHOR]