A Domain Imbedding Method with Distributed Lagrange Multipliers for Acoustic Scattering Problems

The numerical computation of acoustic scattering by bounded twodimensional obstacles is considered. A domain imbedding method with Lagrange multipliers is introduced for the solution of the Helmholtz equation with a second-order absorbing boundary condition. Distributed Lagrange multipliers are used to enforce the Dirichlet boundary condition on the scatterer. The saddle-point problem arising from the conforming finite element discretization is iteratively solved by the GMRES method with a block triangular preconditioner. Numerical experiments are performed with a disc and a semi-open cavity as scatterers.

Controlled time integration for the numerical simulation of meteor radar reflections

We model meteoroids entering the Earth[U+05F3]s atmosphere as objects surrounded by non-magnetized plasma, and consider efficient numerical simulation of radar reflections from meteors in the time domain. Instead of the widely used finite difference time domain method (FDTD), we use more generalized finite differences by applying the discrete exterior calculus (DEC) and non-uniform leapfrog-style time discretization. The computational domain is presented by convex polyhedral elements. The convergence of the time integration is accelerated by the exact controllability method. The numerical experiments show that our code is efficiently parallelized. The DEC approach is compared to the volume …

A boundary condition for arbitrary shaped inlets in lattice-Boltzmann simulations

We introduce a mass-flux-based inlet boundary condition for the lattice-Boltzmann method. The proposed boundary condition requires minimal amount of boundary data, it produces a steady-state velocity field which is accurate close to the inlet even for arbitrary inlet geometries, and yet it is simple to implement. We demonstrate its capability for both simple and complex inlet geometries by numerical experiments. For simple inlet geometries, we show that the boundary condition provides very accurate inlet velocities when Re less than or similar to 1. Even with moderate Reynolds number, the inlet velocities are accurate for practical purposes. Furthermore, the potential of our boundary condit…

Controllability method for acoustic scattering with spectral elements

We formulate the Helmholtz equation as an exact controllability problem for the time-dependent wave equation. The problem is then discretized in time domain with central finite difference scheme and in space domain with spectral elements. This approach leads to high accuracy in spatial discretization. Moreover, the spectral element method results in diagonal mass matrices, which makes the time integration of the wave equation highly efficient. After discretization, the exact controllability problem is reformulated as a least-squares problem, which is solved by the conjugate gradient method. We illustrate the method with some numerical experiments, which demonstrate the significant improveme…

Comparison of implementations of the lattice-Boltzmann method

AbstractSimplicity of coding is usually an appealing feature of the lattice-Boltzmann method (LBM). Conventional implementations of LBM are often based on the two-lattice or the two-step algorithm, which however suffer from high memory consumption and poor computational performance, respectively. The aim of this work was to identify implementations of LBM that would achieve high computational performance with low memory consumption. Effects of memory addressing schemes were investigated in particular. Data layouts for velocity distribution values were also considered, and they were found to be related to computational performance. A novel bundle data layout was therefore introduced. Address…

Generalized finite difference schemes with higher order Whitney forms

Finite difference kind of schemes are popular in approximating wave propagation problems in finite dimensional spaces. While Yee’s original paper on the finite difference method is already from the sixties, mathematically there still remains questions which are not yet satisfactorily covered. In this paper, we address two issues of this kind. Firstly, in the literature Yee’s scheme is constructed separately for each particular type of wave problem. Here, we explicitly generalize the Yee scheme to a class of wave problems that covers at large physics field theories. For this we introduce Yee’s scheme for all problems of a class characterised on a Minkowski manifold by (i) a pair of first ord…

General conservation law for a class of physics field theories

In this paper we form a general conservation law that unifies a class of physics field theories. For this we first introduce the notion of a general field as a formal sum differential forms on a Minkowski manifold. Thereafter, we employ the action principle to define the conservation law for such general fields. By construction, particular field notions of physics, such as electric field strength, stress, strain etc. become instances of the general field. Hence, the differential equations that constitute physics field theories become also instances of the general conservation law. Accordingly, the general field and the general conservation law together correspond to a large class of physics…

Parallel fictitious domain method for a non‐linear elliptic neumann boundary value problem

Parallelization of the algebraic fictitious domain method is considered for solving Neumann boundary value problems with variable coefficients. The resulting method is applied to the parallel solution of the subsonic full potential flow problem which is linearized by the Newton method. Good scalability of the method is demonstrated on a Cray T3E distributed memory parallel computer using MPI in communication. Copyright © 1999 John Wiley & Sons, Ltd.

A Memetic Differential Evolution in Filter Design for Defect Detection in Paper Production

This article proposes a Memetic Differential Evolution (MDE) for designing digital filters which aim at detecting defects of the paper produced during an industrial process. The MDE is an adaptive evolutionary algorithm which combines the powerful explorative features of Differential Evolution (DE) with the exploitative features of two local searchers. The local searchers are adaptively activated by means of a novel control parameter which measures fitness diversity within the population. Numerical results show that the DE framework is efficient for the class of problems under study and employment of exploitative local searchers is helpful in supporting the DE explorative mechanism in avoid…

Mass-flux-based outlet boundary conditions for the lattice Boltzmann method

We present outlet boundary conditions for the lattice Boltzmann method. These boundary conditions are constructed with a mass-flux-based approach. Conceptually, the mass-flux-based approach provides a mathematical framework from which specific boundary conditions can be derived by enforcing given physical conditions. The object here is, in particular, to explain the mass-flux-based approach. Furthermore, we illustrate, transparently, how boundary conditions can be derived from the emerging mathematical framework. For this purpose, we derive and present explicitly three outlet boundary conditions. By construction, these boundary conditions have an apparent physical interpretation which is fu…

Systematisation of Systems Solving Physics Boundary Value Problems

A general conservation law that defines a class of physical field theories is constructed. First, the notion of a general field is introduced as a formal sum of differential forms on a Minkowski manifold. By the action principle the conservation law is defined for such a general field. By construction, particular field notions of physics, e.g., magnetic flux, electric field strength, stress, strain etc. become instances of the general field. Hence, the differential equations that constitute physical field theories become also instances of the general conservation law. The general field and the general conservation law together correspond to a large class of relativistic hyperbolic physical …

Three-dimensional splitting dynamics of giant vortices in Bose-Einstein condensates

We study the splitting dynamics of giant vortices in dilute Bose-Einstein condensates by numerically integrating the three-dimensional Gross-Pitaevskii equation in time. By taking advantage of tetrahedral tiling in the spatial discretization, we decrease the error and increase the reliability of the numerical method. An extensive survey of vortex splitting symmetries is presented for different aspect ratios of the harmonic trapping potential. The symmetries of the splitting patterns observed in the simulated dynamics are found to be in good agreement with predictions obtained by solving the dominant dynamical instabilities from the corresponding Bogoliubov equations. Furthermore, we observe…

A New Augmented Lagrangian Approach for $L^1$-mean Curvature Image Denoising

Variational methods are commonly used to solve noise removal problems. In this paper, we present an augmented Lagrangian-based approach that uses a discrete form of the L1-norm of the mean curvature of the graph of the image as a regularizer, discretization being achieved via a finite element method. When a particular alternating direction method of multipliers is applied to the solution of the resulting saddle-point problem, this solution reduces to an iterative sequential solution of four subproblems. These subproblems are solved using Newton’s method, the conjugate gradient method, and a partial solution variant of the cyclic reduction method. The approach considered here differs from ex…

Laskennallinen tiede - tieteen kolmas menetelmä : tilannekatsaus 2011

Expert-based versus citation-based ranking of scholarly and scientific publication channels

Abstract The Finnish publication channel quality ranking system was established in 2010. The system is expert-based, where separate panels decide and update the rankings of a set of publications channels allocated to them. The aggregated rankings have a notable role in the allocation of public resources into universities. The purpose of this article is to analyze this national ranking system. The analysis is mainly based on two publicly available databases containing the publication source information and the actual national publication activity information. Using citation-based indicators and other available information with association rule mining, decision trees, and confusion matrices, …

Generalized wave propagation problems and discrete exterior calculus

We introduce a general class of second-order boundary value problems unifying application areas such as acoustics, electromagnetism, elastodynamics, quantum mechanics, and so on, into a single framework. This also enables us to solve wave propagation problems very efficiently with a single software system. The solution method precisely follows the conservation laws in finite-dimensional systems, whereas the constitutive relations are imposed approximately. We employ discrete exterior calculus for the spatial discretization, use natural crystal structures for three-dimensional meshing, and derive a “discrete Hodge” adapted to harmonic wave. The numerical experiments indicate that the cumulat…

A GPU-accelerated augmented Lagrangian based L1-mean curvature Image denoising algorithm implementation

This paper presents a graphics processing unit (GPU) implementation of a recently published augmented Lagrangian based L1-mean curvature image denoising algorithm. The algorithm uses a particular alternating direction method of multipliers to reduce the related saddle-point problem to an iterative sequence of four simpler minimization problems. Two of these subproblems do not contain the derivatives of the unknown variables and can therefore be solved point-wise without inter-process communication. Inparticular, this facilitates the efficient solution of the subproblem that deals with the non-convex term in the original objective function by modern GPUs. The two remaining subproblems are so…

Efficient Time Integration of Maxwell's Equations with Generalized Finite Differences

We consider the computationally efficient time integration of Maxwell’s equations using discrete exterior calculus (DEC) as the computational framework. With the theory of DEC, we associate the degrees of freedom of the electric and magnetic fields with primal and dual mesh structures, respectively. We concentrate on mesh constructions that imitate the geometry of the close packing in crystal lattices that is typical of elemental metals and intermetallic compounds. This class of computational grids has not been used previously in electromagnetics. For the simulation of wave propagation driven by time-harmonic source terms, we provide an optimized Hodge operator and a novel time discretizati…

Fitness diversity based adaptation in Multimeme Algorithms:A comparative study

This paper compares three different fitness diversity adaptations in multimeme algorithms (MmAs). These diversity indexes have been integrated within a MmA present in literature, namely fast adaptive memetic algorithm. Numerical results show that it is not possible to establish a superiority of one of these adaptive schemes over the others and choice of a proper adaptation must be made by considering features of the problem under study. More specifically, one of these adaptations outperforms the others in the presence of plateaus or limited range of variability in fitness values, another adaptation is more proper for landscapes having distant and strong basins of attraction, the third one, …

GPU-accelerated time integration of Gross-Pitaevskii equation with discrete exterior calculus

The quantized vortices in superfluids are modeled by the Gross-Pitaevskii equation whose numerical time integration is instrumental in the physics studies of such systems. In this paper, we present a reliable numerical method and its efficient GPU-accelerated implementation for the time integration of the three-dimensional Gross-Pitaevskii equation. The method is based on discrete exterior calculus which allows us the usage of more versatile spatial discretization than traditional finite difference and spectral methods are applicable to. We discretize the problem using six different natural crystal structures and observe the correct choices of spatial tiling to decrease the truncation error…

A parallel radix-4 block cyclic reduction algorithm

A conventional block cyclic reduction algorithm operates by halving the size of the linear system at each reduction step, that is, the algorithm is a radix-2 method. An algorithm analogous to the block cyclic reduction known as the radix-q partial solution variant of the cyclic reduction (PSCR) method allows the use of higher radix numbers and is thus more suitable for parallel architectures as it requires fever reduction steps. This paper presents an alternative and more intuitive way of deriving a radix-4 block cyclic reduction method for systems with a coefficient matrix of the form tridiag{ − I,D, − I}. This is performed by modifying an existing radix-2 block cyclic reduction method. Th…

Systematic derivation of partial differential equations for second order boundary value problems

Software systems designed to solve second order boundary value problems are typically restricted to hardwired lists of partial differential equations. In order to come up with more flexible systems, we introduce a systematic approach to find partial differential equations that result in eligible boundary value problems. This enables one to construct and combine one's own partial differential equations instead of choosing those from a pre-given list. This expands significantly end users possibilities to employ boundary value problems in modeling. To introduce the main ideas we employ differential geometry to examine the mathematical structure involved in second order boundary value problems …

An enhanced memetic differential evolution in filter design for defect detection in paper production.

This article proposes an Enhanced Memetic Differential Evolution (EMDE) for designing digital filters which aim at detecting defects of the paper produced during an industrial process. Defect detection is handled by means of two Gabor filters and their design is performed by the EMDE. The EMDE is a novel adaptive evolutionary algorithm which combines the powerful explorative features of Differential Evolution with the exploitative features of three local search algorithms employing different pivot rules and neighborhood generating functions. These local search algorithms are the Hooke Jeeves Algorithm, a Stochastic Local Search, and Simulated Annealing. The local search algorithms are adap…

Scalable Initialization Methods for Large-Scale Clustering

In this work, two new initialization methods for K-means clustering are proposed. Both proposals are based on applying a divide-and-conquer approach for the K-means|| type of an initialization strategy. The second proposal also utilizes multiple lower-dimensional subspaces produced by the random projection method for the initialization. The proposed methods are scalable and can be run in parallel, which make them suitable for initializing large-scale problems. In the experiments, comparison of the proposed methods to the K-means++ and K-means|| methods is conducted using an extensive set of reference and synthetic large-scale datasets. Concerning the latter, a novel high-dimensional cluster…

A parallel radix-4 block cyclic reduction algorithm

SUMMARY A conventional block cyclic reduction algorithm operates by halving the size of the linear system at each reduction step, that is, the algorithm is a radix-2 method. An algorithm analogous to the block cyclic reduction known as the radix-q partial solution variant of the cyclic reduction (PSCR) method allows the use of higher radix numbers and is thus more suitable for parallel architectures as it requires fever reduction steps. This paper presents an alternative and more intuitive way of deriving a radix-4 block cyclic reduction method for systems with a coefficient matrix of the form tridiag{ − I,D, − I}. This is performed by modifying an existing radix-2 block cyclic reduction me…

High-quality discretizations for microwave simulations

We apply high-quality discretizations to simulate electromagnetic microwaves. Instead of the vector field presentations, we focus on differential forms and discretize the model in the spatial domain using the discrete exterior calculus. At the discrete level, both the Hodge operators and the time discretization are optimized for time-harmonic simulations. Non-uniform spatial and temporal discretization are applied in problems in which the wavelength is highly-variable and geometry contains sub-wavelength structures. peerReviewed

Time-harmonic elasticity with controllability and higher-order discretization methods

The time-harmonic solution of the linear elastic wave equation is needed for a variety of applications. The typical procedure for solving the time-harmonic elastic wave equation leads to difficulties solving large-scale indefinite linear systems. To avoid these difficulties, we consider the original time dependent equation with a method based on an exact controllability formulation. The main idea of this approach is to find initial conditions such that after one time-period, the solution and its time derivative coincide with the initial conditions.The wave equation is discretized in the space domain with spectral elements. The degrees of freedom associated with the basis functions are situa…

On solving separable block tridiagonal linear systems using a GPU implementation of radix-4 PSCR method

Partial solution variant of the cyclic reduction (PSCR) method is a direct solver that can be applied to certain types of separable block tridiagonal linear systems. Such linear systems arise, e.g., from the Poisson and the Helmholtz equations discretized with bilinear finite-elements. Furthermore, the separability of the linear system entails that the discretization domain has to be rectangular and the discretization mesh orthogonal. A generalized graphics processing unit (GPU) implementation of the PSCR method is presented. The numerical results indicate up to 24-fold speedups when compared to an equivalent CPU implementation that utilizes a single CPU core. Attained floating point perfor…

Improving Scalable K-Means++

Two new initialization methods for K-means clustering are proposed. Both proposals are based on applying a divide-and-conquer approach for the K-means‖ type of an initialization strategy. The second proposal also uses multiple lower-dimensional subspaces produced by the random projection method for the initialization. The proposed methods are scalable and can be run in parallel, which make them suitable for initializing large-scale problems. In the experiments, comparison of the proposed methods to the K-means++ and K-means‖ methods is conducted using an extensive set of reference and synthetic large-scale datasets. Concerning the latter, a novel high-dimensional clustering data generation …

Fast Direct Solver for a Time-harmonic Electromagnetic Problem with an Application

A fast direct solution of a periodic problem derived from the time-harmonic Maxwell’s equations is considered. The problem is discretized by low order hexahedral finite elements proposed by Nedelec. The solver is based on the application of FFT, and it has the computational cost O(N log N). An application to scattering of an electromagnetic wave by a periodic structure is presented.

An efficient swap algorithm for the lattice Boltzmann method

During the last decade, the lattice-Boltzmann method (LBM) as a valuable tool in computational fluid dynamics has been increasingly acknowledged. The widespread application of LBM is partly due to the simplicity of its coding. The most well-known algorithms for the implementation of the standard lattice-Boltzmann equation (LBE) are the two-lattice and two-step algorithms. However, implementations of the two-lattice or the two-step algorithm suffer from high memory consumption or poor computational performance, respectively. Ultimately, the computing resources available decide which of the two disadvantages is more critical. Here we introduce a new algorithm, called the swap algorithm, for t…

Computation of generalized time-periodic waves using differential forms, exact controllability, least-squares formulation, conjugate gradient method and discrete exterior calculus Part 1, Theoretical considerations

Controllability method for the Helmholtz equation with higher-order discretizations

We consider a controllability technique for the numerical solution of the Helmholtz equation. The original time-harmonic equation is represented as an exact controllability problem for the time-dependent wave equation. This problem is then formulated as a least-squares optimization problem, which is solved by the conjugate gradient method. Such an approach was first suggested and developed in the 1990s by French researchers and we introduce some improvements to its practical realization. We use higher-order spectral elements for spatial discretization, which leads to high accuracy and lumped mass matrices. Higher-order approximation reduces the pollution effect associated with finite elemen…

HYPERBLEND: SIMULATING SPECTRAL REFLECTANCE AND TRANSMITTANCE OF LEAF TISSUE WITH BLENDER

Abstract. Remotely sensing vegetation condition and health hazards requires modeling the connection of plants’ biophysical and biochemical parameters to their spectral response. Even though many models exist already, the field suffers from lack of access to program code. In this study, we will assess the feasibility of open-source 3D-modeling and rendering software Blender in simulating hyperspectral reflectance and transmittance of leaf tissue to serve as a base for a more advanced large-scale simulator. This is the first phase of a larger HyperBlend project, which will provide a fully open-source, canopy scale leaf optical properties model for simulating remotely sensed hyperspectral imag…

Computation of a few smallest eigenvalues of elliptic operators using fast elliptic solvers

The computation of a few smallest eigenvalues of generalized algebraic eigenvalue problems is studied. The considered problems are obtained by discretizing self-adjoint second-order elliptic partial differential eigenvalue problems in two- or three-dimensional domains. The standard Lanczos algorithm with the complete orthogonalization is used to compute some eigenvalues of the inverted eigenvalue problem. Under suitable assumptions, the number of Lanczos iterations is shown to be independent of the problem size. The arising linear problems are solved using some standard fast elliptic solver. Numerical experiments demonstrate that the inverted problem is much easier to solve with the Lanczos…

Scalable robust clustering method for large and sparse data

Datasets for unsupervised clustering can be large and sparse, with significant portion of missing values. We present here a scalable version of a robust clustering method with the available data strategy. Moreprecisely, a general algorithm is described and the accuracy and scalability of a distributed implementation of the algorithm is tested. The obtained results allow us to conclude the viability of the proposed approach. peerReviewed

Fast Poisson solvers for graphics processing units

Two block cyclic reduction linear system solvers are considered and implemented using the OpenCL framework. The topics of interest include a simplified scalar cyclic reduction tridiagonal system solver and the impact of increasing the radix-number of the algorithm. Both implementations are tested for the Poisson problem in two and three dimensions, using a Nvidia GTX 580 series GPU and double precision floating-point arithmetic. The numerical results indicate up to 6-fold speed increase in the case of the two-dimensional problems and up to 3- fold speed increase in the case of the three-dimensional problems when compared to equivalent CPU implementations run on a Intel Core i7 quad-core CPU…

Numerical experiments with a parallel fast direct elliptic solver on Cray T3E

A parallel fast direct O(N log N) solver is shortly described for linear systems with separable block tridiagonal matrices. A good parallel scalability of the proposed method is demonstrated on a Cray T3E parallel computer using MPI in communication. Also, the sequential performance is compared with the well-known BLKTRI-implementation of the generalized. cyclic reduction method using a single processor of Cray T3E.

Evolution and decay of an Alice ring in a spinor Bose-Einstein condensate

We use first-principles-derived numerical simulations to investigate the long-time evolution of a half-quantum vortex ring, an Alice ring, arising from the decay dynamics of an isolated monopole in the polar phase of a dilute spin-1 Bose-Einstein condensate. In particular, we study the lifetime and decay characteristics of the Alice ring under different experimentally relevant conditions. We observe that, in a 87Rb condensate with a homogeneous external magnetic field, a well-centered Alice ring may survive for over 160 ms, and that during its lifetime it can contract back into a monopole, which again converts into an Alice ring. Interestingly, we notice an additional Alice ring, with an op…