for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> COMPUTER SCIENCE (Total: 1952 journals)
    - ANIMATION AND SIMULATION (29 journals)
    - ARTIFICIAL INTELLIGENCE (96 journals)
    - AUTOMATION AND ROBOTICS (96 journals)
    - CLOUD COMPUTING AND NETWORKS (64 journals)
    - COMPUTER ARCHITECTURE (9 journals)
    - COMPUTER ENGINEERING (10 journals)
    - COMPUTER GAMES (15 journals)
    - COMPUTER PROGRAMMING (23 journals)
    - COMPUTER SCIENCE (1138 journals)
    - COMPUTER SECURITY (43 journals)
    - DATA BASE MANAGEMENT (12 journals)
    - DATA MINING (31 journals)
    - E-BUSINESS (20 journals)
    - E-LEARNING (28 journals)
    - ELECTRONIC DATA PROCESSING (21 journals)
    - IMAGE AND VIDEO PROCESSING (41 journals)
    - INFORMATION SYSTEMS (97 journals)
    - INTERNET (90 journals)
    - SOCIAL WEB (48 journals)
    - SOFTWARE (33 journals)
    - THEORY OF COMPUTING (8 journals)

COMPUTER SCIENCE (1138 journals)                  1 2 3 4 5 6 | Last

Showing 1 - 200 of 872 Journals sorted alphabetically
3D Printing and Additive Manufacturing     Full-text available via subscription   (Followers: 9)
Abakós     Open Access   (Followers: 2)
Academy of Information and Management Sciences Journal     Full-text available via subscription   (Followers: 56)
ACM Computing Surveys     Hybrid Journal   (Followers: 19)
ACM Journal on Computing and Cultural Heritage     Hybrid Journal   (Followers: 5)
ACM Journal on Emerging Technologies in Computing Systems     Hybrid Journal   (Followers: 7)
ACM Transactions on Accessible Computing (TACCESS)     Hybrid Journal   (Followers: 2)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 13)
ACM Transactions on Applied Perception (TAP)     Hybrid Journal   (Followers: 4)
ACM Transactions on Architecture and Code Optimization (TACO)     Hybrid Journal   (Followers: 5)
ACM Transactions on Autonomous and Adaptive Systems (TAAS)     Hybrid Journal   (Followers: 6)
ACM Transactions on Computation Theory (TOCT)     Hybrid Journal   (Followers: 9)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 1)
ACM Transactions on Computer Systems (TOCS)     Hybrid Journal   (Followers: 16)
ACM Transactions on Computer-Human Interaction     Hybrid Journal   (Followers: 10)
ACM Transactions on Computing Education (TOCE)     Hybrid Journal   (Followers: 2)
ACM Transactions on Design Automation of Electronic Systems (TODAES)     Hybrid Journal   (Followers: 1)
ACM Transactions on Economics and Computation     Hybrid Journal  
ACM Transactions on Embedded Computing Systems (TECS)     Hybrid Journal   (Followers: 4)
ACM Transactions on Information Systems (TOIS)     Hybrid Journal   (Followers: 19)
ACM Transactions on Intelligent Systems and Technology (TIST)     Hybrid Journal   (Followers: 9)
ACM Transactions on Interactive Intelligent Systems (TiiS)     Hybrid Journal   (Followers: 4)
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)     Hybrid Journal   (Followers: 7)
ACM Transactions on Reconfigurable Technology and Systems (TRETS)     Hybrid Journal   (Followers: 6)
ACM Transactions on Sensor Networks (TOSN)     Hybrid Journal   (Followers: 8)
ACM Transactions on Speech and Language Processing (TSLP)     Hybrid Journal   (Followers: 9)
ACM Transactions on Storage     Hybrid Journal  
ACS Applied Materials & Interfaces     Full-text available via subscription   (Followers: 17)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 3)
Acta Universitatis Cibiniensis. Technical Series     Open Access  
Ad Hoc Networks     Hybrid Journal   (Followers: 11)
Adaptive Behavior     Hybrid Journal   (Followers: 10)
Advanced Engineering Materials     Hybrid Journal   (Followers: 20)
Advanced Science Letters     Full-text available via subscription   (Followers: 4)
Advances in Adaptive Data Analysis     Hybrid Journal   (Followers: 7)
Advances in Artificial Intelligence     Open Access   (Followers: 13)
Advances in Artificial Neural Systems     Open Access   (Followers: 3)
Advances in Calculus of Variations     Hybrid Journal   (Followers: 2)
Advances in Catalysis     Full-text available via subscription   (Followers: 4)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 14)
Advances in Computer Science : an International Journal     Open Access   (Followers: 13)
Advances in Computing     Open Access   (Followers: 2)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 40)
Advances in Engineering Software     Hybrid Journal   (Followers: 22)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 9)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 21)
Advances in Human-Computer Interaction     Open Access   (Followers: 17)
Advances in Materials Sciences     Open Access   (Followers: 14)
Advances in Operations Research     Open Access   (Followers: 11)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 7)
Advances in Porous Media     Full-text available via subscription   (Followers: 4)
Advances in Remote Sensing     Open Access   (Followers: 29)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Advances in Technology Innovation     Open Access  
AEU - International Journal of Electronics and Communications     Hybrid Journal   (Followers: 7)
African Journal of Information and Communication     Open Access   (Followers: 7)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 3)
Air, Soil & Water Research     Open Access   (Followers: 6)
AIS Transactions on Human-Computer Interaction     Open Access   (Followers: 5)
Algebras and Representation Theory     Hybrid Journal  
Algorithms     Open Access   (Followers: 9)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 2)
American Journal of Computational Mathematics     Open Access   (Followers: 4)
American Journal of Information Systems     Open Access   (Followers: 4)
American Journal of Sensor Technology     Open Access  
Anais da Academia Brasileira de Ciências     Open Access   (Followers: 2)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 5)
Analysis in Theory and Applications     Hybrid Journal  
Animation Practice, Process & Production     Hybrid Journal   (Followers: 4)
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Data Science     Hybrid Journal   (Followers: 5)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 5)
Annals of Pure and Applied Logic     Open Access   (Followers: 1)
Annals of Software Engineering     Hybrid Journal   (Followers: 10)
Annual Reviews in Control     Hybrid Journal   (Followers: 6)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2)
Applied and Computational Harmonic Analysis     Full-text available via subscription   (Followers: 2)
Applied Artificial Intelligence: An International Journal     Hybrid Journal   (Followers: 12)
Applied Categorical Structures     Hybrid Journal   (Followers: 2)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 11)
Applied Computer Systems     Open Access   (Followers: 1)
Applied Informatics     Open Access  
Applied Mathematics and Computation     Hybrid Journal   (Followers: 32)
Applied Medical Informatics     Open Access   (Followers: 9)
Applied Numerical Analysis & Computational Mathematics     Hybrid Journal   (Followers: 5)
Applied Numerical Mathematics     Hybrid Journal   (Followers: 5)
Applied Soft Computing     Hybrid Journal   (Followers: 12)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 3)
Architectural Theory Review     Hybrid Journal   (Followers: 2)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 4)
Archive of Numerical Software     Open Access  
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 4)
Artifact     Hybrid Journal   (Followers: 2)
Artificial Life     Hybrid Journal   (Followers: 5)
Asia Pacific Journal on Computational Engineering     Open Access  
Asia-Pacific Journal of Information Technology and Multimedia     Open Access   (Followers: 1)
Asian Journal of Control     Hybrid Journal  
Assembly Automation     Hybrid Journal   (Followers: 1)
at - Automatisierungstechnik     Hybrid Journal   (Followers: 1)
Australian Educational Computing     Open Access  
Automatic Control and Computer Sciences     Hybrid Journal   (Followers: 3)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 4)
Automatica     Hybrid Journal   (Followers: 8)
Automation in Construction     Hybrid Journal   (Followers: 6)
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 7)
Basin Research     Hybrid Journal   (Followers: 3)
Behaviour & Information Technology     Hybrid Journal   (Followers: 51)
Bioinformatics     Hybrid Journal   (Followers: 190)
Biomedical Engineering     Hybrid Journal   (Followers: 14)
Biomedical Engineering and Computational Biology     Open Access   (Followers: 11)
Biomedical Engineering, IEEE Reviews in     Full-text available via subscription   (Followers: 16)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 25)
Briefings in Bioinformatics     Hybrid Journal   (Followers: 43)
British Journal of Educational Technology     Hybrid Journal   (Followers: 93)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 9)
CALCOLO     Hybrid Journal  
Calphad     Hybrid Journal  
Canadian Journal of Electrical and Computer Engineering     Full-text available via subscription   (Followers: 11)
Catalysis in Industry     Hybrid Journal   (Followers: 1)
CEAS Space Journal     Hybrid Journal  
Cell Communication and Signaling     Open Access   (Followers: 1)
Central European Journal of Computer Science     Hybrid Journal   (Followers: 5)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 1)
Chemometrics and Intelligent Laboratory Systems     Hybrid Journal   (Followers: 15)
ChemSusChem     Hybrid Journal   (Followers: 5)
China Communications     Full-text available via subscription   (Followers: 6)
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 1)
CIN Computers Informatics Nursing     Full-text available via subscription   (Followers: 10)
Circuits and Systems     Open Access   (Followers: 12)
Clean Air Journal     Full-text available via subscription   (Followers: 2)
CLEI Electronic Journal     Open Access  
Clin-Alert     Hybrid Journal   (Followers: 1)
Cluster Computing     Hybrid Journal   (Followers: 1)
Cognitive Computation     Hybrid Journal   (Followers: 4)
COMBINATORICA     Hybrid Journal  
Combustion Theory and Modelling     Hybrid Journal   (Followers: 13)
Communication Methods and Measures     Hybrid Journal   (Followers: 12)
Communication Theory     Hybrid Journal   (Followers: 17)
Communications Engineer     Hybrid Journal   (Followers: 1)
Communications in Algebra     Hybrid Journal   (Followers: 2)
Communications in Partial Differential Equations     Hybrid Journal   (Followers: 1)
Communications of the ACM     Full-text available via subscription   (Followers: 44)
Communications of the Association for Information Systems     Open Access   (Followers: 18)
COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering     Hybrid Journal   (Followers: 3)
Complex Adaptive Systems Modeling     Open Access  
Complex Analysis and Operator Theory     Hybrid Journal   (Followers: 2)
Complexity     Hybrid Journal   (Followers: 6)
Complexus     Full-text available via subscription  
Composite Materials Series     Full-text available via subscription   (Followers: 8)
Computación y Sistemas     Open Access  
Computation     Open Access  
Computational and Applied Mathematics     Hybrid Journal   (Followers: 2)
Computational and Mathematical Methods in Medicine     Open Access   (Followers: 2)
Computational and Mathematical Organization Theory     Hybrid Journal   (Followers: 2)
Computational and Structural Biotechnology Journal     Open Access   (Followers: 1)
Computational and Theoretical Chemistry     Hybrid Journal   (Followers: 10)
Computational Astrophysics and Cosmology     Open Access  
Computational Biology and Chemistry     Hybrid Journal   (Followers: 9)
Computational Chemistry     Open Access   (Followers: 2)
Computational Cognitive Science     Open Access  
Computational Complexity     Hybrid Journal   (Followers: 4)
Computational Condensed Matter     Open Access  
Computational Ecology and Software     Open Access   (Followers: 8)
Computational Economics     Hybrid Journal   (Followers: 9)
Computational Geosciences     Hybrid Journal   (Followers: 13)
Computational Linguistics     Open Access   (Followers: 20)
Computational Management Science     Hybrid Journal  
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 7)
Computational Mechanics     Hybrid Journal   (Followers: 4)
Computational Methods and Function Theory     Hybrid Journal  
Computational Molecular Bioscience     Open Access   (Followers: 1)
Computational Optimization and Applications     Hybrid Journal   (Followers: 7)
Computational Particle Mechanics     Hybrid Journal   (Followers: 1)
Computational Research     Open Access   (Followers: 1)
Computational Science and Discovery     Full-text available via subscription   (Followers: 2)
Computational Science and Techniques     Open Access  
Computational Statistics     Hybrid Journal   (Followers: 14)
Computational Statistics & Data Analysis     Hybrid Journal   (Followers: 26)
Computer     Full-text available via subscription   (Followers: 70)
Computer Aided Surgery     Hybrid Journal   (Followers: 3)
Computer Applications in Engineering Education     Hybrid Journal   (Followers: 6)
Computer Communications     Hybrid Journal   (Followers: 8)
Computer Engineering and Applications Journal     Open Access   (Followers: 4)
Computer Journal     Hybrid Journal   (Followers: 6)
Computer Methods in Applied Mechanics and Engineering     Hybrid Journal   (Followers: 19)
Computer Methods in Biomechanics and Biomedical Engineering     Hybrid Journal   (Followers: 9)
Computer Methods in the Geosciences     Full-text available via subscription  
Computer Music Journal     Hybrid Journal   (Followers: 10)
Computer Physics Communications     Hybrid Journal   (Followers: 3)
Computer Science - Research and Development     Hybrid Journal   (Followers: 6)
Computer Science and Engineering     Open Access   (Followers: 15)
Computer Science and Information Technology     Open Access   (Followers: 8)
Computer Science Education     Hybrid Journal   (Followers: 11)
Computer Science Journal     Open Access   (Followers: 20)
Computer Science Master Research     Open Access   (Followers: 7)
Computer Science Review     Hybrid Journal   (Followers: 8)
Computer Standards & Interfaces     Hybrid Journal   (Followers: 2)
Computer Supported Cooperative Work (CSCW)     Hybrid Journal   (Followers: 7)
Computer-aided Civil and Infrastructure Engineering     Hybrid Journal   (Followers: 8)
Computer-Aided Design and Applications     Hybrid Journal  

        1 2 3 4 5 6 | Last

Journal Cover Applied Numerical Mathematics
  [SJR: 1.254]   [H-I: 56]   [5 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 0168-9274 - ISSN (Online) 0168-9274
   Published by Elsevier Homepage  [3039 journals]
  • Spline collocation for fractional weakly singular integro-differential
           equations
    • Abstract: Publication date: December 2016
      Source:Applied Numerical Mathematics, Volume 110
      Author(s): Arvet Pedas, Enn Tamme, Mikk Vikerpuur
      We consider a class of boundary value problems for linear fractional weakly singular integro-differential equations which involve Caputo-type derivatives. Using an integral equation reformulation of the boundary value problem, we first study the regularity of the exact solution. Based on the obtained regularity properties and spline collocation techniques, the numerical solution of the boundary value problem by suitable non-polynomial approximations is discussed. Optimal global convergence estimates are derived and a super-convergence result for a special choice of grid and collocation parameters is given. A numerical illustration is also presented.


      PubDate: 2016-09-24T15:42:25Z
       
  • Editorial Board
    • Abstract: Publication date: December 2016
      Source:Applied Numerical Mathematics, Volume 110




      PubDate: 2016-09-24T15:42:25Z
       
  • An improved semi-Lagrangian time splitting spectral method for the
           semi-classical Schrödinger equation with vector potentials using NUFFT
    • Abstract: Publication date: January 2017
      Source:Applied Numerical Mathematics, Volume 111
      Author(s): Zheng Ma, Yong Zhang, Zhennan Zhou
      In this paper, we propose a new time splitting Fourier spectral method for the semi-classical Schrödinger equation with vector potentials. Compared with the results in [21], our method achieves spectral accuracy in space by interpolating the Fourier series via the NonUniform Fast Fourier Transform (NUFFT) algorithm in the convection step. The NUFFT algorithm helps maintain high spatial accuracy of Fourier method, and at the same time improve the efficiency from O ( N 2 ) (of direct computation) to O ( N log ⁡ N ) operations, where N is the total number of grid points. The kinetic step and potential step are solved by analytical solution with pseudo-spectral approximation, and, therefore, we obtain spectral accuracy in space for the whole method. We prove that the method is unconditionally stable, and we show improved error estimates for both the wave function and physical observables, which agree with the results in [3] for vanishing potential cases and are superior to those in [21]. Extensive one and two dimensional numerical studies are presented to verify the properties of the proposed method, and simulations of 3D problems are demonstrated to show its potential for future practical applications.


      PubDate: 2016-09-24T15:42:25Z
       
  • Convergent interpolatory quadrature schemes
    • Abstract: Publication date: January 2017
      Source:Applied Numerical Mathematics, Volume 111
      Author(s): U. Fidalgo
      We use a connection between interpolatory quadrature formulas and Fourier series to find a wide class of convergent schemes of interpolatory quadrature rules. In the process we use techniques coming from Riemann–Hilbert problems for varying measures and convex analysis.


      PubDate: 2016-09-24T15:42:25Z
       
  • Approximate Gauss–Newton methods for solving underdetermined
           nonlinear least squares problems
    • Abstract: Publication date: January 2017
      Source:Applied Numerical Mathematics, Volume 111
      Author(s): Ji-Feng Bao, Chong Li, Wei-Ping Shen, Jen-Chih Yao, Sy-Ming Guu
      We propose several approximate Gauss–Newton methods, i.e., the truncated, perturbed, and truncated-perturbed GN methods, for solving underdetermined nonlinear least squares problems. Under the assumption that the Fréchet derivatives are Lipschitz continuous and of full row rank, Kantorovich-type convergence criteria of the truncated GN method are established and local convergence theorems are presented with the radii of convergence balls obtained. As consequences of the convergence results for the truncated GN method, convergence theorems of the perturbed and truncated-perturbed GN methods are also presented. Finally, numerical experiments are presented where the comparisons with the standard inexact Gauss–Newton method and the inexact trust-region method for bound-constrained least squares problems [23] are made.


      PubDate: 2016-09-24T15:42:25Z
       
  • High-order numerical schemes based on difference potentials for 2D
           elliptic problems with material interfaces
    • Abstract: Publication date: January 2017
      Source:Applied Numerical Mathematics, Volume 111
      Author(s): Jason Albright, Yekaterina Epshteyn, Michael Medvinsky, Qing Xia
      Numerical approximations and computational modeling of problems from Biology and Materials Science often deal with partial differential equations with varying coefficients and domains with irregular geometry. The challenge here is to design an efficient and accurate numerical method that can resolve properties of solutions in different domains/subdomains, while handling the arbitrary geometries of the domains. In this work, we consider 2D elliptic models with material interfaces and develop efficient high-order accurate methods based on Difference Potentials for such problems.


      PubDate: 2016-09-24T15:42:25Z
       
  • Discontinuous Galerkin methods with interior penalties on graded meshes
           for 2D singularly perturbed convection–diffusion problems
    • Abstract: Publication date: January 2017
      Source:Applied Numerical Mathematics, Volume 111
      Author(s): Yubo Yang, Peng Zhu
      In this paper, we introduce discontinuous Galerkin methods with interior penalties, both the NIPG and SIPG method for solving 2D singularly perturbed convection–diffusion problems. On the modified graded meshes with the standard Lagrange Q k -elements ( k = 1 , 2 ), we show optimal order error estimates in the ε-weighted energy norm uniformly, up to a logarithmic factor, in the singular perturbation parameter ε. We prove that the convergence rate in the ε-weighted energy norm is O ( log k + 1 ⁡ ( 1 ε ) N k ) , where the total number of the mesh points is O ( N 2 ) . For k ≥ 3 , our methods can be extended directly, provided the higher order regularities of the solution u are derived. Finally, numerical experiments support our theoretical results.


      PubDate: 2016-09-24T15:42:25Z
       
  • Fourier Collocation Algorithm for identification of a spacewise dependent
           source in wave equation from Neumann-type measured data
    • Abstract: Publication date: Available online 13 September 2016
      Source:Applied Numerical Mathematics
      Author(s): Alemdar Hasanov, Balgaisha Mukanova
      Inverse problem of identifying the unknown spacewise dependent source F ( x ) in 1D wave equation u t t = c 2 u x x + F ( x ) G ( t ) + h ( x , t ) , ( x , t ) ∈ ( 0 , 1 ) × ( 0 , T ) , from the Neumann-type measured output g ( t ) : = u x ( 0 , t ) is investigated. Most studies have attempted to reconstruct an unknown spacewise dependent source F ( x ) from the final observation u T ( x ) : = u ( x , T ) . Since a boundary measured data is most feasible from an engineering viewpoint, the identification problem has wide applications, in particular, in electrical networks governed by harmonically varying source for the linear wave equation u t t − u x x = F ( x ) c o s ( ω t ) , where ω > 0 is the frequency and F ( x ) is an unknown source term. In this paper Fourier Collocation Algorithm for reconstructing the spacewise dependent source F ( x ) is developed. This algorithm is based on Fourier expansion of the direct problem solution applied to the minimization problem for Tikhonov functional, by taking then a partial N-sum of the Fourier expansion. Tikhonov regularization is then applied to the obtained discrete ill-posed problem. To obtain high quality reconstruction in large values of the noise level, a numerical filtering algorithm is used for smoothing the noisy data. As an application, we demonstrate the ability of the algorithm on benchmark problems, in particular, on source identification problem in electrical networks governed by mono-frequency source. Numerical results show that the proposed algorithm allows to reconstruct the spacewise dependent source F ( x ) with enough high accuracy, in the presence of high noise levels.


      PubDate: 2016-09-20T15:29:25Z
       
  • A novel finite difference scheme for Burgers' equation on unbounded
           domains
    • Abstract: Publication date: January 2017
      Source:Applied Numerical Mathematics, Volume 111
      Author(s): Quan Zheng, Xin Zhao, Yufeng Liu
      This paper studies a finite difference method for one-dimensional nonhomogeneous Burgers' equation on the infinite domain. Two exact nonlinear artificial boundary conditions are applied on two artificial boundaries to limit the original problem onto a bounded computational domain. A function transformation makes both Burgers' equation and artificial boundary conditions linear. Consequently, a novel finite difference scheme is developed by using the method of reduction of order for the obtained equation and artificial boundary conditions. The stability and the convergence with order 3/2 in time and 2 in space in an energy norm are proved for this method for Burgers' equation. Different examples illustrate the unconditional stability and the accuracy of the proposed method.


      PubDate: 2016-09-20T15:29:25Z
       
  • A radial basis function based implicit–explicit method for option
           pricing under jump-diffusion models
    • Abstract: Publication date: December 2016
      Source:Applied Numerical Mathematics, Volume 110
      Author(s): Mohan K. Kadalbajoo, Alpesh Kumar, Lok Pati Tripathi
      In this article, we present a radial basis function based implicit explicit numerical method to solve the partial integro-differential equation which describes the nature of the option price under jump diffusion model. The governing equation is time semi discrtized by using the implicit–explicit backward difference method of order two (IMEX-BDF2) followed by radial basis function based finite difference (RBF-FD) method. The numerical scheme derived for European option is extended for American option by using operator splitting method. Numerical results for put and call option under Merton and Kou models are given to illustrate the efficiency and accuracy of the present method. The stability of time semi discretized scheme is also proved.


      PubDate: 2016-09-20T15:29:25Z
       
  • Nanostructures imaging via numerical solution of a 3-D inverse scattering
           problem without the phase information
    • Abstract: Publication date: December 2016
      Source:Applied Numerical Mathematics, Volume 110
      Author(s): Michael V. Klibanov, Loc H. Nguyen, Kejia Pan
      Inverse scattering problems without the phase information arise in imaging of nanostructures, whose sizes are hundreds of nanometers, as well as in imaging of biological cells. The governing equation is the 3-D generalized Helmholtz equation with the unknown coefficient, which represents the spatially distributed dielectric constant. It is assumed in the classical inverse scattering problem that both the modulus and the phase of the complex valued scattered wave field are measured outside of a scatterer. Unlike this, it is assumed here that only the modulus of the complex valued scattered wave field is measured on a certain interval of frequencies. The phase is not measured. In this paper a substantially modified reconstruction procedure of [25] is developed and numerically implemented. Ranges of parameters, which are realistic for imaging of nanostructures, are used in numerical examples. Note that numerical studies were not carried out in [25].


      PubDate: 2016-09-20T15:29:25Z
       
  • The computation of the degree of an approximate greatest common divisor of
           two Bernstein polynomials
    • Abstract: Publication date: Available online 6 September 2016
      Source:Applied Numerical Mathematics
      Author(s): Martin Bourne, Joab R. Winkler, Su Yi
      This paper considers the computation of the degree t of an approximate greatest common divisor d ( y ) of two Bernstein polynomials f ( y ) and g ( y ) , which are of degrees m and n respectively. The value of t is computed from the QR decomposition of the Sylvester resultant matrix S ( f , g ) and its subresultant matrices S k ( f , g ) , k = 2 , … , min ⁡ ( m , n ) , where S 1 ( f , g ) = S ( f , g ) . It is shown that the computation of t is significantly more complicated than its equivalent for two power basis polynomials because (a) S k ( f , g ) can be written in several forms that differ in the complexity of the computation of their entries, (b) different forms of S k ( f , g ) may yield different values of t, and (c) the binomial terms in the entries of S k ( f , g ) may cause the ratio of its entry of maximum magnitude to its entry of minimum magnitude to be large, which may lead to numerical problems. It is shown that the QR decomposition and singular value decomposition (SVD) of the Sylvester matrix and its subresultant matrices yield better results than the SVD of the Bézout matrix, and that f ( y ) and g ( y ) must be processed before computations are performed on these resultant and subresultant matrices in order to obtain good results.


      PubDate: 2016-09-09T16:28:07Z
       
  • Two-point boundary value problems associated to functional differential
           equations of even order solved by iterated splines
    • Abstract: Publication date: December 2016
      Source:Applied Numerical Mathematics, Volume 110
      Author(s): Alexandru Mihai Bica, Mircea Curila, Sorin Curila
      A new iterative numerical method to solve two-point boundary value problems associated to functional differential equations of even order is proposed. The method uses a cubic spline interpolation procedure activated at each iterative step. The convergence of the method is proved and it is tested on some numerical experiments. The notion of numerical stability with respect to the choice of the first iteration is introduced proving that the proposed method is numerically stable in this sense.


      PubDate: 2016-09-09T16:28:07Z
       
  • A reconstructed central discontinuous Galerkin-finite element method for
           the fully nonlinear weakly dispersive Green–Naghdi model
    • Abstract: Publication date: December 2016
      Source:Applied Numerical Mathematics, Volume 110
      Author(s): Haiyun Dong, Maojun Li
      In this paper, we present a class of high order reconstructed central discontinuous Galerkin-finite element methods for the fully nonlinear weakly dispersive Green–Naghdi model, which describes a large spectrum of shallow water waves. In the proposed methods, we first reformulate the Green–Naghdi model into conservation laws coupled with an elliptic equation, and then discretize the conservation laws with reconstructed central discontinuous Galerkin methods and the elliptic equation with continuous FE methods. The reconstructed central discontinuous Galerkin methods can be viewed as a class of fast central discontinuous Galerkin methods, in which we replace the standard formula for the numerical solution defined on the dual mesh in the central discontinuous Galerkin method with a projection equation in the L 2 sense. The proposed methods reduce the computational cost of the traditional methods by nearly half but still maintain the formal high order accuracy. We study the L 2 stability and an L 2 a priori error estimate for smooth solutions of the reconstructed central discontinuous Galerkin method for linear hyperbolic equation. Numerical tests are presented to illustrate the accuracy and computational efficiency of the proposed method.


      PubDate: 2016-09-09T16:28:07Z
       
  • The inexact-Newton via GMRES subspace method without line search technique
           for solving symmetric nonlinear equations
    • Abstract: Publication date: Available online 30 August 2016
      Source:Applied Numerical Mathematics
      Author(s): Jueyu Wang, Detong Zhu
      In this paper, we propose an inexact-Newton via GMRES (generalized minimal residual) subspace method without line search technique for solving symmetric nonlinear equations. The iterative direction is obtained by solving the Newton equation of the system of nonlinear equations with the GMRES algorithm. The global convergence and local superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, the numerical results are reported to show the effectiveness of the proposed algorithm.


      PubDate: 2016-08-31T15:40:36Z
       
  • The Fibonacci family of iterative processes for solving nonlinear
           equations
    • Abstract: Publication date: Available online 30 August 2016
      Source:Applied Numerical Mathematics
      Author(s): Tamara Kogan, Luba Sapir, Amir Sapir, Ariel Sapir
      This paper presents a class of stationary iterative processes with convergence order equal to the growth rate of generalized Fibonacci sequences. We prove that the informational and computational efficiency of the processes of our class tend to 2 from below. The paper illustrates a connection of the methods of the class with the nonstationary iterative method suggested by our previous paper, whose efficiency index equals to 2. We prove that the efficiency of the nonstationary iterative method, measured by Ostrowski-Traub criteria, is maximal among all iterative processes of order 2.


      PubDate: 2016-08-31T15:40:36Z
       
  • Editorial Board
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109




      PubDate: 2016-08-31T15:40:36Z
       
  • Analysis of a family of continuous–discontinuous Galerkin FEM for
           convection–diffusion problems
    • Abstract: Publication date: Available online 20 August 2016
      Source:Applied Numerical Mathematics
      Author(s): Sebastian Franz
      It is well known that continuous Galerkin methods lack stability for singularly perturbed convection-diffusion problems. One approach to overcome this behaviour is to use discontinuous Galerkin methods instead. Unfortunately, this increases the number of degrees of freedom and thus the computational costs. We analyse discontinuous Galerkin methods of anisotropic polynomial order and discrete discontinuous spaces. By enforcing continuity in the vertices of a mesh, the number of unknowns can be reduced while the convergence order in the dG-norm is still sustained. Numerical experiments for several polynomial elements and finite element spaces support our theoretical results.


      PubDate: 2016-08-23T07:58:42Z
       
  • A quasi-static contact problem in thermoviscoelastic diffusion theory
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109
      Author(s): M.I.M. Copetti, M. Aouadi
      The problem of thermoviscoelastic quasi-static contact between a rod and a rigid obstacle, when the diffusion effect is taken into account, is modeled and analyzed. The contact is modeled by the Signorini's condition and the stress–strain constitutive equation is of the Kelvin–Voigt type. In the quasi-static case, the governing equations correspond to the coupling of an elliptic and two parabolic equations. It poses some new mathematical difficulties due to the nonlinear boundary conditions. The existence of solutions is proved as the limit of solutions to a penalized problem. Moreover, we show that the weak solution converges to zero exponentially as time goes to infinity. Finally, we give some computational results where the influence of diffusion and viscosity are illustrated in contact.


      PubDate: 2016-08-18T06:09:52Z
       
  • Volume preservation by Runge–Kutta methods
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109
      Author(s): Philipp Bader, David I. McLaren, G.R.W. Quispel, Marcus Webb
      It is a classical theorem of Liouville that Hamiltonian systems preserve volume in phase space. Any symplectic Runge–Kutta method will respect this property for such systems, but it has been shown by Iserles, Quispel and Tse and independently by Chartier and Murua that no B-Series method can be volume preserving for all volume preserving vector fields. In this paper, we show that despite this result, symplectic Runge–Kutta methods can be volume preserving for a much larger class of vector fields than Hamiltonian systems, and discuss how some Runge–Kutta methods can preserve a modified measure exactly.


      PubDate: 2016-08-18T06:09:52Z
       
  • Newton-type methods for inverse singular value problems with multiple
           singular values
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109
      Author(s): Wei-ping Shen, Chong Li, Xiao-qing Jin, Jen-chih Yao
      We consider the convergence problem of some Newton-type methods for solving the inverse singular value problem with multiple and positive singular values. Under the nonsingularity assumption of the relative generalized Jacobian matrices at the solution c ⁎ , a convergence analysis for the multiple and positive case is provided and the superlinear or quadratical convergence properties are proved. Moreover, numerical experiments are given in the last section and comparisons are made.


      PubDate: 2016-08-18T06:09:52Z
       
  • Analysis of a domain decomposition method for linear transport problems on
           networks
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109
      Author(s): J.B. Collins, P.A. Gremaud
      In this paper we analyze the convergence of the domain decomposition method applied to transport problems on networks. In particular, we derive estimates for the number of required iterations for linear problems. These estimates can be used to determine when the implementation of domain decomposition methods would be beneficial for this type of problems.


      PubDate: 2016-08-18T06:09:52Z
       
  • ADI iteration for Lyapunov equations: A tangential approach and adaptive
           shift selection
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109
      Author(s): Thomas Wolf, Heiko K.F. Panzer, Boris Lohmann
      A new version of the alternating directions implicit (ADI) iteration for the solution of large-scale Lyapunov equations is introduced. It generalizes the hitherto existing iteration, by incorporating tangential directions in the way they are already available for rational Krylov subspaces. Additionally, first strategies to adaptively select shifts and tangential directions in each iteration are presented. Numerical examples emphasize the potential of the new results.


      PubDate: 2016-08-18T06:09:52Z
       
  • Stability analysis of explicit exponential integrators for delay
           differential equations
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109
      Author(s): Jingjun Zhao, Rui Zhan, Alexander Ostermann
      The aim of this paper is to analyze stability properties of explicit exponential integrators for three kinds of delay differential equations. First, linear autonomous delay differential equations are studied, and sufficient conditions for P- and GP-contractivity of explicit exponential Runge–Kutta methods are given. Second, for linear nonautonomous test equations, PN- and GPN-stability of a particular Magnus integrator is investigated. It is shown that the Magnus integrator is GPN-stable and convergent of order two. Finally, for semilinear delay differential equations, RN- and GRN-stability of explicit exponential Runge–Kutta methods is studied and sufficient conditions for GRN-stability are derived. Some examples of P-, GP-, RN- and GRN-stable exponential integrators are given, and numerical experiments that illustrate the theoretical results are included.


      PubDate: 2016-08-18T06:09:52Z
       
  • Error analysis of a diffuse interface method for elliptic problems with
           Dirichlet boundary conditions
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109
      Author(s): Matthias Schlottbom
      We use a diffuse interface method for solving Poisson's equation with a Dirichlet condition on an embedded curved interface. The resulting diffuse interface problem is identified as a standard Dirichlet problem on approximating regular domains. We estimate the errors introduced by these domain perturbations, and prove convergence and convergence rates in the H 1 -norm, the L 2 -norm and the L ∞ -norm in terms of the width of the diffuse layer. For an efficient numerical solution we consider the finite element method for which another domain perturbation is introduced. These perturbed domains are polygonal and non-convex in general. We prove convergence and convergences rates in the H 1 -norm and the L 2 -norm in terms of the layer width and the mesh size. In particular, for the L 2 -norm estimates we present a problem adapted duality technique, which crucially makes use of the error estimates derived for the regularly perturbed domains. Our results are illustrated by numerical experiments, which also show that the derived estimates are sharp.


      PubDate: 2016-08-18T06:09:52Z
       
  • On optimal simplicial 3D meshes for minimizing the Hessian-based errors
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109
      Author(s): Y. Mesri, M. Khalloufi, E. Hachem
      In this paper we derive a multi-dimensional mesh adaptation method which produces optimal meshes for quadratic functions, positive semi-definite. The method generates anisotropic adaptive meshes as quasi-uniform ones in some metric space, with the tensor metric being computed based on interpolation error estimates. It does not depend, a priori, on the PDEs at hand in contrast to residual methods. The estimated error is then used to steer local modifications of the mesh in order to reach a prescribed level of error in L p -norm or a prescribed number of elements. The L p -norm of the estimated error is then minimized in order to get an optimal mesh. Numerical examples in 2D and 3D for analytic challenging problems and an application to a Computational Fluid Dynamics problem are presented and discussed in order to show how the proposed method recovers optimal convergence rates as well as to demonstrate its computational performance.


      PubDate: 2016-08-18T06:09:52Z
       
  • Interpolation in Jacobi-weighted spaces and its application to a
           posteriori error estimations of the p-version of the finite element method
           
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109
      Author(s): María G. Armentano, Verónica Moreno
      The goal of this work is to introduce a local and a global interpolator in Jacobi-weighted spaces, with optimal order of approximation in the context of the p-version of finite element methods. Then, an a posteriori error indicator of the residual type is proposed for a model problem in two dimensions and, in the mathematical framework of the Jacobi-weighted spaces, the equivalence between the estimator and the error is obtained on appropriate weighted norm.


      PubDate: 2016-08-18T06:09:52Z
       
  • Analysis of the element free Galerkin (EFG) method for solving fractional
           cable equation with Dirichlet boundary condition
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109
      Author(s): Mehdi Dehghan, Mostafa Abbaszadeh
      The element free Galerkin technique is a meshless method based on the variational weak form in which the test and trial functions are the shape functions of moving least squares approximation. Since the shape functions of moving least squares approximation do not have the Kronecker property thus the Dirichlet boundary condition can not be applied directly and also in this case obtaining an error estimate is not simple. The main aim of the current paper is to propose an error estimate for the extracted numerical scheme from the element free Galerkin method. To this end, we select the fractional cable equation with Dirichlet boundary condition. Firstly, we obtain a time-discrete scheme based on a finite difference formula with convergence order O ( τ 1 + min ⁡ { α , β } ) , then we use the meshless element free Galerkin method, to discrete the space direction and obtain a full-discrete scheme. Also, for calculating the appeared integrals over the boundary and the domain of problem the Gauss–Legendre quadrature rule has been used. In the next, we change the main problem with Dirichlet boundary condition to a new problem with Robin boundary condition. Then, we show that the new technique is unconditionally stable and convergent using the energy method. We show convergence orders of the time discrete scheme and the full discrete scheme are O ( τ 1 + min ⁡ { α , β } ) and O ( r p + 1 + τ 1 + min ⁡ { α , β } ) , respectively. So, we can say that the main aim of this paper is as follows, (1) Transferring the main problem with Dirichlet boundary condition (old problem) to a problem with Robin boundary condition (new problem), (2) Showing that with special condition (when σ → + ∞ ) the solution of the new problem is convergent to the solution of the old problem, (3) Obtaining an error estimate for the new problem. Numerical examples confirm the efficiency and accuracy of the proposed scheme.


      PubDate: 2016-08-18T06:09:52Z
       
  • Degenerate tetrahedra removal
    • Abstract: Publication date: December 2016
      Source:Applied Numerical Mathematics, Volume 110
      Author(s): Franco Dassi, Luca Formaggia, Stefano Zonca
      Standard 3D mesh generation algorithms may produce a low quality tetrahedral mesh, i.e., a mesh where the tetrahedra have very small dihedral angles. In this paper, we propose a series of operations to recover these badly-shaped tetrahedra. In particular, we will focus on the shape of these undesired mesh elements by proposing a novel method to distinguish and classify them. For each of these configurations, we apply a suitable sequence of operations to get a higher mesh quality. Finally, we employ a random algorithm to avoid locks and loops in the procedure. The reliability of the proposed mesh optimization algorithm is numerically proved with several examples.


      PubDate: 2016-08-18T06:09:52Z
       
  • Implicit–explicit multistep methods for general two-dimensional
           nonlinear Schrödinger equations
    • Abstract: Publication date: November 2016
      Source:Applied Numerical Mathematics, Volume 109
      Author(s): Yali Gao, Liquan Mei
      In this paper, implicit–explicit multistep Galerkin methods are studied for two-dimensional nonlinear Schrödinger equations and coupled nonlinear Schrödinger equations. The spatial discretization is based on Galerkin method using linear and quadratic basis functions on triangular and rectangular finite elements. And the implicit–explicit multistep method is used for temporal discretization. Linear and nonlinear numerical tests are presented to verify the validity and efficiency of the numerical methods. The numerical results record that the optimal order of the error in L 2 and L ∞ norm can be reached.


      PubDate: 2016-08-18T06:09:52Z
       
  • The basins of attraction of Murakami's fifth order family of methods
    • Abstract: Publication date: Available online 3 August 2016
      Source:Applied Numerical Mathematics
      Author(s): Changbum Chun, Beny Neta
      In this paper we analyze Murakami's family of fifth order methods for the solution of nonlinear equations. We show how to find the best performer by using a measure of closeness of the extraneous fixed points to the imaginary axis. We demonstrate the performance of these members as compared to the two members originally suggested by Murakami. We found several members for which the extraneous fixed points are on the imaginary axis, only one of these has 6 such points (compared to 8 for the other members). We show that this member is the best performer.


      PubDate: 2016-08-18T06:09:52Z
       
  • Spectral semi-implicit and space–time discontinuous Galerkin methods for
           
    • Abstract: Publication date: Available online 3 August 2016
      Source:Applied Numerical Mathematics
      Author(s): Francesco Fambri, Michael Dumbser
      In this paper two new families of arbitrary high order accurate spectral discontinuous Galerkin (DG) finite element methods are derived on staggered Cartesian grids for the solution of the incompressible Navier–Stokes (NS) equations in two and three space dimensions. The discrete solutions of pressure and velocity are expressed in the form of piecewise polynomials along different meshes. While the pressure is defined on the control volumes of the main grid, the velocity components are defined on edge-based dual control volumes, leading to a spatially staggered mesh. Thanks to the use of a nodal basis on a tensor-product domain, all discrete operators can be written efficiently as a combination of simple one-dimensional operators in a dimension-by-dimension fashion. In the first family, high order of accuracy is achieved only in space, while a simple semi-implicit time discretization is derived by introducing an implicitness factor θ ∈ [ 0.5 , 1 ] for the pressure gradient in the momentum equation. The real advantages of the staggering arise after substituting the discrete momentum equation into the weak form of the continuity equation. In fact, the resulting linear system for the pressure is symmetric and positive definite and either block penta-diagonal (in 2D) or block hepta-diagonal (in 3D). As a consequence, the pressure system can be solved very efficiently by means of a classical matrix-free conjugate gradient method. From our numerical experiments we find that the pressure system appears to be reasonably well-conditioned, since in all test cases shown in this paper the use of a preconditioner was not necessary. This is a rather unique feature among existing implicit DG schemes for the Navier–Stokes equations. In order to avoid a stability restriction due to the viscous terms, the latter are discretized implicitly using again a staggered mesh approach, where the viscous stress tensor is also defined on the dual mesh. The second family of staggered DG schemes proposed in this paper achieves high order of accuracy also in time by expressing the numerical solution in terms of piecewise space–time polynomials. In order to circumvent the low order of accuracy of the adopted fractional stepping, a simple iterative Picard procedure is introduced, which leads to a space–time pressure-correction algorithm. In this manner, the symmetry and positive definiteness of the pressure system are not compromised. The resulting algorithm is stable, computationally very efficient, and at the same time arbitrary high order accurate in both space and time. These features are typically not easy to obtain all at the same time for a numerical method applied to the incompressible Navier–Stokes equations. The new numerical method has been thoroughly validated for approximation polynomials of degree up to N = 11 , using a large set of non-trivial test problems in two and three space dimensions, for which either analytical, numerical or experimental reference solutions exist.


      PubDate: 2016-08-18T06:09:52Z
       
  • A fixed grid, shifted stencil scheme for inviscid fluid-particle
           interaction
    • Abstract: Publication date: Available online 12 August 2016
      Source:Applied Numerical Mathematics
      Author(s): John D. Towers
      This paper presents a finite volume scheme for a scalar one-dimensional fluid-particle interaction model. When devising a finite volume scheme for this model, one difficulty that arises is how to deal with the moving source term in the PDE while maintaining a fixed grid. The fixed grid requirement comes from the ultimate goal of accommodating two or more particles. The finite volume scheme that we propose addresses the moving source term in a novel way. We use a modified computational stencil, with the lower part of the stencil shifted during those time steps when the particle crosses a mesh point. We then employ an altered convective flux to compensate the stencil shifts. The resulting scheme uses a fixed grid, preserves total momentum, and enforces several stability properties in the single-particle case. The single-particle scheme is easily extended to multiple particles by a splitting method.


      PubDate: 2016-08-18T06:09:52Z
       
  • A nonlinear time-dependent radiation condition for simulations of internal
           gravity waves in geophysical fluid flows
    • Abstract: Publication date: Available online 12 August 2016
      Source:Applied Numerical Mathematics
      Author(s): V. Nijimbere, L.J. Campbell
      This paper examines the development of a time-dependent nonreflecting boundary condition (or radiation condition) for use in simulations of the propagation of internal gravity waves in a two-dimensional geophysical fluid flow configuration. First, a linear radiation condition, originally derived by Campbell and Maslowe, is implemented in some linear test cases. It involves the computation of a Laplace convolution integral which is nonlocal in time and thus requires values of the dependent variable at all previous time levels. An approximation for the integral is implemented here to reduce the expense of the computation and the results obtained are shown to be more accurate than those obtained using steady boundary conditions. For larger amplitude waves, nonlinear equations are required and the application of the linear radiation condition gives rise to instabilities. A new nonlinear time-dependent nonreflecting boundary condition is introduced which takes into account wave mean flow interactions in the vicinity of the outflow boundary by including a component corresponding to the vertical divergence of the horizontal momentum flux. This prevents the development of numerical instabilities and gives more accurate results in a nonlinear test problem than the results obtained using the linear radiation condition.


      PubDate: 2016-08-18T06:09:52Z
       
  • Editorial Board
    • Abstract: Publication date: October 2016
      Source:Applied Numerical Mathematics, Volume 108




      PubDate: 2016-08-18T06:09:52Z
       
  • Hyperbolicity of pressure-velocity equations for computational hydro
           acoustics
    • Abstract: Publication date: Available online 7 June 2016
      Source:Applied Numerical Mathematics
      Author(s): Po-Hsien Lin, S.-T. John Yu
      A set of model equations are proposed to simulate waves generated by unsteady, low-speed, nearly incompressible air and water flows. The equations include the continuity and momentum equations with pressure and velocity as the unknowns. Compressibility effect associated with waves motion is directly tracked by time-accurate calculation of pressure fluctuations. The corresponding density changes are modeled by using the bulk modulus of the medium. The three-dimensional equations are shown to be hyperbolic by analyzing eigenvalues and eigenvectors of the composite Jacobian matrix of the equations. Specifically, the matrix is shown to be diagonalizable and have a real spectrum. Moreover, an analytical form of the Riemann invariants of the one-dimensional equations are derived. To validate the model equations, the space-time Conservation Element and Solution Element (CESE) method and the SOLVCON code are employed to solve the two-dimensional equations. Aeolian tones generated by air and water flows passing a cylinder and over an open cavity are simulated. Numerical results compare well with previously reported data.


      PubDate: 2016-06-16T18:07:53Z
       
  • Adaptive model order reduction for the Jacobian calculation in inverse
           multi-frequency problem for Maxwell's equations
    • Abstract: Publication date: Available online 11 June 2016
      Source:Applied Numerical Mathematics
      Author(s): M. Kordy, E. Cherkaev, P. Wannamaker
      This work develops a model order reduction method for a numerical solution of an inverse multi-frequency eddy current problem using a rational interpolation of the transfer function in the complex plane. We use the Pade interpolation in the complex frequency plane; this allows us to speed up the calculation of the frequency-dependent Jacobian in the inversion procedure without loosing accuracy. Interpolating frequencies are chosen adaptively to reduce the maximal approximation error. We use the error indicator that is equivalent to a seminorm of the residual. The efficiency of the developed approach is demonstrated by applying it to the inverse magnetotelluric problem, which is a geophysical electromagnetic remote sensing method used in mineral, geothermal, and groundwater exploration. In this application, the transfer function values are needed for shifts in a purely imaginary interval. Thus we consider the interpolating shifts in the same interval as well as in a purely real interval, containing the spectrum of the operator. Numerical tests show an excellent performance of the proposed methods characterized by a significant reduction of computational time without loss of accuracy of the calculated Jacobian.


      PubDate: 2016-06-16T18:07:53Z
       
  • Para-orthogonal polynomials on the unit circle satisfying three term
           recurrence formulas
    • Abstract: Publication date: Available online 11 June 2016
      Source:Applied Numerical Mathematics
      Author(s): C.F. Bracciali, A. Sri Ranga, A. Swaminathan
      When a nontrivial measure μ on the unit circle satisfies the symmetry d μ ( e i ( 2 π − θ ) ) = − d μ ( e i θ ) then the associated orthogonal polynomials on the unit circle, say Φ n , are all real. In this case, in 1986, Delsarte and Genin have shown that the two sequences of para-orthogonal polynomials { z Φ n ( z ) + Φ n ⁎ ( z ) } and { z Φ n ( z ) − Φ n ⁎ ( z ) } , where Φ n ⁎ ( z ) = z n Φ n ( 1 / z ‾ ) ‾ , satisfy three term recurrence formulas and have also explored some further consequences of these sequences of polynomials such as their connections to sequences of orthogonal polynomials on the interval [ − 1 , 1 ] . The same authors, in 1988, have also provided a means to extend these results to cover any nontrivial measure on the unit circle. However, only recently the extension associated with the para-orthogonal polynomials z Φ n ( z ) − Φ n ⁎ ( z ) was thoroughly explored, especially from the point of view of three term recurrence and chain sequences. The main objective of the present article is to provide the theory surrounding the extension associated with the para-orthogonal polynomials z Φ n ( z ) + Φ n ⁎ ( z ) for any nontrivial measure on the unit circle. As an important application of the theory, a characterization for the existence of the integral ∫ 0 2 π e i θ − w − 2 d μ ( e i θ ) , where w is such that w = 1 , is given in terms of the coefficients α n − 1 = − Φ n ( 0 ) ‾ ...
      PubDate: 2016-06-16T18:07:53Z
       
  • Primal hybrid method for parabolic problems
    • Abstract: Publication date: October 2016
      Source:Applied Numerical Mathematics, Volume 108
      Author(s): Sanjib Kumar Acharya, Ajit Patel
      In this article, a class of second order parabolic initial-boundary value problems in the framework of primal hybrid principle is discussed. The interelement continuity requirement for standard finite element method has been alleviated by using primal hybrid method. Finite elements are constructed and used in spatial direction, and backward Euler scheme is used in temporal direction for solving fully discrete scheme. Optimal order estimates for both the semidiscrete and fully discrete method are derived with the help of modified projection operator. Numerical results are obtained in order to verify the theoretical analysis.


      PubDate: 2016-06-16T18:07:53Z
       
  • Solving optimal control problems with control delays using direct
           transcription
    • Abstract: Publication date: October 2016
      Source:Applied Numerical Mathematics, Volume 108
      Author(s): John T. Betts, Stephen L. Campbell, Karmethia C. Thompson
      The numerical treatment of optimal control problems with state and control delays is important in a wide variety of scientific and technical applications. Solutions to these types of problems are difficult to obtain via analytic techniques since the system may be nonlinear and subjected to complicated inputs and constraints. There are several numerical methods available to compute the solutions of optimal control problems without delays. One such popular method is direct transcription. Although the numerical solutions of optimal control delay problems are important, less literature and software exists in this area. A general purpose industrial grade direct transcription code that can handle optimal control problems with both state and control constraints and delays is under development. Control delays pose a special challenge. A new technique for treating control delays when using a direct transcription approach is investigated in this paper.


      PubDate: 2016-06-16T18:07:53Z
       
  • Convolution regularization method for backward problems of linear
           parabolic equations
    • Abstract: Publication date: October 2016
      Source:Applied Numerical Mathematics, Volume 108
      Author(s): Cong Shi, Chen Wang, Ting Wei
      In this paper, we consider a class of severely ill-posed backward problems for linear parabolic equations. We use a convolution regularization method to obtain a stable approximate initial data from the noisy final data. The convergence rates are obtained under an a priori and an a posteriori regularization parameter choice rule in which the a posteriori parameter choice is a new generalized discrepancy principle based on a modified version of Morozov's discrepancy principle. The log-type convergence order under the a priori regularization parameter choice rule and log ⁡ log -type order under the a posteriori regularization parameter choice rule are obtained. Two numerical examples are tested to support our theoretical results.


      PubDate: 2016-06-16T18:07:53Z
       
  • Numerical schemes for networks of hyperbolic conservation laws
    • Abstract: Publication date: October 2016
      Source:Applied Numerical Mathematics, Volume 108
      Author(s): Raul Borsche
      In this paper we propose a procedure to extend classical numerical schemes for hyperbolic conservation laws to networks of hyperbolic conservation laws. At the junctions of the network we solve the given coupling conditions and minimize the contributions of the outgoing numerical waves. This flexible procedure allows us to also use central schemes at the junctions. Several numerical examples are considered to investigate the performance of this new approach compared to the common Godunov solver and exact solutions.


      PubDate: 2016-06-16T18:07:53Z
       
  • A Legendre–Galerkin spectral approximation and estimation of the index
           of refraction for transmission eigenvalues
    • Abstract: Publication date: October 2016
      Source:Applied Numerical Mathematics, Volume 108
      Author(s): Jing An
      In this paper we present an efficient spectral method based on the Legendre–Galerkin approximation for the transmission eigenvalue problem. A rigorous error analysis is presented by using the minmax principle for the generalized eigenvalue problems associated to a transmission eigenvalue problem. However, this formulation can only compute real eigenvalues. Thus, we also present another formulation based on second order equations and construct an appropriate set of basis functions such that the matrices in the discrete variational form are sparse. For the case of constant medium, we derive the matrix formulations based on the tensor-product for the discrete variational form in two and three-dimensional cases, respectively. In addition, we also establish an optimization scheme based on the Legendre–Galerkin approximation. With this scheme we can estimate the index of refraction of an inhomogeneous medium. We also present ample numerical results to show that our method is very effective and high accurate.


      PubDate: 2016-06-16T18:07:53Z
       
  • Modified modulus-based matrix splitting algorithms for a class of weakly
           nondifferentiable nonlinear complementarity problems
    • Abstract: Publication date: October 2016
      Source:Applied Numerical Mathematics, Volume 108
      Author(s): Changfeng Ma, Na Huang
      By reformulating a class of weakly nonlinear complementarity problems as implicit fixed-point equations based on splitting of the system matrix, a modified modulus-based matrix splitting algorithm is presented. The convergence analysis of proposed algorithm is established for the case that the splitting of the system matrix is an H-splitting. Numerical experiments on two model problems are given to illustrate the theoretical results and examine the numerical effectiveness.


      PubDate: 2016-06-16T18:07:53Z
       
  • An inexact low-rank Newton–ADI method for large-scale algebraic
           Riccati equations
    • Abstract: Publication date: October 2016
      Source:Applied Numerical Mathematics, Volume 108
      Author(s): Peter Benner, Matthias Heinkenschloss, Jens Saak, Heiko K. Weichelt
      This paper improves the inexact Kleinman–Newton method for solving algebraic Riccati equations by incorporating a line search and by systematically integrating the low-rank structure resulting from ADI methods for the approximate solution of the Lyapunov equation that needs to be solved to compute the Kleinman–Newton step. A convergence result is presented that tailors the convergence proof for general inexact Newton methods to the structure of Riccati equations and avoids positive semi-definiteness assumptions on the Lyapunov equation residual, which in general do not hold for low-rank approaches. In the convergence proof of this paper, the line search is needed to ensure that the Riccati residuals decrease monotonically in norm. In the numerical experiments, the line search can lead to substantial reduction in the overall number of ADI iterations and, therefore, overall computational cost.


      PubDate: 2016-06-16T18:07:53Z
       
  • Fast iterative solvers for large matrix systems arising from
           time-dependent Stokes control problems
    • Abstract: Publication date: Available online 16 May 2016
      Source:Applied Numerical Mathematics
      Author(s): John W. Pearson
      In this manuscript we consider the development of fast iterative solvers for Stokes control problems, an important class of PDE-constrained optimization problems. In particular we wish to develop effective preconditioners for the matrix systems arising from finite element discretizations of time-dependent variants of such problems. To do this we consider a suitable rearrangement of the matrix systems, and exploit the saddle point structure of many of the relevant sub-matrices involved – we may then use this to construct representations of these sub-matrices based on good approximations of their ( 1 , 1 ) -block and Schur complement. We test our recommended iterative methods on a distributed control problem with Dirichlet boundary conditions, and on a time-periodic problem.


      PubDate: 2016-05-19T15:01:16Z
       
  • The Prothero and Robinson example: Convergence studies for Runge–Kutta
           and Rosenbrock–Wanner methods
    • Abstract: Publication date: Available online 11 May 2016
      Source:Applied Numerical Mathematics
      Author(s): Joachim Rang
      It is well-known that one-step methods have order reduction if they are applied on stiff ODEs such as the example of Prothero–Robinson. In this paper we analyse the local error of Runge–Kutta and Rosenbrock–Wanner methods. We derive new order conditions and define with them B P R -consistency. We show that for strongly A-stable methods B P R -consistency implies B P R -convergence. Finally we analyse methods from literature, derive new B P R -consistent methods and present numerical examples. The numerical and analytical results show the influence of different properties of the methods and of different order conditions on the numerical error and on the numerical convergence order.


      PubDate: 2016-05-13T14:46:49Z
       
  • Weak convergence for a stochastic exponential integrator and finite
           element discretization of stochastic partial differential equation with
           multiplicative & additive noise
    • Abstract: Publication date: Available online 9 May 2016
      Source:Applied Numerical Mathematics
      Author(s): Antoine Tambue, Jean Medard T. Ngnotchouye
      We consider a finite element approximation of a general semi-linear stochastic partial differential equation (SPDE) driven by space-time multiplicative and additive noise. We examine the full weak convergence rate of the exponential Euler scheme when the linear operator is self adjoint and also provide the full weak convergence rate for non-self-adjoint linear operator with additive noise. Key part of the proof does not rely on Malliavin calculus. For non-self-adjoint operators, we analyse the optimal strong error for spatially semi discrete approximations for both multiplicative and additive noise with truncated and non-truncated noise. Depending on the regularity of the noise and the initial solution, we found that in some cases the rate of weak convergence is twice the rate of the strong convergence. Our convergence rate is in agreement with some numerical results in two dimensions.


      PubDate: 2016-05-13T14:46:49Z
       
  • A Maximum-Principle-satisfying finite volume compact-WENO Scheme for
           traffic flow model on networks
    • Abstract: Publication date: Available online 10 May 2016
      Source:Applied Numerical Mathematics
      Author(s): YuFeng Shi, Yan Guo
      In this paper, we apply a maximum-principle-satisfying finite volume compact weighted scheme to numerical modelling traffic flow problems on networks. Road networks can be numerically model as a graph, whose edges are a finite number of roads that join at junctions. The evolution on each road is described by a scalar hyperbolic conservation law, and traffic distribution matrices are used to formulate coupling conditions at the network junctions. In order to achieve maximum-principle of the traffic density on each road, the maximum-principle-satisfying polynomial rescaling limiter is adopted. Numerical results for road networks with rich solution structures are presented in this work and indicate that the finite volume compact weighted scheme produces essentially non-oscillatory, maximum principle preserving and high resolution solutions.


      PubDate: 2016-05-13T14:46:49Z
       
  • Algorithms for the Haar wavelet based fast evaluation of aggregation
           integrals in population balance equations
    • Abstract: Publication date: Available online 10 May 2016
      Source:Applied Numerical Mathematics
      Author(s): Sabine Le Borne, Lusine Shahmuradyan
      In several production processes, the distribution of particles dispersed in an environmental phase may be mathematically described by the solution of population balance equations. We are concerned with the development of efficient numerical techniques for the aggregation process: It invokes an integral term that is usually numerically expensive to evaluate and often dominates the total simulation cost. We describe an approach on locally refined nested grids to evaluate both the source and the sink terms in almost linear complexity (instead of quadratic complexity resulting from a direct approach). The key is to switch from a nodal to a wavelet basis representation of the density function. We illustrate the numerical performance of this approach, both in comparison to a discretization of piecewise constant functions on a uniform grid as well as to the fixed pivot method on a geometric grid.


      PubDate: 2016-05-13T14:46:49Z
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 54.146.211.105
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016