Read by QxMD icon Read

Numerische Mathematik

Astrid S Pechstein, Joachim Schöberl
The tangential-displacement normal-normal-stress (TDNNS) method is a finite element method for mixed elasticity. As the name suggests, the tangential component of the displacement vector as well as the normal-normal component of the stress are the degrees of freedom of the finite elements. The TDNNS method was shown to converge of optimal order, and to be robust with respect to shear and volume locking. However, the method is slightly nonconforming, and an analysis with respect to the natural norms of the arising spaces was still missing...
2018: Numerische Mathematik
Anton Arnold, Claudia Negulescu
This paper is concerned with a 1D Schrödinger scattering problem involving both oscillatory and evanescent regimes, separated by jump discontinuities in the potential function, to avoid "turning points". We derive a non-overlapping domain decomposition method to split the original problem into sub-problems on these regions, both for the continuous and afterwards for the discrete problem. Further, a hybrid WKB-based numerical method is designed for its efficient and accurate solution in the semi-classical limit: a WKB-marching method for the oscillatory regions and a FEM with WKB-basis functions in the evanescent regions...
2018: Numerische Mathematik
John W Pearson, Jennifer Pestana, David J Silvester
This paper is concerned with the implementation of efficient solution algorithms for elliptic problems with constraints. We establish theory which shows that including a simple scaling within well-established block diagonal preconditioners for Stokes problems can result in significantly faster convergence when applying the preconditioned MINRES method. The codes used in the numerical studies are available online.
2018: Numerische Mathematik
Peter Benner, Zvonimir Bujanović, Patrick Kürschner, Jens Saak
This paper introduces a new algorithm for solving large-scale continuous-time algebraic Riccati equations (CARE). The advantage of the new algorithm is in its immediate and efficient low-rank formulation, which is a generalization of the Cholesky-factored variant of the Lyapunov ADI method. We discuss important implementation aspects of the algorithm, such as reducing the use of complex arithmetic and shift selection strategies. We show that there is a very tight relation between the new algorithm and three other algorithms for CARE previously known in the literature-all of these seemingly different methods in fact produce exactly the same iterates when used with the same parameters: they are algorithmically different descriptions of the same approximation sequence to the Riccati solution...
2018: Numerische Mathematik
Gunther Leobacher, Michaela Szölgyenyi
We prove strong convergence of order [Formula: see text] for arbitrarily small [Formula: see text] of the Euler-Maruyama method for multidimensional stochastic differential equations (SDEs) with discontinuous drift and degenerate diffusion coefficient. The proof is based on estimating the difference between the Euler-Maruyama scheme and another numerical method, which is constructed by applying the Euler-Maruyama scheme to a transformation of the SDE we aim to solve.
2018: Numerische Mathematik
Axel Målqvist, Anna Persson
We use the local orthogonal decomposition technique introduced in Målqvist and Peterseim (Math Comput 83(290):2583-2603, 2014) to derive a generalized finite element method for linear and semilinear parabolic equations with spatial multiscale coefficients. We consider nonsmooth initial data and a backward Euler scheme for the temporal discretization. Optimal order convergence rate, depending only on the contrast, but not on the variations of the coefficients, is proven in the [Formula: see text]-norm. We present numerical examples, which confirm our theoretical findings...
2018: Numerische Mathematik
Bangti Jin, Buyang Li, Zhi Zhou
In this work, we establish the maximal [Formula: see text]-regularity for several time stepping schemes for a fractional evolution model, which involves a fractional derivative of order [Formula: see text], [Formula: see text], in time. These schemes include convolution quadratures generated by backward Euler method and second-order backward difference formula, the L1 scheme, explicit Euler method and a fractional variant of the Crank-Nicolson method. The main tools for the analysis include operator-valued Fourier multiplier theorem due to Weis (Math Ann 319:735-758, 2001...
2018: Numerische Mathematik
John W Pearson, Jacek Gondzio
Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability. In this paper, we consider PDE-constrained optimization problems with bound constraints on the state and control variables, and their representation on the discrete level as quadratic programming problems. To tackle complex problems and achieve high accuracy in the solution, one is required to solve matrix systems of huge scale resulting from Newton iteration, and hence fast and robust methods for these systems are required...
2017: Numerische Mathematik
Andrea Cangiani, Emmanuil H Georgoulis, Tristan Pryer, Oliver J Sutton
An posteriori error analysis for the virtual element method (VEM) applied to general elliptic problems is presented. The resulting error estimator is of residual-type and applies on very general polygonal/polyhedral meshes. The estimator is fully computable as it relies only on quantities available from the VEM solution, namely its degrees of freedom and element-wise polynomial projection. Upper and lower bounds of the error estimator with respect to the VEM approximation error are proven. The error estimator is used to drive adaptive mesh refinement in a number of test problems...
2017: Numerische Mathematik
Markus Bause, Florin A Radu, Uwe Köcher
Variational time discretization schemes are getting of increasing importance for the accurate numerical approximation of transient phenomena. The applicability and value of mixed finite element methods in space for simulating transport processes have been demonstrated in a wide class of works. We consider a family of continuous Galerkin-Petrov time discretization schemes that is combined with a mixed finite element approximation of the spatial variables. The existence and uniqueness of the semidiscrete approximation and of the fully discrete solution are established...
2017: Numerische Mathematik
Astrid S Pechstein, Joachim Schöberl
A new family of locking-free finite elements for shear deformable Reissner-Mindlin plates is presented. The elements are based on the "tangential-displacement normal-normal-stress" formulation of elasticity. In this formulation, the bending moments are treated as separate unknowns. The degrees of freedom for the plate element are the nodal values of the deflection, tangential components of the rotations and normal-normal components of the bending strain. Contrary to other plate bending elements, no special treatment for the shear term such as reduced integration is necessary...
2017: Numerische Mathematik
Michael Feischl, Gregor Gantner, Alexander Haberl, Dirk Praetorius
In a recent work (Feischl et al. in Eng Anal Bound Elem 62:141-153, 2016), we analyzed a weighted-residual error estimator for isogeometric boundary element methods in 2D and proposed an adaptive algorithm which steers the local mesh-refinement of the underlying partition as well as the multiplicity of the knots. In the present work, we give a mathematical proof that this algorithm leads to convergence even with optimal algebraic rates. Technical contributions include a novel mesh-size function which also monitors the knot multiplicity as well as inverse estimates for NURBS in fractional-order Sobolev norms...
2017: Numerische Mathematik
Xiong Meng, Jennifer K Ryan
In this paper, an analysis of the accuracy-enhancement for the discontinuous Galerkin (DG) method applied to one-dimensional scalar nonlinear hyperbolic conservation laws is carried out. This requires analyzing the divided difference of the errors for the DG solution. We therefore first prove that the [Formula: see text]-th order [Formula: see text] divided difference of the DG error in the [Formula: see text] norm is of order [Formula: see text] when upwind fluxes are used, under the condition that [Formula: see text] possesses a uniform positive lower bound...
2017: Numerische Mathematik
Philipp Grohs, Markus Sprecher, Thomas Yu
We consider the problem of approximating a function f from an Euclidean domain to a manifold M by scattered samples [Formula: see text], where the data sites [Formula: see text] are assumed to be locally close but can otherwise be far apart points scattered throughout the domain. We introduce a natural approximant based on combining the moving least square method and the Karcher mean. We prove that the proposed approximant inherits the accuracy order and the smoothness from its linear counterpart. The analysis also tells us that the use of Karcher's mean (dependent on a Riemannian metric and the associated exponential map) is inessential and one can replace it by a more general notion of 'center of mass' based on a general retraction on the manifold...
2017: Numerische Mathematik
G R Barrenechea, L Boulton, N Boussaïd
We examine the equivalence between an extension of the Lehmann-Maehly-Goerisch method developed a few years ago by Zimmermann and Mertins, and a geometrically motivated method developed more recently by Davies and Plum. We establish a general framework which allows sharpening various previously known results in these two settings and determine explicit convergence estimates for both methods. We demonstrate the applicability of the method of Zimmermann and Mertins by means of numerical tests on the resonant cavity problem...
2017: Numerische Mathematik
Wolfgang Hackbusch, André Uschmajew
A higher-order tensor allows several possible matricizations (reshapes into matrices). The simultaneous decay of singular values of such matricizations has crucial implications on the low-rank approximability of the tensor via higher-order singular value decomposition. It is therefore an interesting question which simultaneous properties the singular values of different tensor matricizations actually can have, but it has not received the deserved attention so far. In this paper, preliminary investigations in this direction are conducted...
2017: Numerische Mathematik
M Charina, C Conti, N Guglielmi, V Protasov
In this paper, we study scalar multivariate non-stationary subdivision schemes with integer dilation matrix M and present a unifying, general approach for checking their convergence and for determining their Hölder regularity (latter in the case [Formula: see text]). The combination of the concepts of asymptotic similarity and approximate sum rules allows us to link stationary and non-stationary settings and to employ recent advances in methods for exact computation of the joint spectral radius. As an application, we prove a recent conjecture by Dyn et al...
2017: Numerische Mathematik
Gabriel R Barrenechea, Erik Burman, Fotini Karakatsani
For the case of approximation of convection-diffusion equations using piecewise affine continuous finite elements a new edge-based nonlinear diffusion operator is proposed that makes the scheme satisfy a discrete maximum principle. The diffusion operator is shown to be Lipschitz continuous and linearity preserving. Using these properties we provide a full stability and error analysis, which, in the diffusion dominated regime, shows existence, uniqueness and optimal convergence. Then the algebraic flux correction method is recalled and we show that the present method can be interpreted as an algebraic flux correction method for a particular definition of the flux limiters...
2017: Numerische Mathematik
Marta M Betcke, Heinrich Voss
In this work we present a new restart technique for iterative projection methods for nonlinear eigenvalue problems admitting minmax characterization of their eigenvalues. Our technique makes use of the minmax induced local enumeration of the eigenvalues in the inner iteration. In contrast to global numbering which requires including all the previously computed eigenvectors in the search subspace, the proposed local numbering only requires a presence of one eigenvector in the search subspace. This effectively eliminates the search subspace growth and therewith the super-linear increase of the computational costs if a large number of eigenvalues or eigenvalues in the interior of the spectrum are to be computed...
2017: Numerische Mathematik
Claudia Wulff, Chris Evans
We study semilinear evolution equations [Formula: see text] posed on a Hilbert space [Formula: see text], where A is normal and generates a strongly continuous semigroup, B is a smooth nonlinearity from [Formula: see text] to itself, and [Formula: see text], [Formula: see text], [Formula: see text]. In particular the one-dimensional semilinear wave equation and nonlinear Schrödinger equation with periodic, Neumann and Dirichlet boundary conditions fit into this framework. We discretize the evolution equation with an A-stable Runge-Kutta method in time, retaining continuous space, and prove convergence of order [Formula: see text] for non-smooth initial data [Formula: see text], where [Formula: see text], for a method of classical order p, extending a result by Brenner and Thomée for linear systems...
2016: Numerische Mathematik
Fetch more papers »
Fetching more papers... Fetching...
Read by QxMD. Sign in or create an account to discover new knowledge that matter to you.
Remove bar
Read by QxMD icon Read

Search Tips

Use Boolean operators: AND/OR

diabetic AND foot
diabetes OR diabetic

Exclude a word using the 'minus' sign

Virchow -triad

Use Parentheses

water AND (cup OR glass)

Add an asterisk (*) at end of a word to include word stems

Neuro* will search for Neurology, Neuroscientist, Neurological, and so on

Use quotes to search for an exact phrase

"primary prevention of cancer"
(heart or cardiac or cardio*) AND arrest -"American Heart Association"