A new approach for admissibility analysis of the direct discontinuous Galerkin method through Hilbert matrices

This article continues the study of the so‐called direct discontinuous Galerkin (DDG) method for diffusion problems as developed in [Liu and Yan, SIAM J Numer Anal 47 (2009), 475–698;, Liu and Yan, Commun Comput Phys 8 (2010), 541–564; C. Vidden and J. Yan, J Comput Math 31 (2013), 638–662; H. Liu, Math Comp (in press)]. A key feature of the DDG method lies with the numerical flux design which includes two (or more) free parameters. This article identifies the class of all admissible numerical flux choices (Theorem 2.2) for degree n polynomial approximations for the symmetric DDG method [C. Vidden and J. Yan, J Comput Math 31 (2013), 638–662], guaranteeing stability of the resulting method. Our main contribution is the new technique of analysis for the DDG admissibility condition. The strategy is to directly evaluate the admissibility condition (Lemma 2.4) by choosing a simple polynomial basis. The admissibility condition is then transformed into an eigenvalue problem resulting in showing needed properties of inverse Hilbert matrices (Lemma 2.3, Appendix). Numerical tests are provided to confirm theoretical results. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 350–367, 2016     

Legendre modified moments for Euler's constant

Polynomial moments are often used for the computation of Gauss quadrature to stabilize the numerical calculation of the orthogonal polynomials, see [W. Gautschi, Computational aspects of orthogonal polynomials, in: P. Nevai (Ed.), Orthogonal Polynomials-Theory and Practice, NATO ASI Series, Series C: Mathematical and Physical Sciences, vol. 294. Kluwer, Dordrecht, 1990, pp. 181–216 [6]; W. Gautschi, On the sensitivity of orthogonal polynomials to perturbations in the moments, Numer. Math. 48(4) (1986) 369–382 [5]; W. Gautschi, On generating orthogonal polynomials, SIAM J. Sci. Statist. Comput. 3(3) (1982) 289–317 [4]] or numerical resolution of linear systems [C. Brezinski, Padé-type approximation and general orthogonal polynomials, ISNM, vol. 50, Basel, Boston, Stuttgart, Birkhäuser, 1980 [3]]. These modified moments can also be used to accelerate the convergence of sequences to a real or complex numbers if the error satisfies some properties as done in [C. Brezinski, Accélération de la convergence en analyse numérique, Lecture Notes in Mathematics, vol. 584. Springer, Berlin, New York, 1977; M. Prévost, Padé-type approximants with orthogonal generating polynomials, J. Comput. Appl. Math. 9(4) (1983) 333–346]. In this paper, we use Legendre modified moments to accelerate the convergence of the sequence H_n-log(n+1) to the Euler's constant γ. A formula for the error is given. It is proved that it is a totally monotonic sequence. At last, we give applications to the arithmetic property of γ.     

Solution of nonlinear convection-diffusion problems by a conservative Galerkin-characteristics method

We consider a scheme for nonlinear (degenerate) convection dominant diffusion problems that arise in contaminant transport in porous media with equilibrium adsorption isotherm. This scheme is based on a regularization relaxation scheme that has been introduced by Jäger and Ka?ur (Numer Math 60:407–427, 1991; M²AN Math Model Numer Anal 29(N5):605–627, 1995) with a type of numerical integration by Bermejo (SIAM J Numer Anal 32:425–455, 1995) to the modified method of characteristics with adjusted advection MMOCAA that was recently developed by Douglas et al. (Numer Math 83(3):353–369, 1999; Comput Geosci 1:155–190, 1997). We present another variant of adjusting advection method. The convergence of the scheme is proved. An error estimate of the approximated scheme is derived. Computational experiments are carried out to illustrate the capability of the scheme to conserve the mass.     

On the convergence of Newton-type methods under mild differentiability conditions

We introduce the new idea of recurrent functions to provide a new semilocal convergence analysis for Newton-type methods, under mild differentiability conditions. It turns out that our sufficient convergence conditions are weaker, and the error bounds are tighter than in earlier studies in some interesting cases (Chen, Ann Inst Stat Math 42:387–401, 1990; Chen, Numer Funct Anal Optim 10:37–48, 1989; Cianciaruso, Numer Funct Anal Optim 24:713–723, 2003; Cianciaruso, Nonlinear Funct Anal Appl 2009; Dennis 1971; Deuflhard 2004; Deuflhard, SIAM J Numer Anal 16:1–10, 1979; Gutiérrez, J Comput Appl Math 79:131–145, 1997; Hernández, J Optim Theory Appl 109:631–648, 2001; Hernández, J Comput Appl Math 115:245–254, 2000; Huang, J Comput Appl Math 47:211–217, 1993; Kantorovich 1982; Miel, Numer Math 33:391–396, 1979; Miel, Math Comput 34:185–202, 1980; Moret, Computing 33:65–73, 1984; Potra, Libertas Mathematica 5:71–84, 1985; Rheinboldt, SIAM J Numer Anal 5:42–63, 1968; Yamamoto, Numer Math 51: 545–557, 1987; Zabrejko, Numer Funct Anal Optim 9:671–684, 1987; Zinc̆ko 1963). Applications and numerical examples, involving a nonlinear integral equation of Chandrasekhar-type, and a differential equation are also provided in this study.     

Weak convergence theorem for Lipschizian pseudocontraction semigroups in Banach spaces

The purpose of this paper is to study the weak convergence problems of the irnplicity iteration process for Lipschitzian pseudocontraction semigroups in general Banach spaces. The results presented in this paper extend and improve the corresponding results of Zhou [Nonlinear Anal., 68, 2977-2983 （2008）], Chen, et ah [J. Math. Anal. Appl., 314, 701 709 （2006）], Xu and Ori [Numer. Funct. Anal. Optim, 22, 767-773 （2001）] and Osilike [J. Math. Anal. Appl., 294, 73-81 （2004）]. Keywords     

On the stability of the J transformation

The stability of a large class of nonlinear sequence transformations is analyzed. Considered are variants of the J transformation [17]. Suitable variants of this transformation belong to the most successful extrapolation algorithms that are known [20]. Similar to recent results of Sidi, it is proved that the _p {J} transformations, the Weniger S transformation, the Levin transformation and a special case of the generalized Richardson extrapolation process of Sidi are S-stable. An efficient algorithm for the calculation of stability indices is presented. A numerical example demonstrates the validity of the approach. This revised version was published online in June 2006 with corrections to the Cover Date.     

A minimum entropy principle of high order schemes for gas dynamics equations

The entropy solutions of the compressible Euler equations satisfy a minimum principle for the specific entropy (Tadmor in Appl Numer Math 2:211–219, 1986). First order schemes such as Godunov-type and Lax-Friedrichs schemes and the second order kinetic schemes (Khobalatte and Perthame in Math Comput 62:119–131, 1994) also satisfy a discrete minimum entropy principle. In this paper, we show an extension of the positivity-preserving high order schemes for the compressible Euler equations in Zhang and Shu (J Comput Phys 229:8918–8934, 2010) and Zhang et?al. (J Scientific Comput, in press), to enforce the minimum entropy principle for high order finite volume and discontinuous Galerkin (DG) schemes.     

Remarks on an overdetermined boundary value problem

We modify and extend proofs of Serrin’s symmetry result for overdetermined boundary value problems from the Laplace-operator to a general quasilinear operator and remove a strong ellipticity assumption in Philippin (Maximum principles and eigenvalue problems in partial differential equations (Knoxville, TN, 1987), Longman Sci. Tech., Pitman Res. Notes Math. Ser., Harlow, 175, pp. 34–48, 1988) and a growth assumption in Garofalo and Lewis (A symmetry result related to some overdetermined boundary value problems, Am. J. Math. 111, 9–33, 1989) on the diffusion coefficient A, as well as a starshapedness assumption on Ω in Fragalà et al. (Overdetermined boundary value problems with possibly degenerate ellipticity: a geometric approach. Math. Zeitschr. 254, 117–132, 2006).     

On the Gauss–Newton method

We provide a new semilocal convergence analysis of the Gauss–Newton method (GNM) for solving nonlinear equation in the Euclidean space. Using a combination of center-Lipschitz, Lipschitz conditions, and our new idea of recurrent functions, we provide under the same or weaker hypotheses than before (Ben-Israel, J. Math. Anal. Appl. 15:243–252, 1966; Chen and Nashed, Numer. Math. 66:235–257, 1993; Deuflhard and Heindl, SIAM J. Numer. Anal. 16:1–10, 1979; Guo, J. Comput. Math. 25:231–242, 2007; Häußler, Numer. Math. 48:119–125, 1986; Hu et al., J. Comput. Appl. Math. 219:110–122, 2008; Kantorovich and Akilov, Functional Analysis in Normed Spaces, Pergamon, Oxford, 1982), a finer convergence analysis. The results can be extended in case outer or generalized inverses are used. Numerical examples are also provided to show that our results apply, where others fail (Ben-Israel, J. Math. Anal. Appl. 15:243–252, 1966; Chen and Nashed, Numer. Math. 66:235–257, 1993; Deuflhard and Heindl, SIAM J. Numer. Anal. 16:1–10, 1979; Guo, J. Comput. Math. 25:231–242, 2007; Häußler, Numer. Math. 48:119–125, 1986; Hu et al., J. Comput. Appl. Math. 219:110–122, 2008; Kantorovich and Akilov, Functional Analysis in Normed Spaces, Pergamon, Oxford, 1982).     

Third-order iterative methods with applications to Hammerstein equations: A unified approach

The geometrical interpretation of a family of higher order iterative methods for solving nonlinear scalar equations was presented in [S. Amat, S. Busquier, J.M. Gutiérrez, Geometric constructions of iterative functions to solve nonlinear equations. J. Comput. Appl. Math. 157(1) (2003) 197-205]. This family includes, as particular cases, some of the most famous third-order iterative methods: Chebyshev methods, Halley methods, super-Halley methods, C-methods and Newton-type two-step methods. The aim of the present paper is to analyze the convergence of this family for equations defined between two Banach spaces by using a technique developed in [J.A. Ezquerro, M.A. Hernández, Halley’s method for operators with unbounded second derivative. Appl. Numer. Math. 57(3) (2007) 354-360]. This technique allows us to obtain a general semilocal convergence result for these methods, where the usual conditions on the second derivative are relaxed. On the other hand, the main practical difficulty related to the classical third-order iterative methods is the evaluation of bilinear operators, typically second-order Fréchet derivatives. However, in some cases, the second derivative is easy to evaluate. A clear example is provided by the approximation of Hammerstein equations, where it is diagonal by blocks. We finish the paper by applying our methods to some nonlinear integral equations of this type.     

A unified approach to a posteriori error estimation using element residual methods

Summary This paper deals with the problem of obtaining numerical estimates of the accuracy of approximations to solutions of elliptic partial differential equations. It is shown that, by solving appropriate local residual type problems, one can obtain upper bounds on the error in the energy norm. Moreover, in the special case of adaptiveh-p finite element analysis, the estimator will also give a realistic estimate of the error. A key feature of this is the development of a systematic approach to the determination of boundary conditions for the local problems. The work extends and combines several existing methods to the case of fullh-p finite element approximation on possibly irregular meshes with, elements of non-uniform degree. As a special case, the analysis proves a conjecture made by Bank and Weiser [Some A Posteriori Error Estimators for Elliptic Partial Differential Equations, Math. Comput.44, 283–301 (1985)].     

Eigenvalue patterned condition numbers: Toeplitz and Hankel cases

We continue the study started in [Noschese and Pasquini, Eigenvalue condition numbers: zero-structured versus traditional. J. Comput. Appl. Math. 185 (2006) 174–189] concerning the sensitivity of simple eigenvalues of a matrix A to perturbations in A   that belong to a chosen subspace of matrices. In [Noschese and Pasquini, Eigenvalue condition numbers: zero-structured versus traditional. J. Comput. Appl. Math. 185 (2006) 174–189] the zero-structured perturbations have been considered. Here we focus on patterned perturbations, and the cases of the Toeplitz and of the Hankel matrices are investigated in detail. Useful expressions of the absolute patterned condition number of the eigenvalue λ$\lambda$ and of the analogue of the matrix yx^H${\mathit{yx}}^{\mathrm{H}}$, which leads to the traditional condition number of λ$\lambda$, are given. MATLAB codes are defined to compare traditional, zero-structured and patterned condition numbers. A report on significant numerical tests is included.     

A communication-less parallel algorithm for tridiagonal Toeplitz systems

Diagonally dominant tridiagonal Toeplitz systems of linear equations arise in many application areas and have been well studied in the past. Modern interest in numerical linear algebra is often focusing on solving classic problems in parallel. In McNally [Fast parallel algorithms for tri-diagonal symmetric Toeplitz systems, MCS Thesis, University of New Brunswick, Saint John, 1999], an m processor Split & Correct algorithm was presented for approximating the solution to a symmetric tridiagonal Toeplitz linear system of equations. Nemani [Perturbation methods for circulant-banded systems and their parallel implementation, Ph.D. Thesis, University of New Brunswick, Saint John, 2001] and McNally (2003) adapted the works of Rojo [A new method for solving symmetric circulant tri-diagonal system of linear equations, Comput. Math. Appl. 20 (1990) 61–67], Yan and Chung [A fast algorithm for solving special tri-diagonal systems, Computing 52 (1994) 203–211] and McNally et al. [A split-correct parallel algorithm for solving tri-diagonal symmetric Toeplitz systems, Internat. J. Comput. Math. 75 (2000) 303–313] to the non-symmetric case. In this paper we present relevant background from these methods and then introduce an m processor scalable communication-less approximation algorithm for solving a diagonally dominant tridiagonal Toeplitz system of linear equations.     

Some argument inequalities for certain analytic functions

For analytic functions f(z) in the open unit disk U and convex functions g(z) in U, Nunokawa et al. [NUNOKAWA, M.—OWA, S.—NISHIWAKI, J.—KUROKI, K.—HAYAMI, T: Differential subordination and argumental property, Comput. Math. Appl. 56 (2008), 2733–2736] have proved one theorem which is a generalization of the result [POMMERENKE, CH.: On close-toconvex analytic functions, Trans. Amer. Math. Soc. 114 (1965), 176–186]. The object of the present paper is to generalize the theorem due to Nunokawa et al..     

Calculation of the complete elliptic integrals with complex modulus

Summary This is an Addendum to a preceding paper of Morita and Horiguchi [Numer. Math.20, 425–430 (1973)]. Attention is called to an error in the algol procedure given in that paper. A corrected procedure of calculating the complete elliptic integrals of the first and the second kind with complex modulusk is presented, in the form that is itself useful in the calculation of their analytic continuations over the branch cuts.     

Mixed finite element analysis of a thermally nonlinear coupled problem

In Loula and Zhou [Comput Appl Math 20 (2001), 321–339], a thermally coupled nonlinear elliptic system modeling a large class of engineering problems was considered, and some mathematical and numerical analyses (C⁰ Lagrangian finite elements combined with a fixed point algorithm) were given. To continue our work, we propose in this article a mixed method for the potential equation and present the corresponding analyses and numerical implementations. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Finite element methods with numerical quadrature for elliptic problems with smooth interfaces

The purpose of this paper is to study the effect of the numerical quadrature on the finite element approximation to the exact solution of elliptic equations with discontinuous coefficients. Due to low global regularity of the solution, it seems difficult to achieve optimal order of convergence with classical finite element methods [Z. Chen, J. Zou, Finite element methods and their convergence for elliptic and parabolic interface problems, Numer. Math. 79 (1998) 175-202]. We derive error estimates in finite element method with quadrature for elliptic interface problems in a two-dimensional convex polygonal domain. Optimal order error estimates in L² and H¹ norms are shown to hold even if the regularity of the solution is low on the whole domain. Finally, numerical experiment for two dimensional test problem is presented in support of our theoretical findings.     

Analysis of the Kleiser-Schumann method for a family of mixed finite elements for the Stokes equations

We study the Stokes problem by using a mixed finite element method introduced by Stenberg [Numer. Math. 56 , 827 (1990)] and adapt it to the splitting introduced by Canuto and Sacchi Landriani [Numer. Math. 50 , 217 (1986)] and Chinosi and Comodi [Numer. Methods Partial Different. Equations 7 , 363 (1991)], by using the incompressibility condition to implicitly define a boundary condition for the pressure. © 1994 John Wiley & Sons, Inc.     

Bounds for Asian basket options

In this paper we propose pricing bounds for European-style discrete arithmetic Asian basket options in a Black and Scholes framework. We start from methods used for basket options and Asian options. First, we use the general approach for deriving upper and lower bounds for stop-loss premia of sums of non-independent random variables as in Kaas et al. [Upper and lower bounds for sums of random variables, Insurance Math. Econom. 27 (2000) 151–168] or Dhaene et al. [The concept of comonotonicity in actuarial science and finance: theory, Insurance Math. Econom. 31(1) (2002) 3–33]. We generalize the methods in Deelstra et al. [Pricing of arithmetic basket options by conditioning, Insurance Math. Econom. 34 (2004) 55–57] and Vanmaele et al. [Bounds for the price of discrete sampled arithmetic Asian options, J. Comput. Appl. Math. 185(1) (2006) 51–90]. Afterwards we show how to derive an analytical closed-form expression for a lower bound in the non-comonotonic case. Finally, we derive upper bounds for Asian basket options by applying techniques as in Thompson [Fast narrow bounds on the value of Asian options, Working Paper, University of Cambridge, 1999] and Lord [Partially exact and bounded approximations for arithmetic Asian options, J. Comput. Finance 10 (2) (2006) 1–52]. Numerical results are included and on the basis of our numerical tests, we explain which method we recommend depending on moneyness and time-to-maturity.     

Error estimates for abstract linear–quadratic optimal control problems using proper orthogonal decomposition

In this paper we investigate POD discretizations of abstract linear–quadratic optimal control problems with control constraints. We apply the discrete technique developed by Hinze (Comput. Optim. Appl. 30:45–61, 2005) and prove error estimates for the corresponding discrete controls, where we combine error estimates for the state and the adjoint system from Kunisch and Volkwein (Numer. Math. 90:117–148, 2001; SIAM J. Numer. Anal. 40:492–515, 2002). Finally, we present numerical examples that illustrate the theoretical results.