A uniformly computable Implicit Function Theorem

We prove uniformly computable versions of the Implicit Function Theorem in its differentiable and non‐differentiable forms. We show that the resulting operators are not computable if information about some of the partial derivatives of the implicitly defining function is omitted. Finally, as a corollary, we obtain a uniformly computable Inverse Function Theorem, first proven by M. Ziegler (2006). (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On Schwarz Alternating Methods for the Subsonic Full Potential Equation

The Schwarz alternating method can be used to solve elliptic boundary value problems on domains which consist of two or more overlapping subdomains. The solution is approximated by an infinite sequence of functions which results from solving a sequence of elliptic boundary value problems in each of the subdomains. The full potential equation is derived from the Navier–Stokes equations assuming the fluid is compressible, inviscid, irrotational and isentropic. It is being used by the aircraft industry to model flow over an airfoil or even an entire aircraft. This paper shows that the additive and multiplicative versions of the Schwarz alternating method, when applied to the full potential equation in three dimensions, converge to the true solution geometrically. The assumptions are that the initial guess and the true solution are everywhere subsonic. We use the convergence proof by Tai and Xu and modify it for certain closed convex subsets.     

Computable dimension for ordered fields

The computable dimension of a structure counts the number of computable copies up to computable isomorphism. In this paper, we consider the possible computable dimensions for various classes of computable ordered fields. We show that computable ordered fields with finite transcendence degree are computably stable, and thus have computable dimension 1. We then build computable ordered fields of infinite transcendence degree which have infinite computable dimension, but also such fields which are computably categorical. Finally, we show that 1 is the only possible finite computable dimension for any computable archimedean field.     

Noncoercive Boundary Value Problems for Elliptic Partial Differential and Differential-Operator Equations

In this paper we find conditions guarantee that irregular boundary value problems for elliptic differential-operator equations of the second order in an interval are fredholm. We apply this result to find some algebraic conditions guarantee that irregular boundary value problems for elliptic partial differential equations of the second order in cylindrical domains are fredholm. Apparently this is the first paper where the regularity of an elliptic boundary value problem is not satisfied on a manifold of the dimension equal to dimension of the boundary. Nevertheless the problem is fredholm and the resolvent is compact. It is interesting to note that the considered boundary value problems for elliptic equations in a cylinder being with separating variables are noncoercive.     

Noncoercive boundary value problems for the Laplace equation with a spectral parameter

In this paper we find conditions that guarantee that irregular boundary value problems for elliptic differential-operator equations of the second order in an interval are coercive with a defect and fredholm; compactness of a resolvent and estimations by spectral parameter; completeness of root functions. We apply this result to find some algebraic conditions that guarantee that irregular boundary value problems for elliptic partial differential equations of the second order in cylindrical domains have the same properties. Apparently this is the first paper where the regularity of an elliptic boundary value problem is not satisfied on a manifold of the dimension equal to the dimension of the boundary. Nevertheless, the problem is fredholm and the resolvent is compact. It is interesting to note that the considered boundary value problems for elliptic equations in a cylinder being with separating variables are noncoercive. I wish to thank the referee whose comments helped me improve the style of the paper. Supported in part by the Israel Ministry of Science and Technology and the Israel-France Rashi Foundation.     

Asymptotic behavior of the spectrum of variational problems on the solutions of elliptic systems

One computes the principal term of the asymptotics of the spectrum of variational problems of the form B[u]/A[u] considered on the solutions of elliptic systems Lu=0 on a compact manifold with boundary. Previously, the corresponding result has been obtained by the authors under the additional condition of the existence of an elliptic boundary problem for the operator L. Now this restriction is removed.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 115, pp. 23–39, 1982.     

A posteriori error analysis for linearization of nonlinear elliptic problems and their discretizations

The paper is devoted to a posteriori quantitative analysis for errors caused by linearization of non-linear elliptic boundary value problems and their finite element realizations. We employ duality theory in convex analysis to derive computable bounds on the difference between the solution of a non-linear problem and the solution of the linearized problem, by using the solution of the linearized problem only. We also derive computable bounds on differences between finite element solutions of the nonlinear problem and finite element solutions of the linearized problem, by using finite element solutions of the linearized problem only. Numerical experiments show that our a posteriori error bounds are efficient.     

Application of Analogues of General Kolosov–Muskhelishvili Representations in the Theory of Elastic Mixtures

The existence and uniqueness of a solution of the first, the second and the third plane boundary value problem are considered for the basic homogeneous equations of statics in the theory of elastic mixtures. Applying the general Kolosov–Muskhelishvili representations from [1], these problems can be split and reduced to the first and the second boundary value problem for an elliptic equation which structurally coincides with the equation of statics of an isotropic elastic body.     

Effectiveness in RPL, with applications to continuous logic

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of ?ukasiewicz logic) and continuous logic, and prove effective versions of some related theorems in model theory. We show how to reduce continuous logic to rational Pavelka logic. We also define notions of computability and decidability of a model for logics with computable, but uncountable, set of truth values; we show that provability degree of a formula with respect to a linear theory is computable, and use this to carry out an effective Henkin construction. Therefore, for any effectively given consistent linear theory in continuous logic, we effectively produce its decidable model. This is the best possible, since we show that the computable model theory of continuous logic is an extension of computable model theory of classical logic. We conclude with noting that the unique separable model of a separably categorical and computably axiomatizable theory (such as that of a probability space or an L^p Banach lattice) is decidable.     

The complexity of central series in nilpotent computable groups

The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are independent even when restricted to groups which admit computable orders.     

Borel complexity and computability of the Hahn–Banach Theorem

The classical Hahn–Banach Theorem states that any linear bounded functional defined on a linear subspace of a normed space admits a norm-preserving linear bounded extension to the whole space. The constructive and computational content of this theorem has been studied by Bishop, Bridges, Metakides, Nerode, Shore, Kalantari Downey, Ishihara and others and it is known that the theorem does not admit a general computable version. We prove a new computable version of this theorem without unrolling the classical proof of the theorem itself. More precisely, we study computability properties of the uniform extension operator which maps each functional and subspace to the set of corresponding extensions. It turns out that this operator is upper semi-computable in a well-defined sense. By applying a computable version of the Banach–Alaoglu Theorem we can show that computing a Hahn–Banach extension cannot be harder than finding a zero in a compact metric space. This allows us to conclude that the Hahn–Banach extension operator is -computable while it is easy to see that it is not lower semi-computable in general. Moreover, we can derive computable versions of the Hahn–Banach Theorem for those functionals and subspaces which admit unique extensions. This work has been partially supported by the National Research Foundation (NRF) Grant FA2005033000027 on “Computable Analysis and Quantum Computing”. An extended abstract version has been published in the conference proceedings [7].     

Fredholm property of elliptic boundary value problems for partial differential and differential- operator equations

In this paper we find conditions on boundary value problems for elliptic differential-operator equations of the 4-th order in an interval to be fredholm. Apparently, this is the first publication for elliptic differential-operator equations of the 4-th order, when the principal part of the equation has the form u′?n(t) + Au″(t) + Bu(t), where AB^-1/2 is a bounded operator and is not compact. As an application we find some algebraic conditions on boundary value problems for elliptic partial equations of the 4-th order in cylindrical domains to be fredholm. Note that a new method has actually been suggested here for investigation of boundary value problems for elliptic partial equations of the 4-th order.     

On a-Posteriori Error Estimate of Approximate Solutions to a Mildly Nonlinear Nonpotential Elliptic Boundary Value Problem

The paper deals with the construction of a computable a-posteriori error estimate of the approximate solution to some nonpotential nonlinear elliptic boundary value problems. The convergence of the presented error estimate to the true error is proved. The method is illustrated on some numerical examples.     

Positive eigenvalues for nonlinear multivalued noncompact operators with applications to differential operators

The first part of Section 1 contains two theorems concerning the existence of positive eigenvalues and corresponding eigenvectors for multivalued and not necessarily compact mappings. Theorem 1 contains as special cases the Birkhoff-Kellogg and Krasnoselskii theorems for single-valued compact mappings while Theorem 2 includes a single-valued result of Reich and some results of Schaefer concerning the existence of positive eigenvalues. The second part of Section 1 contains Theorem 3, which extends another result of Schaefer for positive compact mappings to positive eigenvalue problems involving not necessarily compact mappings. In Section 2 our Theorem 1 is applied to positive eigenvalue problems involving quasilinear ordinary integro-differential operators, quasilinear elliptic operators, and nonlinear ordinary differential operators.     

Rigidity for regular functions over Hamilton and Cayley numbers and a boundary Schwarz' Lemma

A new theory of regular functions over the skew field of Hamilton numbers (quaternions) and in the division algebra of Cayley numbers (octonions) has been recently introduced by Gentili and Struppa (Adv. Math. 216 (2007) 279–301). For these functions, among several basic results, the analogue of the classical Schwarz' Lemma has been already obtained. In this paper, following an interesting approach adopted by Burns and Krantz in the holomorphic setting, we prove some boundary versions of the Schwarz' Lemma and Cartan's Uniqueness Theorem for regular functions. We are also able to extend to the case of regular functions most of the related “rigidity” results known for holomorphic functions.     

On solution uniqueness of elliptic boundary value problems

In this paper, we consider the problem of solution uniqueness for the second order elliptic boundary value problem, by looking at its finite element or finite difference approximations. We derive several equivalent conditions, which are simpler and easier than the boundedness of the entries of the inverse matrix given in Yamamoto et al., [T. Yamamoto, S. Oishi, Q. Fang, Discretization principles for linear two-point boundary value problems, II, Numer. Funct. Anal. Optim. 29 (2008) 213–224]. The numerical experiments are provided to support the analysis made. Strictly speaking, the uniqueness of solution is equivalent to the existence of nonzero eigenvalues in the corresponding eigenvalue problem, and this condition should be checked by solving the corresponding eigenvalue problems. An application of the equivalent conditions is that we may discover the uniqueness simultaneously, while seeking the approximate solutions of elliptic boundary equations.     

Sous-solutions d'équations elliptiques dans L1

We study subsolutions for semilinear elliptic boundary value problems in L1. We consider as well nonlinear as linear boundary conditions. The nonlinear functions may be multivated. We characterize in terms of p.d.e. the subsolutions defined by a nonlinear functional analysis argument. Applications are given to obtain existence results for semilinear elliptic boundary value problems and comparison and estimates for nonlinear parabolic boundary value problems.     

Polynomial approximation on tetrahedrons in the finite element method

The main aim of this paper is to derive an interpolation theorem (Theorem 1) which implies both a construction of once continuously differentiable functions which are piecewise polynomial in a domain divided into tetrahedrons (Corollary 1 and Theorem 2) and convergence theorems of the finite element method for solving three-dimensional elliptic boundary value problems of the fourth order (Theorems 3 and 4).     

一类具有小周期系数的椭圆型边值问题的双尺度渐近分析方法

1．引言在大型水坝和海港等大体积混凝土结构的施工及运行中,为防止结构开裂,必须采取水管冷却等控制温度技术;在大型仓储和化学反应器中,为了控制温度,必须采用有规律的供暖或冷却技术;刚性夹杂复合材料结构的稳态问题以及具有周期性约束的是网结构的平衡问题等．这些工程实际问题,在稳定状态或某个瞬时状态,都可以归结为一类具有周期性的复杂构造的椭圆型方程边值问题：其中路（x）二a。柞）,河为结构所占据的区域,其。维模型如图1．l所示．图1．1具有周期性特征的二维结构这类问题的特点是材料系数a勺（x）呈现高度振荡的以。…     

Hopf’s boundary point lemma,the Krein–Rutman theorem and a special domain

Hopf’s Boundary Point Lemma and the Krein–Rutman Theorem combine to a strong tool for second order elliptic boundary value problems on smooth domains. We show an example of a domain where this combination cannot be used. Moreover we recall some generalisations of both results, that seem to be known to the specialists but which are also hardly traceable in the literature. Several examples illustrate the optimal results.