Harmonic and refined Rayleigh–Ritz for the polynomial eigenvalue problem

After reviewing the harmonic Rayleigh–Ritz approach for the standard and generalized eigenvalue problem, we discuss several extraction processes for subspace methods for the polynomial eigenvalue problem. We generalize the harmonic and refined Rayleigh–Ritz approaches which lead to new approaches to extract promising approximate eigenpairs from a search space. We give theoretical as well as numerical results of the methods. In addition, we study the convergence of the Jacobi–Davidson method for polynomial eigenvalue problems with exact and inexact linear solves and discuss several algorithmic details. Copyright © 2008 John Wiley & Sons, Ltd.     

Band limited functions on quantum graphs

The notion of band limited functions is introduced on a quantum graph. The main results of the paper are a uniqueness theorem and a reconstruction algorithm of such functions from discrete sets of values. It turns out that some of our band limited functions can have compact supports and their frequencies can be localized on the ``time" side. It opens an opportunity to consider signals of a variable band width and to develop a sampling theory with variable rate of sampling.

     

Error Estimates for Rayleigh–Ritz Approximations of Eigenvalues and Eigenfunctions of the Mathieu and Spheroidal Wave Equation

Error estimates are derived for the computation of eigenvalues and eigenvectors of infinite tridiagonal matrices by the Rayleigh–Ritz method. The results are applied to the Mathieu and spheroidal wave equation.     

Bernstein–Nikolskii and Plancherel–Polya inequalities in Lp ‐norms on non‐compact symmetric spaces

By using Bernstein‐type inequality we define analogs of spaces of entire functions of exponential type in L_p (X), 1 ≤ p ≤ ∞, where X is a symmetric space of non‐compact. We give estimates of L_p ‐norms, 1 ≤ p ≤ ∞, of such functions (the Nikolskii‐type inequalities) and also prove the L_p ‐Plancherel–Polya inequalities which imply that our functions of exponential type are uniquely determined by their inner products with certain countable sets of measures with compact supports and can be reconstructed from such sets of “measurements” in a stable way (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A numerical technique for solving fractional variational problems

This paper presents an accurate numerical method for solving a class of fractional variational problems (FVPs). The fractional derivative in these problems is in the Caputo sense. The proposed method is called fractional Chebyshev finite difference method. In this technique, we approximate FVPs and end up with a finite‐dimensional problem. The method is based on the combination of the useful properties of Chebyshev polynomials approximation and finite difference method. The Caputo fractional derivative is replaced by a difference quotient and the integral by a finite sum. The fractional derivative approximation using Clenshaw and Curtis formula introduced here, along with Clenshaw and Curtis procedure for the numerical integration of a non‐singular functions and the Rayleigh–Ritz method for the constrained extremum, is considered. By this method, the given problem is reduced to the problem for solving a system of algebraic equations, and by solving this system, we obtain the solution of FVPs. Special attention is given to study the convergence analysis and evaluate an error upper bound of the obtained approximate formula. Illustrative examples are included to demonstrate the validity and applicability of the proposed technique. A comparison with another method is given. Copyright © 2012 John Wiley & Sons, Ltd.     

Convergence estimates of nonrestarted and restarted block‐Lanczos methods

The block‐Lanczos method serves to compute a moderate number of eigenvalues and the corresponding invariant subspace of a symmetric matrix. In this paper, the convergence behavior of nonrestarted and restarted versions of the block‐Lanczos method is analyzed. For the nonrestarted version, we improve an estimate by Saad by means of a change of the auxiliary vector so that the new estimate is much more accurate in the case of clustered or multiple eigenvalues. For the restarted version, an estimate by Knyazev is generalized by extending our previous results on block steepest descent iterations and single‐vector restarted Krylov subspace iterations. The new estimates can also be reformulated and applied to invert‐block‐Lanczos methods for solving generalized matrix eigenvalue problems.     

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

Let M=(V,E,A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C={C₁,…,C_k} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is . The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small as possible. The Chinese postman problem is: given a strongly connected mixed graph M, find a minimum length closed walk using all edges and arcs of M. These problems are NP-hard. We show that they can be solved in polynomial time if M has bounded tree-width.     

Weyl eigenvalue asymptotics and sharp adaptation on vector bundles

This paper examines the estimation of an indirect signal embedded in white noise on vector bundles. It is found that the sharp asymptotic minimax bound is determined by the degree to which the indirect signal is embedded in the linear operator. Thus when the linear operator has polynomial decay, recovery of the signal is polynomial where the exact minimax constant and rate are determined. Adaptive sharp estimation is carried out using a blockwise shrinkage estimator. Application to the spherical deconvolution problem for the polynomially bounded case is made.     

Macrocosmos/microcosmos: celestial mechanics and old quantum theory

The Bohr atom was a solar system in miniature. Despite many deep foundational questions related to the origin of quantized motion, rapid progress was made in its mathematical development and its apparently successful application to spectral line series. In United States, where celestial mechanics flourished throughout the 19th and well into the 20th century, mathematicians and physicists were well prepared for just this sort of problem and made it their own far faster than many areas of the new physics. This paper examines the link between classical problems of perturbation theory, three-body and N-body orbital trajectories, the Hamilton–Jacobi equation, and the old quantum theory. I discuss why it was comparatively easy for American applied mathematicians, astronomers, and mathematical physicists to make significant contributions quickly to quantum theory and why further progress toward quantum mechanics by the same cohort was, in contrast, so slow.     

Some well-posed results on the time-fractional Rayleigh–Stokes problem with polynomial and gradient nonlinearities

In this work, we ponder on a Cauchy problem for the Rayleigh–Stokes equation accompanied by polynomial and gradient nonlinearities. We particularly concern about the behavior of mild solutions for the different instances of the nonlinear source term. In the case of polynomial nonlinearities, we present the local-in-time existence and uniqueness of the mild solution. Moreover, we claim that either it is the global-in-time or it blows up at a finite time. With reference to the case that the source function is global Lipschitzian, we observe that the solution always uniquely exists for a finite time and is continuously dependent. Eventually, we establish some regularity results for the mild solution.     

Analysis and computational method based on quadratic B‐spline FEM for the Rosenau–Burgers equation

L_∞‐error estimates for B‐spline Galerkin finite element solution of the Rosenau–Burgers equation are considered. The semidiscrete B‐spline Galerkin scheme is studied using appropriate projections. For fully discrete B‐spline Galerkin scheme, we consider the Crank–Nicolson method and analyze the corresponding error estimates in time. Numerical experiments are given to demonstrate validity and order of accuracy of the proposed method. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 877–895, 2016     

Bernstein–Nikolskii inequalities and Riesz interpolation formula on compact homogeneous manifolds

Bernstein–Nikolskii inequalities and Riesz interpolation formula are established for eigenfunctions of Laplace operators and polynomials on compact homogeneous manifolds.     

Green kernel estimates and the full Martin boundary for random walks on lamplighter groups and Diestel–Leader graphs

We determine the precise asymptotic behaviour (in space) of the Green kernel of simple random walk with drift on the Diestel–Leader graph , where q,r2. The latter is the horocyclic product of two homogeneous trees with respective degrees q+1 and r+1. When q=r, it is the Cayley graph of the wreath product (lamplighter group) with respect to a natural set of generators. We describe the full Martin compactification of these random walks on -graphs and, in particular, lamplighter groups. This completes previous results of Woess, who has determined all minimal positive harmonic functions.     

Wavelet approximations on closed surfaces and their application to boundary-value problems of potential theory

Wavelets on closed surfaces in Euclidean space ℝ³ are introduced starting from a scale discrete wavelet transform for potentials harmonic down to a spherical boundary. Essential tools for approximation are integration formulas relating an integral over the sphere to suitable linear combinations of function values (resp. normal derivatives) on the closed surface under consideration. A scale discrete version of multiresolution is described for potential functions harmonic outside the closed surface and regular at infinity. Furthermore, an exact fully discrete wavelet approximation is developed in case of band-limited wavelets. Finally, the role of wavelets is discussed in three problems, namely (i) the representation of a function on a closed surface from discretely given data, (ii) the (discrete) solution of the exterior Dirichlet problem, and (iii) the (discrete) solution of the exterior Neumann problem. © 1998 by B. G. Teubner Stuttgart–John Wiley & Sons Ltd.     

Local approximations and intrinsic characterization of spaces of smooth functions on regular subsets of ℝn

We give an intrinsic characterization of the restrictions of Sobolev (?ⁿ ), Triebel–Lizorkin (?ⁿ ) and Besov (?ⁿ ) spaces to regular subsets of ?ⁿ via sharp maximal functions and local approximations. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Numerical and theoretical discussions for solving nonlinear generalized Benjamin–Bona–Mahony–Burgers equation based on the Legendre spectral element method

This article is devoted to solving numerically the nonlinear generalized Benjamin–Bona–Mahony–Burgers (GBBMB) equation that has several applications in physics and applied sciences. First, the time derivative is approximated by using a finite difference formula. Afterward, the stability and convergence analyses of the obtained time semi‐discrete are proven by applying the energy method. Also, it has been demonstrated that the convergence order in the temporal direction is O(dt) . Second, a fully discrete formula is acquired by approximating the spatial derivatives via Legendre spectral element method. This method uses Lagrange polynomial based on Gauss–Legendre–Lobatto points. An error estimation is also given in detail for full discretization scheme. Ultimately, the GBBMB equation in the one‐ and two‐dimension is solved by using the proposed method. Also, the calculated solutions are compared with theoretical solutions and results obtained from other techniques in the literature. The accuracy and efficiency of the mentioned procedure are revealed by numerical samples.     

Specht's ratio and complementary inequalities to Golden–Thompson type inequalities on the Hadamard product

As a converse of the arithmetic–geometric mean inequality, W. Specht [Math. Z. 74 (1960) 91–98] estimated the ratio of the arithmetic mean to the geometric one. In this paper, we shall show complementary inequalities to the matricial generalization of Oppenheim's inequality and the Golden–Thompson type inequalities on the Hadamard product by T. Ando [Linear Algebra Appl. 26 (1979) 203; Linear Algebra Appl. 241–243 (1996) 105], in which Specht's ratio plays an important role. As an application, we shall obtain a complementary inequality to the Hadamard determinant inequality.     

Studies on Jacobi–Davidson,Rayleigh quotient iteration,inverse iteration generalized Davidson and Newton updates

We study Davidson‐type subspace eigensolvers. Correction equations of Jacobi–Davidson and several other schemes are reviewed. New correction equations are derived. A general correction equation is constructed, existing correction equations may be considered as special cases of this general equation. The main theme of this study is to identify the essential common ingredient that leads to the efficiency of a diverse form of Davidson‐type methods. We emphasize the importance of the approximate Rayleigh‐quotient‐iteration direction. Copyright © 2006 John Wiley & Sons, Ltd.