performance comparison of numerical inversion methods for laplace and hankel integral transforms in engineering problems abstract different methods for the numerical evaluations of the inverse laplace and inverse of joint laplace hankel integral transforms are applied to solve a wide range of initial boundary value problems often arising in engineering and applied mathematics the aim of the paper is to present a performance comparison among different numerical methods when they are applied to transformed functions related to actual engineering problems found in the literature most of our selected test functions have been found in the solution of boundary value problems of applied mechanics such as those related to transient responses of isotropic and transversely isotropic half space to concentrated impulse or those related to viscoelastic wave motion in layered media these classes of test functions are frequently encountered in similar problems such as those in boundary element or boundary integral equations theoretical seismology soil structure interaction in time domain and so on therefore their behavior with different numerical inversion algorithms could make a useful guide to a precise choice of more suitable inversion method to be used in similar problems some different methods are also investigated in detail and compared for the inversion of the joint hankel laplace transforms where more sophisticated integrand functions are encountered it is shown that durbin crump d amore fixed talbot gaver whyn rho gwr and direct integration methods have excellent performance and produce good results when applied to the same problems on the contrary gaver stehfest and piessens methods furnish results not very reliable for almost all classes of transformed functions and they seem good only for simple transformed functions particularly the performance of gwr algorithm is very good even for transformed functions with infinite number of singularities where the other methods fail in addition in case of double integral transforms only the fixed talbot durbin and weeks methods are recommended

a parameter method for computing highly oscillatory integrals this paper presents a new efficient parameter method for integration of the highly oscillatory integral 0 1f x e i w g x dx with an irregular oscillator the effectiveness and accuracy are tested by means of numerical examples for the case where g x has stationary points

cubic hermite interpolation with minimal derivative oscillation in this paper a new optimal cubic hermite interpolation method is presented the method is to optimize the derivative of the interpolant the diagonally dominant property of the obtained system of normal equations and the error bound are better than some of the existing cubic interpolants for parametric curve design the vector valued interpolation method is given some numerical examples are provided to illustrate the satisfactory shape of the interpolation curves

on the implementation of discontinuous galerkin methods for volterra integral equations with highly oscillatory bessel kernels in this paper we consider implementation of discontinuous galerkin methods for weakly singular volterra integral equations of first and second kinds with highly oscillatory bessel kernels which cost the same operations independent of large values of frequencies preliminary numerical results show that the proposed method is efficient for verifying accuracy of approximate solutions

an always successful method in univariate convex c 2 interpolation we consider convex interpolation with cubic c 2 splines on grids built by adding two knots in each subinterval of neighbouring data sites the additional knots have to be variable in order to get a chance to always retain convexity by means of the staircase algorithm we provide computable intervals for the added knots such that all knots from these intervals allow convexity preserving spline interpolation of c 2 continuity

numerical evaluation of finite fourier integrals abstract a computationally efficient algorithm for evaluating fourier integrals 1 1 x e i x d x using interpolatory quadrature formulas on any set of collocation points is presented examples are given to illustrate the performances of interpolatory formulas which are based on the applications of the fejer clenshaw curtis basu and the newton cotes points initially the formulas for nonoscillatory integrals are generated and then generalizations to finite fourier integrals are made extensions of this algorithm to some other weighted integrals are also considered

parareal multiscale methods for highly oscillatory dynamical systems we introduce a new strategy for coupling the parallel in time parareal iterative methodology with multiscale integrators following the parareal framework the algorithm computes a low cost approximation of all slow variables in the system using an appropriate multiscale integrator which is refined using parallel fine scale integrations convergence is obtained using an alignment algorithm for fast phase like variables the method may be used either to enhance the accuracy and range of applicability of the multiscale method in approximating only the slow variables or to resolve all the state variables the numerical scheme does not require that the system is split into slow and fast coordinates moreover the dynamics may involve hidden slow variables for example due to resonances we propose an alignment algorithm for almost periodic solutions in which case convergence of the parareal iterations is proved the applicability of the method is demonstrated in numerical examples

a method for computing bessel function integrals abstract a method for numerical calculation of integrals containing bessel functions of integer or integer plus one half order is described the calculation involves first a one dimensional fourier sine or cosine transform followed by evaluation of the coefficient of the chebyshev series of the fourier transformed function in the case of the bessel function and evaluation of the legendre expansion coefficient in the case of the spherical bessel function a generalization of the method for the computation of an integral involving the bessel function of arbitrary real order v is presented as well

staircase algorithm and construction of convex spline interpolants up to the continuity c3 abstract this paper is concerned with the convex interpolation of data sets based on the staircase algorithm several methods are presented which allow the construction of convex spline interpolants up to the continuity c 3

an efficient method for evaluating the integral of a class of highly oscillatory functions highly oscillatory integrals require special techniques for their effective evaluation various studies have been conducted to find computational methods for evaluating such integrals in this paper we present an efficient numerical method to evaluate a class of generalised fourier integrals on a line or a square with integrands of the form f x e i k g x under the assumption that in the domain of integration both f and g are sufficiently smooth and that g does not have any stationary critical points numerical analysis and results are given to illustrate the effectiveness of our method for computing generalised fourier integrals

optimal by accuracy and optimal by order cubature formulae in interpolational classes in this paper the problem of optimal integration for fast oscillatory functions of two variables is solved constructively in the case where a priori information is limited the connection of this problem with the problem of optimal recovery of a function from interpolational classes is analysed using properties of majorants and minorants for these functional classes

procedures for computing one and two dimensional integrals of functions with rapid irregular oscillations a collocation procedure for efficient integration of rapidly oscillatory functions is presented the integration problem is transformed into a certain o d e problem and this is solved by a collocation technique the method is also extended to two dimensional integration and some numerical results are appended showing the efficiency of the method in handling difficult cases of rapid irregular oscillations 1 the procedure for one dimensional integrals we consider integrals of the form a 1 1 1 f x e iq x dx where f is smooth and nonoscillatory and iq x i b a 1 two practical methods for evaluating rapidly oscillatory integrals are described in 1 the use of approximation as in filon s method 3 4 and the speedup method of longman 5 formally both methods are applicable to any integral of the form 1 1 but their best performance is for the case of a constant frequency q w in this note we present an efficient method which is applicable for cases of varying frequency q using only a small number of values of f and q in a b and the values q a and q b the proposed method follows the spirit of filon s method it is based upon the fact that if f were of the form 1 2 f x iq x p x p x l l1p x a x b then the integral could be evaluated directly as 1 3 j b iq x p x pt x eiq x dx f d p x eiq x dx b e qbp a eiqa equation 1 2 can be considered as a differential equation for p x and any solution of this equation can be used in 1 3 for evaluating i the general solution of this equation is 1 4 p x e iq x f t eiq t dt cj received march 24 1981 revised july 29 1981 1980 mathematics subject classification primary 65d30 secondary 65d32 1982 american mathematical society 0025 5718 8 1 ooo 0 1 23 03 25 531 this content downloaded from 157 55 39 104 on sun 19 jun 2016 06 36 01 utc all use subject to http about jstor org terms

fast computation of a class of highly oscillatory integrals in this paper the problem of numerical evaluation of a class of highly oscillatory integrals a b f x x a b x k 1 n x k k e i x dx where 1 k 1 a k b and 1 has been discussed based on analytic continuation the integrals are transformed into the problems of integrating the forms on 0 with the integrand does not oscillate and decays exponentially fast which can be efficiently computed by using general gauss laguerre quadrature rule theoretical results and numerical experiments perform that the method is very efficient in obtaining very high precision approximations if is sufficiently large

on the convergence of the method for indefinite integration of oscillatory and singular functions we consider the problem of convergence and error estimation of the method for computing indefinite integrals proposed in keller 8 to this end we have analysed the properties of the difference operator related to the difference equation for the chebyshev coefficients of a function that satisfies a given linear differential equation with polynomial coefficients properties of this operator were never investigated before the obtained results lead us to the conclusion that the studied method is always convergent we also give a rigorous proof of the error estimates

fast integration of rapidly oscillatory functions a collocation method for approximating integrals of rapidly oscillatory functions is presented the method is efficient for integrals involving bessel functions jv rx with large oscillation parameter r as well as for many other one and multi dimensional integrals of functions with rapid irregular oscillations

on the evaluation of bessel transformations with the oscillators via asymptotic series of whittaker functions in this paper we are concerned with numerical evaluation of bessel transformations with the oscillators first we rewrite the integrals by whittaker functions then based on the asymptotic series of whittaker functions the integrals are transformed into the problems involving the complex exponential functions which can be efficiently computed by using the complex integration method at the same time we obtain the entirely different asymptotic expansions from the references in particular the asymptotic expansions can be denoted by the incomplete gamma function the error analysis shows that the decay of the error drastically improves as the frequency grows the effectiveness and accuracy of the methods are tested for large arguments of bessel functions

efficient method for the computation of oscillatory bessel transform and bessel hilbert transform abstract in this paper we study the numerical methods for the evaluation of two kinds of highly oscillatory bessel transforms firstly we rewrite both integrals as the sum of two integrals by rewriting the bessel function as a linear combination of whittaker w function we then transform one of integrals into the fourier type which can be transformed into the integrals on 0 and can be computed by some proper gaussian quadrature which take into account the asymptotic property of whittaker w function as x 0 the other can be efficiently computed based on the evaluation of special functions in addition error analysis for the presented methods is given moreover we also give an explicit formula for the integral 0 j x x d x in terms of meijer g function and then apply the method for the oscillatory bessel transforms to the computation of highly oscillatory bessel hilbert transforms theoretical results and numerical examples demonstrate the efficiency and accuracy of the proposed methods

asymptotic expansions of bessel anger and weber transformations in this paper we explore higher order numerical quadrature for the integrations of systems containing bessel anger and weber functions the method is constructed by finding the approximate solution of the differential equation and truncating the asymptotic series numerical examples based on theoretical results are presented to demonstrate the efficiency of the method

fourier or bessel transformations of highly oscillatory functions an algorithm for integral transformation of highly oscillatory functions is presented it is a generalization of the standard gaussian quadrature method but has the virtue that the usual tedious tests of convergence of the numerical results is not necessary the effectiveness and accuracy of the algorithm is tested for both large arguments and higher orders of the bessel function

approximation of highly oscillatory integrals containing special functions abstract a modified form of levin s method based on multi quadric radial basis function is presented for numerical evaluation of integrals having squared oscillatory bessel function of the first kind of order and oscillatory airy function the method converts the oscillatory integrals into a system of coupled ordinary differential equations odes and subsequently numerical solution of the coupled odes is obtained by meshless collocation procedure a multi resolution quadrature is used to tackle singularity of the proposed method theoretical error analysis of the proposed methods is performed in asymptotic sense numerical test problems are included to verify accuracy and efficiency of the new methods in the context of oscillatory airy and bessel integrals

approximation of certain functions given by integrals with highly oscillatory integrands there is often a need to approximate integrals of highly oscillatory functions when studying scattering and diffraction of electromagnetic waves this paper presents a method of estimating certain types of these integrals by evaluating one interpolating function and performing one or two relatively easy numerical integrations the method is demonstrated for the case of a fresnel integral

asymptotic expansions and fast computation of oscillatory hilbert transforms in this paper we study the asymptotics and fast computation of the one sided oscillatory hilbert transforms of the form begin aligned h f t e i omega t x int nolimits 0 infty e i omega t frac f t t x dt quad omega 0 quad x ge 0 end aligned where the bar indicates the cauchy principal value and f is a real valued function with analytic continuation in the first quadrant except possibly a branch point of algebraic type at the origin when x 0 the integral is interpreted as a hadamard finite part integral provided it is divergent asymptotic expansions in inverse powers of omega are derived for each fixed x ge 0 which clarify the large omega behavior of this transform we then present efficient and affordable approaches for numerical evaluation of such oscillatory transforms depending on the position of x we classify our discussion into three regimes namely x mathcal o 1 or x gg 1 0 x ll 1 and x 0 numerical experiments show that the convergence of the proposed methods greatly improve when the frequency omega increases some extensions to oscillatory hilbert transforms with bessel oscillators are briefly discussed as well

galois points for plane curves and cremona transformations abstract we study the relation between galois points for plane curves and cremona transformations first we prove that a galois point is preserved by a standard quadratic transformation then we define a certain minimality for a pair of a plane curve and a galois point so that we study defining equations of plane curves with a galois point

convexity preserving piecewise rational cubic interpolation a twice continuously differentiable piecewise rational cubic interpolant f to data s x j y j j 1 cdots n delta j 2 ne 0 x j 1 x j is defined in terms of turn parameters tau j j 1 cdots n 1 and end conditions f x 1 f x n 0 the necessary and sufficient condition f x j delta j 2 geqq 0 j 2 cdots n 1 is derived which ensures that the interpolant f preserves the local convexity concavity properties of s a fast simple and robust procedure for generating f is described and the results obtained for a specific data set s are compared with some standard cubic spline interpolants

shape preserving piecewise rational interpolation with higher order continuity abstract a united form of the classical hermite interpolation and shape preserving interpolation is presented in this paper the presented interpolation method provides higher order continuous shape preserving interpolation splines the given interpolants are explicit piecewise rational expressions without solving a linear or nonlinear system of consistency equations by setting parameter values the interpolation curve can be generated by choosing the classical piecewise hermite interpolation polynomials or the presented piecewise rational expressions for monotonicity preserving and convexity preserving interpolation the appropriate values of a parameter are given on each subinterval numerical examples indicate that the given method produces visually pleasing curves

method for numerical integration of rapidly oscillating functions in diffraction theory the quadrature of general highly oscillatory integrals is a relatively complicated computational problem that occurs in a wide range of practical applications e g in physics chemistry and image analysis it is often necessary to use a high number of nodal points with classical quadrature formulas in order to achieve a required accuracy of numerical integration of rapidly oscillating functions however an increase in integration points leads to a larger computational time our work describes and analyses a method for numerical integration of rapidly oscillating functions which enables to obtain the required accuracy with a smaller number of nodal points than classical integration rules and with a relatively simple integration formula the proposed method is generally suitable for integration of rapidly oscillating functions in various applications the method is demonstrated in examples of calculation of the diffraction integral in optics where the integrand is often a rapidly oscillatory function the results can be readily adapted to similar problems from other fields copyright 2009 john wiley sons ltd

field theory for function fields of plane quartic curves abstract let c be a smooth plane quartic curve over a field k and k c be a rational function field of c we develop a field theory for k c in the following method let p be the projection from c to a line l with a center p p 2 the p induces an extension field k c k p 1 where k p 1 is a maximal rational subfield in this paper we study the extension k c k p 1 from several points of view for example we consider the following questions when is the extension k c k p 1 galois what is the galois closure of k c k p 1

laplace transforms for approximation of highly oscillatory volterra integral equations of the first kind abstract this paper focuses on laplace and inverse laplace transforms for approximation of volterra integral equations of the first kind with highly oscillatory bessel kernels where the explicit formulae for the solution of the first kind integral equations are derived from which the integral equations can also be efficiently calculated by the clenshaw curtis filon type methods furthermore by applying the asymptotics of the solution some simpler formulas for approximating the solution for large values of the parameters are deduced preliminary numerical results are presented based on the approximate formulae and the explicit formulae which are compared with the convolution quadrature and numerical inverse laplace transform methods all these methods share that the costs the same independent of large values of frequencies

convexity preserving piecewise rational quartic interpolation a family of piecewise rational quartic interpolants is given identified uniquely by the value of a tension parameter lambda i each interpolant of the family can be c 2 spline without solving a linear or nonlinear system of consistency equations for the derivative values at the knots the interpolant can preserve the local convexity concavity properties of the given data a proper choice of lambda i to guarantee shape preservation is given a convergence analysis establishes an error bound in terms of lambda i and shows that o h 3 accuracy is obtained for c 2 continuity several examples are supplied to support the practical value of the method

convexity preserving approximation by univariate cubic splines a convexity preserving approximation method is presented similar to the cubic spline interpolation the given approximation function is univariate cubic spline with c 2 continuity a very simple computing method is described the approximation order and polynomial reproducing property of this convexity preserving approximant are discussed the computing method for interpolating a small quantity of data is given some numerical examples are given to show the effectivity

algorithm for the computation of bessel function integrals abstract a fortran subroutine is given for the computation of integrals of the form c 0 f x j v x d x where v 0 1 10

preserving convexity through rational cubic spline fractal interpolation function we propose a new type of c 1 rational cubic spline fractal interpolation function fif for convexity preserving univariate interpolation the associated iterated function system ifs involves rational functions of the form p n x q n x where p n x are cubic polynomials determined through the hermite interpolation conditions of the fif and q n x are preassigned quadratic polynomials with two shape parameters the rational cubic spline fif converges to the original function f as rapidly as the rth power of the mesh norm approaches to zero provided f r is continuous for r 1 or 2 and certain mild conditions on the scaling factors are imposed furthermore suitable values for the rational ifs parameters are identified so that the property of convexity carries from the data set to the rational cubic fifs in contrast to the classical non recursive convexity preserving interpolation schemes the present fractal scheme is well suited for the approximation of a convex function f whose derivative is continuous but has varying irregularity

on van der corput type lemmas for bessel and airy transforms and applications abstract this paper presents van der corput type lemmas for bessel and airy transforms with shifted jacobi weight functions these results on the asymptotic orders of the highly oscillatory integrals on the frequency are optimal furthermore from these estimates the convergence rates on filon type methods are easily derived

computation of oscillatory integrals with an exponential kernel and jacobi type singularities abstract in this communication two rules are considered for computing oscillatory integrals with an exponential kernel and jacobi type singularities an asymptotic rule is presented with the aid of integration by parts an asymptotic filon type quadrature rule is constructed on the basis of a two point taylor interpolation polynomial error analysis on the proposed rules in inverse powers of large frequency is provided numerical examples are provided to illustrate that the two rules are very efficient in obtaining very high precision approximations if is sufficiently large

letter to the editor on the filon and levin methods for highly oscillatory integral this paper shows that for any suitably smooth function f x and arbitrarily selected interpolation nodes c1 c2 cv in a b the filon method and the levin method for with the polynomial interpolation approach are identical when g x is a linear function based on this result a new efficient levin quadrature for is presented

on the implementation of the asymptotic filon type method for infinite integrals with oscillatory bessel kernels in this paper we consider the implementation of the asymptotic filon type method for the semi infinite highly oscillatory bessel integrals of the form 1 f x c v wx dx where c v wx denotes bessel function j v wx of the first kind y v wx of the second kind h v 1 wx and h v 2 wx of the third kind and modified bessel function k v wx of the second kind respectively f is a smooth function on 1 lim x f k x 0 k 0 1 2 and w is large by approximating f by a linear combination of negative integer powers so that the moments can be expressed by some special functions we complete the implementation of the method furthermore we give the error analysis of the method for computing the integrals the method is very efficient in obtaining very high precision approximations if w is sufficiently large numerical examples are provided to confirm our analysis

on the levin iterative method for oscillatory integrals this paper considers and gives error analysis for levin iteration method to approximate bessel trigonometric transformation i f email protected a bf x cos r 1x j m rx dx for generalized fourier transformation i f email protected a bf x e i w g x dx under the condition that g x 0 for all email protected a b levin iteration method with the initial u 0 x 0 is identical to the asymptotic method

on generalized quadrature rules for fast oscillatory integrals abstract in this paper we present numerical analysis for the generalized quadrature rule for a b f x w r x d x where w r x is an oscillatory function and derive higher order generalized quadrature rules the results show that the generalized quadrature rules are efficient for bessel trigonometric transformations and the accuracy increases when oscillation becomes faster

fast integration of highly oscillatory integrals with exotic oscillators in this paper we present an efficient filon type method for the integration of systems containing bessel functions with exotic oscillators based on a diffeomorphism transformation and give applications to airy transforms preliminary numerical results show the effectiveness and accuracy of the quadrature for large arguments of integral systems

numerical solutions to volterra integral equations of the second kind with oscillatory trigonometric kernels this paper explores quadrature methods for weakly singular volterra integral equation of the second kind with highly oscillatory trigonometric kernels and presents piecewise constant and linear collocation methods for approximation of the solution the evaluation of the highly oscillatory kernels of integral equation will give rise to the computation of oscillatory integrals which can be done by using efficient filon type methods moreover by using asymptotic analysis of the solution the convergence rates for piecewise constant and linear collocation methods which show the higher the frequency the more accurate the numerical results the effectiveness and accuracy of the proposed method are tested by numerical examples

efficient evaluation of oscillatory bessel hilbert transforms in this paper we study the asymptotics and evaluation of the oscillatory bessel hilbert transform 0 f x email protected n wx dx with 0 t the singularity of the hilbert transform is transferred to an individual oscillatory integral independent of f x for this singular integral we present two methods one is the combination of a filon type method and a complex integration method the other is the combination of a filon type method and an adaptive clenshaw curtis quadrature the remaining integral which is nonsingular can be well calculated with a combination of a filon type method and a gauss laguerre quadrature the efficiency and accuracy of the proposed methods are illustrated by numerical examples

analysis of a collocation method for integrating rapidly oscillatory functions a collocation method for approximating integrals of rapidly oscillatory functions is analyzed the method is efficient for integrals involving bessel functions j rx with a large oscillation frequency parameter r as well as for many other one and multi dimensional integrals of functions with rapid irregular oscillations the analysis provides a convergence rate and it shows that the relative error of the method is even decreasing as the frequency of the oscillations increases ko words oscillatory integrals collocation analysis

a sparse discretization for integral equation formulations of high frequency scattering problems we consider two dimensional scattering problems formulated as an integral equation defined on the boundary of the scattering obstacle the oscillatory nature of high frequency scattering problems necessitates a large number of unknowns in classical boundary element methods in addition the corresponding discretization matrix of the integral equation is dense we formulate a boundary element method with basis functions that incorporate the asymptotic behavior of the solution at high frequencies the method exhibits the effectiveness of asymptotic methods at high frequencies with only few unknowns but retains accuracy for lower frequencies new in our approach is that we combine this hybrid method with very effective quadrature rules for oscillatory integrals as a result we obtain a sparse discretization matrix for the oscillatory problem moreover numerical experiments indicate that the accuracy of the solution actually increases with increasing frequency the sparse discretization applies to problems where the phase of the solution can be predicted a priori for example in the case of smooth and convex scatterers

numerical approximations for highly oscillatory bessel transforms and applications abstract this paper presents an efficient numerical method for approximating highly oscillatory bessel transforms based on analytic continuation we transform the integrals into the problems of integrating the forms on 0 with the integrand that does not oscillate and decays exponentially fast which can be efficiently computed by using gauss laguerre quadrature rule we then derive the error of the method depending on the frequency and the node number moreover we apply the scheme for studying the approximations of the solutions of two kinds of highly oscillatory integral equations preliminary numerical results show the efficiency and accuracy of numerical approximations

choice of specific interpolation points in quadrature formula for fast oscillating integrals integrals containing trigonometric functions with non linear argument having a large multiplier are treated with the help of a specific choice of interpolation points this allows excluding the contribution of internal points of interpolation and determining upper and low bounds of the considered integral

c1 positive scattered data interpolation a local c 1 surface construction scheme is presented to preserve the shape of positive scattered data arranged over a triangular grid each boundary curve of the triangle is constructed by a rational cubic function with two free parameters and this rational function is also used for the side vertex interpolation the final surface patch is constructed by taking the convex combination of three side vertex interpolants for each triangular patch there are three boundary curves and three side vertex interpolants simple sufficient data dependent constraints are derived on these free parameters to preserve the shape of the positive scattered data the developed scheme is not only local and computationally economical but visually pleasing as well

global parametric solutions of scalar transport passive scalar transport involves complex interactions between advection and diffusion where the global transport rate depends upon scalar diffusivity and the values of the possibly large set of parameters controlling the advective flow although computation of a single solution of the advection diffusion equation ade is simple in general it is prohibitively expensive to compute the parametric variation of solutions over the full parameter space q even though this is crucial for e g optimization parameter estimation and elucidating the global structure of transport by decomposing the flows within q so as to exploit symmetries we derive a spectral method that solves the ade over q three orders of magnitude faster than other methods of similar accuracy solutions are expressed in terms of the exponentially decaying natural periodic patterns of the ade sometimes called strange eigenmodes we apply the method to the experimentally realisable rotated arc mixer chaotic flow both to establish numerical properties and to calculate the fine scale structure of the global solution space for transport in this chaotic flow over 10 5 solutions within q are resolved and spatial pattern locking a symmetry breaking transition to disordered spatial patterns and fractally distributed optima in transport rate are observed the method exhibits exponential convergence and efficiency increases with resolution of q

on numerical computation of integrals with integrands of the form f x sin w xr on 0 1 with existing numerical integration methods and algorithms it is difficult in general to obtain accurate approximations to integrals of the form 0 1f x sin wx r dxor 0 1f x cos wx r dx r 0 where f is a sufficiently smooth function on 0 1 gautschi has developed software as scripts in matlab for computing these integrals for the special case r w 1 in this paper an algorithm as a mathematica program is developed for computing these integrals to arbitrary precision for any given values of the parameters in a certain range numerical examples are given of testing the performance of the algorithm program

efficient numerical methods for bessel type of oscillatory integrals in this paper new quadrature rules are proposed for numerical evaluation of highly oscillatory integrals containing first kind of bessel functions j x meshless procedure with uniform and scattered nodes is used to cope with frequent irregular oscillations caused by bessel and bessel trigonometric functions in addition multi resolution quadrature rules based on hybrid functions and haar wavelets are used as supporting tools to handle the case of singularity of the meshless collocation method error bounds of the proposed methods are calculated and numerically verified by solving some benchmark test problems

shape preserving piecewise rational interpolant with quartic numerator and quadratic denominator an explicit representation of a piecewise rational interpolant with quartic numerator and quadratic denominator is presented for positivity data monotone data and convex data the shape preserving properties of the interpolant are given the interpolant is c 2 continuous spline with a shape parameter w i on each subinterval the values of w i to guarantee shape preservation are estimated a convergence analysis establishes an error bound in terms of w i and shows that the interpolant is o h 2 or o h 3 accurate several examples are supplied to support the practical value of the given interpolation method

a chebyshev collocation method for a class of fredholm integral equations with highly oscillatory kernels based on the filon clenshaw curtis method for highly oscillatory integrals and together with the sommariva s result sommariva 2013 for clenshaw curtis quadrature rule we present a chebyshev collocation method for a class of fredholm integral equations with highly oscillatory kernels whose unknown function is assumed to be less oscillatory than the kernel in the proposed method the filon clenshaw curtis method is used to compute the involved oscillatory integrals which makes the proposed method very precise by solving only a small system of linear equations we can obtain a very satisfactory numerical solution the performance of the presented method is illustrated by several numerical examples compared with the method proposed by li et al 2012 this method enjoys a lower computational complexity furthermore numerical examples show that the presented method has a competitive advantage on the accuracy compared with the method in li et al 2012

on the evaluation of highly oscillatory integrals by analytic continuation we consider the integration of one dimensional highly oscillatory functions based on analytic continuation rapidly converging quadrature rules are derived for a general class of oscillatory integrals with an analytic integrand the accuracy of the quadrature increases both for the case of a fixed number of points and increasing frequency and for the case of an increasing number of points and fixed frequency these results are then used to obtain quadrature rules for more general oscillatory integrals i e for functions that exhibit some smoothness but that are not analytic the approach described in this paper is related to the steepest descent method but it does not employ asymptotic expansions it can be used for small or moderate frequencies as well as for very high frequencies the approach is compared with the oscillatory integration techniques recently developed by iserles and norsett

on graded meshes for weakly singular volterra integral equations with oscillatory trigonometric kernels we compare the collocation methods on graded meshes with that on uniform meshes for the solution of the weakly singular volterra integral equation of the second kind with oscillatory trigonometric kernels due to in general unbounded derivatives at the left endpoint of the interval of integration we should approximate the solution of the integral equation by collocation methods on graded meshes however we show that this non smooth behavior of the solution has little effect on the approximate solution when the kernels of integral equation are highly oscillatory numerical examples are given to confirm the proposed results

efficient quadrature of highly oscillatory integrals using derivatives in this paper we explore quadrature methods for highly oscillatory integrals generalizing the method of stationary phase we expand such integrals into asymptotic series in inverse powers of the frequency the outcome is two families of methods one based on a truncation of the asymptotic series and the other extending an approach implicit in the work of filon filon 1928 proc r soc edinb 49 38 47 1 both kinds of methods approximate the integral as a linear combination of function values and derivatives with coefficients that may depend on frequency we determine asymptotic properties of these methods proving perhaps counterintuitively that their performance drastically improves as frequency grows the paper is accompanied by numerical results that demonstrate the potential of this set of ideas 1 ref 4

a convexity preservingc2 parametric rational cubic interpolation ac 2 parametric rational cubic interpolantr t x t i y t j t t 1 t n to data s xj yj j 1 n is defined in terms of non negative tension parameters j j 1 n 1 letp be the polygonal line defined by the directed line segments joining the points x j y j t 1 n sufficient conditions are derived which ensure thatr t is a strictly convex function on strictly left right winding polygonal line segmentsp it is then proved that there always exist j j 1 n 1 for whichr t preserves the local left righ winding properties of any polygonal linep an example application is discussed

visualization of data preserving monotonicity a rational cubic function m tian y zhang j zhu q duan convexity preserving piecewise rational cubic interpolation iscias hefei china 2005 has been used to visualize monotone data in the view of monotone curves by making constraints on free parameters in the description of rational cubic function the rational cubic function is extended to rational bicubic partially blended function coons patches simple constraints are derived on free parameters in the description of rational bicubic partially blended patches to visualize the monotone data in the view of monotone surfaces the scheme of the paper is economical to compute and visually pleasant

galois points on singular plane quartic curves abstract we study the structure of function fields of plane curves following our method developed in k miura h yoshihara field theory for function fields of plane quartic curves j algebra 226 2000 283 294 especially we study galois points on singular plane quartic curves and determine the number of galois points on them furthermore we give concrete defining equations when the curve has a galois point

hyperbolic splines and nonlinear distortion using mobius transformations we consider how to interpolate a set of monotone increasing data points x sub k y sub k so that the interpolant is a smooth invertible function and that the interpolant and its inverse have the same simple functional form we use our method to cancel jammer induced distortion in a nonlinear channel

function field theory of plane curves by dual curves we study the structure of function fields of plane curves following our method developed previously k miura and h yoshihara 2000 j algebra226 283 294 let k be the function field of a smooth plane curve c of degree d 4 and let kp be a maximal rational subfield of k for p p2 we study the field extension k kp from a geometrical viewpoint especially we give a sufficient condition that the galois group of the galois closure of k kp becomes a full symmetric group

a unified framework for asymptotic analysis and computation of finite hankel transform abstract in this paper we present a unified framework for asymptotic analysis of the finite hankel transform this framework enables us to derive asymptotic expansions of the transform including the cases where the oscillator has zeros and stationary points as a consequence two efficient and affordable methods for computing the transform numerically are discussed and a detailed analysis of their asymptotic error estimate is carried out numerical examples are provided to confirm our analysis

optimal by order quadrature formulae for fast oscillatory functions with inaccurately given a priori information abstract in this article the authors construct optimal by order quadrature formulae for integration of fast oscillatory functions in interpolational classes c 1 l n 1 and c 1 l n e 1 the construction of efficient formulae for numerical integration of fast oscillatory functions is based on the application of the residual method and the method of quasi solutions both cases weak and strong oscillations are considered results of numerical examples are presented

quadrature methods for multivariate highly oscillatory integrals using derivatives while there exist effective methods for univariate highly oscillatory quadrature this is not the case in a multivariate setting in this paper we embark on a project extending univariate theory to more variables inter alia we demonstrate that in the absence of critical points and subject to a nonresonance condition an integral over a simplex can be expanded asymptotically using only function values and derivatives at the vertices a direct counterpart of the univariate case this provides a convenient avenue towards the generalization of asymptotic and filon type methods as formerly introduced by the authors in a single dimension to simplices and more generally to polytopes the nonresonance condition is bound to be violated once the boundary of the domain of integration is smooth in effect its violation is equivalent to the presence of stationary points in a single dimension we further explore this issue and propose a technique that often can be used in this situation yet much remains to be done to understand more comprehensively the influence of resonance on the asymptotics of highly oscillatory integrals

fast computation of seabed spherical wave reflection coefficients in geoacoustic inversion this paper develops a fast numerical approach to computing spherical wave reflection coefficients swrcs for layered seabeds which provides substantial savings in computation time when used as the forward model for geoacoustic inversion of broadband seabed reflectivity data the approach exploits the sommerfeld integral representation of swrcs as the hankel transform of a function proportional to the plane wave reflection coefficient pwrc and applies levin integration to the rapidly oscillating integrand cast as the product of a pre computed media independent matrix and a vector involving pwrcs at a sparse sampling of integration angles compared to conventional simpson s rule integration for computation of the swrc the levin integration yields speed up factors of an order of magnitude or more further it results in reduced memory requirements for storage of pre computed quantities a desirable property when a graphics processing unit gpu is used for parallel computation of swrcs the paper applies trans dimensional bayesian inversion to investigate the impact of forward modeling in terms of pwrcs and swrcs on the estimation of geoacoustic parameters and uncertainties model comparisons are quantified in simulated and measured data inversions by comparing the estimated geoacoustic parameters to the true parameters or core measurements respectively and by calculating the deviance information criterion for model selection

the linear kdv equation with an interface the interface problem for the linear korteweg de vries kdv equation in one dimensional piecewise homogeneous domains is examined by constructing an explicit solution in each domain the location of the interface is known and a number of compatibility conditions at the boundary are imposed we provide an explicit characterization of sufficient interface conditions for the construction of a solution using fokas s unified transform method the problem and the method considered here extend that of earlier papers to problems with more than two spatial derivatives

on the numerical approximation for fourier type highly oscillatory integrals with gauss type quadrature rules in this paper we present an improved numerical steepest descent method for the approximation of fourier type highly oscillatory integrals based on the previous numerical steepest descent method the new method used the integrand information at endpoints and stationary points the asymptotic order is given that is improved both for the case of stationary points and stationary points free several numerical examples are presented which show the high efficiency of the proposed method numerical results support our theoretical analyses