scholarly journals High-Order AFEM for the Laplace–Beltrami Operator: Convergence Rates

2016 ◽  
Vol 16 (6) ◽  
pp. 1473-1539 ◽  
Author(s):  
Andrea Bonito ◽  
J. Manuel Cascón ◽  
Khamron Mekchay ◽  
Pedro Morin ◽  
Ricardo H. Nochetto
2014 ◽  
Vol 24 (08) ◽  
pp. 1495-1539 ◽  
Author(s):  
Francesco Bassi ◽  
Lorenzo Botti ◽  
Alessandro Colombo

In this work we consider agglomeration-based physical frame discontinuous Galerkin (dG) discretization as an effective way to increase the flexibility of high-order finite element methods. The mesh free concept is pursued in the following (broad) sense: the computational domain is still discretized using a mesh but the computational grid should not be a constraint for the finite element discretization. In particular the discrete space choice, its convergence properties, and even the complexity of solving the global system of equations resulting from the dG discretization should not be influenced by the grid choice. Physical frame dG discretization allows to obtain mesh-independent h-convergence rates. Thanks to mesh agglomeration, high-order accurate discretizations can be performed on arbitrarily coarse grids, without resorting to very high-order approximations of domain boundaries. Agglomeration-based h-multigrid techniques are the obvious choice to obtain fast and grid-independent solvers. These features (attractive for any mesh free discretization) are demonstrated in practice with numerical test cases.


Author(s):  
Yuxin Ding

Traditional Hopfield networking has been widely used to solve combinatorial optimization problems. However, high order Hopfiled networks, as an expansion of traditional Hopfield networks, are seldom used to solve combinatorial optimization problems. In theory, compared with low order networks, high order networks have better properties, such as stronger approximations and faster convergence rates. In this chapter, the authors focus on how to use high order networks to model combinatorial optimization problems. Firstly, the high order discrete Hopfield Network is introduced, then the authors discuss how to find the high order inputs of a neuron. Finally, the construction method of energy function and the neural computing algorithm are presented. In this chapter, the N queens problem and the crossbar switch problem, which are NP-complete problems, are used as examples to illustrate how to model practical problems using high order neural networks. The authors also discuss the performance of high order networks for modeling the two combinatorial optimization problems.


Author(s):  
Erik Burman ◽  
Guillaume Delay ◽  
Alexandre Ern

Abstract We design and analyze a hybrid high-order method on unfitted meshes to approximate the Stokes interface problem. The interface can cut through the mesh cells in a very general fashion. A cell-agglomeration procedure prevents the appearance of small cut cells. Our main results are inf-sup stability and a priori error estimates with optimal convergence rates in the energy norm. Numerical simulations corroborate these results.


2009 ◽  
Vol 146 (1) ◽  
pp. 225-256 ◽  
Author(s):  
PETER HALL ◽  
MOHAMMAD HOSSEINI–NASAB

AbstractFunctional data analysis, or FDA, is a relatively new and rapidly growing area of statistics. A substantial part of the interest in the field derives from new types of data that are generated through the application of new technologies. Statistical methodologies, such as linear regression, which are effectively finite-dimensional in conventional statistical settings, become infinite-dimensional in the context of functional data. As a result, the convergence rates of estimators based on functional data can be relatively slow, and so there is substantial interest in methods for dimension reduction, such as principal components analysis (PCA). However, although the statistical development of PCA for FDA has been underway for approximately two decades, relatively high-order theoretical arguments have been largely absent. This makes it difficult to assess the impact that, for example, eigenvalue spacings have on properties of eigenvalue estimators, or to develop concise first-order limit theory for linear functional regression. This paper shows how to overcome these hurdles. It develops rigorous arguments that underpin stochastic expansions of estimators of eigenvalues and eigenfunctions, and shows how to use them to answer statistical questions. The theory is based on arguments from operator theory, made more challenging by the requirement of statisticians that closeness of functions be measured in theL∞, rather thanL2, metric. The statistical implications of the properties we develop have been discussed elsewhere, but the theoretical arguments that lie behind them have not been presented before.


2015 ◽  
Vol 143 (7) ◽  
pp. 2937-2954 ◽  
Author(s):  
Kiran K. Katta ◽  
Ramachandran D. Nair ◽  
Vinod Kumar

Abstract This paper presents two finite-volume (FV) schemes for solving linear transport problems on the cubed-sphere grid system. The schemes are based on the central-upwind finite-volume (CUFV) method, which is a class of Godunov-type method for solving hyperbolic conservation laws, and combines the attractive features of the classical upwind and central FV methods. One of the CUFV schemes is based on a dimension-by-dimension approach and employs a fifth-order one-dimensional (1D) Weighted Essentially Nonoscillatory (WENO5) reconstruction method. The other scheme employs a fully two-dimensional (2D) fourth-order accurate reconstruction method. The cubed-sphere grid system imposes several computational challenges due to its patched-domain topology and nonorthogonal curvilinear grid structure. A high-order 1D interpolation procedure combining cubic and quadratic interpolations is developed for the FV schemes to handle the discontinuous edges of the cubed-sphere grid. The WENO5 scheme is compared against the fourth-order Kurganov–Levy (KL) scheme formulated in the CUFV framework. The performance of the schemes is compared using several benchmark problems such as the solid-body rotation and deformational-flow tests, and empirical convergence rates are reported. In addition, a bound-preserving filter combined with an optional positivity-preserving filter is tested for nonsmooth problems. The filtering techniques considered are local, inexpensive, and effective. A fourth-order strong stability preserving explicit Runge–Kutta time-stepping scheme is used for integration. The results show that schemes are competitive to other published FV schemes in the same category.


SPE Journal ◽  
2019 ◽  
Vol 24 (06) ◽  
pp. 2946-2967 ◽  
Author(s):  
Savithru Jayasinghe ◽  
David L. Darmofal ◽  
Eric Dow ◽  
Marshall C. Galbraith ◽  
Steven R. Allmaras

Summary In this paper, we present a new well model for reservoir simulation. The proposed well model relates the volumetric flow rate and the bottomhole pressure (BHP) of the well to the reservoir pressure through a spatially distributed source term that is independent of the numerical method and the discrete mesh used to solve the flow problem. This is in contrast to the widely used Peaceman–type well models, which are inherently tied to a particular numerical discretization by the definition of an equivalent well radius. The proposed distributed well model does not require the calculation of an equivalent well radius. Hence, it can be readily applied to finite–difference, finite–volume (FV), or finite–element discretizations on arbitrarily unstructured meshes, which also makes it an attractive option for mesh–adaptation schemes. The new well model is demonstrated on a steady-state single-phase flow problem and an unsteady two-phase flow problem, using a conventional FV method and a high–order discontinuous Galerkin (DG) method. The distributed well model produces error–convergence behaviors that are very similar to the Peaceman well model on uniform structured meshes, but its applicability to high–order discretizations and mesh–adaptation schemes allows for higher convergence rates and more cost-efficient solutions, especially on adapted unstructured meshes.


2009 ◽  
Vol 2009 ◽  
pp. 1-23 ◽  
Author(s):  
Don Liu ◽  
Weijia Kuang ◽  
Andrew Tangborn

A series of compact implicit schemes of fourth and sixth orders are developed for solving differential equations involved in geodynamics simulations. Three illustrative examples are described to demonstrate that high-order convergence rates are achieved while good efficiency in terms of fewer grid points is maintained. This study shows that high-order compact implicit difference methods provide high flexibility and good convergence in solving some special differential equations on nonuniform grids.


Author(s):  
Carsten Carstensen ◽  
Alexandre Ern ◽  
Sophie Puttkammer

AbstractThis paper introduces a novel hybrid high-order (HHO) method to approximate the eigenvalues of a symmetric compact differential operator. The HHO method combines two gradient reconstruction operators by means of a parameter $$0<\alpha <~1$$ 0 < α < 1 and introduces a novel cell-based stabilization operator weighted by a parameter $$0<\beta <\infty $$ 0 < β < ∞ . Sufficient conditions on the parameters $$\alpha $$ α and $$\beta $$ β are identified leading to a guaranteed lower bound property for the discrete eigenvalues. Moreover optimal convergence rates are established. Numerical studies for the Dirichlet eigenvalue problem of the Laplacian provide evidence for the superiority of the new lower eigenvalue bounds compared to previously available bounds.


Sign in / Sign up

Export Citation Format

Share Document