Classroom note: The number c in Cauchy's average value theorem

The location of the number c arising from Cauchy's Average Value Theorem is described when the size of the interval is small.     

Carpenter,tractors and microbes for the development of logical–mathematical thinking – the way 10th graders and pre-service teachers solve thinking challenges

The objective of this case study was to investigate the ability of 10th graders and pre-service teachers to solve logical–mathematical thinking challenges. The challenges do not require mathematical knowledge beyond that of primary school but rather an informed use of the problem representation. The percentage of correct answers given by the 10th graders was higher than that of the pre-service teachers. Unlike the 10th graders, some of whom used various strategies for representing the problem, most of the pre-service teachers’ answers were based on a technical algorithm, without using control processes. The obvious conclusion drawn from the findings supports and recommends expanding and enhancing the development of logical–mathematical thinking, both in specific lessons and as an integral part of other lessons in pre-service frameworks.     

Perpetual convertible bonds with credit risk

A convertible bond is a security that the holder can convert into a specified number of underlying shares. We enrich the standard model by introducing some default risk of the issuer. Once default has occured payments stop immediately. In the context of a reduced form model with infinite time horizon driven by a Brownian motion, analytical formulae for the no-arbitrage price of this American contingent claim are obtained and characterised in terms of solutions of free boundary problems. It turns out that the default risk changes the structure of the optimal stopping strategy essentially. Especially, the continuation region may become a disconnected subset of the state space.     

Regularization in Sobolev Spaces with Fractional Order

We study the minimization of a quadratic functional where the Tichonov regularization term is an H ^s -norm with a fractional s > 0. Moreover, pointwise bounds for the unknown solution are given. A multilevel approach as an equivalent norm concept is introduced. We show higher regularity of the solution of the variational inequality. This regularity is used to show the existence of regular Lagrange multipliers in function space. The theory is illustrated by two applications: a Dirichlet boundary control problem and a parameter identification problem.     

On Efficiency Conditions for Nonsmooth Vector Equilibrium Problems with Equilibrium Constraints

In this article, necessary conditions of Fritz John type for weak efficient solutions of a nonsmooth vector equilibrium problem involving equilibrium constraints (VEPEC) in terms of the Clarke subdifferentials are established. Under constraint qualifications which are suitable for (VEPEC), necessary conditions of Kuhn-Tucker type for efficiency are derived. Under assumptions on generalized convexity of data, sufficient conditions for efficiency are developed. Some applications to vector variational inequalities and vector optimization problems with equilibrium constraints are also given.     

Hölder Continuity of Solutions to Parametric Vector Equilibrium Problems with Nonlinear Scalarization

In this article, using the nonlinear scalarization approach by virtue of the nonlinear scalarization function, commonly known as the Gerstewitz function in the theory of vector optimization, Hölder continuity of solution mappings for both set-valued and single-valued cases to parametric vector equilibrium problems is studied. The nonlinear scalarization function is a powerful tool that plays a key role in the proofs, and its main properties (such as sublinearity, continuity, convexity) are fully employed. Especially, its locally and globally Lipschitz properties are provided and the Lipschitz property is first exploited to investigate the Hölder continuity of solutions.     

The projected newton method for solving inverse eigenvalue problems - the case of multiple eigenvaues

This paper deals with the optimal solution of ill-posed linear problems, i.e..linear problems for which the solution operator is unbounded. We consider worst-case ar,and averagecase settings. Our main result is that algorithms having finite error (for a given setting) exist if and only if the solution operator is bounded (in that setting). In the worst-case setting, this means that there is no algorithm for solving ill-posed problems having finite error. In the average-case setting, this means that algorithms having finite error exist if and only lf the solution operator is bounded on the average. If the solution operator is bounded on the average, we find average-case optimal information of cardinality n and optimal algorithms using this information, and show that the average error of these algorithms tends to zero as n→∞. These results are then used to determine the [euro]-complexity, i.e., the minimal costof finding an [euro]-accurate approximation. In the worst-case setting, the [euro]comp1exity of an illposed problem is infinite for all [euro]>0; that is, we cannot find an approximation having finite error and finite cost. In the average-case setting, the [euro]-complexity of an ill-posed problem is infinite for all [euro]>0 iff the solution operator is not bounded on the average, moreover, if the the solutionoperator is bounded on the average, then the [euro]-complexity is finite for all [euro]>0.     

Regularization of nonlinear illposed problems with closed operators

In this paper Tikhonov regularization for nonlinear illposed problems is investigated. The regularization term is characterized by a closed linear operator, permitting seminorm regularization in applications. Results for existence, stability, convergence and con- vergence rates of the solution of the regularized problem in terms of the noise level are given. An illustrating example involving parameter estimation for a one dimensional stationary heat equation is given.     

Regularizing properties of a truncated newton-cg algorithm for nonlinear inverse problems

This paper develops truncated Newton methods as an appropriate tool for nonlinear inverse problems which are ill-posed in the sense of Hadamard. In each Newton step an approximate solution for the linearized problem is computed with the conjugate gradient method as an inner iteration. The conjugate gradient iteration is terminated when the residual has been reduced to a prescribed percentage. Under certain assumptions on the nonlinear operator it is shown that the algorithm converges and is stable if the discrepancy principle is used to terminate the outer iteration. These assumptions are fulfilled, e.g., for the inverse problem of identifying the diffusion coefficient in a parabolic differential equation from distributed data.     

Primal mixed formulations for the coupling of FEM and BEM. Part I: linear problems

We apply the boundary integral equation method and a primal mixed finite element approach to study the weak solvability and Galerkin approximations of linear interior transmission problems arising in potential theory and elastostatics. The existence and uniqueness of solution of the resulting weak formulations and of the associated discrete schemes are derived by using the classical theory for variational problems with constraints. Suitable finite element subspaces of Lagrange type satisfying the compatibility conditions are utilized for defining the Galerkin scheme. The error analysis and corresponding rates of convergence are also provided.