Stieltjes representation of the 3D Bruggeman effective medium and Padé approximation

The paper deals with Bruggeman effective medium approximation (EMA) which is often used to model effective complex permittivity of a two-phase composite. We derive the Stieltjes integral representation of the 3D Bruggeman effective medium and use constrained Padé approximation method introduced in [39] to numerically reconstruct the spectral density function in this representation from the effective complex permittivity known in a range of frequencies. The problem of reconstruction of the Stieltjes integral representation arises in inverse homogenization problem where information about the spectral function recovered from the effective properties of the composite, is used to characterize its geometric structure. We present two different proofs of the Stieltjes analytical representation for the effective complex permittivity in the 3D Bruggeman effective medium model: one proof is based on direct calculation, the other one is the derivation of the representation using Stieltjes inversion formula. We show that the continuous spectral density in the integral representation for the Bruggeman EMA model can be efficiently approximated by a rational function. A rational approximation of the spectral density is obtained from the solution of a constrained minimization problem followed by the partial fractions decomposition. We show results of numerical rational approximation of Bruggeman continuous spectral density and use these results for estimation of fractions of components in a composite from simulated effective permittivity of the medium. The volume fractions of the constituents in the composite calculated from the recovered spectral function show good agreement between theoretical and predicted values.     

A multivariate QD-like algorithm

The problem of constructing a univariate rational interpolant or Padé approximant for given data can be solved in various equivalent ways: one can compute the explicit solution of the system of interpolation or approximation conditions, or one can start a recursive algorithm, or one can obtain the rational function as the convergent of an interpolating or corresponding continued fraction.In case of multivariate functions general order systems of interpolation conditions for a multivariate rational interpolant and general order systems of approximation conditions for a multivariate Padé approximant were respectively solved in [6] and [9]. Equivalent recursive computation schemes were given in [3] for the rational interpolation case and in [5] for the Padé approximation case. At that moment we stated that the next step was to write the general order rational interpolants and Padé approximants as the convergent of a multivariate continued fraction so that the univariate equivalence of the three main defining techniques was also established for the multivariate case: algebraic relations, recurrence relations, continued fractions. In this paper a multivariate qd-like algorithm is developed that serves this purpose.     

Asymptotic Uniqueness of Best Rational Approximants of Given Degree to Markov Functions in L 2 of the Circle

We improve over a sufficient condition given in [8] for uniqueness of a nondegenerate critical point in best rational approximation of prescribed degree over the conjugate-symmetric Hardy space of the complement of the disk. The improved condition connects to error estimates in AAK approximation, and is necessary and sufficient when the function to be approximated is of Markov type. For Markov functions whose defining measure satisfies the Szego condition, we combine what precedes with sharp asymptotics in multipoint Padé approximation from [43], [40] in order to prove uniqueness of a critical point when the degree of the approximant goes large. This lends perspective to the uniqueness issue for more general classes of functions defined through Cauchy integrals.     

Weighted inequalities and applications to best local approximation in Luxemburg norm

In this paper we establish a result about uniformly equivalent norms and the convergence of best approximant pairs on the unitary ball for a family of weighted Luxemburg norms with normalized weight functions depending on ε, when ε→ 0. It is introduced a general concept of Pade approximant and we study its relation with the best local quasi-rational approximant. We characterize the limit of the error for polynomial approximation. We also obtain a new condition over a weight function in order to obtain inequalities in Lp norm, which play an important role in problems of weighted best local Lp approximation in several variables.     

Error autocorrection in rational approximation and interval estimates. [A survey of results.]

The error autocorrection effect means that in a calculation all the intermediate errors compensate each other, so the final result is much more accurate than the intermediate results. In this case standard interval estimates (in the framework of interval analysis including the so-called a posteriori interval analysis of Yu. Matijasevich) are too pessimistic. We shall discuss a very strong form of the effect which appears in rational approximations to functions. The error autocorrection effect occurs in all efficient methods of rational approximation (e.g., best approxmations, Padé approximations, multipoint Padé approximations, linear and nonlinear Padé-Chebyshev approximations, etc.), where very significant errors in the approximant coefficients do not affect the accuracy of this approximant. The reason is that the errors in the coefficients of the rational approximant are not distributed in an arbitrary way, but form a collection of coefficients for a new rational approximant to the same approximated function. The understanding of this mechanism allows to decrease the approximation error by varying the approximation procedure depending on the form of the approximant. Results of computer experiments are presented. The effect of error autocorrection indicates that variations of an approximated function under some deformations of rather a general type may have little effect on the corresponding rational approximant viewed as a function (whereas the coefficients of the approximant can have very significant changes). Accordingly, while deforming a function for which good rational approximation is possible, the corresponding approximant’s error can rapidly increase, so the property of having good rational approximation is not stable under small deformations of the approximated functions. This property is “individual”, in the sense that it holds for specific functions.     

Piecewise interpolants on matrix lie groups

Here we consider a numerical procedure to interpolate on matrix Lie groups. By using the exponential map and its (1, 1) diagonal Padé approximant, piecewice interpolants may be derived. The approach based on the Padé map has the advantage that the computation of exponentials and logarithms of matrices are reduced. We show that the updating technique proposed by Enright in [1] may be applied when a dense output is required. The application to the numerical solution of a system ODEs on matrix group and to a classical interpolation problem are reported.     

Discrete linearized least-squares rational approximation on the unit circle

We already generalized the Rutishauser—Gragg—Harrod—Reichel algorithm for discrete least-squares polynomial approximation on the real axis to the rational case. In this paper, a new method for discrete least-squares linearized rational approximation on the unit circle is presented. It generalizes the algorithms of Reichel—Ammar—Gragg for discrete least-squares polynomial approximation on the unit circle to the rationale case. The algorithm is fast in the sense that it requires order m computation time where m is the number of data points and is the degree of the approximant. We describe how this algorithm can be implemented in parallel. Examples illustrate the numerical behavior of the algorithm.     

Approximation by matrices with restricted spectra

We investigate the properties of the approximation of a matrix by matrices whose spectra are in a closed convex set of the complex plane. We explain why the Khalil and Maher characterization of an approximant, which spectrum is in a strip, is not quite correct. We prove that their characterization is valid but for another kind of approximation. We formulate a conjecture which leads to some algorithm for computing approximants. The conjecture is motivated by numerical experiments and some theoretical considerations. Separately we consider the approximation of normal matrices.     

Approximation and the spectral multiplicity of special automorphisms

Summary Conditions have been given [7] under which a special automorphism over an automorphism admitting a simple approximation again admits a simple approximation, and so has simple spectrum.In this paper using different techniques to those employed in [7], we obtain improved results in the same direction. Specifically, conditions are given for a special automorphism over an automorphism, which admits either a simple approximation, or an approximation with suitable speed, to have bounded spectral multiplicity. Furthermore, we obtain as a corollary a result on primitive automorphisms, which partially generalises a result appearing in [4].     

Kronecker type theorems,normality and continuity of the multivariate Padé operator

Summary. For univariate functions the Kronecker theorem, stating the equivalence between the existence of an infinite block in the table of Padé approximants and the approximated function being rational, is well-known. In [Lubi88] Lubinsky proved that if is not rational, then its Padé table is normal almost everywhere: for an at most countable set of points the Taylor series expansion of is such that it generates a non-normal Padé table. This implies that the Padé operator is an almost always continuous operator because it is continuous when computing a normal Padé approximant [Wuyt81]. In this paper we generalize the above results to the case of multivariate Padé approximation. We distinguish between two different approaches for the definition of multivariate Padé approximants: the general order one introduced in [Levi76, CuVe84] and the so-called homogeneous one discussed in [Cuyt84]. Received December 19, 1994     

Approximations and the spectral properties of measure-preserving group actions

This paper presents some extensions and applications of the method of approximations of ergodic theory (see [6]). Two notions of approximation are defined which are applicable to arbitrary σ-finite-measure-preserving group actions (see §1). Building upon results of [2], [13] and [6], the speeds of such approximations are related to the questions of spectral multiplicity, spectral type and ergodicity (see §3). For the result on spectral multiplicity, there is first established a general result concerning the spectral decomposition of unitary representations (see §2). The last section is devoted to applications—chiefly to certain classes of cylinder transformations which arise in connection with irregularity of distribution (see [12]). These transformations provide examples (on infinite measure spaces) of approximations of all finite multiplicities. The method of approximations is shown to be a natural tool for the study of their spectral properties.     

Fractional Brownian motion approximation based on fractional integration of a white noise

We study simple approximations to fractional Gaussian noise and fractional Brownian motion. The approximations are based on spectral properties of the noise. They allow one to consider the noise as the result of fractional integration/differentiation of a white Gaussian noise. We consider correlation properties of the approximation to fractional Gaussian noise and point to the peculiarities of persistent and anti-persistent behaviors. We also investigate self-similarity properties of the approximation to fractional Brownian motion, namely, `τ^H laws' for the structure function and the range. We conclude that the models proposed serve as a convenient tool for modelling of natural processes and testing and improvement of methods aimed at analysis and interpretation of experimental data.     

Rank Reducing Matrix Norms

We consider approximation numbers for some norms on matrices, and look at the question when a closest rank h p approximant can be chosen to reduce the rank of a matrix by p . If the latter is always possible, we call the norm rank p reducing. It is easily seen that any unitarily invariant norm is rank p reducing. We show that any absolute norm on $\shadC^{n \times m}$ is rank n m 1 reducing and that the numerical radius norm on $ \shadC^{n\times n}$ is rank n m 1 reducing as well. Non-examples and computations of approximation numbers are also presented.     

An approximate analytic solution of the Blasius problem

The [4/3] Pade approximant for the derivative is modified so that the resulting expression has the required asymptotic behavior. This gives an analytical result which represents the solution of the classical Blasius problem on the whole domain.     

Function-valued Padé-type approximant via E-algorithm and its applications in solving integral equations

The function-valued Padé-type approximant (FPTA) was defined in the inner product space [8]. In this work, we choose the coefficients in the Neumann power series to make the inner product with both sides a function-valued system of equations to yield a scalar system. Then we express an FPTA in the determinant form. To avoid the direct computation of the determinants, we present the E-algorithm for FPTA based on the vector-valued E-algorithm given by Brezinski [4]. The method of FPTA via E-algorithm (FPTAVEA) not only includes all previous methods but overcomes their essential difficulties. The numerical experiment for a typical integral equation [1] illustrates that the method of FPTAVEA is simpler and more effective for obtaining the characteristic values and the characteristic functions than all previous methods. In addition, this method is also applicable to other Fredholm integral equations of the second kind without explicit characteristic values and characteristic functions. A corresponding example [12] is given and the numerical result is the same as that in [12].     

Parameter studies of modal vibrations associated with impurity pinned dislocations in a metal single crystal

Koehler's model [1–2] of motion for edge‐type dislocations in a metal single crystal that are pinned down by impurity atoms is studied. An exact solution can be found, which is composed of a rapidly decaying transient and a steady time‐oscillating, steady state vibration. This solution is used to improve Koehler's [1] approximation to the steady time‐oscillating steady state vibration. General parameter studies of the modes of oscillation are then performed. The present result is of some significance, because it allows insight into the behavior of crystalline solids over a wide parameter range, whereas Koehler's asymptotic approach is valid only for materials that exhibit order‐of‐magnitude variation in system parameters. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 427–439, 2001.     

Spline approximant in Hilbertian subspaces ofC(Ω)

Summary In this paper we give a new approach of approximation by spline functions. We define and study approximant spline functions which can be easly calculated without solving a linear system. We investigate also the error in using approximant spline functions.     

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18     

Maximal functions and ergodic averages related to Waring’s problem

We study the arithmetic analogue of maximal functions on diagonal hypersurfaces. This paper is a natural step following the papers of [13], [14] and [16]. We combine more precise knowledge of oscillatory integrals and exponential sums to generalize the asymptotic formula in Waring’s problem to an approximation formula for the Fourier transform of the solution set of lattice points on hypersurfaces arising in Waring’s problem and apply this result to arithmetic maximal functions and ergodic averages. In sufficiently large dimensions, the approximation formula, ? ²-maximal theorems and ergodic theorems were previously known. Our contribution is in reducing the dimensional constraint in the approximation formula using recent bounds of Wooley, and improving the range of ? ^p spaces in the maximal and ergodic theorems. We also conjecture the expected range of spaces.     

COMPUTATION OF THE RELAXATION OSCILLATION PERIOD IN LOTKA‐VOLTERRA SYSTEMS

ABSTRACT. This work surveys techniques of Grasman and Veling [1973], Vasil'eva and Belyanin [1988] and Shih [1996] for computing the relaxation oscillation period of singularly perturbed Lotka‐Volterra systems. Grasman and Veling [1973] used an implicit function theorem to derive an asymptotic formula for the period; Vasil'eva and Belyanin [1988] employed a method of matched asymptotic expansions to obtain an approximation to the period; Shih [1996] obtained two (exact) integral representations for the period in terms of two inverse functions W(–k, x) of xexp(x). These results are compared numerically and asymptotically. In particular, the integral representation of the period in Shih [1996] is computed numerically using a Gauss‐Tschebyscheff integration rule of the first kind, and is further investigated asymptotically by virtue of the asymptotics of W(–k, x), Laplace's method, and a method of consequent representation. Computational results indicate that the Gauss‐Tschebyscheff approximation of the period in Shih [1996] is uniformly accurate for a wide range of the singular parameter (? in the paper).