Error growth analysis via stability regions for discretizations of initial value problems

This paper deals with numerical methods for the solution of linear initial value problems. Two main theorems are presented on the stability of these methods. Both theorems give conditions guaranteeing a mild error growth, for one-step methods characterized by a rational function ϕ(z). The conditions are related to the stability regionS={z:z∈ℂ with |ϕ(z)|≤1}, and can be viewed as variants to the resolvent condition occurring in the reputed Kreiss matrix theorem. Stability estimates are presented in terms of the number of time stepsn and the dimensions of the space. The first theorem gives a stability estimate which implies that errors in the numerical process cannot grow faster than linearly withs orn. It improves previous results in the literature where various restrictions were imposed onS and ϕ(z), including ϕ′(z)≠0 forz∈σS andS be bounded. The new theorem is not subject to any of these restrictions. The second theorem gives a sharper stability result under additional assumptions regarding the differential equation. This result implies that errors cannot grow faster thann ^β, with fixed β<1. The theory is illustrated in the numerical solution of an initial-boundary value problem for a partial differential equation, where the error growth is measured in the maximum norm.     

Fast diffusion flow on manifolds of nonpositive curvature

We consider the fast diffusion equation (FDE) u _t = Δu ^m (0 < m < 1) on a nonparabolic Riemannian manifold M. Existence of weak solutions holds. Then we show that the validity of Euclidean–type Sobolev inequalities implies that certain L ^p −L ^q smoothing effects of the type ∥u(t)∥ _q ≤ Ct ^−α ∥u ₀∥^γ _p , the case q = ∞ being included. The converse holds if m is sufficiently close to one. We then consider the case in which the manifold has the addition gap property min σ(−Δ) > 0. In that case solutions vanish in finite time, and we estimate from below and from above the extinction time.      

Lp-decay rates to nonlinear diffusion waves for p-system with nonlinear damping

In this paper, we study the L ^p (2 ⩽ p ⩽ +∞) convergence rates of the solutions to the Cauchy problem of the so-called p-system with nonlinear damping. Precisely, we show that the corresponding Cauchy problem admits a unique global solution (v(x,t), u(x,t)) and such a solution tends time-asymptotically to the corresponding nonlinear diffusion wave (ῡ(x,t), ū(x,t)) governed by the classical Darcys’s law provided that the corresponding prescribed initial error function (w ₀(x), z ₀(x)) lies in (H ³ × H ²) (ℝ) and |v ₊ − v ₋| + ∥w ₀∥₃ + ∥z ₀∥₂ is sufficiently small. Furthermore, the L ^p (2 ⩽ p ⩽ +∞) convergence rates of the solutions are also obtained.     

An infeasible-interior-point potential-reduction algorithm for linear programming

n . The method is based on Rockafellar’s proximal point algorithm and a cutting-plane technique. At each step, we use an approximate proximal point p^a(x_k) of x_k to define a v_k∈∂_εkf(p^a(x_k)) with ε_k≤α∥v_k∥, where α is a constant. The method monitors the reduction in the value of ∥v_k∥ to identify when a line search on f should be used. The quasi-Newton step is used to reduce the value of ∥v_k∥. Without the differentiability of f, the method converges globally and the rate of convergence is Q-linear. Superlinear convergence is also discussed to extend the characterization result of Dennis and Moré. Numerical results show the good performance of the method. Received October 3, 1995 / Revised version received August 20, 1998 Published online January 20, 1999     

Smooth approximations to solutions of perturbed Weyl and Dirac equations

Iterations of spherical mean values of the initial condition are used to approximate solutions of the Weyl and the Dirac equations in the Hilbert space [L ²(ℝ ⁿ )] ^N . In this work we smooth the potential and the initial condition, without restrictions on the increase rate as ∥x∥ → ∞. By iterating perturbations of such mean values, we prove apriori estimates for the approximate solutions of the perturbed Weyl and Dirac equations in the topology of uniform convergence of time and space derivatives on compact subsets in ℝ×ℝ ⁿ . Translated fromMatematicheskie Zametki, Vol. 60, No. 4, pp. 538–555, October, 1996. I thank Professor A. M. Chebotarev and Professor R. Quezada for their comments and help in the preparation of this paper. This research was partially supported by SNI and CONACyT-E, grant No 0233P-E9506.     

Von Neumann-Jordan Constants of Absolute Normalized Norms on C^n

In this note, we give some estimations of the Von Neumann-Jordan constant C _{N J} (∥·∥_ψ) of Banach space (ℂ ⁿ , ∥·∥_ψ), where ∥·∥_ψ is the absolute normalized norm on ℂ ⁿ given by function ψ. In the case where ψ and φ are comparable, n=2 and C _{N J} (∥·∥_ψ)=1, we obtain a formula of computing C _{N J} (∥·∥_ψ). Our results generalize some results due to Saito and others. Received May 11, 2002, Accepted November 20, 2002 This work is partly supported by NNSF of China (No. 19771056)     

Error estimate for finite volume scheme

We study the convergence of a finite volume scheme for the linear advection equation with a Lipschitz divergence-free speed in R ^d . We prove a h ^1/2-error estimate in the L ^∞(0,t;L ¹)-norm for BV data. This result was expected from numerical experiments and is optimal.     

Probabilistic and deterministic convergence proofs for software for initial value problems

The numerical solution of initial value problems for ordinary differential equations is frequently performed by means of adaptive algorithms with user-input tolerance τ. The time-step is then chosen according to an estimate, based on small time-step heuristics, designed to try and ensure that an approximation to the local error commited is bounded by τ. A question of natural interest is to determine how the global error behaves with respect to the tolerance τ. This has obvious practical interest and also leads to an interesting problem in mathematical analysis. The primary difficulties arising in the analysis are that: (i) the time-step selection mechanisms used in practice are discontinuous as functions of the specified data; (ii) the small time-step heuristics underlying the control of the local error can break down in some cases. In this paper an analysis is presented which incorporates these two difficulties. For a mathematical model of an error per unit step or error per step adaptive Runge–Kutta algorithm, it may be shown that in a certain probabilistic sense, with respect to a measure on the space of initial data, the small time-step heuristics are valid with probability one, leading to a probabilistic convergence result for the global error as τ→0. The probabilistic approach is only valid in dimension m>1 this observation is consistent with recent analysis concerning the existence of spurious steady solutions of software codes which highlights the difference between the cases m=1 and m>1. The breakdown of the small time-step heuristics can be circumvented by making minor modifications to the algorithm, leading to a deterministic convergence proof for the global error of such algorithms as τ→0. An underlying theory is developed and the deterministic and probabilistic convergence results proved as particular applications of this theory. This revised version was published online in June 2006 with corrections to the Cover Date.     

B-spline collocation for solution of two-point boundary value problems

A numerical method based on B-spline is developed to solve the general nonlinear two-point boundary value problems up to order 6. The standard formulation of sextic spline for the solution of boundary value problems leads to non-optimal approximations. In order to derive higher orders of accuracy, high order perturbations of the problem are generated and applied to construct the numerical algorithm. The error analysis and convergence properties of the method are studied via Green’s function approach. O(h⁶) global error estimates are obtained for numerical solution of these classes of problems. Numerical results are given to illustrate the efficiency of the proposed method. Results of numerical experiments verify the theoretical behavior of the orders of convergence.     

Approximation of singularly perturbed parabolic equations in unbounded domains subject to piecewise smooth boundary conditions in the case of solutions that grow at infinity

The initial-boundary value problem in a domain on a straight line that is unbounded in x is considered for a singularly perturbed reaction-diffusion parabolic equation. The higher order derivative in the equation is multiplied by a parameter ɛ², where ɛ ∈ (0, 1]. The right-hand side of the equation and the initial function grow unboundedly as x → ∞ at a rate of O(x ²). This causes the unbounded growth of the solution at infinity at a rate of O(Ψ(x)), where Ψ(x) = x ² + 1. The initialboundary function is piecewise smooth. When ɛ is small, a boundary and interior layers appear, respectively, in a neighborhood of the lateral part of the boundary and in a neighborhood of the characteristics of the reduced equation passing through the discontinuity points of the initial function. In the problem under examination, the error of the grid solution grows unboundedly in the maximum norm as x → ∞ even for smooth solutions when ɛ is fixed. In this paper, the proximity of solutions of the initial-boundary value problem and its grid approximations is considered in the weighted maximum norm ∥·∥ ^w with the weighting function Ψ⁻¹(x); in this norm, the solution of the initial-boundary value problem is ɛ-uniformly bounded. Using the method of special grids that condense in a neighborhood of the boundary layer or in neighborhoods of the boundary and interior layers, special finite difference schemes are constructed and studied that converge ɛ-uniformly in the weighted norm. It is shown that the convergence rate considerably depends on the type of nonsmoothness in the initial-boundary conditions. Grid approximations of the Cauchy problem with the right-hand side and the initial function growing as O(Ψ(x)) that converge ɛ-uniformly in the weighted norm are also considered.     

Quadratic spline interpolation on uniform meshes

The interpolation problem at uniform mesh points of a quadratic splines(x _i)=f _i,i=0, 1,...,N ands(x ₀)=f₀ is considered. It is known that s–f=O(h ³) and s–f=O(h ²), whereh is the step size, and that these orders cannot be improved. Contrary to recently published results we prove that superconvergence cannot occur for any particular point independent off other than mesh points wheres=f by assumption. Best error bounds for some compound formulae approximatingf _i andf _i ⁽³⁾ are also derived.     

The ultrametric corona problem

Let K be a complete ultrametric algebraically closed field and let A be the K-Banach algebra of bounded analytic functions in the disk D: |x| < 1. Let Mult(A, ∥ · ∥) be the set of continuous multiplicative semi-norms of A, let Mult _m (A, ∥ · ∥) be the subset of the ϕ ∈ Mult(A, ∥ · ∥) whose kernel is a maximal ideal and let Mult _a (A, ∥ · ∥) be the subset of the ϕ ∈ Mult _m (A, ∥ · ∥) whose kernel is of the form (x − a)A, a ∈ D ( if ϕ ∈ Mult _m (A, ∥ · ∥) \ Mult _a (A, ∥ · ∥), the kernel of ϕ is then of infinite codimension). We examine whether Mult _a (A, ∥ · ∥) is dense inside Mult _m (A, ∥ · ∥) with respect to the topology of simple convergence. This a first step to the conjecture of density of Mult _a (A, ∥ · ∥) in the whole set Mult(A, ∥ · ∥): this is the corresponding problem to the well-known complex corona problem. We notice that if ϕ ∈ Mult _m (A, ∥ · ∥) is defined by an ultrafilter on D, then ϕ lies in the closure of Mult _a (A, ∥ · ∥). Particularly, we show that this is case when a maximal ideal is the kernel of a unique ϕ ∈ Multm(A, ∥ · ∥). Particularly, when K is strongly valued all maximal ideals enjoy this property. And we can prove this is also true when K is spherically complete, thanks to the ultrametric holomorphic functional calculus. More generally, we show that if ψ ∈ Mult(A, ∥ · ∥) does not define the Gauss norm on polynomials (∥ · ∥), then it is defined by a circular filter, like on rational functions and analytic elements. As a consequence, if ψ ∈ Multm(A, ∥ · ∥) \ Multa(A, ∥ · ∥) or if φ does not lie in the closure of Mult _a (A, ∥ · ∥), then its restriction to polynomials is the Gauss norm. The first situation does happen. The second is unlikely. The text was submitted by the authors in English.     

L P boundedness of area function associated with operators on product spaces

Let L be the infinitesimal generator of an analytic semigroup on L2 (Rn) with suitable upper bounds on its heat kernels. Assume that L has a bounded holomorphic functional calculus on L2(Rn). In this paper,we define the Littlewood- Paley g function associated with L on Rn × Rn, denoted by GL(f)(x1, x2), and decomposition, we prove that ‖SL(f)‖p ≈‖GL(f)‖p ≈‖f‖p for 1 ＜ p ＜∞.     

Integral inequalities with weights for maxiamal operators

Let μ be a measure on the upper half-space R ₊ ⁿ⁺¹ , and v a weight onR ⁿ, we give a characterization for the pair (v, μ) such that ∥M(fv)∥_{L Θ (μ}) ⩽ c ∥f∥_{L Θ (μ}), where Φ is an N-function satisfying Δ₂ condition andMf(x,t), is the maximal function onR ₊ ⁿ⁺¹ , which was introduced by Ruiz, F. and Torrea, J.. Supported by NSFC.     

Correction of finite element eigenvalues for problems with natural or periodic boundary conditions

Recent results of Andrew and Paine for a regular Sturm-Liouville problem with essential boundary conditions are extended to problems with natural or periodic boundary conditions. These results show that a simple asymptotic correction technique of Paine, de Hoog and Anderssen reduces the error in the estimate of thekth eigenvalue obtained by the finite element method, with linear hat functions and mesh lengthh, fromO(k ⁴ h ²) toO(kh ²). Numerical results show the correction to be useful even for low values ofk.     

Pseudo-symplectic Runge-Kutta methods

Apart from specific methods amenable to specific problems, symplectic Runge-Kutta methods are necessarily implicit. The aim of this paper is to construct explicit Runge-Kutta methods which mimic symplectic ones as far as the linear growth of the global error is concerned. Such method of orderp have to bepseudo-symplectic of pseudosymplecticness order2p, i.e. to preserve the symplectic form to within ⊗(h ^2p )-terms. Pseudo-symplecticness conditions are then derived and the effective construction of methods discussed. Finally, the performances of the new methods are illustrated on several test problems.     

On the Duality Mapping Sets in Orlicz Sequence Spaces

The criteria for the weak compactness of duality mapping sets J(x) = {f∈X* : <f, x> = ∥f∥² = ∥x∥²} in Orlicz sequence spaces endowed either with the Luxemburg norm or with the Orlicz norm are obtained. Supported by the National Natural Science Foundation of China, Grants 19901007 and 19871020     

Minimax goodness-of-fit testing in multivariate nonparametric regression

We consider an unknown response function f defined on Δ = [0, 1] ^d , 1 ≤ d ≤ ∞, taken at n random uniform design points and observed with Gaussian noise of known variance. Given a positive sequence r _n → 0 as n → ∞ and a known function f ₀ ∈ L ₂(Δ), we propose, under general conditions, a unified framework for goodness-of-fit testing the null hypothesis H ₀: f = f ₀ against the alternative H ₁: f ∈ $ \mathcal{F} $ \mathcal{F} , ∥f − f ₀∥ ≥ r _n , where $ \mathcal{F} $ \mathcal{F} is an ellipsoid in the Hilbert space L ₂(Δ) with respect to the tensor product Fourier basis and ∥ · ∥ is the norm in L ₂(Δ). We obtain both rate and sharp asymptotics for the error probabilities in the minimax setup. The derived tests are inherently non-adaptive. Several illustrative examples are presented. In particular, we consider functions belonging to ellipsoids arising from the well-known multidimensional Sobolev and tensor product Sobolev norms as well as from the less-known Sloan-Woźniakowski norm and a norm constructed from multivariable analytic functions on the complex strip.     

Convergence of an explicit finite volume scheme for first order symmetric systems

Summary.  This paper is devoted to the derivation of a O(h ^1/2) error estimate for the classical upwind, explicit in time, finite volume scheme for linear first order symmetric systems. Such a result already existed for the corresponding implicit in time finite volume scheme, since it can be interpreted as a particular case of the space-time discontinuous Galerkin method but the technique of proof, used in that case, does not extend to explicit schemes. The general framework, recently developed to analyse the convergence rate of finite volume schemes for non linear scalar conservation laws, can not be used either, because it is not adapted for systems, even linear. In this article, we propose a new technique, which takes advantage of the linearity of the problem. The first step consists in controlling the approximation error ∥u−u _h ∥ _L2 by an expression of the form <ν _h , g>−2<μ _h , gu>, where u is the exact solution, g is a particular smooth function, and μ _h , ν _h are some linear forms depending on the approximate solution u _h . The second step consists in carefully estimating the error terms <μ _h , gu> and <ν _h , g>, by using uniform stability results for the discrete problem and regularity properties of the continuous solution. Received December 20, 2001 / Revised version received January 2, 2001 / Published online November 27, 2002 Mathematics Subject Classification (1991): 65N30     

Asymptotic stability and instability criteria for nonautonomous systems

The classical criterion of asymptotic stability of the zero solution of equations x′ = f(t, x) is that there exists a function V (t, x), a(∥x∥) ≤ V (t, x) ≤ b(∥x∥) for some a, b ∈ K such that [(V)\dot] \dot{V} (t, x) ≤ −c(∥x∥) for some c ∈ K. In this paper, we prove that if V^{(m + 1)} \mathop {V}\limits^{(m + {1})} (t, x) is bounded on some set [tk − T, tk + T] × BH(tk → +∞ as k → ∞), then the condition that [(V)\dot] \dot{V} (t, x) ≤ −c(∥x∥) can be weakened and replaced by that [(V)\dot] \dot{V} (t, x) ≤ 0 and − (−[(V)\dot] \dot{V} (tk, x)| + − [(V)\ddot] \ddot{V} (tk, x)| + ⋯ + − V^(m) \mathop {V}\limits^{(m)} (tk, x)|) ≤ −c′(∥x∥) for some c′ ∈ K. Moreover, the author also presents a corresponding instability criterion. [1–10]