Searcharxiv⌕ Search

arXiv subjects

Patrick E. Farrell

Publications and source records attributed to Patrick E. Farrell.

At least 37 records · Page 2Linked to original sources

Time-harmonic waves in Korteweg and nematic-Korteweg fluids

We derive the Helmholtz--Korteweg equation, which models acoustic waves in Korteweg fluids. We further derive a nematic variant of the Helmholtz-Korteweg equation, which incorporates an additional orientational term in the stress tensor. Its dispersion relation coincides with that arising in Virga's analysis of the Euler-Korteweg equations, which we extend to consider imaginary wave numbers and the effect of boundary conditions. In particular, our extensions allow us to analyze the effect of nematic orientation on the penetration depth of evanescent plane waves, and on the scattering of sound waves by obstacles. Furthermore, we make new, experimentally-verifiable predictions for the effect of boundary conditions for a modification of the Mullen-Lüthi-Stephen experiment, and for the scattering of acoustic waves in nematic-Korteweg fluids by a circular obstacle.

math-ph↗

The latent variable proximal point algorithm for variational problems with inequality constraints

The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point algorithm. At the continuous level, the two formulations are equivalent, but the saddle point formulation is more amenable to discretization because it introduces a structure-preserving transformation between a latent function space and the feasible set. Working in this latent space is much more convenient for enforcing inequality constraints than the feasible set, as discretizations can employ general linear combinations of suitable basis functions, and nonlinear solvers can involve general additive updates. LVPP yields numerical methods with observed mesh-independence for obstacle problems, contact, fracture, plasticity, and others besides; in many cases, for the first time. The framework also extends to more complex constraints, providing means to enforce convexity in the Monge--Ampère equation and handling quasi-variational inequalities, where the underlying constraint depends implicitly on the unknown solution. In this paper, we describe the LVPP algorithm in a general form and apply it to ten problems from across mathematics.

math.OC↗

An augmented Lagrangian preconditioner for the control of the Navier--Stokes equations

We address the solution of the distributed control problem for the steady, incompressible Navier--Stokes equations. We propose an inexact Newton linearization of the optimality conditions. Upon discretization by a finite element scheme, we obtain a sequence of large symmetric linear systems of saddle-point type. We use an augmented Lagrangian-based block triangular preconditioner in combination with the flexible GMRES method at each Newton step. The preconditioner is applied inexactly via a suitable multigrid solver. Numerical experiments indicate that the resulting method appears to be fairly robust with respect to viscosity, mesh size, and the choice of regularization parameter when applied to 2D problems.

math.NA↗

Kinetic derivation of a compressible Leslie--Ericksen equation for rarified calamitic gases

Nematic ordering describes the phenomenon where anisotropic molecules tend to locally align, like matches in a matchbox. This ordering can arise in solids (as nematic elastomers), liquids (as liquid crystals), and in gases. In the 1940s, Onsager described how nematic ordering can arise in dilute colloidal suspensions from the molecular point of view. However, the kinetic theory of nonspherical molecules has not, thus far, accounted for phenomena relating to the presence of nematic ordering. In this work we develop a kinetic theory for the behavior of rarified calamitic (rodlike) gases in the presence of nematic ordering. Building on previous work by Curtiss, we derive from kinetic theory the rate of work hypothesis that forms the starting point for Leslie--Ericksen theory. We incorporate ideas from the variational theory of nematic liquid crystals to create a moment closure that preserves the coupling between the laws of linear and angular momentum. The coupling between these laws is a key feature of our theory, in contrast to the kinetic theory proposed by {Curtiss \& Dahler}, where the couple stress tensor is assumed to be zero. This coupling allows the characterization of anisotropic phenomena arising from the nematic ordering. Furthermore, the theory leads to an energy functional that is a compressible variant of the classical Oseen--Frank energy (with a pressure-dependent Frank constant) and to a compressible analogue of the Leslie--Ericksen equations. The emergence of compressible aspects in the theory for nematic fluids enhances our understanding of these complex systems.

math-ph↗

Two conjectures on the Stokes complex in three dimensions on Freudenthal meshes

In recent years a great deal of attention has been paid to discretizations of the incompressible Stokes equations that exactly preserve the incompressibility constraint. These are of substantial interest because these discretizations are pressure-robust, i.e. the error estimates for the velocity do not depend on the error in the pressure. Similar considerations arise in nearly incompressible linear elastic solids. Conforming discretizations with this property are now well understood in two dimensions, but remain poorly understood in three dimensions. In this work we state two conjectures on this subject. The first is that the Scott-Vogelius element pair is inf-sup stable on uniform meshes for velocity degree $k \ge 4$; the best result available in the literature is for $k \ge 6$. The second is that there exists a stable space decomposition of the kernel of the divergence for $k \ge 5$. We present numerical evidence supporting our conjectures.

math.NA↗

A scalable and robust vertex-star relaxation for high-order FEM

Pavarino proved that the additive Schwarz method with vertex patches and a low-order coarse space gives a $p$-robust solver for symmetric and coercive problems. However, for very high polynomial degree it is not feasible to assemble or factorize the matrices for each patch. In this work we introduce a direct solver for separable patch problems that scales to very high polynomial degree on tensor product cells. The solver constructs a tensor product basis that diagonalizes the blocks in the stiffness matrix for the internal degrees of freedom of each individual cell. As a result, the non-zero structure of the cell matrices is that of the graph connecting internal degrees of freedom to their projection onto the facets. In the new basis, the patch problem is as sparse as a low-order finite difference discretization, while having a sparser Cholesky factorization. We can thus afford to assemble and factorize the matrices for the vertex-patch problems, even for very high polynomial degree. In the non-separable case, the method can be applied as a preconditioner by approximating the problem with a separable surrogate. We demonstrate the approach by solving the Poisson equation and a $H(\mathrm{div})$-conforming interior penalty discretization of linear elasticity in three dimensions at $p = 15$.

math.NA↗

Multigrid solvers for the de Rham complex with optimal complexity in polynomial degree

The Riesz maps of the $L^2$ de Rham complex frequently arise as subproblems in the construction of fast preconditioners for more complicated problems. In this work we present multigrid solvers for high-order finite element discretizations of these Riesz maps with the same time and space complexity as sum-factorized operator application, i.e.~with optimal complexity in polynomial degree in the context of Krylov methods. The key idea of our approach is to build new finite elements for each space in the de Rham complex with orthogonality properties in both the $L^2$- and $H(\mathrm{d})$-inner products ($\mathrm{d} \in \{\mathrm{grad}, \mathrm{curl}, \mathrm{div}\})$ on the reference hexahedron. The resulting sparsity enables the fast solution of the patch problems arising in the Pavarino, Arnold--Falk--Winther and Hiptmair space decompositions, in the separable case. In the non-separable case, the method can be applied to an auxiliary operator that is sparse by construction. With exact Cholesky factorizations of the sparse patch problems, the application complexity is optimal but the setup costs and storage are not. We overcome this with the finer Hiptmair space decomposition and the use of incomplete Cholesky factorizations imposing the sparsity pattern arising from static condensation, which applies whether static condensation is used for the solver or not. This yields multigrid relaxations with time and space complexity that are both optimal in the polynomial degree.

math.NA↗

Colloidal smectics in button-like confinements: experiment and theory

Liquid crystals can self-organize into a layered smectic phase. While the smectic layers are typically straight forming a lamellar pattern in bulk, external confinement may drastically distort the layers due to the boundary conditions imposed on the orientational director field. Resolving this distortion leads to complex structures with topological defects. Here, we explore the configurations adopted by two-dimensional colloidal smectics made from nearly hard rod-like particles in complex confinements, characterized by a button-like structure with two internal boundaries (inclusions): a two-holed disk and a double annulus. The topology of the confinement generates new structures which we classify in reference to previous work as generalized laminar and generalized Shubnikov states. To explore these configurations, we combine particle-resolved experiments on colloidal rods with three complementary theoretical approaches: Monte-Carlo simulation, first-principles density functional theory and phenomenological $\mathbf{Q}$-tensor modeling. This yields a consistent and comprehensive description of the structural details. In particular, we characterize a nontrivial tilt angle between the direction of the layers and symmetry axes of the confinement.

cond-mat.soft↗

Finite-element discretization of the smectic density equation

The fourth-order PDE that models the density variation of smectic A liquid crystals presents unique challenges in its (numerical) analysis beyond more common fourth-order operators, such as the classical biharmonic. While the operator is positive definite, the equation has a "wrong-sign" shift, making it somewhat more akin to an indefinite Helmholtz operator, with lowest-energy modes consisting of plane waves. As a result, for large shifts, the natural continuity, coercivity, and inf-sup constants degrade considerably, impacting standard error estimates. In this paper, we analyze and compare three finite-element formulations for such PDEs, based on $H^2$-conforming elements, the $C^0$ interior penalty method, and a mixed finite-element formulation that explicitly introduces approximations to the gradient of the solution and a Lagrange multiplier. The conforming method is simple but is impractical to apply in three dimensions; the interior-penalty method works well in two and three dimensions but has lower-order convergence and (in preliminary experiments) seems difficult to precondition; the mixed method uses more degrees of freedom, but works well in both two and three dimensions, and is amenable to monolithic multigrid preconditioning. Our analysis reveals different behaviours of the error bounds with the shift parameter and mesh size for the different schemes. Numerical results verify the finite-element convergence for all discretizations, and illustrate the trade-offs between the three schemes.

math.NA↗

A full approximation scheme multilevel method for nonlinear variational inequalities

We present the full approximation scheme constraint decomposition (FASCD) multilevel method for solving variational inequalities (VIs). FASCD is a common extension of both the full approximation scheme (FAS) multigrid technique for nonlinear partial differential equations, due to A.~Brandt, and the constraint decomposition (CD) method introduced by X.-C.~Tai for VIs arising in optimization. We extend the CD idea by exploiting the telescoping nature of certain function space subset decompositions arising from multilevel mesh hierarchies. When a reduced-space (active set) Newton method is applied as a smoother, with work proportional to the number of unknowns on a given mesh level, FASCD V-cycles exhibit nearly mesh-independent convergence rates, and full multigrid cycles are optimal solvers. The example problems include differential operators which are symmetric linear, nonsymmetric linear, and nonlinear, in unilateral and bilateral VI problems.

math.NA↗

Monolithic multigrid for implicit Runge-Kutta discretizations of incompressible fluid flow

Most research on preconditioners for time-dependent PDEs has focused on implicit multi-step or diagonally-implicit multi-stage temporal discretizations. In this paper, we consider monolithic multigrid preconditioners for fully-implicit multi-stage Runge-Kutta (RK) time integration methods. These temporal discretizations have very attractive accuracy and stability properties, but they couple the spatial degrees of freedom across multiple time levels, requiring the solution of very large linear systems. We extend the classical Vanka relaxation scheme to implicit RK discretizations of saddle point problems. We present numerical results for the incompressible Stokes, Navier-Stokes, and resistive magnetohydrodynamics equations, in two and three dimensions, confirming that these relaxation schemes lead to robust and scalable monolithic multigrid methods for a challenging range of incompressible fluid-flow models.

math.NA↗

Optimization of Hopf bifurcation points

We introduce a numerical technique for controlling the location and stability properties of Hopf bifurcations in dynamical systems. The algorithm consists of solving an optimization problem constrained by an extended system of nonlinear partial differential equations that characterizes Hopf bifurcation points. The flexibility and robustness of the method allows us to advance or delay a Hopf bifurcation to a target value of the bifurcation parameter, as well as controlling the oscillation frequency with respect to a parameter of the system or the shape of the domain on which solutions are defined. Numerical applications are presented in systems arising from biology and fluid dynamics, such as the FitzHugh--Nagumo model, Ginzburg--Landau equation, Rayleigh--Bénard convection problem, and Navier--Stokes equations, where the control of the location and oscillation frequency of periodic solutions is of high interest.

math.NA↗

Structural electroneutrality in Onsager-Stefan-Maxwell transport with charged species

We present a method to embed local electroneutrality within Onsager-Stefan-Maxwell electrolytic-transport models, circumventing their formulation as differential systems with an algebraic constraint. Flux-explicit transport laws are formulated for general multicomponent electrolytes, in which the conductivity, component diffusivities, and transference numbers relate to Stefan-Maxwell coefficients through invertible matrix calculations. A construction we call a `salt-charge basis' implements Guggenheim's transformation of species electrochemical potentials into combinations describing a minimal set of neutral components, leaving a unique combination associated with electricity. Defining conjugate component concentrations and fluxes that preserve the structures of the Gibbs function and energy dissipation retains symmetric Onsager reciprocal relations. The framework reproduces Newman's constitutive laws for binary electrolytes and the Pollard-Newman laws for molten salts; we also propose laws for salt solutions in two-solvent blends, such as lithium-ion-battery electrolytes. Finally, we simulate a potentiostatic Hull cell containing a non-ideal binary electrolyte with concentration-dependent properties.

physics.flu-dyn↗

Preconditioners for computing multiple solutions in three-dimensional fluid topology optimization

Topology optimization problems generally support multiple local minima, and real-world applications are typically three-dimensional. In previous work [I. P. A. Papadopoulos, P. E. Farrell, and T. M. Surowiec, Computing multiple solutions of topology optimization problems, SIAM Journal on Scientific Computing, (2021)], the authors developed the deflated barrier method, an algorithm that can systematically compute multiple solutions of topology optimization problems. In this work we develop preconditioners for the linear systems arising in the application of this method to Stokes flow, making it practical for use in three dimensions. In particular, we develop a nested block preconditioning approach which reduces the linear systems to solving two symmetric positive-definite matrices and an augmented momentum block. An augmented Lagrangian term is used to control the innermost Schur complement and we apply a geometric multigrid method with a kernel-capturing relaxation method for the augmented momentum block. We present multiple solutions in three-dimensional examples computed using the proposed iterative solver.

math.NA↗

A new mixed finite-element method for $H^2$ elliptic problems

Fourth-order differential equations play an important role in many applications in science and engineering. In this paper, we present a three-field mixed finite-element formulation for fourth-order problems, with a focus on the effective treatment of the different boundary conditions that arise naturally in a variational formulation. Our formulation is based on introducing the gradient of the solution as an explicit variable, constrained using a Lagrange multiplier. The essential boundary conditions are enforced weakly, using Nitsche's method where required. As a result, the problem is rewritten as a saddle-point system, requiring analysis of the resulting finite-element discretization and the construction of optimal linear solvers. Here, we discuss the analysis of the well-posedness and accuracy of the finite-element formulation. Moreover, we develop monolithic multigrid solvers for the resulting linear systems. Two and three-dimensional numerical results are presented to demonstrate the accuracy of the discretization and efficiency of the multigrid solvers proposed.

math.NA↗

On the finite element approximation of a semicoercive Stokes variational inequality arising in glaciology

Stokes variational inequalities arise in the formulation of glaciological problems involving contact. We consider the problem of a two-dimensional marine ice sheet with a grounding line, although the analysis presented here is extendable to other contact problems in glaciology, such as that of subglacial cavitation. The analysis of this problem and its discretisation is complicated by the nonlinear rheology commonly used for modelling ice, the enforcement of a friction boundary condition given by a power law, and the presence of rigid modes in the velocity space, which render the variational inequality semicoercive. In this work, we consider a mixed formulation of this variational inequality involving a Lagrange multiplier and provide an analysis of its finite element approximation. Error estimates in the presence of rigid modes are obtained by means of a specially-built projection operator onto the subspace of rigid modes and a Korn-type inequality. These proofs rely on the fact that the subspace of rigid modes is at most one-dimensional. Numerical results are reported to validate the error estimates.

math.NA↗

Variational and numerical analysis of a $\mathbf{Q}$-tensor model for smectic-A liquid crystals

We analyse an energy minimisation problem recently proposed for modelling smectic-A liquid crystals. The optimality conditions give a coupled nonlinear system of partial differential equations, with a second-order equation for the tensor-valued nematic order parameter $\mathbf{Q}$ and a fourth-order equation for the scalar-valued smectic density variation $u$. Our two main results are a proof of the existence of solutions to the minimisation problem, and the derivation of a priori error estimates for its discretisation of the decoupled case (i.e., $q=0$) using the $\mathcal{C}^0$ interior penalty method. More specifically, optimal rates in the $H^1$ and $L^2$ norms are obtained for $\mathbf{Q}$, while optimal rates in a mesh-dependent norm and $L^2$ norm are obtained for $u$. Numerical experiments confirm the rates of convergence.

math.NA↗

Finite element methods for multicomponent convection-diffusion

We develop finite element methods for coupling the steady-state Onsager--Stefan--Maxwell equations to compressible Stokes flow. These equations describe multicomponent flow at low Reynolds number, where a mixture of different chemical species within a common thermodynamic phase is transported by convection and molecular diffusion. Developing a variational formulation for discretizing these equations is challenging: the formulation must balance physical relevance of the variables and boundary data, regularity assumptions, tractability of the analysis, enforcement of thermodynamic constraints, ease of discretization, and extensibility to the transient, anisothermal, and non-ideal settings. To resolve these competing goals, we employ two augmentations: the first enforces the mass-average constraint in the Onsager--Stefan--Maxwell equations, while its dual modifies the Stokes momentum equation to enforce symmetry. Remarkably, with these augmentations we achieve a Picard linearization of symmetric saddle point type, despite the equations not possessing a Lagrangian structure. Exploiting the structure of linear irreversible thermodynamics, we prove the inf-sup condition for this linearization, and identify finite element function spaces that automatically inherit well-posedness. We verify our error estimates with a numerical example, and illustrate the application of the method to non-ideal fluids with a simulation of the microfluidic mixing of hydrocarbons.

math.NA↗