Optimal Subspaces for n -Widths of Bounded Subsets in Hilbert Spaces

In this article, we consider the problem of proving the optimality of several approximation spaces by means of n-widths. Specifically, they are optimal subspaces for approximating bounded subsets in some Hilbert spaces with mesh-dependent norms. We prove that finite element spaces and newly developed generalized L-spline spaces are optimal subspaces for n-widths.     

Dual mixed finite element methods for the elasticity problem with Lagrange multipliers

We study a dual mixed formulation of the elasticity system in a polygonal domain of the plane with mixed boundary conditions and its numerical approximation. The (essential) Neumann boundary conditions (or traction boundary condition) are imposed using a discontinuous Lagrange multiplier corresponding to the trace of the displacement field. Moreover, a strain tensor is introduced as a new unknown and its symmetry is relaxed, also by the use of a Lagrange multiplier (the rotation). The singular behaviour of the solution requires us to use refined meshes to restore optimal rates of convergence. Uniform error estimates in the Lamé coefficient λ$\lambda$ are obtained for large λ$\lambda$. The hybridization of the problem is performed and numerical tests are presented confirming our theoretical results.     

On Existence and Weak Stability of Matrix Refinable Functions

We consider the existence of distributional (or L ₂ ) solutions of the matrix refinement equation where P is an r×r matrix with trigonometric polynomial entries. One of the main results of this paper is that the above matrix refinement equation has a compactly supported distributional solution if and only if the matrix P (0) has an eigenvalue of the form 2 ⁿ , . A characterization of the existence of L ₂ -solutions of the above matrix refinement equation in terms of the mask is also given. A concept of L ₂ -weak stability of a (finite) sequence of function vectors is introduced. In the case when the function vectors are solutions of a matrix refinement equation, we characterize this weak stability in terms of the mask. August 1, 1996. Date revised: July 28, 1997. Date accepted: August 12, 1997.     

Adaptive finite element analysis of structures under transient dynamic loading using modal superposition

In this paper, the error estimation and adaptive strategy developed for the linear elastodynamic problem under transient dynamic loading based on the Z–Z criterion is utilized for 2D and plate bending problems. An automatic mesh generator based on “growth meshing” is utilized effectively for adaptive mesh refinement. Optimal meshes are obtained iteratively corresponding to the prescribed domain discretization error limit and for a chosen number of basis modes satisfying modal truncation errors. Numerous examples show the effectiveness of the integrated approach in achieving the target accuracy in finite element transient dynamic analysis.     

Adjoint-based h–p adaptive discontinuous Galerkin methods for the 2D compressible Euler equations

In this paper, we investigate and present an adaptive Discontinuous Galerkin algorithm driven by an adjoint-based error estimation technique for the inviscid compressible Euler equations. This approach requires the numerical approximations for the flow (i.e. primal) problem and the adjoint (i.e. dual) problem which corresponds to a particular simulation objective output of interest. The convergence of these two problems is accelerated by an hp-multigrid solver which makes use of an element Gauss–Seidel smoother on each level of the multigrid sequence. The error estimation of the output functional results in a spatial error distribution, which is used to drive an adaptive refinement strategy, which may include local mesh subdivision (h-refinement), local modification of discretization orders (p-enrichment) and the combination of both approaches known as hp-refinement. The selection between h- and p-refinement in the hp-adaptation approach is made based on a smoothness indicator applied to the most recently available flow solution values. Numerical results for the inviscid compressible flow over an idealized four-element airfoil geometry demonstrate that both pure h-refinement and pure p-enrichment algorithms achieve equivalent error reductions at each adaptation cycle compared to a uniform refinement approach, but requiring fewer degrees of freedom. The proposed hp-adaptive refinement strategy is capable of obtaining exponential error convergence in terms of degrees of freedom, and results in significant savings in computational cost. A high-speed flow test case is used to demonstrate the ability of the hp-refinement approach for capturing strong shocks or discontinuities while improving functional accuracy.     

Antibandwidth and cyclic antibandwidth of meshes and hypercubes

The antibandwidth problem consists of placing the vertices of a graph on a line in consecutive integer points in such a way that the minimum difference of adjacent vertices is maximised. The problem was originally introduced in [J.Y.-T. Leung, O. Vornberger, J.D. Witthoff, On some variants of the bandwidth minimisation problem, SIAM Journal of Computing 13 (1984) 650-667] in connection with the multiprocessor scheduling problems and can also be understood as a dual problem to the well-known bandwidth problem, as a special radiocolouring problem or as a variant of obnoxious facility location problems. The antibandwidth problem is NP-hard, there are a few classes of graphs with polynomial time complexities. Exact results for nontrivial graphs are very rare. Miller and Pritikin [Z. Miller, D. Pritikin, On the separation number of a graph, Networks 19 (1989) 651-666] showed tight bounds for the two-dimensional meshes and hypercubes. We solve the antibandwidth problem precisely for two-dimensional meshes, tori and estimate the antibandwidth value for hypercubes up to the third-order term. The cyclic antibandwidth problem is to embed an n-vertex graph into the cycle C_n, such that the minimum distance (measured in the cycle) of adjacent vertices is maximised. This is a natural extension of the antibandwidth problem or a dual problem to the cyclic bandwidth problem. We start investigating this invariant for typical graphs and prove basic facts and exact results for the same product graphs as for the antibandwidth.     

A variational characterisation of spherical designs

In this paper we first establish a new variational characterisation of spherical designs: it is shown that a set , where , is a spherical L-design if and only if a certain non-negative quantity A_L,N(X_N) vanishes. By combining this result with a known “sampling theorem” for the sphere, we obtain the main result, which is that if is a stationary point set of A_L,N whose “mesh norm” satisfies h_XN<1/(L+1), then X_N is a spherical L-design. The latter result seems to open a pathway to the elusive problem of proving (for fixed d) the existence of a spherical L-design with a number of points N of order (L+1)^d. A numerical example with d=2 and L=19 suggests that computational minimisation of A_L,N can be a valuable tool for the discovery of new spherical designs for moderate and large values of L.     

An Adaptive Mesh Rezoning for FSI Problems

In the problems of fluid-structure interaction (FSI) the mesh updating scheme plays a key role. We have developed an adaptive mesh rezoning technique which is applicable to the three-dimensional FSI problems. In order to prevent the inversion of elements in the mesh and to maintain a well-conditioned shape for successive time-step calculations, we introduce constrained conditions of dilatational strain in the least-square form as well as the gradient of displacement vectors, in relatively small elements. By the present mesh rezoning technique, even under the large deformation of boundaries concerned, we can reduce the use of the process of mesh generation and switching of nodal values at the interboundary of time slabs. These steps require rather significant CPU time and induced projection errors of nodal values from the previous mesh to the current one. The case of collapsing tube problems shows the remarkable potential of our method. The present method is entirely general in that it can be applied to structured and unstructured meshes, effectively.     

Effects of grid size on predictions of bed expansion in bubbling fluidized beds of Geldart B particles: A generalized rule for a grid-independent solution of TFM simulations

Numerical simulations of gas–solid fluidized beds based on the kinetic theory of granular flow exhibit a significant dependence on domain discretization. Bubble formation, bubble size and shape all vary greatly with the discretization, and the use of an inappropriate scale resolution leads to inaccurate predictions of fluidization hydrodynamics. In this study, grid-independent solutions of the two fluid model were examined by comparing the bed expansions obtained from numerical simulations with experimental results and empirical predictions, based on bubbling fluidized beds of Geldart B particles. Grid independence was achieved with a grid resolution equal to 18 times the particle diameter. The simulation results were compared with previously published data for verification purposes. The results of this work should provide a guideline for choosing the appropriate grid size and thereby minimize the time and expense associated with large simulations.