Multiscale and hysteresis effects in vortex pattern simulations for Ginzburg–Landau problems

The behavior and properties of vortex pattern solutions to a benchmark Ginzburg–Landau model are investigated using hybrid continuation algorithms in conjunction with parallel adaptive mesh refinement (AMR) schemes to resolve the local vortices. The model is related to phase transition models arising in superconductivity and superfluids. The approach is based on a coupled variational formulation and finite element approximation scheme for the complex‐valued solution. The associated algorithms implement continuation treatments based on the vortex scale coherence parameter and the winding number parameter in this model. Simulation results demonstrate the behavior of non‐unique solutions, as characterized by different vortex configurations, and energy plots are used to display hysteresis effects. The complex‐valued nature of the solution also serves to illustrate some interesting open questions related to AMR strategies and error indicators for complex‐valued solution fields as well as other implications for such coupled systems. Copyright © 2009 John Wiley & Sons, Ltd.     

The frozen-field approximation and the Ginzburg-Landau equations of superconductivity

The Ginzburg-Landau (GL) equations of superconductivity provide a computational model for the study of magnetic flux vortices in type-II superconductors. In this article it is shown through numerical examples and rigorous mathematical analysis that the GL model reduces to the frozen-field model when the charge of the Cooper pairs (the superconducting charge carriers) goes to zero while the applied field stays near the upper critical field.     

Interfacial Tension and Interface Delocalization Phase Boundary for Strongly Type-I Superconductors

We analytically determine the interface delocalization (or wetting) transition phase boundary in the limit of strongly type-I superconductors. In particular, within Ginzburg–Landau theory we derive an analytic expression for the reduced surface tension, _SC/N, of a type-I superconductor. We find that the truncated expansion (where is the Ginzburg–Landau parameter) is so accurate in the entire type-I regime that derivation of higher-order terms is unnecessary. We further derive an expression for the wall/superconductor interfacial tension which again proves accurate across a broad range of values. These expansions allow us to locate the low- interface delocalization phase boundary accurately, complementing previous numerical results for the wetting phase diagram.     

Numerical solution of non‐linear Klein–Gordon equations by variational iteration method

In this paper, numerical solution of non‐linear Klein–Gordon equations with power law non‐linearities are obtained by the new application of He's variational iteration method. Numerical illustrations that include non‐linear Klein–Gordon equations and non‐linear partial differential equations are investigated to show the pertinent features of the technique. Copyright © 2006 John Wiley & Sons, Ltd.     

Adaptive POD‐based low‐dimensional modeling supported by residual estimates

An adaptive low‐dimensional model is considered to simulate time‐dependent dynamics in nonlinear dissipative systems governed by PDEs. The method combines an inexpensive POD‐based Galerkin system with short runs of a standard numerical solver that provides the snapshots necessary to first construct and then update the POD modes. Switching between the numerical solver and the Galerkin system is decided ‘on the fly’ by monitoring (i) a truncation error estimate and (ii) a residual estimate. The latter estimate is used to control the mode truncation instability and highly improves former adaptive strategies that detected this instability by monitoring consistency with a second instrumental Galerkin system based on a larger number of POD modes. The most computationally expensive run of the numerical solver occurs at the outset, when the whole set of POD modes is calculated. This step is improved by using mode libraries, which may either be generic or result from former applications of the method. The outcome is a flexible, robust, computationally inexpensive procedure that adapts itself to the local dynamics by using the faster Galerkin system for the majority of the time and few, on demand, short runs of a numerical solver. The method is illustrated considering the complex Ginzburg–Landau equation in one and two space dimensions. Copyright © 2015 John Wiley & Sons, Ltd.     

Fast exact linear and non‐linear structural reanalysis and the Sherman–Morrison–Woodbury formulas

Several exact fast static structural reanalysis techniques, introduced by researchers mostly for truss structures and some for frames and plate structures, are reviewed. Most utilize the property that the solution of a system of linear equations can be updated inexpensively when the matrix is changed by a low‐rank increment. This paper shows that these methods are variants of the well‐known Sherman–Morrison and Woodbury (SMW) formulas for the update of the inverse of a matrix. In addition, the paper extends the low‐cost linear reanalysis in the spirit of the SMW formulas to some non‐linear reanalysis problems. For a linear reanalysis, the extension reduces to the SMW formulas. Copyright © 2001 John Wiley & Sons, Ltd.     

Convergence study of the truncated Karhunen–Loeve expansion for simulation of stochastic processes

A random process can be represented as a series expansion involving a complete set of deterministic functions with corresponding random coefficients. Karhunen–Loeve (K–L) series expansion is based on the eigen‐decomposition of the covariance function. Its applicability as a simulation tool for both stationary and non‐stationary Gaussian random processes is examined numerically in this paper. The study is based on five common covariance models. The convergence and accuracy of the K–L expansion are investigated by comparing the second‐order statistics of the simulated random process with that of the target process. It is shown that the factors affecting convergence are: (a) ratio of the length of the process over correlation parameter, (b) form of the covariance function, and (c) method of solving for the eigen‐solutions of the covariance function (namely, analytical or numerical). Comparison with the established and commonly used spectral representation method is made. K–L expansion has an edge over the spectral method for highly correlated processes. For long stationary processes, the spectral method is generally more efficient as the K–L expansion method requires substantial computational effort to solve the integral equation. The main advantage of the K–L expansion method is that it can be easily generalized to simulate non‐stationary processes with little additional effort. Copyright © 2001 John Wiley & Sons, Ltd.     

Application of the higher‐order Cauchy–Born rule in mesh‐free continuum and multiscale simulation of carbon nanotubes

This paper investigates the application of a recently proposed higher‐order Cauchy–Born rule in the continuum simulation and multiscale analysis of carbon nanotubes (CNTs). A mesh‐free computational framework is developed to implement the numerical computation of the hyper‐elastic constitutive model that is derived from the higher‐order Cauchy–Born rule. The numerical computation reveals that the buckling pattern of a single‐walled carbon nanotube (SWCNT) can be accurately displayed by taking into consideration the second‐order deformation gradient, and fewer mesh‐free nodes can provide a good simulation of homogeneous deformation. The bridging domain method is employed to couple the developed mesh‐free method and the atomistic simulation. The coupling method is used to simulate the bending buckling of an SWCNT and the tensile failure of an SWCNT with a single‐atom vacancy defect, and good computational results are obtained. Copyright © 2008 John Wiley & Sons, Ltd.     

On a high‐order Newton linearization method for solving the incompressible Navier–Stokes equations

The present study aims to accelerate the non‐linear convergence to incompressible Navier–Stokes solution by developing a high‐order Newton linearization method in non‐staggered grids. For the sake of accuracy, the linearized convection–diffusion–reaction finite‐difference equation is solved line‐by‐line using the nodally exact one‐dimensional scheme. The matrix size is reduced and, at the same time, the CPU time is considerably saved owing to the reduction of stencil points. This Newton linearization method is computationally efficient and is demonstrated to outperform the classical Newton method through computational exercises. Copyright © 2005 John Wiley & Sons, Ltd.     

Full SPH fluid–shell interaction for leakage simulation in explicit dynamics

This paper is devoted to the modeling of fluid leakage through a shell in case of impact loading. The modeling of the fluid and the shell is based on SPH formulation. The proposed model is devoted to the prediction of failure of a shell filled with fluid. This paper is devoted to the numerical modeling of fluid–structure interaction. The pinballs technique is used for contact analysis. Numerical predictions are compared with analytical as well as with an original experiment. Copyright © 2009 John Wiley & Sons, Ltd.     

Mesh‐free simulation of ductile fracture

This paper is concerned with mesh‐free simulations of crack growth in ductile materials, which is a major technical difficulty in computational mechanics. The so‐called reproducing kernel particle method, which is a member of the mesh‐free method family, is used together with the Gurson–Tvergaard–Needleman constitutive model for simulation of ductile fracture. A study has been carried out to compare the proposed mesh‐free simulation with the available experimental results and previous finite element simulations for crack propagation in a three‐point‐bending steel specimen. The results show that the mesh‐free simulation agrees well with experimental results, and it is confirmed that the proposed method provides a convenient and yet accurate means for simulation of ductile fracture. Copyright © 2004 John Wiley & Sons, Ltd.     

Elasto–acoustic and acoustic–acoustic coupling on non‐matching grids

Flexible discretization techniques for the approximative solution of coupled wave propagation problems are investigated, focussing on aero–acoustic and elasto–acoustic coupling. In particular, the advantages of using non‐matching grids are presented, when one subregion has to be resolved by a substantially finer grid than the other subregion. For the elasto–acoustic coupling, the problem formulation remains essentially the same as for the matching situation, while for the aero–acoustic coupling, the formulation is enhanced with Lagrange multipliers within the framework of mortar finite element methods. Several numerical examples are presented to demonstrate the flexibility and applicability of the approach. Copyright © 2006 John Wiley & Sons, Ltd.     

Truncation error and stability analysis of iterative and non‐iterative Thomas–Gladwell methods for first‐order non‐linear differential equations

The consistency and stability of a Thomas–Gladwell family of multistage time‐stepping schemes for the solution of first‐order non‐linear differential equations are examined. It is shown that the consistency and stability conditions are less stringent than those derived for second‐order governing equations. Second‐order accuracy is achieved by approximating the solution and its derivative at the same location within the time step. Useful flexibility is available in the evaluation of the non‐linear coefficients and is exploited to develop a new non‐iterative modification of the Thomas–Gladwell method that is second‐order accurate and unconditionally stable. A case study from applied hydrogeology using the non‐linear Richards equation confirms the analytic convergence assessment and demonstrates the efficiency of the non‐iterative formulation. Copyright © 2004 John Wiley & Sons, Ltd.     

Solving linear and non‐linear space–time fractional reaction–diffusion equations by the Adomian decomposition method

In this paper, we consider linear and non‐linear space–time fractional reaction–diffusion equations (STFRDE) on a finite domain. The equations are obtained from standard reaction–diffusion equations by replacing a second‐order space derivative by a fractional derivative of order β∈(1, 2], and a first‐order time derivative by a fractional derivative of order α∈(0, 1]. We use the Adomian decomposition method to construct explicit solutions of the linear and non‐linear STFRDE. Finally, some examples are given. Copyright © 2007 John Wiley & Sons, Ltd.     

Local boundary value problems for the error in FE approximation of non‐linear diffusion systems

In this work we investigate the a posteriori error estimation for a class of non‐linear, multicomponent diffusion operators, which includes the Stefan–Maxwell equations. The local error indicators for the global error are based on local boundary value problems, which are chosen to approximate either the global residual of the finite element approximation or the global linearized error equation. Using representative numerical examples, it is shown that the error indicators based on the latter approach are more accurate for estimating the global error for this problem class as the problem becomes more non‐linear, and can even produce better adaptive mesh refinement (AMR). In addition, we propose a new local error indicator for the error in output functionals that is accurate, inexpensive to compute, and is suitable for AMR, as demonstrated by numerical examples. Copyright © 2007 John Wiley & Sons, Ltd.     

Numerical simulation of flapping wings using a panel method and a high‐order Navier–Stokes solver

The design of efficient flapping wings for human engineered micro aerial vehicles (MAVs) has long been an elusive goal, in part because of the large size of the design space. One strategy for overcoming this difficulty is to use a multifidelity simulation strategy that appropriately balances computation time and accuracy. We compare two models with different geometric and physical fidelity. The low‐fidelity model is an inviscid doublet lattice method with infinitely thin lifting surfaces. The high‐fidelity model is a high‐order accurate discontinuous Galerkin Navier–Stokes solver, which uses an accurate representation of the flapping wing geometry. To compare the performance of the two methods, we consider a model flapping wing with an elliptical planform and an analytically prescribed spanwise wing twist, at size scales relevant to MAVs. Our results show that in many cases, including those with mild separation, low‐fidelity simulations can accurately predict integrated forces, provide insight into the flow structure, indicate regions of likely separation, and shed light on design–relevant quantities. But for problems with significant levels of separation, higher‐fidelity methods are required to capture the details of the flow field. Inevitably high‐fidelity simulations are needed to establish the limits of validity of the lower fidelity simulations.Copyright © 2012 John Wiley & Sons, Ltd.     

On the long time simulation of the Rayleigh–Taylor instability

We investigate the classical Rayleigh–Taylor instability with a phase‐field method. Despite of the long history of numerical simulations for the Rayleigh–Taylor instability, almost all results were relatively short time experiments. This is partly because of the way of treating the pressure boundary conditions. We implement a time‐dependent pressure boundary condition through a time‐dependent density field at the boundary. Owing to the pressure boundary treatment, we can perform long time evolutions resulting in an equilibrium state. In addition to the bubble and spike fronts, we have found that the width of sides is another important landmark on the interface of the Rayleigh–Taylor instability. Copyright © 2010 John Wiley & Sons, Ltd.     

Source terms in Eulerian–Lagrangian contaminant transport simulation

Standard Eulerian treatment of source terms in Eulerian–Lagrangian numerical simulations results in poor performance at higher Courant numbers. To regain the customary high accuracy of Eulerian–Lagrangian methods under these conditions, a Lagrangian treatment of source terms is needed. It is also important to include the effects of fluid sources as well as contaminant sources. A new Lagrangian source formulation is presented, which has been implemented in a finite element simulator for contaminant transport in rivers and estuaries. Test problems demonstrate the high accuracy of the technique under a range of conditions, and its applicability to general multi‐dimensional problems and unstructured grids. Copyright © 2004 John Wiley & Sons, Ltd.     

Improving multigrid performance for unstructured mesh drift–diffusion simulations on 147,000 cores

This study considers the scaling of three algebraic multigrid aggregation schemes for a finite element discretization of a drift–diffusion system, specifically the drift–diffusion model for semiconductor devices. The approach is more general and can be applied to other systems of partial differential equations. After discretization on unstructured meshes, a fully coupled multigrid preconditioned Newton–Krylov solution method is employed. The choice of aggregation scheme for generating coarser levels has a significant impact on the performance and scalability of the multigrid preconditioner. For the test cases considered, the uncoupled aggregation scheme, which aggregates/combines the immediate neighbors, followed by repartitioning and data redistribution for the coarser level matrices on a subset of the Message Passing Interface (MPI) processes, outperformed the two other approaches, including the baseline aggressive coarsening scheme. Scaling results are presented up to 147,456 cores on an IBM Blue Gene/P platform. A comparison of the scaling of a multigrid V‐cycle and W‐cycle is provided. Results for 65,536 cores demonstrate that a factor of 3.5 × reduction in time between the uncoupled aggregation and baseline aggressive coarsening scheme can be obtained by significantly reducing the iteration count due to the increased number of multigrid levels and the generation of better quality aggregates. Copyright © 2012 John Wiley & Sons, Ltd.