Numerical peak holomorphic functions on Banach spaces

We introduce the notion of numerical (strong) peak function and investigate the denseness of the norm and numerical peak functions on complex Banach spaces. Let Ab(BX:X) be the Banach space of all bounded continuous functions f on the unit ball BX of a Banach space X and their restrictions to the open unit ball are holomorphic. In finite dimensional spaces, we show that the intersection of the set of all norm peak functions and the set of all numerical peak functions is a dense Gδ-subset of Ab(BX:X). We also prove that if X is a smooth Banach space with the Radon-Nikodým property, then the set of all numerical strong peak functions is dense in Ab(BX:X). In particular, when X=Lp(μ)(1<p<∞) or X=?₁, it is shown that the intersection of the set of all norm strong peak functions and the set of all numerical strong peak functions is a dense Gδ-subset of Ab(BX:X). As an application, the existence and properties of numerical boundary of Ab(BX:X) are studied. Finally, the numerical peak function in Ab(BX:X) is characterized when X=C(K) and some negative results on the denseness of numerical (strong) peak holomorphic functions are given.     

Estimating Mahler measures using periodic points for the doubling map

The Mahler measure m(P)$m\left(P\right)$ of a polynomial P$P$ is a numerical value which is useful in number theory, dynamical systems and geometry. In this article we show how this can be written in terms of periodic points for the doubling map on the unit interval. This leads to an interesting algorithm for approximating m(P)$m\left(P\right)$ which we illustrate with several examples.     

On a Generalized Dirichlet Problem for Analytic Family

In this paper, we give the Silov boundary for an analytic family on a bounded strictly pseudoconvex domain or an analytic polyhedron in Cn, and get a necessary and sufficient condition for a generalized Dirichlet problem to be solvable for an analytic family on a bounded holomorphic domain. Especially, we derive that this condition is just that the continuous real boundary value is prescribed on and only on the Silov boundary for an analytic family on a bounded strictly pseudoconvex domain or an analytic polyhedron.     

Algebra matrix and similarity classification of operators

In this paper, by the Gelfand representation theory and the Silov idempotents theorem, we first obtain a central decomposition theorem related to a unital semi-simple n-homogeneous Banach algebra, and then give a similarity classification of two strongly irreducible Cowen-Douglas operators using this theorem.     

The polynomial numerical hull of a matrix and algorithms for computing the numerical range

Let A be an n × n matrix. In this paper we discuss theoretical properties of the polynomial numerical hull of A of degree one and assemble them into three algorithms to computing the numerical range of A.     

Strong peak points and strongly norm attaining points with applications to denseness and polynomial numerical indices

Using the variational method, it is shown that the set of all strong peak functions in a closed algebra A of Cb(K) is dense if and only if the set of all strong peak points is a norming subset of A. As a corollary we can induce the denseness of strong peak functions on other certain spaces. In case that a set of uniformly strongly exposed points of a Banach space X is a norming subset of , then the set of all strongly norm attaining elements in is dense. In particular, the set of all points at which the norm of is Fréchet differentiable is a dense Gδ subset. In the last part, using Reisner's graph-theoretic approach, we construct some strongly norm attaining polynomials on a CL-space with an absolute norm. Then we show that for a finite dimensional complex Banach space X with an absolute norm, its polynomial numerical indices are one if and only if X is isometric to . Moreover, we give a characterization of the set of all complex extreme points of the unit ball of a CL-space with an absolute norm.     

A new approach to numerical solution of fixed-point problems and its application to delay differential equations

In this paper we consider a certain approximation of fixed-points of a continuous operator A mapping the metric space into itself by means of finite dimensional ε(h)-fixed-points of A. These finite dimensional functions are obtained from functions defined on discrete space grid points (related to a parameter h→0) by applying suitably chosen extension operators p_h. A theorem specifying necessary and sufficient conditions for existence of fixed-points of A in terms of ε(h)-fixed-points of A is given. A corollary which follows the theorem yields an approximate method for a fixed-point problem and determines conditions for its convergence. An example of application of the obtained general results to numerical solving of boundary value problems for delay differential equations is provided.Numerical experiments carried out on three examples of boundary value problems for second order delay differential equations show that the proposed approach produces much more accurate results than many other numerical methods when applied to the same examples.     

Mathematical Model of Ice Melting on Transmission Lines

During ice storms, ice forms on high voltage electrical lines. This ice formation often results in downed lines and has been responsible for considerable damage to life and property as was evidenced in the catastrophic ice storm of Quebec recently. There are two main aspects, viz., the formation of ice and its timely mitigation. In this paper, we mathematically model the melting of ice due to a higher current applied to the transmission wire. The two dimensional cross-section contains four layers consisting of the transmission wire, water due to melting of ice, ice, and the atmosphere. The model includes heat equations for the various regions with suitable boundary conditions. Heat propagation and ice melting are expressed as a Stefan-like problem for the moving boundary between the layers of ice and water. The model takes into account gravity which leads to downward motion of ice and to forced convection of heat in the water layer. In this paper, the results are applied to the case when the cross-sections are concentric circles to yield melting times for ice dependent on the increase in intensity of the electrical flow in the line. This research has been supported in part by Manitoba Hydro and NSERC.     

On the numerical radius of Lipschitz operators in Banach spaces

We study the numerical radius of Lipschitz operators on Banach spaces via the Lipschitz numerical index, which is an analogue of the numerical index in Banach space theory. We give a characterization of the numerical radius and obtain a necessary and sufficient condition for Banach spaces to have Lipschitz numerical index 1. As an application, we show that real lush spaces and C  -rich subspaces have Lipschitz numerical index 1. Moreover, using the Gâteaux differentiability of Lipschitz operators, we characterize the Lipschitz numerical index of separable Banach spaces with the RNP. Finally, we prove that the Lipschitz numerical index has the stability properties for the _c0$c_0$-, _l1$l_1$-, and _l∞$l_{\infty }$-sums of spaces and vector-valued function spaces. From this, we show that the C(K)$C(K)$ spaces, _L1(μ)$L_1(\mu )$-spaces and _L∞(ν)$L_{\infty }(\nu )$-spaces have Lipschitz numerical index 1.     

A method for calculating the Painlevé transcendents

A numerical method for solving the Cauchy problem for all the six Painlevé equations is proposed. The difficulty of solving these equations is that the unknown functions can have movable (that is, dependent on the initial data) singular points of the pole type. Moreover, the Painlevé III–VI equations may have singularities at points where the solution takes certain finite values. The positions of all these singularities are not a priori known and are determined in the process of solving the equation. The proposed method is based on the transition to auxiliary systems of differential equations in neighborhoods of the indicated points. The equations in these systems and their solutions have no singularities at the corresponding point and its neighborhood. Such auxiliary equations are derived for all Painlevé equations and for all types of singularities. Efficient criteria for transition to auxiliary systems are formulated, and numerical results illustrating the potentials of the method are presented.     

一阶导数的五点数值微分公式及外推算法

通过对四次Lagrange插值多项式求导推导出一阶导数的五点数值微分公式,其截断误差为O(h~4).利用Richardson外推原理得到该公式的外推算法,K次外推后,中间节点的数值精度提高到O(h~(2(k+2))),其它节点的精度提高到O(h~(k+4)).     

The block numerical range of matrix polynomials

Block numerical ranges of matrix polynomials, especially the quadratic numerical range, are considered. The main results concern spectral inclusion, boundedness of the block numerical range, an estimate of the resolvent in terms of the quadratic numerical range, geometrical properties of the quadratic numerical range, and inclusion between block numerical ranges of the matrix polynomials for refined block decompositions. As an application, we connect the quadratic numerical range with the localization of the spectrum of matrix polynomials.     

Almost Sure Relative Stability of the Overshoot of Power Law Boundaries

We give necessary and sufficient conditions for the almost sure relative stability of the overshoot of a random walk when it exits from a two-sided symmetric region with curved boundaries. The boundaries are of power-law type, ±rn ^b , r > 0, n = 1, 2,..., where 0 ≤ b < 1, b≠ 1/2. In these cases, the a.s. stability occurs if and only if the mean step length of the random walk is finite and non-zero, or the step length has a finite variance and mean zero.      

Monte-Carlo simulation of stochastic differential systems — a geometrical approach

We develop some numerical schemes for d$d$-dimensional stochastic differential equations derived from Milstein approximations of diffusions which are obtained by lifting the solutions of the stochastic differential equations to higher dimensional spaces using geometrical tools, in the line of the work [A.B. Cruzeiro, P. Malliavin, A. Thalmaier, Geometrization of Monte-Carlo numerical analysis of an elliptic operator: Strong approximation, C. R. Acad. Sci. Paris, Ser. I 338 (2004) 481–486].     

A local min-orthogonal method for finding multiple saddle points

The purpose of this paper is twofold. The first is to remove a possible ill-posedness related to a local minimax method developed in SIAM J. Sci. Comput. 23 (2001) 840-865, SIAM J. Sci. Comput. 24 (2002) 840-865 and the second is to provide a local characterization for nonminimax type saddle points. To do so, a local L-⊥ selection is defined and a necessary and sufficient condition for a saddle point is established, which leads to a min-orthogonal method. Those results exceed the scope of a minimax principle, the most popular approach in critical point theory. An example is given to illustrate the new theory. With this local characterization, the local minimax method in SIAM J. Sci. Comput. 23 (2001) 840-865, SIAM J. Sci. Comput. 24 (2002) 840-865 is generalized to a local min-orthogonal method for finding multiple saddle points. In a subsequent paper, this approach is applied to define a modified pseudo gradient (flow) of a functional for finding multiple saddle points in Banach spaces.     

On Generalized Numerical Ranges of Operators on an Indefinite Inner Product Space

In this article, numerical ranges associated with operators on an indefinite inner product space are investigated. Boundary generating curves, corners, shapes and computer generations of these sets are studied. In particular, the Murnaghan-Kippenhahn theorem for the classical numerical range is generalized.     

Regenerative cascade homotopies for solving polynomial systems

A key step in the numerical computation of the irreducible decomposition of a polynomial system is the computation of a witness superset of the solution set. In many problems involving a solution set of a polynomial system, the witness superset contains all the needed information. Sommese and Wampler gave the first numerical method to compute witness supersets, based on dimension-by-dimension slicing of the solution set by generic linear spaces, followed later by the cascade homotopy of Sommese and Verschelde. Recently, the authors of this article introduced a new method, regeneration, to compute solution sets of polynomial systems. Tests showed that combining regeneration with the dimension-by-dimension algorithm was significantly faster than naively combining it with the cascade homotopy. However, in this article, we combine an appropriate randomization of the polynomial system with the regeneration technique to construct a new cascade of homotopies for computing witness supersets. Computational tests give strong evidence that regenerative cascade is superior in practice to previous methods.