Search

Certain applications that analyze damping effects require the solution of quadratic eigenvalue problems (QEPs). We use refined isogeometric analysis (rIGA) to solve quadratic eigenproblems. rIGA discretization, while conserving desirable properties of maximum-continuity isogeometric analysis (IGA), reduces the interconnection between degrees of freedom by adding low-continuity basis functions. This connectivity reduction in rIGA's algebraic system results in faster matrix LU factorizations when using multifrontal direct solvers. We compare computational costs of rIGA versus those of IGA when employing Krylov eigensolvers to solve quadratic eigenproblems arising in 2D vector-valued multifield problems. For large problem sizes, the eigencomputation cost is governed by the cost of LU factorization, followed by costs of several matrix-vector and vector-vector multiplications, which correspond to Krylov projections. We minimize the computational cost by introducing C^0 and C^1 separators at specific element interfaces for our rIGA generalizations of the curl-conforming Nedelec and divergence-conforming Raviart-Thomas finite elements. Let p be the polynomial degree of basis functions; the LU factorization is up to O((p-1)^2) times faster when using rIGA compared to IGA in the asymptotic regime. Thus, rIGA theoretically improves the total eigencomputation cost by O((p-1)^2) for sufficiently large problem sizes. Yet, in practical cases of moderate-size eigenproblems, the improvement rate deteriorates as the number of computed eigenvalues increases because of multiple matrix-vector and vector-vector operations. Our numerical tests show that rIGA accelerates the solution of quadratic eigensystems by O(p-1) for moderately sized problems when we seek to compute a reasonable number of eigenvalues.

© 2018 Elsevier B.V. We introduce a multicomponent Cahn–Hilliard system with multiple reversible chemical reactions. We derive the conservation laws of the multicomponent system within the thermodynamical constraints. Furthermore, we consider multiple chemical reactions based on the mass action law. This coupling reproduces phase separation under spinodal decomposition as a chemical reaction between the species takes place. Finally, we perform a numerical simulation to show the robustness of the model as well as the resulting patterns.

We present a fast, user-friendly implementation of a potential flow solver based on the unsteady vortex lattice method (UVLM), namely PyFly. UVLM computes the aerodynamic loads applied on lifting surfaces while capturing the unsteady effects such as the added mass forces, the growth of bound circulation, and the wake while assuming that the flow separation location is known a priori. This method is based on discretizing the body surface into a lattice of vortex rings and relies on the Biot–Savart law to construct the velocity field at every point in the simulated domain. We introduce the pointwise approximation approach to simulate the interactions of the far-field vortices to overcome the computational burden associated with the classical implementation of UVLM. The computational framework uses the Python programming language to provide an easy to handle user interface while the computational kernels are written in Fortran. The mixed language approach enables high performance regarding solution time and great flexibility concerning easiness of code adaptation to different system configurations and applications. The computational tool predicts the unsteady aerodynamic behavior of multiple moving bodies (e.g., flapping wings, rotating blades, suspension bridges) subject to incoming air. The aerodynamic simulator can also deal with enclosure effects, multi-body interactions, and B-spline representation of body shapes. We simulate different aerodynamic problems to illustrate the usefulness and effectiveness of PyFly.

We propose a second-order accurate energy-stable time-integration method that controls the evolution of numerical instabilities introducing numerical dissipation in the highest-resolved frequencies. Our algorithm further extends the generalized-a method and provides control over dissipation via the spectral radius. We derive the first and second laws of thermodynamics for the Swift-Hohenberg equation and provide a detailed proof of the unconditional energy stability of our algorithm. Finally, we present numerical results to verify the energy stability and its second-order accuracy in time.

We provide explicit quadrature rules for spaces of C1 quintic splines with uniform knot sequences over finite domains. The quadrature nodes and weights are derived via an explicit recursion that avoids numerical solvers. Each rule is optimal, that is, requires the minimal number of nodes, for a given function space. For each of n subintervals, generically, only two nodes are required which reduces the evaluation cost by 2/3 when compared to the classical Gaussian quadrature for polynomials over each knot span. Numerical experiments show fast convergence, as n grows, to the “two-third” quadrature rule of Hughes et al. (2010) for infinite domains.

© 2016 Elsevier LtdWe introduce Gaussian quadrature rules for spline spaces that are frequently used in Galerkin discretizations to build mass and stiffness matrices. By definition, these spaces are of even degrees. The optimal quadrature rules we recently derived (Barton and Calo, 2016) act on spaces of the smallest odd degrees and, therefore, are still slightly sub-optimal. In this work, we derive optimal rules directly for even-degree spaces and therefore further improve our recent result. We use optimal quadrature rules for spaces over two elements as elementary building blocks and use recursively the homotopy continuation concept described in Barton and Calo (2016) to derive optimal rules for arbitrary admissible numbers of elements. We demonstrate the proposed methodology on relevant examples, where we derive optimal rules for various even-degree spline spaces. We also discuss convergence of our rules to their asymptotic counterparts, these are the analogues of the midpoint rule of Hughes et al. (2010), that are exact and optimal for infinite domains.

We study linear elasticity problems with high contrast in the coefficients using asymptotic limits recently introduced. We derive an asymptotic expansion to solve heterogeneous elasticity problems in terms of the contrast in the coefficients. We study the convergence of the expansion in the H1 norm.

We introduce a new concept for generating optimal quadrature rules for splines. To generate an optimal quadrature rule in a given (target) spline space, we build an associated source space with known optimal quadrature and transfer the rule from the source space to the target one, while preserving the number of quadrature points and therefore optimality. The quadrature nodes and weights are, considered as a higher-dimensional point, a zero of a particular system of polynomial equations. As the space is continuously deformed by changing the source knot vector, the quadrature rule gets updated using polynomial homotopy continuation. For example, starting with C1 cubic splines with uniform knot sequences, we demonstrate the methodology by deriving the optimal rules for uniform C2 cubic spline spaces where the rule was only conjectured to date. We validate our algorithm by showing that the resulting quadrature rule is independent of the path chosen between the target and the source knot vectors as well as the source rule chosen.

In this paper, we combine the Alternating Direction Implicit (ADI) algorithm with the concept of preconditioning and apply it to linear systems discretized from the 2D steady-state diffusion equations with orthotropic heterogeneous coefficients by the finite element method assuming tensor product basis functions. Specifically, we adopt the compound iteration idea and use ADI iterations as the preconditioner for the outside Krylov subspace method that is used to solve the preconditioned linear system. An efficient algorithm to perform each ADI iteration is crucial to the efficiency of the overall iterative scheme. We exploit the Kronecker product structure in the matrices, inherited from the tensor product basis functions, to achieve high efficiency in each ADI iteration. Meanwhile, in order to reduce the number of Krylov subspace iterations, we incorporate partially the coefficient information into the preconditioner by exploiting the local support property of the finite element basis functions. Numerical results demonstrated the efficiency and quality of the proposed preconditioner. © 2014 Elsevier B.V. All rights reserved.

We study the numerical recovery of Manning's roughness coefficient for the diffusive wave approximation of the shallow water equation. We describe a conjugate gradient method for the numerical inversion. Numerical results for one-dimensional models are presented to illustrate the feasibility of the approach. Also we provide a proof of the differentiability of the weak form with respect to the coefficient as well as the continuity and boundedness of the linearized operator under reasonable assumptions using the maximal parabolic regularity theory. © 2012 Elsevier B.V. All rights reserved.

In this short note, we discuss variational multiscale methods for solving porous media flows in high-contrast heterogeneous media with rough source terms. Our objective is to separate, as much as possible, subgrid effects induced by the media properties from those due to heterogeneous source terms. For this reason, enriched coarse spaces designed for high-contrast multiscale problems are used to represent the effects of heterogeneities of the media. Furthermore, rough source terms are captured via auxiliary correction equations that appear in the formulation of variational multiscale methods [23]. These auxiliary equations are localized and one can use additive or multiplicative constructions for the subgrid corrections as discussed in the current paper. Our preliminary numerical results show that one can capture the effects due to both spatial heterogeneities in the coefficients (such as permeability field) and source terms (e.g., due to singular well terms) in one iteration. We test the cases for both smooth source terms and rough source terms and show that with the multiplicative correction, the numerical approximations are more accurate compared to the additive correction. © 2010 Elsevier Ltd.