We explain four variants of an adaptive finite element method with cubic splines and compare their performance in simple elliptic model problems. The methods in comparison are Truncated Hierarchical B-splines with two different refinement strategies, T-splines with the refinement strategy introduced by Scott et al. in 2012, and T-splines with an alternative refinement strategy introduced by some of the authors. In four examples, including singular and non-singular problems of linear elasticity and the Poisson problem, the H1-errors of the discrete solutions, the number of degrees of freedom as well as sparsity patterns and condition numbers of the discretized problem are compared. The quantitative results of this paper can help the reader to choose the most appropriate refinement method for the application.

After a decade of extensive study of the sparse representation synthesis model, we can safely say that this is a mature and stable field, with clear theoretical foundations, and appealing applications. Alongside this approach, there is an counterpart model, which, despite its similarity to the synthesis alternative, is markedly different. Surprisingly, the analysis model did not get a similar attention, and its understanding today is shallow and partial. In this paper we take a closer look at the analysis approach, better define it as a generative model for signals, and contrast it with the synthesis one. This work proposes effective pursuit methods that aim to solve inverse problems regularized with the analysis-model prior, accompanied by a preliminary theoretical study of their performance. We demonstrate the effectiveness of the analysis model in several experiments, and provide a detailed study of the model associated with the 2D finite difference analysis operator, a close cousin of the TV norm.

Multifractal analysis has become a standard signal processing tool, for which a promising new formulation, the pleader multifractal formalism, has recently been proposed. It relies on novel multiscale quantities, the p-leaders, defined as local ℓ p norms of sets of wavelet coefficients located at infinitely many fine scales. Computing such infinite sums from actual finite-resolution data requires truncations to the finest available scale, which results in biased p-leaders and thus in inaccurate estimates of multifractal properties. A systematic study of such finite-resolution effects leads to conjecture an explicit and universal closed-form correction that permits an accurate estimation of scaling exponents. This conjecture is formulated from the theoretical study of a particular class of models for multifractal processes, the wavelet-based cascades. The relevance and generality of the proposed conjecture is assessed by numerical simulations conducted over a large variety of multifractal processes. Finally, the relevance of the proposed corrected estimators is demonstrated on the analysis of heart rate variability data.

Alfvén-like operators are of interest in magnetohydrodynamics, which is used in plasma physics to study the macroscopic behavior of plasma. Motivated by this important and complex application, we focus on a parameter-dependent curl–div problem that can be seen as a prototype of an Alfvén-like operator, and we discretize it using isogeometric analysis based on tensor-product B-splines. The involved coefficient matrices can be very ill-conditioned, so that standard numerical solution methods perform quite poorly here. In order to overcome the difficulties caused by such ill-conditioning, a two-step strategy is proposed. First, we conduct a detailed spectral study of the coefficient matrices, highlighting the critical dependence on the different physical and approximation parameters. Second, we exploit such spectral information to design fast iterative solvers for the corresponding linear systems. For the first goal we apply the theory of (multilevel block) Toeplitz and generalized locally Toeplitz sequences, while for the second we use a combination of multigrid techniques and preconditioned Krylov solvers. Several numerical tests are provided both for the study of the spectral problem and for the solution of the corresponding linear systems.

Isogeometric analysis (IGA) represents a recently developed technology in computational mechanics that offers the possibility of integrating methods for analysis and Computer Aided Design (CAD) into a single, unified process. The implications to practical engineering design scenarios are profound, since the time taken from design to analysis is greatly reduced, leading to dramatic gains in efficiency. In this manuscript, through a self-contained Matlab implementation, we present an introduction to IGA applied to simple analysis problems and the related computer implementation aspects. Furthermore, implementation of the extended IGA which incorporates enrichment functions through the partition of unity method (PUM) is also presented, where several examples for both two-dimensional and three-dimensional fracture are illustrated. We also describe the use of IGA in the context of strong-form (collocation) formulations, which has been an area of research interest due to the potential for significant efficiency gains offered by these methods. The code which accompanies the present paper can be applied to one, two and three-dimensional problems for linear elasticity, linear elastic fracture mechanics, structural mechanics (beams/plates/shells including large displacements and rotations) and Poisson problems with or without enrichment. The Bézier extraction concept that allows the FE analysis to be performed efficiently on T-spline geometries is also incorporated. The article includes a summary of recent trends and developments within the field of IGA.

Upper bound limit analysis allows one to evaluate directly the ultimate load of structures without performing a cumbersome incremental analysis. In order to numerically apply this method to thin plates in bending, several authors have proposed to use various finite elements discretizations. We provide in this paper a mathematical analysis which ensures the convergence of the finite element method, even with finite elements with discontinuous derivatives such as the quadratic 6 node Lagrange triangles and the cubic :Reunite triangles. More precisely, we prove the F -convergence of the discretized problems towards the continuous limit analysis problem. Numerical results illustrate the relevance of this analysis for the yield design of both homogeneous and non -homogeneous materials.

We introduce the dispersion-minimized mass for isogeometric analysis to approximate the structural vibration, which we model as a second-order differential eigenvalue problem. The dispersion-minimized mass reduces the eigenvalue error significantly, from the optimum order of to the superconvergence order of for the th order isogeometric elements with maximum continuity, which in return leads to a more accurate method. We first establish the dispersion error, where the leading error term is explicitly written in terms of the stiffness and mass entries, for arbitrary polynomial order isogeometric elements. We derive the dispersion-minimized mass in one dimension by solving a -dimensional local matrix problem for the th order approximation and then extend it to multiple dimensions on tensor-product grids. We show that the dispersion-minimized mass can also be obtained by approximating the mass matrix using optimally-blended quadratures. We generalize the lower order quadrature-blending results to arbitrary polynomial order isogeometric approximations as well as to arbitrary quadrature rules. Various numerical examples validate the eigenvalue and eigenfunction error estimates.

Isogeometric analysis is a recently developed framework based on finite element analysis, where the simple building blocks in geometry and solution space are replaced by more complex and geometrically-oriented compounds. Box splines are an established tool to model complex geometry, and form an intermediate approach between classical tensor-product B-splines and splines over triangulations. Local refinement can be achieved by considering hierarchically nested sequences of box spline spaces. Since box splines do not offer special elements to impose boundary conditions for the numerical solution of partial differential equations (PDEs), we discuss a weak treatment of such boundary conditions. Along the domain boundary, an appropriate domain strip is introduced to enforce the boundary conditions in a weak sense. The thickness of the strip is adaptively defined in order to avoid unnecessary computations. Numerical examples show the optimal convergence rate of box splines and their hierarchical variants for the solution of PDEs.

We study the Rayleigh–Stokes problem for a generalized second-grade fluid which involves a Riemann–Liouville fractional derivative in time, and present an analysis of the problem in the continuous, space semidiscrete and fully discrete formulations. We establish the Sobolev regularity of the homogeneous problem for both smooth and nonsmooth initial data $$v$$ v , including $$v\in L^2(\Omega )$$ v ∈ L 2 ( Ω ) . A space semidiscrete Galerkin scheme using continuous piecewise linear finite elements is developed, and optimal with respect to initial data regularity error estimates for the finite element approximations are derived. Further, two fully discrete schemes based on the backward Euler method and second-order backward difference method and the related convolution quadrature are developed, and optimal error estimates are derived for the fully discrete approximations for both smooth and nonsmooth initial data. Numerical results for one- and two-dimensional examples with smooth and nonsmooth initial data are presented to illustrate the efficiency of the method, and to verify the convergence theory.

In this article the error estimation of the moving least squares approximation is provided for functions in fractional order Sobolev spaces. The analysis presented in this paper extends the previous estimations and explains some unnoticed mathematical details. An application to Galerkin method for partial differential equations is also supplied.