A collocation/quadrature-based Sturm–Liouville problem solver

We present a computational method for solving a class of boundary-value problems in Sturm–Liouville form. The algorithms are based on global polynomial collocation methods and produce discrete representations of the eigenfunctions. Error control is performed by evaluating the eigenvalue problem residuals generated when the eigenfunctions are interpolated to a finer discretization grid; eigenfunctions that produce residuals exceeding an infinity-norm bound are discarded. Because the computational approach involves the generation of quadrature weights and arrays for discrete differentiation operations, our computational methods provide a convenient framework for solving boundary-value problems by eigenfunction expansion and other projection methods.     

Subspace correction multi‐level methods for elliptic eigenvalue problems

In this work, we apply the ideas of domain decomposition and multi‐grid methods to PDE‐based eigenvalue problems represented in two equivalent variational formulations. To find the lowest eigenpair, we use a “subspace correction” framework for deriving the multiplicative algorithm for minimizing the Rayleigh quotient of the current iteration. By considering an equivalent minimization formulation proposed by Mathew and Reddy, we can use the theory of multiplicative Schwarz algorithms for non‐linear optimization developed by Tai and Espedal to analyse the convergence properties of the proposed algorithm. We discuss the application of the multiplicative algorithm to the problem of simultaneous computation of several eigenfunctions also formulated in a variational form. Numerical results are presented. Copyright © 2001 John Wiley & Sons, Ltd.     

Eigenvibrations of a bar with elastically attached load

We study the problem on the eigenvibrations of a bar with an elastically attached load. The problem is reduced to finding the eigenvalues and eigenfunctions of an ordinary secondorder differential problem with a spectral parameter nonlinearly occurring in the boundary condition at the load attachment point. We prove the existence of countably many simple positive eigenvalues of the differential problem. The problem is approximated by a grid scheme of the finite element method. We study the convergence and accuracy of the approximate solutions.     

The combined effect of numerical integration and approximation of the boundary in the finite element method for eigenvalue problems

Summary. The paper deals with the finite element analysis of second order elliptic eigenvalue problems when the approximate domains are not subdomains of the original domain and when at the same time numerical integration is used for computing the involved bilinear forms. The considerations are restricted to piecewise linear approximations. The optimum rate of convergence for approximate eigenvalues is obtained provided that a quadrature formula of first degree of precision is used. In the case of a simple exact eigenvalue the optimum rate of convergence for approximate eigenfunctions in the -norm is proved while in the -norm an almost optimum rate of convergence (i.e. near to is achieved. In both cases a quadrature formula of first degree of precision is used. Quadrature formulas with degree of precision equal to zero are also analyzed and in the case when the exact eigenfunctions belong only to the convergence without the rate of convergence is proved. In the case of a multiple exact eigenvalue the approximate eigenfunctions are compard (in contrast to standard considerations) with linear combinations of exact eigenfunctions with coefficients not depending on the mesh parameter . Received September 18, 1993 / Revised version received September 26, 1994     

Spectral convergence and nonlinear dynamics of reaction-diffusion equations under perturbations of the domain

In this paper we obtain the continuity of attractors for semilinear parabolic problems with Neumann boundary conditions relatively to perturbations of the domain. We show that, if the perturbations on the domain are such that the convergence of eigenvalues and eigenfunctions of the Neumann Laplacian is granted then, we obtain the upper semicontinuity of the attractors. If, moreover, every equilibrium of the unperturbed problem is hyperbolic we also obtain the continuity of attractors. We also give necessary and sufficient conditions for the spectral convergence of Neumann problems under perturbations of the domain.     

External finite-element approximations of eigenfunctions in the case of multiple eigenvalues

The paper deals with the finite-element analysis of second-order elliptic eigenvalue problems when the approximate domains Ω_h are not subdomains of the original domain . The considerations are restricted to piecewise linear approximations. Special attention is devoted to the convergence of approximate eigenfunctions in the case of multiple exact eigenvalues. As yet the approximate solutions have been compared with linear combinations of exact eigenfunctions with coefficients depending on the mesh parameter h. We avoid this disadvantage.     

Asymptotic property and convergence estimation for the eigenelements of the Laplace operator

In this article, we provide a rigorous derivation of asymptotic expansions for eigenfunctions and we establish convergence estimation for both eigenvalues and eigenfunctions of the Laplacian. We address the integral equation method to investigate the interplay between the geometry, boundary conditions and spectral properties of the eigenelements of the Laplace operator under deformation of the domain. The asymptotic formula and convergence estimation are tested by numerical examples.     

On the uniform convergence of spectral expansions for a spectral problem with boundary conditions of the third kind one of which contains the spectral parameter

We study the uniform convergence, on a closed interval, of spectral expansions of Hölder functions in a given complete and minimal system of eigenfunctions corresponding to a spectral problem with spectral parameter in a boundary condition. We consider boundary conditions of the third kind and subject the function to be expanded to a condition of nonlocal type ensuring the uniform convergence. We prove a theorem stating that expansions in the entire system of eigenfunctions of the problem are possible without any additional conditions.     

Series solution of nonlinear eigenvalue problems by means of the homotopy analysis method

A general analytic approach for nonlinear eigenvalue problems is described. Two physical problems are used as examples to show the validity of this approach for eigenvalue problems with either periodic or non-periodic eigenfunctions. Unlike perturbation techniques, this approach is independent of any small physical parameters. Besides, different from all other analytic techniques, it provides a simple way to ensure the convergence of series of eigenvalues and eigenfunctions so that one can always get accurate enough approximations. Finally, unlike all other analytic techniques, this approach provides great freedom to choose an auxiliary linear operator so as to approximate the eigenfunction more effectively by means of better base functions. This approach provides us a new way to investigate eigenvalue problems with strong nonlinearity.     

Expansion in eigenfunctions of the Sturm-Liouville problem on a bundle graph

In this paper we consider the applicability of the Fourier method for partial differential equations on spatial grids (we choose a bundle graph as a model). This leads to an important problem, namely, to the expansion of a given function in eigenfunctions of the corresponding Sturm-Liouville problem on a grid. We study a model problem which describes a symmetric case, when one considers physically identical one-dimensional continuums on the bundle graph. Such problems arise, for example, in the modeling of oscillating processes of an elastic mast with supporting elastic ties.     

Multigrid convergence for a singular perturbation problem

So far there has been no analysis of multigrid methods applied to singularly perturbed Dirichlet boundary-value problems. Only for periodic boundary conditions does the Fourier transformation (mode analysis) apply, and it is not obvious that the convergence results carry over to the Dirichlet case, since the eigenfunctions are quite different in the two cases. In this paper we prove a close relationship between multigrid convergence for the easily analysable case of periodic conditions and the convergence for the Dirichlet case.     

Some theoretical properties of Silverman's method for Smoothed functional principal component analysis

Principal component analysis (PCA) is one of the key techniques in functional data analysis. One important feature of functional PCA is that there is a need for smoothing or regularizing of the estimated principal component curves. Silverman’s method for smoothed functional principal component analysis is an important approach in a situation where the sample curves are fully observed due to its theoretical and practical advantages. However, lack of knowledge about the theoretical properties of this method makes it difficult to generalize it to the situation where the sample curves are only observed at discrete time points. In this paper, we first establish the existence of the solutions of the successive optimization problems in this method. We then provide upper bounds for the bias parts of the estimation errors for both eigenvalues and eigenfunctions. We also prove functional central limit theorems for the variation parts of the estimation errors. As a corollary, we give the convergence rates of the estimations for eigenvalues and eigenfunctions, where these rates depend on both the sample size and the smoothing parameters. Under some conditions on the convergence rates of the smoothing parameters, we can prove the asymptotic normalities of the estimations.     

On the convergence of expansions in polyharmonic eigenfunctions

We consider expansions of smooth, nonperiodic functions defined on compact intervals in eigenfunctions of polyharmonic operators equipped with homogeneous Neumann boundary conditions. Having determined asymptotic expressions for both the eigenvalues and eigenfunctions of these operators, we demonstrate how these results can be used in the efficient computation of expansions. Next, we consider the convergence. We establish the key advantage of such expansions over classical Fourier series–namely, both faster and higher-order convergence–and provide a full asymptotic expansion for the error incurred by the truncated expansion. Finally, we derive conditions that completely determine the convergence rate.     

The Finite Difference Based Fast Adaptive Composite Grid Method

The fast adaptive composite grid (FAC) method is an iterative method for solving discrete boundary value problems on composite grids. McCormick introduced the method in [8] and considered the convergence behaviour for discrete problems resulting from finite volume element discretization on composite grids. In this paper we consider discrete problems resulting from finite difference discretization on composite grids. We distinguish between two obvious discretization approaches at the grid points on the interfaces between fine and coarse subgrids. The FAC method for solving such discrete problems is described. In the FAC method several intergrid transfer operators appear. We study how the convergence behaviour depends on these intergrid transfer operators. Based on theoretical insights, (quasi-)optimal intergrid transfer operators are derived. Numerical results illustrate the fast convergence of the FAC method using these intergrid transfer operators.     

On the continuum limit of a discrete inverse spectral problem on optimal finite difference grids

We consider finite difference approximations of solutions of inverse Sturm‐Liouville problems in bounded intervals. Using three‐point finite difference schemes, we discretize the equations on so‐called optimal grids constructed as follows: For a staggered grid with 2 k points, we ask that the finite difference operator (a k × k Jacobi matrix) and the Sturm‐Liouville differential operator share the k lowest eigenvalues and the values of the orthonormal eigenfunctions at one end of the interval. This requirement determines uniquely the entries in the Jacobi matrix, which are grid cell averages of the coefficients in the continuum problem. If these coefficients are known, we can find the grid, which we call optimal because it gives, by design, a finite difference operator with a prescribed spectral measure. We focus attention on the inverse problem, where neither the coefficients nor the grid are known. A key question in inversion is how to parametrize the coefficients, i.e., how to choose the grid. It is clear that, to be successful, this grid must be close to the optimal one, which is unknown. Fortunately, as we show here, the grid dependence on the unknown coefficients is weak, so the inversion can be done on a precomputed grid for an a priori guess of the unknown coefficients. This observation leads to a simple yet efficient inversion algorithm, which gives coefficients that converge pointwise to the true solution as the number k of data points tends to infinity. The cornerstone of our convergence proof is showing that optimal grids provide an implicit, natural regularization of the inverse problem, by giving reconstructions with uniformly bounded total variation. The analysis is based on a novel, explicit perturbation analysis of Lanczos recursions and on a discrete Gel'fand‐Levitan formulation. © 2005 Wiley Periodicals, Inc.     

An adaptive C~0IPG method for the Helmholtz transmission eigenvalue problem

The interior penalty methods using C~0 Lagrange elements(C~0 IPG) developed in the recent decade for the fourth order problems are an interesting topic at present. In this paper, we discuss the adaptive proporty of C~0 IPG method for the Helmholtz transmission eigenvalue problem. We give the a posteriori error indicators for primal and dual eigenfunctions, and prove their reliability and efficiency. We also give the a posteriori error indicator for eigenvalues and design a C~0 IPG adaptive algorithm. Numerical experiments show that this algorithm is efficient and can get the optimal convergence rate.     

On the convergence of solutions and eigenelements of a boundary value problem in a domain perforated along the boundary

We consider a boundary value problem in a model domain periodically perforated along the boundary. We assume that the homogeneous Neumann condition is posed on the external boundary and the homogeneous Dirichlet condition is posed on the boundary of the cavities. A limit (homogenized) problem is obtained. We prove the convergence of the solutions, eigenvalues, and eigenfunctions of the original problem to the solutions, eigenvalues, and eigenfunctions, respectively, of the limit problem.     

AN ADAPTIVE INVERSE ITERATION FEM FOR THE INHOMOGENEOUS DIELECTRIC WAVEGUIDES

We introduce an adaptive finite element method for computing electromagnetic guided waves in a closed, inhomogeneous, pillared three-dimensional waveguide at a given frequency based on the inverse iteration method. The problem is formulated as a generalized eigenvalue problems. By modifying the exact inverse iteration algorithm for the eigenvalue problem, we design a new adaptive inverse iteration finite element algorithm. Adaptive finite element methods based on a posteriori error estimate are known to be successful in resolving singularities of eigenfunctions which deteriorate the finite element convergence. We construct a posteriori error estimator for the electromagnetic guided waves problem. Numerical results are reported to illustrate the quasi-optimal performance of our adaptive inverse iteration finite element method.     

特征值问题的自适应反迭代有限元算法

1引言设Ω∈R~2为Lipschitz单连通的有界闭区域,X为定义在Ω的Sobolev空间,a(·,·)和b(·,·)为X×X→C的有界双线性或半双线性泛函,考虑变分特征值问题:求(λ,u≠0)∈C×X使得a(u,v)=λb(u,u),(?)u∈X,其中a(·,·)满足X上的"V-强制性"条件或者连续的inf-sup条件,设M_h为Q区域上的正则三角形剖分,X_h∈X为定义在M_h有限元子空间,上述变分问题对应的有限元离散问题为:求(λ_h,u_h)∈R×X,u_h≠0使得     

Multigrid Methods with Newton-Gauss-Seidel Smoothing and Constraint Preserving Interpolation for Obstacle Problems

In this paper, we propose a multigrid algorithm based on the full approximate scheme for solving the membrane constrained obstacle problems and the minimal surface obstacle problems in the formulations of HJB equations. A Newton-Gauss-Seidel (NGS) method is used as smoother. A Galerkin coarse grid operator is proposed for the membrane constrained obstacle problem. Comparing with standard FAS with the direct discretization coarse grid operator, the FAS with the proposed operator converges faster. A special prolongation operator is used to interpolate functions accurately from the coarse grid to the fine grid at the boundary between the active and inactive sets. We will demonstrate the fast convergence of the proposed multigrid method for solving two model obstacle problems and compare the results with other multigrid methods.