Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userError analysis of forced discrete mechanical systems
178
0
0.0
(
0
)
Added by
Javier Fernandez
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The purpose of this paper is to perform an error analysis of the variational integrators of mechanical systems subject to external forcing. Essentially, we prove that when a discretization of contact order $r$ of the Lagrangian and force are used, the integrator has the same contact order. Our analysis is performed first for discrete forced mechanical systems defined over $TQ$, where we study the existence of flows, the construction and properties of discrete exact systems and the contact order of the flows (variational integrators) in terms of the contact order of the original systems. Then we use those results to derive the corresponding analysis for the analogous forced systems defined over $Qtimes Q$.
rate research
Read More
This paper analyzes the generalization error of two-layer neural networks for computing the ground state of the Schrodinger operator on a $d$-dimensional hypercube. We prove that the convergence rate of the generalization error is independent of the dimension $d$, under the a priori assumption that the ground state lies in a spectral Barron space. We verify such assumption by proving a new regularity estimate for the ground state in the spectral Barron space. The later is achieved by a fixed point argument based on the Krein-Rutman theorem.
We consider a fully discrete loosely coupled scheme for incompressible fluid-structure interaction based on the time semi-discrete splitting method introduced in {emph{[Burman, Durst & Guzman, arXiv:1911.06760]}}. The splittling method uses a Robin-Robin type coupling that allows for a segregated solution of the solid and the fluid systems, without inner iterations. For the discretisation in space we consider piecewise affine continuous finite elements for all the fields and ensure the inf-sup condition by using a Brezzi-Pitkaranta type pressure stabilization. The interfacial fluid-stresses are evaluated in a variationally consistent fashion, that is shown to admit an equivalent Lagrange multiplier formulation. We prove that the method is unconditionally stable and robust with respect to the amount of added-mass in the system. Furthermore, we provide an error estimate that shows the error in the natural energy norm for the system is $mathcal Obig(sqrt{T}(sqrt{Delta t} + h)big)$ where $T$ is the final time, $Delta t$ the time-step length and $h$ the space discretization parameter.
The extended Lagrangian molecular dynamics (XLMD) method provides a useful framework for reducing the computational cost of a class of molecular dynamics simulations with constrained latent variables. The XLMD method relaxes the constraints by introducing a fictitious mass $varepsilon$ for the latent variables, solving a set of singularly perturbed ordinary differential equations. While favorable numerical performance of XLMD has been demonstrated in several different contexts in the past decade, mathematical analysis of the method remains scarce. We propose the first error analysis of the XLMD method in the context of a classical polarizable force field model. While the dynamics with respect to the atomic degrees of freedom are general and nonlinear, the key mathematical simplification of the polarizable force field model is that the constraints on the latent variables are given by a linear system of equations. We prove that when the initial value of the latent variables is compatible in a sense that we define, XLMD converges as the fictitious mass $varepsilon$ is made small with $mathcal{O}(varepsilon)$ error for the atomic degrees of freedom and with $mathcal{O}(sqrt{varepsilon})$ error for the latent variables, when the dimension of the latent variable $d$ is 1. Furthermore, when the initial value of the latent variables is improved to be optimally compatible in a certain sense, we prove that the convergence rate can be improved to $mathcal{O}(varepsilon)$ for the latent variables as well. Numerical results verify that both estimates are sharp not only for $d =1$, but also for arbitrary $d$. In the setting of general $d$, we do obtain convergence, but with the non-sharp rate of $mathcal{O}(sqrt{varepsilon})$ for both the atomic and latent variables.
This paper describes the analysis of Lagrange interpolation errors on tetrahedrons. In many textbooks, the error analysis of Lagrange interpolation is conducted under geometric assumptions such as shape regularity or the (generalized) maximum angle condition. In this paper, we present a new estimation in which the error is bounded in terms of the diameter and projected circumradius of the tetrahedron. Because we do not impose any geometric restrictions on the tetrahedron itself, our error estimation may be applied to any tetrahedralizations of domains including very thin tetrahedrons.
Using deep neural networks to solve PDEs has attracted a lot of attentions recently. However, why the deep learning method works is falling far behind its empirical success. In this paper, we provide a rigorous numerical analysis on deep Ritz method (DRM) cite{Weinan2017The} for second order elliptic equations with Drichilet, Neumann and Robin boundary condition, respectively. We establish the first nonasymptotic convergence rate in $H^1$ norm for DRM using deep networks with smooth activation functions including logistic and hyperbolic tangent functions. Our results show how to set the hyper-parameter of depth and width to achieve the desired convergence rate in terms of number of training samples.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
