Uniform stability of spectral nonlinear Galerkin methods

This article provides a stability analysis for the backward Euler schemes of time discretization applied to the spatially discrete spectral standard and nonlinear Galerkin approximations of the nonstationary Navier‐Stokes equations with some appropriate assumption of the data (λ, u₀, f). If the backward Euler scheme with the semi‐implicit nonlinear terms is used, the spectral standard and nonlinear Galerkin methods are uniform stable under the time step constraint Δt ≤ (2/λλ₁). Moreover, if the backward Euler scheme with the explicit nonlinear terms is used, the spectral standard and nonlinear Galerkin methods are uniform stable under the time step constraints Δt = O(λ) and Δt = O(λ), respectively, where λ ≤ λ, which shows that the restriction on the time step of the spectral nonlinear Galerkin method is less than that of the spectral standard Galerkin method. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2004     

A spectral Galerkin approximation of the Orr-Sommerfeld eigenvalue problem in a semi-infinite domain

Summary The convergence of a Galerkin approximation of the Orr-Sommerfeld eigenvalue problem, which is defined in a semi-infinite domain, is studied theoretically. In case the system of trial functions is based on a composite of Jacobi polynomials and an exponential transform of the semi-infinite domain, the error of the Galerkin approximation is estimated in terms of the transformation parametera and the numberN of trial functions. Finite or infinite-order convergence of the spectral Galerkin method is obtained depending on how the transformation parameter is chosen. If the transformation parameter is fixed, then convergence is of finite order only. However, ifa is varied proportional to 1/N with an exponent 0<<1, then the approximate eigenvalue converges faster than any finite power of 1/N asN. Some numerical examles are given.     

On stability in the first approximation

In the problem of stability in the first approximation, in the sense of Lyapunov, Poincaré and Zhukovskii, the classical condition for regularity of the first approximation is replaced by the requirement that the sign of the Lyapunov exponents must remain constant for small changes in the initial states.     

On the spectral stability of functional-differential equations

A boundary value problem for an elliptic functional-differential equation with contraction and dilatation of the arguments of the desired function in the leading part is considered in a starshaped bounded domain. Estimates for the modification of eigenvalues of the operator of the problem under internal deformations of the domain are obtained.     

On synchronization of a forced delay dynamical system via the Galerkin approximation

A forced scalar delay dynamical system is analyzed from the perspective of bifurcation and synchronization. In general first order differential equations do not exhibit chaos, but introduction of a delay feedback makes the system infinite dimensional and shows chaoticity. In order to study the dynamics of such a system, Galerkin projection technique is used to obtain a finite dimensional set of ordinary differential equations from the delay differential equation. We compare the results of simulation with those obtained from direct numerical simulation of the delay equation to ascertain the accuracy of the truncation process in the Galerkin approximation. We have considered two cases, one with five and the other with eight shape functions. Next we study two types of synchronization by considering coupling of the above derived equations with a forced dynamical system without delay. Our analysis shows that it is possible to have synchronization between two such systems. It has been shown that the chaotic system with delay feedback can drive the system without delay to achieve synchronization and the opposite case is also equally valid. This is confirmed by the evaluation of the conditional Lyapunov exponents of the systems.     

On generalized matrix approximation problem in the spectral norm

In this paper theoretical results regarding a generalized minimum rank matrix approximation problem in the spectral norm are presented. An alternative solution expression for the generalized matrix approximation problem is obtained. This alternative expression provides a simple characterization of the achievable minimum rank, which is shown to be the same as the optimal objective value of the classical problem considered by Eckart–Young–Schmidt–Mirsky, as long as the generalized problem is feasible. In addition, this paper provides a result on a constrained version of the matrix approximation problem, establishing that the later problem is solvable via singular value decomposition.     

On the maximal error of spectral approximation of graph bisection

Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class of graphs, we prove that the standard spectral graph bisection can produce bisections that are far from optimal. In particular, we show that the maximum error in the spectral approximation of the optimal bisection (partition sizes exactly equal) cut for such graphs is bounded below by a constant multiple of the order of the graph squared.     

On stability of approximation methods for the Muskhelishvili equation

We study approximation methods for the Muskhelishvili integral equations on curves with corner points and establish necessary and sufficient conditions for their stability.     

Accelerated spectral approximation

A systematic development of higher order spectral analysis, introduced by Dellwo and Friedman, is undertaken in the framework of an appropriate product space. Accelerated analogues of Osborn's results about spectral approximation are presented. Numerical examples are given by considering an integral operator.

     

Three-point finite-difference schemes, Padé and the spectral Galerkin method. I. One-sided impedance approximation

A method for calculating special grid placement for three-point schemes which yields exponential superconvergence of the Neumann to Dirichlet map has been suggested earlier. Here we show that such a grid placement can yield impedance which is equivalent to that of a spectral Galerkin method, or more generally to that of a spectral Galerkin-Petrov method. In fact we show that for every stable Galerkin-Petrov method there is a three-point scheme which yields the same solution at the boundary. We discuss the application of this result to partial differential equations and give numerical examples. We also show equivalence at one corner of a two-dimensional optimal grid with a spectral Galerkin method.

     

On accuracy of approximation of the spectral radius by the Gelfand formula

The famous Gelfand formula ρ(A)=limsup_n→∞A^n1/n for the spectral radius of a matrix is of great importance in various mathematical constructions. Unfortunately, the range of applicability of this formula is substantially restricted by a lack of estimates for the rate of convergence of the quantities A^n1/n to ρ(A). In the paper this deficiency is made up to some extent. By using the Bochi inequalities we establish explicit computable estimates for the rate of convergence of the quantities A^n1/n to ρ(A). The obtained estimates are then extended for evaluation of the joint spectral radius of matrix sets.     

On the stability of some classical operators from approximation theory

We obtain some results on Hyers–Ulam stability for some classical operators from approximation theory. For Bernstein operators we determine the Hyers–Ulam constant using a result concerning coefficient bounds of Lorentz representation for a polynomial.     

Galerkin approximation for elliptic PDEs on spheres

We discuss a Galerkin approximation scheme for the elliptic partial differential equation -Δu+ω²u=f on SⁿRⁿ⁺¹. Here Δ is the Laplace–Beltrami operator on Sⁿ, ω is a non-zero constant and f belongs to C^2k-2(Sⁿ), where kn/4+1, k is an integer. The shifts of a spherical basis function φ with φH^τ(Sⁿ) and τ>2kn/2+2 are used to construct an approximate solution. An H¹(Sⁿ)-error estimate is derived under the assumption that the exact solution u belongs to C^2k(Sⁿ).     

Convergence of Galerkin approximation for two-dimensional Vlasov-Poisson equation

We give explicit estimates on the rate of convergence of the solutions of finite dimensional truncations (by means of Fourier-Hermite expansion) of Vlasov-Poisson equation in a two-dimensional flat torus.

---

Zusammmenfassung Wir geben eine explizite Abschätzung der Konvergenzgeschwindigkeit einer endlichdimensionalen Fourier-Hermite-Entwicklung gegen die Lösung der Vlasov-Poisson-Gleichung für den räumlich 2-dimensionalen periodischen Fall an.

     

On error estimates for Galerkin spectral discretizations of parabolic problems with nonsmooth initial data

We analyze the Legendre and Chebyshev spectral Galerkin semidiscretizations of a one dimensional homogeneous parabolic problem with nonconstant coefficients. We present error estimates for both smooth and nonsmooth data. In the Chebyshev case a limit in the order of approximation is established. On the contrary, in the Legendre case we find an arbitrary high order of convegence.

     

Observations on the numerical stability of the Galerkin method

A simple factorization of the finite-dimensional Galerkin operators motivates a study of the numerical stability of a Galerkin procedure on the basis of its “potential stability” and the “conditioning” of its coordinate functions. Conditions sufficient for stability and conditions leading to instability are thereby identified. Numerical examples of stability and instability occurring in the application of the Galerkin method to boundary-integral equations arising in simple scattering problems are provided and discussed within this framework. Numerical instabilities reported by other authors are examined and explained from the same point of view. This revised version was published online in June 2006 with corrections to the Cover Date.     

Error analysis for Galerkin POD approximation of the nonstationary Boussinesq equations

In this article, we study error estimates for approximate solutions of POD Galerkin type for the equations for the motion of a nonstationary viscous thermally conducting fluid in a bounded domain. Time discretization is based on backward Euler scheme. We study both the fully implicit and semi‐implicit versions of this scheme. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27 : 1639‐1665, 2011     

Semi-discrete Galerkin approximation of the single layer equation by general splines

This paper deals with a semi-discrete version of the Galerkin method for the single-layer equation in a plane, in which the outer integral is approximated by a quadrature rule. A feature of the analysis is that it does not require high precision quadrature or exceptional smoothness of the data. Instead, the assumptions on the quadrature rule are that constant functions are integrated exactly, that the rule is based on sufficiently many quadrature points to resolve the approximation space, and that the Peano constant of the rule is sufficiently small. It is then shown that the semi-discrete Galerkin approximation is well posed. For the trial and test spaces we consider quite general piecewise polynomials on quasi-uniform meshes, ranging from discontinuous piecewise polynomials to smoothest splines. Since it is not assumed that the quadrature rule integrates products of basis functions exactly, one might expect degradation in the rate of convergence. To the contrary, it is shown that the semi-discrete Galerkin approximation will converge at the same rate as the corresponding Galerkin approximation in the and norms. Received March 15, 1996 / Revised version received June 2, 1997