Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/9910013

A numerical scheme for impact problems

Laetitia Paoli·Michelle Schatzman
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider a mechanical system with impact and n degrees of freedom, written in generalized coordinates. The system is not necessarily Lagrangian. The representative point of the system must remain inside a set of constraints K; the boundary of K is three times differentiable. At impact, the tangential component of the impulsion is conserved, while its normal coordinate is reflected and multiplied by a given coefficient of restitution e between 0 and 1. The orthognality is taken with respect to the natural metric in the space of impulsions. We define a numerical scheme which enables us to approximate the solutions of the Cauchy problem: this is an ad hoc scheme which does not require a systematic search for the times of impact. We prove the convergence of this numerical scheme to a solution, which yields also an existence result. Without any a priori estimates, the convergence and the existence are local; with some a priori estimates, the convergence and the existence are proved on intervals depending exclusively on these estimates. This scheme has been implemented with a trivial and a non trivial mass matrix.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Laetitia Paoli, Michelle Schatzman. 1999-10-04. A numerical scheme for impact problems. https://arxiv.org/abs/math/9910013

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bias Reduction by Multiscale Quasi-Interpolation for Scalar- and Manifold-Valued Functions

We study the bias--variance tradeoff within a multiscale approximation framework. Our approach uses a given quasi-interpolation operator, which is repeatedly applied within an error-correction scheme over a hierarchical data structure. We use the bias ratio, the fraction of mean squared error attributable to squared bias, to assess multiscale estimators. We also provide a theoretical mechanism for the observed bias reduction: for scalar-valued linear quasi-interpolation with zero-mean additive noise, the statistical bias of the multiscale estimator is exactly the deterministic residual produced by the multiscale error-correction scheme. A residual-contraction condition then yields bias reduction, and a spectral-filter model gives a monotone nonincreasing integrated bias ratio with respect to the number of levels. Within the same model, we obtain an exact per-level error increment whose bias--variance crossover gives a criterion for when an additional level is beneficial. Under a local consistency assumption, a tangent-space analysis extends the residual-bias mechanism to manifold-valued constructions and yields a leading-order bias--variance decomposition. Our findings establish multiscale approximation as a bias-reduction methodology applicable to general quasi-interpolation operators, including applications to manifold-valued functions.

math.NA↗
arXiv2026

Minimality of Tree Tensor Network Ranks

For a given tree tensor network $G$, we call a tuple of bond dimensions minimal if there exists a tensor $T$ that can be represented by this network but not on the same tree topology with strictly smaller bond dimensions. We establish necessary and sufficient conditions on the bond dimensions of a tree tensor network to be minimal, generalising a characterisation of Carlini and Kleppe about existence of tensors with a given multilinear rank. We also show that in a minimal tree tensor network, the non-minimal tensors form a Zariski closed subset, so minimality is a generic property in this sense.

math.NA↗
arXiv2026

Whittle-Matérn Fields with Variable Smoothness

We introduce and analyze a nonlocal generalization of Whittle--Matérn Gaussian fields in which the smoothness parameter varies in space through the fractional order, $s=s(x)\in[\underline s,\overline s]\subset(0,1)$. The model is defined via an integral-form operator whose kernel is constructed from the modified Bessel function of the second kind and whose local singularity is governed by the symmetric exponent $β(x,y)=(s(x)+s(y))/2$. This variable-order nonlocal formulation departs from the classical constant-order pseudodifferential setting and raises new analytic and numerical challenges. We develop a novel variational framework adapted to the kernel, prove existence and uniqueness of weak solutions on truncated bounded domains, and derive Sobolev regularity of the Gaussian (spectral) solution controlled by the minimal local order, with realizations lying in $H^r(\mathcal G)$ for every $r<2\underline s-\tfrac{d}{2}$ with $d\ge2$ or $\underline s\le1/2$, with a slightly reduced range in the remaining case (i.e. $d=1$ and $\underline s > 1/2$), hence in $L_2(\mathcal G)$ when $\underline s>d/4$. Here $H^r(\mathcal G)$ denotes the Sobolev space on the bounded domain $\mathcal G$. We also present a finite-element sampling method for the integral model, derive error estimates, and provide numerical experiments in one dimension that illustrate the impact of spatially varying smoothness on the solution covariance. Computational aspects and directions for scalable implementations are discussed.

math.NA↗