Best Approximation in Numerical Radius

Let X be a reflexive Banach space. In this article, we give a necessary and sufficient condition for an operator T ∈ 𝒦(X) to have the best approximation in numerical radius from the convex subset 𝒰 ? 𝒦(X), where 𝒦(X) denotes the set of all linear, compact operators from X into X. We also present an application to minimal extensions with respect to the numerical radius. In particular, some results on best approximation in norm are generalized to the case of the numerical radius.     

A new approximation for the generalized fractional derivative and its application to generalized fractional diffusion equation

In this paper, we derive a fourth order approximation for the generalized fractional derivative that is characterized by a scale function z(t) and a weight function w(t) . Combining the new approximation with compact finite difference method, we develop a numerical scheme for a generalized fractional diffusion problem. The stability and convergence of the numerical scheme are proved by the energy method, and it is shown that the temporal and spatial convergence orders are both 4. Several numerical experiments are provided to illustrate the efficiency of our scheme.     

Numerical treatment for nonlinear Brusselator chemical model

Nowadays, numerical models have great importance in every field of science, especially for solving the nonlinear differential equations, partial differential equations, biochemical reactions, etc. The total time evolution of the reactant species which interacts with other species is simulated by the Runge-Kutta of order four (RK4) and by Non-Standard finite difference (NSFD) method. A NSFD model has been constructed for the biochemical reaction problem and numerical experiments are performed for different values of discretization parameter h. The results are compared with the well-known numerical scheme, i.e. RK4. The developed scheme NSFD gives better results than RK4.     

A semi-discretization method based on quartic splines for solving one-space-dimensional hyperbolic equations

In this paper, based on C³ quartic splines, a semi-discretization method containing two schemes is constructed to solve one-space-dimensional linear hyperbolic equations. It is shown that both schemes are unconditionally stable and their approximation orders are of O(k⁵+h⁴) and of O(k⁷+h⁴) with k and h being step sizes in time and space, respectively, which are much higher than those of other published schemes. A numerical example is presented and the results are compared with other published numerical results.     

Numerical solution of Volterra integral and integro-differential equations with rapidly vanishing convolution kernels

Variable stepsize algorithms for the numerical solution of nonlinear Volterra integral and integro-differential equations of convolution type are described. These algorithms are based on an embedded pair of Runge–Kutta methods of order p=5 and p=4 proposed by Dormand and Prince with interpolation of uniform order p=4. They require O(N) number of kernel evaluations, where N is the number of steps. The cost of the algorithms can be further reduced for equations that have rapidly vanishing convolution kernels, by using waveform relaxation iterations after computing the numerical approximation by variable stepsize algorithm on some initial interval. AMS subject classification (2000)  65R20, 45L10, 93C22     

On the Multiplicity of Solutions Of a Differential Equation Arising in Chemical Reactor Theory

Consider the boundary value problem where β ? 0, τ ? 0. We are concerned with a mathematically rigorous numerical study of the number of solutions in any bounded portion of the positive quadrant (τ ? 0, β ? 0) of the τ, β plane. These correct computational results may then be matched with asymptotic (β→∞, τ ? 0) results developed earlier. These numerical results are based on the development of a posteriori error estimates for the numerical solution of an associated initial-value problem and a priori bounds on .     

Exponential spline solutions for a class of two point boundary value problems over a semi-infinite range

In this paper, we developed numerical methods of order O(h ²) and O(h ⁴) based on exponential spline function for the numerical solution of class of two point boundary value problems over a Semi-infinite range. The present approach gives better approximations over all the existing finite difference methods. Properties of the infinite linear system are established. Convergence analysis and a bound on the approximate solution are discussed. Test problem with various kinds of boundary conditions is included to illustrate the practical usefulness and superiority of our methods.     

Irreducible Numerical Semigroups Having Toms Decomposition

In this article we prove that if S is an irreducible numerical semigroup and S is generated by an interval or S has multiplicity 3 or 4, then it enjoys Toms decomposition. We also prove that if a numerical semigroup can be expressed as an expansion of a numerical semigroup generated by an interval, then it is irreducible and has Toms decomposition.     

Two energy-conserving and compact finite difference schemes for two-dimensional Schrödinger-Boussinesq equations

In this paper, we study two compact finite difference schemes for the Schrödinger-Boussinesq (SBq) equations in two dimensions. The proposed schemes are proved to preserve the total mass and energy in the discrete sense. In our numerical analysis, besides the standard energy method, a “cut-off” function technique and a “lifting” technique are introduced to establish the optimal H¹ error estimates without any restriction on the grid ratios. The convergence rate is proved to be of O(τ² + h⁴) with the time step τ and mesh size h. In addition, a fast finite difference solver is designed to speed up the numerical computation of the proposed schemes. The numerical results are reported to verify the error estimates and conservation laws.

     

The load transfer between two rigid spherical inclusions in an elastic medium

The paper is concerned with the load transfer problem between two rigid spherical inclusions in an elastic matrix. A reflection-type formula is developed which is accurate up to and including terms ofO(a/R)⁴, wherea is the maximum radius of the inclusions, andR is the centre-to-centre distance between the two inclusions. Asymptotic results are derived at near touching showing a weak logarithmic singularity in the load transfer. The results are verified by a direct numerical calculation using a boundary collocation method. The numerical method uses Kelvin's general solution as the basis functions for the approximate solution and is highly accurate and efficient, even at near touching.     

On the distribution of the zeros of the cubic <Emphasis Type="Italic">L</Emphasis>-function

The distribution of the real parts of the zeros of the cubic L-function is considered. Some observations based on numerical results are presented. Bibliography: 4 titles.     

B-Spline collocation method for linear and nonlinear Fredholm and Volterra integro-differential equations

A numerical method based on quintic B-spline has been developed to solve the linear and nonlinear Fredholm and Volterra integro-differential equations up to order 4. The solution and its derivatives are collocated by quintic B-spline and then the integral equation is approximated by the 4-points Gauss–Turán quadrature formula with respect to the weight function Legendre. The error analysis of proposed numerical method is studied theoretically. Numerical results are given to illustrate the efficiency of the proposed method which shows that our method can be applied for large values of N. The results are compared with the results obtained by other methods which show that our method is accurate.     

Numerical Burniat and Irregular Surfaces

In this paper, we construct three numerical Burniat surfaces as desingularizations of double planes of degree >10. Two are surfaces having the bigenus P ₂=4 and the third is a surface having the bigenus P ₂=5. In addition, another surface of general type is constructed as a desingularization of a double plane of degree 12 having the birational invariants: q=p _g =1, P ₂=4. One of the numerical Burniat surfaces with P ₂=4 is obtained as a desingularization of a double plane of degree 22 with an irreducible branch locus, so it is a good candidate for having torsion zero. Moreover, its bicanonical transformation seems to be birational.     

Numerical integration of 2‐D integrals based on local bivariate C 1 quasi‐interpolating splines

In this paper cubature formulas based on bivariate C ¹ local polynomial splines with a four directional mesh [4] are generated and studied. Some numerical results with comparison with other methods are given. Moreover the method proposed is applied to the numerical evaluation of 2‐D singular integrals defined in the Hadamard finite part sense. Computational features, convergence properties and error bounds are proved. This revised version was published online in August 2006 with corrections to the Cover Date.     

Numerical Schottky Uniformizations

A real algebraic curve of algebraic genus g ≥ 2 is a pair (S, τ), where S is a closed Riemann surface of genus g and τ is a reflection on S (anticonformal involution with fixed points). In this note, we discuss a numerical (Burnside) program which permits to obtain a Riemann period matrix of the surface S in terms of an uniformizing real Schottky group. If we denote by Aut₊(S, τ) the group of conformal automorphisms of S commuting with the real structure τ, then it is a well known fact that |Aut₊(S,τ)| ≥ 12(g−1). We say that (S,τ) is maximally symmetric if |Aut₊(S,τ)|=12(g−1). We work explicitly such a numerical program in the case of maximally symmetric real curves of genus two. We construct a real Schottky uniformization for each such real curve and we use the numerical program to obtain a real algebraic curve, a Riemann period matrix and the accessory parameters in terms of the corresponding Schottky uniformization. In particular, we are able to give for Bolza’s curve a Schottky uniformization (at least numerically), providing an example for which the inverse uniformization theorem is numerically solved.Partially supported by Projects Fondecyt 1030252 1030373 and UTFSM 12.03.21     

A new efficient approach to the characterization of D‐stable matrices

The concept of D‐stability is relevant for stable square matrices of any order, especially when they appear in ordinary differential systems modeling physical problems. Indeed, D‐stability was treated from different points of view in the last 50 years, but the problem of characterization of a general D‐stable matrix was solved for low‐order matrices only (ie, up to order 4). Here, a new approach is proposed within the context of numerical linear algebra. Starting from a known necessary and sufficient condition, other simpler equivalent necessary and sufficient conditions for D‐stability are proved. Such conditions turn out to be computationally more appealing for symbolic software, as discussed in the reported examples. Therefore, a new symbolic method is proposed to characterize matrices of order greater than 4, and then it is used in some numerical examples, given in details.     

Constrained mountain pass algorithm for the numerical solution of semilinear elliptic problems

Summary. A new numerical algorithm for solving semilinear elliptic problems is presented. A variational formulation is used and critical points of a C¹-functional subject to a constraint given by a level set of another C¹-functional (or an intersection of such level sets of finitely many functionals) are sought. First, constrained local minima are looked for, then constrained mountain pass points. The approach is based on the deformation lemma and the mountain pass theorem in a constrained setting. Several examples are given showing new numerical solutions in various applications.Mathematics Subject Classification (2000):35J20, 65N99The author would like to thank the referee for helpful comments in particular on Section 4.     

Finite element approximation of a semilinear elliptic problem with a singular nonlinearity

Given , we consider the following problem: find , such that where or 3, and in . We prove and error bounds for the standard continuous piecewise linear Galerkin finite element approximation with a (weakly) acute triangulation. Our bounds are nearly optimal. In addition, for d = 1 and 2 and we analyze a more practical scheme involving numerical integration on the nonlinear term. We obtain nearly optimal and error bounds for d = 1. For this case we also present some numerical results. Received July 4, 1996 / Revised version received December 18, 1997     

A quadrature based method for evaluating exponential-type functions for exponential methods

We present a quadrature-based method to evaluate exponential-like operators required by different kinds of exponential integrators. The method approximates these operators by means of a quadrature formula that converges like O(e ^−cK ), with K the number of quadrature nodes, and it is useful when solving parabolic equations. The approach allows also the evaluation of the associated scalar mappings. The method is based on numerical inversion of sectorial Laplace transforms. Several numerical illustrations are provided to test the algorithm, including examples with a mass matrix and the application of the method inside the MATLAB package EXP4, an adaptive solver based on an exponential Runge–Kutta method.     

Asymptotic-preserving &; well-balanced schemes for radiative transfer and the Rosseland approximation

Summary. We are concerned with efficient numerical simulation of the radiative transfer equations. To this end, we follow the Well-Balanced approachs canvas and reformulate the relaxation term as a nonconservative product regularized by steady-state curves while keeping the velocity variable continuous. These steady-state equations are of Fredholm type. The resulting upwind schemes are proved to be stable under a reasonable parabolic CFL condition of the type tO(x²) among other desirable properties. Some numerical results demonstrate the realizability and the efficiency of this process.Mathematics Subject Classification (1991): 82C70, 65M06, 35B25Work partially supported by EEC network #HPRN-CT-2002-00282.Revised version received July 21, 2003