No Arabic abstract
We develop a version of Haar and Holmgren methods which applies to discontinuous solutions of nonlinear hyperbolic systems and allows us to control the L1 distance between two entropy solutions. The main difficulty is to cope with linear hyperbolic systems with discontinuous coefficients. Our main observation is that, while entropy solutions contain compressive shocks only, the averaged matrix associated with two such solutions has compressive or undercompressive shocks, but no rarefaction-shocks -- which are recognized as a source for non-uniqueness and instability. Our Haar-Holmgren-type method rests on the geometry associated with the averaged matrix and takes into account adjoint problems and wave cancellations along generalized characteristics. It extends the method proposed earlier by LeFloch et al. for genuinely nonlinear systems. In the present paper, we cover solutions with small total variation and a class of systems with general flux that need not be genuinely nonlinear and includes for instance fluid dynamics equations. We prove that solutions generated by Glimm or front tracking schemes depend continuously in the L1 norm upon their initial data, by exhibiting an L1 functional controling the distance between two solutions.
The ubiquitous Lanczos method can approximate $f(A)x$ for any symmetric $n times n$ matrix $A$, vector $x$, and function $f$. In exact arithmetic, the methods error after $k$ iterations is bounded by the error of the best degree-$k$ polynomial uniformly approximating $f(x)$ on the range $[lambda_{min}(A), lambda_{max}(A)]$. However, despite decades of work, it has been unclear if this powerful guarantee holds in finite precision. We resolve this problem, proving that when $max_{x in [lambda_{min}, lambda_{max}]}|f(x)| le C$, Lanczos essentially matches the exact arithmetic guarantee if computations use roughly $log(nC|A|)$ bits of precision. Our proof extends work of Druskin and Knizhnerman [DK91], leveraging the stability of the classic Chebyshev recurrence to bound the stability of any polynomial approximating $f(x)$. We also study the special case of $f(A) = A^{-1}$, where stronger guarantees hold. In exact arithmetic Lanczos performs as well as the best polynomial approximating $1/x$ at each of $A$s eigenvalues, rather than on the full eigenvalue range. In seminal work, Greenbaum gives an approach to extending this bound to finite precision: she proves that finite precision Lanczos and the related CG method match any polynomial approximating $1/x$ in a tiny range around each eigenvalue [Gre89]. For $A^{-1}$, this bound appears stronger than ours. However, we exhibit matrices with condition number $kappa$ where exact arithmetic Lanczos converges in $polylog(kappa)$ iterations, but Greenbaums bound predicts $Omega(kappa^{1/5})$ iterations. It thus cannot offer significant improvement over the $O(kappa^{1/2})$ bound achievable via our result. Our analysis raises the question of if convergence in less than $poly(kappa)$ iterations can be expected in finite precision, even for matrices with clustered, skewed, or otherwise favorable eigenvalue distributions.
In this article, we investigate the determination of the spatial component in the time-dependent second order coefficient of a hyperbolic equation from both theoretical and numerical aspects. By the Carleman estimates for general hyperbolic operators and an auxiliary Carleman estimate, we establish local Holder stability with both partial boundary and interior measurements under certain geometrical conditions. For numerical reconstruction, we minimize a Tikhonov functional which penalizes the gradient of the unknown function. Based on the resulting variational equation, we design an iteration method which is updated by solving a Poisson equation at each step. One-dimensional prototype examples illustrate the numerical performance of the proposed iteration.
We are concerned with hyperbolic systems of order-one linear PDEs originated on non-characteristic manifolds. We put forward a simple but effective method of transforming such initial conditions to standard initial conditions (i.e. when the solution is specified at an initial moment of time). We then show how our method applies in fluid mechanics. More specifically, we present a complete solution to the problem of long waves run-up in inclined bays of arbitrary shape with nonzero initial velocity.
This paper extends the model reduction method by the operator projection to the one-dimensional special relativistic Boltzmann equation. The derivation of arbitrary order globally hyperbolic moment system is built on our careful study of two families of the complicate Grad type orthogonal polynomials depending on a parameter. We derive their recurrence relations, calculate their derivatives with respect to the independent variable and parameter respectively, and study their zeros and coefficient matrices in the recurrence formulas. Some properties of the moment system are also proved. They include the eigenvalues and their bound as well as eigenvectors,hyperbolicity, characteristic fields, linear stability, and Lorentz covariance. A semi-implicit numerical scheme is presented to solve a Cauchy problem of our hyperbolic moment system in order to verify the convergence behavior of the moment method. The results show that the solutions of our hyperbolic moment system can converge to the solution of the special relativistic Boltzmann equation as the order of the hyperbolic moment system increases.
We introduce a formulation of the initial and boundary value problem for nonlinear hyperbolic conservation laws posed on a differential manifold endowed with a volume form, possibly with a boundary; in particular, this includes the important case of Lorentzian manifolds. Only limited regularity is assumed on the geometry of the manifold. For this problem, we establish the existence and uniqueness of an L1 semi-group of weak solutions satisfying suitable entropy and boundary conditions.