arXiv subjects

Alexander Bihlo

Publications and source records attributed to Alexander Bihlo.

At least 37 records · Page 2Linked to original sources

arXiv2017

Group analysis of general Burgers-Korteweg-de Vries equations

The complete group classification problem for the class of (1+1)-dimensional $r$th order general variable-coefficient Burgers-Korteweg-de Vries equations is solved for arbitrary values of $r$ greater than or equal to two. We find the equivalence groupoids of this class and its various subclasses obtained by gauging equation coefficients with equivalence transformations. Showing that this class and certain gauged subclasses are normalized in the usual sense, we reduce the complete group classification problem for the entire class to that for the selected maximally gauged subclass, and it is the latter problem that is solved efficiently using the algebraic method of group classification. Similar studies are carried out for the two subclasses of equations with coefficients depending at most on the time or space variable, respectively. Applying an original technique, we classify Lie reductions of equations from the class under consideration with respect to its equivalence group. Studying of alternative gauges for equation coefficients with equivalence transformations allows us not only to justify the choice of the most appropriate gauge for the group classification but also to construct for the first time classes of differential equations with nontrivial generalized equivalence group such that equivalence-transformation components corresponding to equation variables locally depend on nonconstant arbitrary elements of the class. For the subclass of equations with coefficients depending at most on the time variable, which is normalized in the extended generalized sense, we explicitly construct its extended generalized equivalence group in a rigorous way. The new notion of effective generalized equivalence group is introduced.

math-ph↗

arXiv2017

Group classification of linear evolution equations

The group classification problem for the class of (1+1)-dimensional linear $r$th order evolution equations is solved for arbitrary values of $r>2$. It is shown that a related maximally gauged class of homogeneous linear evolution equations is uniformly semi-normalized with respect to linear superposition of solutions and hence the complete group classification can be obtained using the algebraic method. We also compute exact solutions for equations from the class under consideration using Lie reduction and its specific generalizations for linear equations.

math-ph↗

arXiv2017

A well-balanced meshless tsunami propagation and inundation model

We present a novel meshless tsunami propagation and inundation model. We discretize the nonlinear shallow-water equations using a well-balanced scheme relying on radial basis function based finite differences. The inundation model relies on radial basis function generated extrapolation from the wet points closest to the wet-dry interface into the dry region. Numerical results against standard one- and two-dimensional benchmarks are presented.

physics.ao-ph↗

arXiv2016

Conservative methods for dynamical systems

We show a novel systematic way to construct conservative finite difference schemes for quasilinear first-order system of ordinary differential equations with conserved quantities. In particular, this includes both autonomous and non-autonomous dynamical systems with conserved quantities of arbitrary forms, such as time-dependent conserved quantities. Sufficient conditions to construct conservative schemes of arbitrary order are derived using the multiplier method. General formulas for first-order conservative schemes are constructed using divided difference calculus. New conservative schemes are found for various dynamical systems such as Euler's equation of rigid body rotation, Lotka-Volterra systems, the planar restricted three-body problem and the damped harmonic oscillator.

math.NA↗

arXiv2016

Symmetry-preserving numerical schemes

In these lectures we review two procedures for constructing finite difference numerical schemes that preserve symmetries of differential equations. The first approach is based on Lie's infinitesimal symmetry generators, while the second method uses the novel theory of equivariant moving frames. The advantages of both techniques are discussed and illustrated with the Schwarzian differential equation, the Korteweg-de Vries equation and Burgers' equation. Numerical simulations are presented and innovative techniques for obtaining better invariant numerical schemes are introduced. New research directions and open problems are indicated at the end of these notes.

math.NA↗

arXiv2016

Stochastic domain decomposition for the solution of the two-dimensional magnetotelluric problem

Stochastic domain decomposition is proposed as a novel method for solving the two-dimensional Maxwell's equations as used in the magnetotelluric method. The stochastic form of the exact solution of Maxwell's equations is evaluated using Monte-Carlo methods taking into consideration that the domain may be divided into neighboring sub-domains. These sub-domains can be naturally chosen by splitting the sub-surface domain into regions of constant (or at least continuous) conductivity. The solution over each sub-domain is obtained by solving Maxwell's equations in the strong form. The sub-domain solver used for this purpose is a meshless method resting on radial basis function based finite differences. The method is demonstrated by solving a number of classical magnetotelluric problems, including the quarter-space problem, the block-in-half-space problem and the triangle-in-half-space problem.

physics.geo-ph↗

arXiv2015

The multiplier method to construct conservative finite difference schemes for ordinary and partial differential equations

We present the multiplier method of constructing conservative finite difference schemes for ordinary and partial differential equations. Given a system of differential equations possessing conservation laws, our approach is based on discretizing conservation law multipliers and their associated density and flux functions. We show that the proposed discretization is consistent for any order of accuracy when the discrete multiplier has a multiplicative inverse. Moreover, we show that by construction, discrete densities can be exactly conserved. In particular, the multiplier method does not require the system to possess a Hamiltonian or variational structure. Examples, including dissipative problems, are given to illustrate the method. In the case when the inverse of the discrete multiplier becomes singular, consistency of the method is also established for scalar ODEs provided the discrete multiplier and density are zero-compatible.

math.NA↗

arXiv2015

Algebraic method for finding equivalence groups

The algebraic method for computing the complete point symmetry group of a system of differential equations is extended to finding the complete equivalence group of a class of such systems. The extended method uses the knowledge of the corresponding equivalence algebra. Two versions of the method are presented, where the first involves the automorphism group of this algebra and the second is based on a list of its megaideals. We illustrate the megaideal-based version of the method with the computation of the complete equivalence group of a class of nonlinear wave equations with applications in nonlinear elasticity.

math-ph↗

arXiv2015

Stochastic domain decomposition for time dependent adaptive mesh generation

The efficient generation of meshes is an important component in the numerical solution of problems in physics and engineering. Of interest are situations where global mesh quality and a tight coupling to the solution of the physical partial differential equation (PDE) is important. We consider parabolic PDE mesh generation and present a method for the construction of adaptive meshes in two spatial dimensions using stochastic domain decomposition that is suitable for an implementation in a multi- or many-core environment. Methods for mesh generation on periodic domains are also provided. The mesh generator is coupled to a time dependent physical PDE and the system is evolved using an alternating solution procedure. The method uses the stochastic representation of the exact solution of a parabolic linear mesh generator to find the location of an adaptive mesh along the (artificial) subdomain interfaces. The deterministic evaluation of the mesh over each subdomain can then be obtained completely independently using the probabilistically computed solutions as boundary conditions. The parallel performance of this general stochastic domain decomposition approach has previously been shown. We demonstrate the approach numerically for the mesh generation context and compare the mesh obtained with the corresponding single domain mesh using a representative mesh quality measure.

math.NA↗

arXiv2014

The Korteweg-de Vries equation and its symmetry-preserving discretization

The Korteweg-de Vries equation is one of the most important nonlinear evolution equations in the mathematical sciences. In this article invariant discretization schemes are constructed for this equation both in the Lagrangian and in the Eulerian form. We also propose invariant schemes that preserve the momentum. Numerical tests are carried out for all invariant discretization schemes and related to standard numerical schemes. We find that the invariant discretization schemes give generally the same level of accuracy as the standard schemes with the added benefit of preserving Galilean transformations which is demonstrated numerically as well.

math-ph↗

arXiv2014

Parallel stochastic methods for PDE based grid generation

The efficient generation of meshes is an important step in the numerical solution of various problems in physics and engineering. We are interested in situations where global mesh quality and tight coupling to the physical solution is important. We consider elliptic PDE based mesh generation and present a method for the construction of adaptive meshes in two spatial dimensions using domain decomposition that is suitable for an implementation on parallel computing architectures. The method uses the stochastic representation of the exact solution of a linear mesh generator of Winslow type to find the points of the adaptive mesh along the subdomain interfaces. The meshes over the single subdomains can then be obtained completely independently of each other using the probabilistically computed solutions along the interfaces as boundary conditions for the linear mesh generator. Further to the previously acknowledged performance characteristics, we demonstrate how the stochastic domain decomposition approach is particularly suited to the problem of grid generation - generating quality meshes efficiently. In addition we show further improvements are possible using interpolation of the subdomain interfaces and smoothing of mesh candidates. An optimal placement strategy is introduced to automatically choose the number and placement of points along the interface using the mesh density function. Various examples of meshes constructed using this stochastic-deterministic domain decomposition technique are shown and compared to the respective single domain solutions using a representative mesh quality measure. A brief performance study is included to show the viability of the stochastic domain decomposition approach and to illustrate the effect of algorithmic choices on the solver's efficiency.

math.NA↗

arXiv2014

A stochastic domain decomposition method for time dependent mesh generation

We use a time-relaxed linear grid generator of Winslow type to propose a new deterministic-stochastic domain decomposition approach to the generation of adaptive moving meshes. The method uses the probabilistic form of the exact solution of the linear mesh generator to provide the sub-domain interface values that serve as boundary conditions for the domain decomposition. The meshes over the single sub-domains can then be obtained independently of each other in an entirely parallel fashion. We demonstrate numerically the capability of the method to yield smooth, time-evolving meshes.

math.NA↗

arXiv2013

Invariant parameterization and turbulence modeling on the beta-plane

Invariant parameterization schemes for the eddy-vorticity flux in the barotropic vorticity equation on the beta-plane are constructed and then applied to turbulence modeling. This construction is realized by the exhaustive description of differential invariants for the maximal Lie invariance pseudogroup of this equation using the method of moving frames, which includes finding functional bases of differential invariants of arbitrary order, a minimal generating set of differential invariants and a basis of operators of invariant differentiation in an explicit form. Special attention is paid to the problem of two-dimensional turbulence on the beta-plane. It is shown that classical hyperdiffusion as used to initiate the energy-enstrophy cascades violates the symmetries of the vorticity equation. Invariant but nonlinear hyperdiffusion-like terms of new types are introduced and then used in the course of numerically integrating the vorticity equation and carrying out freely decaying turbulence tests. It is found that the invariant hyperdiffusion scheme is close to but not exactly reproducing the 1/k shape of energy spectrum in the enstrophy inertial range. By presenting conservative invariant hyperdiffusion terms, we also demonstrate that the concepts of invariant and conservative parameterizations are consistent.

math-ph↗

arXiv2013

Invariant Discretization Schemes Using Evolution-Projection Techniques

Finite difference discretization schemes preserving a subgroup of the maximal Lie invariance group of the one-dimensional linear heat equation are determined. These invariant schemes are constructed using the invariantization procedure for non-invariant schemes of the heat equation in computational coordinates. We propose a new methodology for handling moving discretization grids which are generally indispensable for invariant numerical schemes. The idea is to use the invariant grid equation, which determines the locations of the grid point at the next time level only for a single integration step and then to project the obtained solution to the regular grid using invariant interpolation schemes. This guarantees that the scheme is invariant and allows one to work on the simpler stationary grids. The discretization errors of the invariant schemes are established and their convergence rates are estimated. Numerical tests are carried out to shed some light on the numerical properties of invariant discretization schemes using the proposed evolution-projection strategy.

math-ph↗

arXiv2013

Convecting reference frames and invariant numerical models

In the recent paper by Bernardini et al. [J. Comput. Phys. 232 (2013), 1-6] the discrepancy in the performance of finite difference and spectral models for simulations of flows with a preferential direction of propagation was studied. In a simplified investigation carried out using the viscous Burgers equation the authors attributed the poorer numerical results of finite difference models to a violation of Galilean invariance in the discretization and propose to carry out the computations in a reference frame moving with the bulk velocity of the flow. Here we further discuss this problem and relate it to known results on invariant discretization schemes. Non-invariant and invariant finite difference discretizations of Burgers equation are proposed and compared with the discretization using the remedy proposed by Bernardini et al..

math.NA↗

arXiv2013

Symmetry preserving parameterization schemes

Methods for the design of physical parameterization schemes that possess certain invariance properties are discussed. These methods are based on different techniques of group classification and provide means to determine expressions for unclosed terms arising in the course of averaging of nonlinear differential equations. The demand that the averaged equation is invariant with respect to a subalgebra of the maximal Lie invariance algebra of the unaveraged equation leads to a problem of inverse group classification which is solved by the description of differential invariants of the selected subalgebra. Given no prescribed symmetry group, the direct group classification problem is relevant. Within this framework, the algebraic method or direct integration of determining equations for Lie symmetries can be applied. For cumbersome parameterizations, a preliminary group classification can be carried out. The methods presented are exemplified by parameterizing the eddy vorticity flux in the averaged vorticity equation. In particular, differential invariants of (infinite dimensional) subalgebras of the maximal Lie invariance algebra of the unaveraged vorticity equation are computed. A hierarchy of normalized subclasses of generalized vorticity equations is constructed. Invariant parameterizations possessing minimal symmetry extensions are described and a restricted class of invariant parameterization is exhaustively classified. The physical importance of the parameterizations designed is discussed.

math-ph↗

arXiv2013

Invariant discretization schemes for the shallow-water equations

Invariant discretization schemes are derived for the one- and two-dimensional shallow-water equations with periodic boundary conditions. While originally designed for constructing invariant finite difference schemes, we extend the usage of difference invariants to allow constructing of invariant finite volume methods as well. It is found that the classical invariant schemes converge to the Lagrangian formulation of the shallow-water equations. These schemes require to redistribute the grid points according to the physical fluid velocity, i.e., the mesh cannot remain fixed in the course of the numerical integration. Invariant Eulerian discretization schemes are proposed for the shallow-water equations in computational coordinates. Instead of using the fluid velocity as the grid velocity, an invariant moving mesh generator is invoked in order to determine the location of the grid points at the subsequent time level. The numerical conservation of energy, mass and momentum is evaluated for both the invariant and non-invariant schemes.

math-ph↗

arXiv2012

Symmetry analysis of a system of modified shallow-water equations

We revise the symmetry analysis of a modified system of one-dimensional shallow-water equations (MSWE) recently considered by Raja Sekhar and Sharma [Commun. Nonlinear Sci. Numer. Simulat. 20 (2012) 630-636]. Only a finite dimensional subalgebra of the maximal Lie invariance algebra of the MSWE, which in fact is infinite dimensional, was found in the aforementioned paper. The MSWE can be linearized using a hodograph transformation. An optimal list of inequivalent one-dimensional subalgebras of the maximal Lie invariance algebra is constructed and used for Lie reductions. Non-Lie solutions are found from solutions of the linearized MSWE.

math-ph↗