modelling damped acoustic waves by a dissipation preserving conformal symplectic method we propose a novel stable and efficient dissipation preserving method for acoustic wave propagations in attenuating media with both correct phase and amplitude through introducing the conformal multi symplectic structure the intrinsic dissipation law and the conformal symplectic conservation law are revealed for the damped acoustic wave equation the proposed algorithm is exactly designed to preserve a discrete version of the conformal symplectic conservation law more specifically two subsystems in conjunction with the original damped wave equation are derived one is actually the conservative hamiltonian wave equation and the other is a dissipative linear ordinary differential equation ode system standard symplectic method is devoted to the conservative system whereas the analytical solution is obtained for the ode system an explicit conformal symplectic scheme is constructed by concatenating these two parts of solutions by the strang splitting technique stability analysis and convergence tests are given thereafter a benchmark model in homogeneous media is presented to demonstrate the effectiveness and advantage of our method in suppressing numerical dispersion and preserving the energy dissipation further numerical tests show that our proposed method can efficiently capture the dissipation in heterogeneous media

derivation and analysis of a filtered backprojection algorithm for cone beam projection data the authors address the problem of three dimensional image reconstruction from cone beam projections modifying a result due to a a kirillov soviet math dokl vol 2 p 268 9 1961 the authors derive an inversion formula for the case where the cone vertices form an unbounded curve for the special case in which the cone vertices form a circle an approximate reconstruction formula is developed and shown to be essentially equivalent to the practical cone beam algorithm of l a feldkamp et al 1984 for this approximate inverse the authors derive the resulting spatially varying point spread function examine the effect of bandlimiting due to sampling and compare the resulting image quality as a function of the radius of the circle formed by the cone vertices

on block triangular preconditioned iteration methods for solving the helmholtz equation abstract to further improve the efficiency of solving the helmholtz equation in heterogeneous media with large wavenumber the krylov subspace methods incorporated with a class of inexact rotated block triangular preconditioners are presented to solve a block two by two linear system derived from the discrete helmholtz equation we further develop the eigenvalue properties of the preconditioned matrices to discuss the convergence of the corresponding preconditioned iteration methods the superiority of such preconditioned iteration methods is prominent according to the numerical results when comparing with other classical iteration methods we also investigate how the wavenumber influences the performance of the corresponding methods and it is shown that the iteration number of our proposed methods linearly increase with the wavenumber roughly furthermore the computational wave fields which conform the real physical law are exhibited to show the correctness of our proposed numerical modeling algorithm

a method for the integration in time of certain partial differential equations abstract a method for the numerical solution of ordinary differential equations is analyzed that is explicit and yet can conserve the quadratic quantities conserved by the equations the method can be a useful alternative to the usual leapfrog technique in that it does not suffer from the occurrence of blowup phenomena numerical examples concerning the korteweg de vries equation and the nonlinear schrodinger equation are given

on k t subnormal covering codes the concept of a k t subnormal covering code is defined it is discussed how an amalgamated direct sumlike construction can be used to combine such codes the existence of optimal q n m 1 codes c is discussed such that by puncturing the first coordinate of c one obtains a code with q 1 subnorm 2

p sv wave propagation in heterogeneous media velocity stress finite difference method i present a finite difference method for modeling p sv wave propagation in heterogeneous media this is an extension of the method i previously proposed for modeling sh wave propagation by using velocity and stress in a discrete grid the two components of the velocity cannot be defined at the same node for a complete staggered grid the stability condition and the p wave phase velocity dispersion curve do not depend on the poisson s ratio while the s wave phase velocity dispersion curve behavior is rather insensitive to the poisson s ratio therefore the same code used for elastic media can be used for liquid media where s wave velocity goes to zero and no special treatment is needed for a liquid solid interface typical physical phenomena arising with p sv modeling such as surface waves are in agreement with analytical results the weathered layer and corner edge models show in seismograms the same converted phases obtained by previous authors this method gives stable results for step discontinuities as shown for a liquid layer above an elastic half space the head wave preserves the correct amplitude finally the corner edge model illustrates a more complex geometry for the liquid solid interface as the poisson s ratio v increases from 0 25 to 0 5 the shear converted phases are removed from seismograms and from the time section of the wave field

a note on bounds for q ary covering codes two strongly seminormal codes over z sub 5 are constructed to prove a conjecture of ostergard see ibid vol 37 no 3 p 660 4 1991 it is shown that a result of honkala see ibid vol 37 no 4 p 1203 6 1991 on k t subnormal codes holds also under weaker assumptions a lower bound and an upper bound on k sub q n r the minimal cardinality of a q ary code of length n with covering radius r are obtained these give improvements in seven upper bounds and twelve lower bounds by ostergard for k sub q n r for q 3 4 and 5

explicit runge kutta like schemes to solve certain quantum operator equations of motion we propose a kind of explicit sympletic runge kutta like scheme to solve operator equations of motion in quantum mechanics and in a quantum scalar field theory

multidirectional vector based elastic reverse time migration and angle domain common image gathers with approximate wavefield decomposition of p and s waves abstractelastic reverse time migration e rtm has limitations when the migration velocities contain strong contrasts first the traditional scheme of p s wave mode separation is based on helmholtz s equations which ignore the conversion between p and s waves at the current separation time thus it contains an implicit assumption of the constant shear modulus and requires smoothing the heterogeneous model to approximately satisfy a locally constant condition second the vector based imaging condition needs to use the reflection image normal and it also cannot give the correct polarity of the pp image in all possible conditions third the angle domain common image gathers adcigs calculated using the poynting vectors pvs do not consider the wave interferences that happen at each reflector therefore smooth models are often used for e rtm we relax this condition by proposing an improved data flow that involves three new contributions the first contribution is an improved system of p s wave mode

grid dispersion and stability criteria of some common finite element methods for acoustic and elastic wave equations purely numerical methods based on finite element approximation of the acoustic or elastic wave equation are becoming increasingly popular for the generation of synthetic seismograms we present formulas for the grid dispersion and stability criteria for some popular finite element methods fem for wave propagation namely classical and spectral fem we develop an approach based on a generalized eigenvalue formulation to analyze the dispersive behavior of these fems for acoustic or elastic wave propagation that overcomes difficulties caused by irregular node spacing within the element and the use of high order polynomials as is the case for spectral fem analysis reveals that for spectral fem of order four or greater dispersion is less than 0 2 at four to five nodes per wavelength and dispersion is not angle dependent new results can be compared with grid dispersion results of some classical finite difference methods fdm used for acoustic or elastic wave propagation analysis reveals that fdm and classical fem require a larger sampling ratio than a spectral fem to obtain results with the same degree of accuracy the staggered grid fdm is an efficient scheme but the dispersion is angle dependent with larger values along the grid axes on the other hand spectral fem of order four or greater is isotropic with small dispersion making it attractive for simulations with long propagation times

accurate and efficient seismic modeling in random media the optimum method for seismic modeling in random media must 1 be highly accurate to be sensitive to subtle effects of wave propagation 2 allow coarse sampling to model media that are large compared to the scale lengths and wave propagation distances which are long compared to the wavelengths this is necessary to obtain statistically meaningful overall attributes of wavefields high order staggered grid finite difference algorithms and the pseudospectral method combine high accuracy in time and space with coarse sampling investigations for random media reveal that both methods lead to nearly identical wavefields the small differences can be attributed mainly to differences in the numerical dispersion this result is important because it shows that errors of the numerical differentiation which are caused by poor polynomial interpolation near discontinuities do not accumulate but cancel in a random medium where discontinuities are numerous the differentiator can be longer than the medium scale leng

sh wave propagation in heterogeneous media velocity stress finite difference method a new finite difference fd method is presented for modeling sh wave propagation in a generally heterogeneous medium this method uses both velocity and stress in a discrete grid density and shear modulus are similarly discretized avoiding any spatial smoothing therefore boundaries will be correctly modeled under an implicit formulation standard problems quarter plane propagation sedimentary basin propagation are studied to compare this method with other methods finally a more complex example a salt dome inside a two layered medium shows the effect of lateral propagation on seismograms recorded at the surface a corner wave always in phase with the incident wave and a head wave will appear which will pose severe problems of interpretation with the usual vertical migration methods

a cone beam reconstruction algorithm using shift variant filtering and cone beam backprojection an exact inversion formula written in the form of shift variant filtered backprojection fbp is given for reconstruction from cone beam data taken from any orbit satisfying h k tuy s 1983 sufficiency conditions the method is based on a result of p grangeat 1987 involving the derivative of the three dimensional 3d radon transform but unlike grangeat s algorithm no 3d rebinning step is required data redundancy which occurs when several cone beam projections supply the same values in the radon domain is handled using an elegant weighting function and without discarding data the algorithm is expressed in a convenient cone beam detector reference frame and a specific example for the case of a dual orthogonal circular orbit is presented when the method is applied to a single circular orbit even though tuy s condition is not satisfied it is shown to be equivalent to the well known algorithm of l a feldkamp et al 1984

on the covering radius of codes the covering radius r of a code is the maximal distance of any vector from the code this work gives a number of new results concerning t n k the minimal covering radius of any binary code of length n and dimension k for example t n 4 and t n 5 are determined exactly and reasonably tight bounds on t n k are obtained for any k when n is large these results are found by using several new constructions for codes with small covering radius one construction the amalgamated direct sum involves a quantity called the norm of a code codes with norm leq 2 r 1 are called normal and may be combined efficiently the paper concludes with a table giving bounds on t n k for n leq 64

new lower bounds for binary covering codes g d chen et al ibid vol it 32 p 680 94 1986 presented two new lower bounds for k n r where k n r denotes the minimum cardinality of a binary code of length n and covering radius r the author shows that a slight modification gives further improvements and some examples are given to confirm the argument codes that have a certain partitioning property are considered

kernel optimum nearly analytical discretization kond algorithm applied to parabolic and hyperbolic equations abstract two applications of the kernel optimum nearly analytical discretization kond algorithm to the parabolic and the hyperbolic type equations are presented in detail to lead to novel numerical schemes with very high numerical accuracy it is demonstrated numerically that the two dimensional kond p scheme for the parabolic type yields much less numerical error by over 2 3 orders measured quantitatively by the root mean square deviation from analytical solutions and reduces the cpu time to about 1 5 for a common numerical accuracy compared with the conventional explicit scheme of reference it is also demonstrated numerically that the kond h scheme for the hyperbolic type yields much less diffusive error and has fairly high stability for both of the linear and the nonlinear wave propagations compared with other conventional schemes origins of numerical errors in data processing in general numerical schemes are discussed

discontinuous galerkin methods for hamiltonian odes and pdes in this article we present a unified framework of discontinuous galerkin dg discretizations for hamiltonian odes and pdes we show that with appropriate numerical fluxes the numerical algorithms deduced from dg discretizations can be combined with the symplectic methods in time to derive the multi symplectic prk schemes the resulting numerical discretizations are applied to the linear and nonlinear schrodinger equations some conservative properties of the numerical schemes are investigated and confirmed in the numerical experiments

modeling the scalar wave equation with nystrom methods high accuracy numerical schemes for modeling of the scalar wave equation based on nystrom methods are developed in this paper space is discretized by using the pseudospectral algorithm for the time discretization nystrom methods are used a fourth order symplectic nystrom method with pseudospectral spatial discretization is presented this scheme is compared with a commonly used second order scheme and a fourth order nonsymplectic nystrom method for a typical time step size the second order scheme exhibits spatial dispersion errors for long time simulations while both fourth order schemes do not suffer from these errors numerical comparisons show that the fourth order symplectic algorithm is more accurate than the fourth order nonsymplectic one the capability of the symplectic nystrom method in approximately preserving the discrete energy for long time simulations is also demonstrated

a note on stability of a three stage difference scheme for ordinary differential equations abstract the stability of a three stage difference scheme constructed in 1 is discussed with the construction process given out concisely at first we also present some numerical examples to test our theoretical results

multisymplectic geometry and multisymplectic preissmann scheme for the kdv equation the multisymplectic structure of the kdv equation is presented directly from the variational principle from the numerical view point we give a multisymplectic twelve points scheme which is equivalent to the multisymplectic preissmann scheme finally we test the twelve points scheme on solitary waves over long time intervals

fourth order finite difference p sv seismograms i describe the properties of a fourth order accurate space second order accurate time two dimensional p sk finite difference scheme based on the madariagavirieux staggered grid formulation the numerical scheme is developed from the first order system of hyperbolic elastic equations of motion and constitutive laws expressed in particle velocities and stresses the madariaga virieux staggered grid scheme has the desirable quality that it can correctly model any variation in material properties including both large and small poisson s ratio materials with minimal numerical dispersion and numerical anisotropy dispersion analysis indicates that the shortest wavelengths in the model need to be sampled at 5 gridpoints wavelength the scheme can be used to accurately simulate wave propagation in mixed acoustic elastic media making it ideal for modeling marine problems explicitly calculating both velocities and stresses makes it relatively simple to initiate a source at the free surface or within a layer and to satisfy free surface boundary conditions benchmark comparisons of finite difference and analytical solutions to lamb s problem are almost identical as are comparisons of finite difference and reflectivity solutions for elastic elastic and acoustic elastic layered models

invariant sets under linear operator and covering codes over modules let a be a finite commutative ring with identity a subset h of the a module an is called an r short covering of an if every vector of this module can be written as a sum of a scalar multiple of an element in h and an a linear combination with at most r canonical vectors let c a n r denote the smallest cardinality of an r short covering of an in order to explore the symmetries of such coverings we investigate a characterization of invariant sets under certain linear operator over a finite ring a based on its factorization into local rings as a consequence new classes of upper bounds on c a n r are obtained extending previous results moreover an optimal class on c a n r is derived from a construction of mds codes over certain rings

exponential integrators preserving local conservation laws of pdes with time dependent damping driving forces abstract structure preserving algorithms for solving conservative pdes with added linear dissipation are generalized to systems with time dependent damping driving terms this study is motivated by several pde models of physical phenomena such as korteweg de vries klein gordon schrodinger and camassa holm equations all with damping driving terms and time dependent coefficients since key features of the pdes under consideration are described by local conservation laws which are independent of the boundary conditions the proposed second order in time discretizations are developed with the intent of preserving those local conservation laws the methods are respectively applied to a damped driven nonlinear schrodinger equation and a damped camassa holm equation numerical experiments illustrate the structure preserving properties of the methods as well as favorable results over other competitive schemes

further results on the covering radius of codes a number of upper and lower bounds are obtained for k n r the minimal number of codewords in any binary code of length n and covering radius r several new constructions are used to derive the upper bounds including an amalgamated direct sum construction for nonlinear codes this construction works best when applied to normal codes and we give some new and stronger conditions which imply that a linear code is normal an upper bound is given for the density of a covering code over any alphabet and it is shown that k n 2 r 1 leq k n r holds for sufficiently large n

upper bounds for q ary covering codes new methods for constructing q ary covering codes are presented the author introduces the concepts of p seminormal and strongly p seminormal codes and shows how seminormal codes and punctured hamming codes can be combined to construct new covering codes using these methods upper bounds for ternary covering codes are improved the new bounds are k sub 3

improved sphere bounds on the covering radius of codes the sphere bound is a trivial lower bound on k n r the minimal cardinality of any binary code of length n and with covering radius r by simple arguments it is considerably improved to k n 1 or 2 sup n n for n even a table of lower and upper bounds on k n r for n

forward modeling by a fourier method a fourier or pseudospectral forward modeling algorithm for solving the two dimensional acoustic wave equation is presented the method utilizes a spatial numerical grid to calculate spatial derivatives by the fast fourier transform time derivatives which appear in the wave equation are calculated by second order differcncing the scheme requires fewer grid points than finite diffcrcnce methods to achieve the same accuracy it is therefore believed that the fourier method will prove more efficient than finitedifference methods especially when dealing with threedimensional models the fourier forward modeling method was tested against two problems a single layer problem with a known analytic solution and a wedge problem which was also tested by physical modeling the numerical results agreed with both the analytic and physical model results furthermore the numerical model facilitates the explanation of certain events on the time section of the physical model which otherwise could not easily be taken into account

an inversion formula for cone beam reconstruction an analytic inversion formula allowing the reconstruction of a three dimensional object from x ray cone beams is given the formula is valid for the case where the source of the beams describes a bounded curve satisfying a set of weak conditions

derivation and implementation of a cone beam reconstruction algorithm for nonplanar orbits b d smith ibid vol mi 4 p 15 25 1985 opt eng vol 29 p 524 34 1990 and p grangeat these de doctorat 1987 lecture notes in mathematics 1497 p 66 97 1991 derived a cone beam inversion formula that can be applied when a nonplanar orbit satisfying the completeness condition is used although grangeat s inversion formula is mathematically different from smith s one they have similar overall structures to each other the contribution of the present paper is two fold first based on the derivation of smith the authors point out that grangeat s inversion formula and smith s one can be conveniently described using a single formula the smith grangeat inversion formula that is in the form of space variant filtering followed by cone beam backprojection furthermore the resulting formula is reformulated for data acquisition systems with a planar detector to obtain a new reconstruction algorithm second the authors make two significant modifications to the new algorithm to reduce artifacts and numerical errors encountered in direct implementation of the new algorithm as for exactness of the new algorithm the following fact can be stated the algorithm based on grangeat s intermediate function is exact for any complete orbit whereas that based on smith s intermediate function should be considered as an approximate inverse excepting the special case where almost every plane in 3d space meets the orbit the validity of the new algorithm is demonstrated by simulation studies

direct reconstruction of cone beam data acquired with a vertex path containing a circle cone beam data acquired with a vertex path satisfying the data sufficiency condition of tuy can be reconstructed using exact filtered backprojection algorithms these algorithms are based on the application to each cone beam projection of a two dimensional 2 d filter that is nonstationary and therefore more complex than the one dimensional 1 d ramp filter used in the approximate algorithm of feldkamp davis and kress 1984 fdk we determine in this paper the general conditions under which the 2 d nonstationary filter reduces to a 2 d stationary filter and also give the explicit expression of the corresponding convolution kernel using this result and the redundancy of the cone beam data a composite algorithm is derived for the class of vertex paths that consist of one circle and some complementary subpath designed to guarantee data sufficiency in this algorithm the projections corresponding to vertex points along the circle are filtered using a 2 d stationary filter whereas the other projections are handled with a 2 d nonstationary filter the composite algorithm generalizes the method proposed by kudo and saito 1990 in which the circle data are processed with a 1 d ramp filter as in the fdk algorithm the advantage of the 2 d filter introduced in this paper is to guarantee that the filtered cone beam projections do not contain singularities in smooth regions of the object tests of the composite algorithm on simulated data are presented

two dimensional nonlinear inversion of seismic waveforms numerical results the nonlinear problem of inversion of seismic waveforms can be set up using least squares methods the inverse problem is then reduced to the problem of minimizing a lp nonquadratic function in a space of many 104to106 variables using gradient methods leads to iterative algorithms each iteration implying a forward propagation generated by the actual sources a backward propagation generated by the data residuals acting as if they were sources and a correlation at each point of the space of the two fields thus obtained which gives the updated model the quality of the results of any inverse method depends heavily on the realism of the forward modeling finite difference schemes are a good choice relative to realism because although they are time consuming they give excellent results numerical tests performed with multioffset synthetic data from a two dimensional model prove the feasibility of the approach if only surface recorded reflections are used the high spatial frequency content of the

a survey on symplectic and multi symplectic algorithms we simply review symplectic and multi symplectic algorithms in the paper these algorithms have many superiorities to general non symplectic algorithms such as they have long time behavior they can preserve the symplectic geometry structure of the hamiltonian system exactly and they can simulate original physical phenomena well some commonly used methods to construct symplectic and multi symplectic schemes are simply surveyed numerical examples are also enumerated to illustrate their performances

energy conservation issues in the numerical solution of the semilinear wave equation in this paper we discuss energy conservation issues related to the numerical solution of the semilinear wave equation as is well known this problem can be cast as a hamiltonian system that may be autonomous or not depending on the prescribed boundary conditions we relate the conservation properties of the original problem to those of its semi discrete version obtained by the method of lines subsequently we show that the very same properties can be transferred to the solutions of the fully discretized problem obtained by using energy conserving methods in the hbvms hamiltonian boundary value methods class similar arguments hold true for different types of hamiltonian partial differential equations e g the nonlinear schrodinger equation

high order multi symplectic schemes for the nonlinear klein gordon equation in this paper we construct multi symplectic schemes with any order of accuracy for the nonlinear klein gordon equation by concatenating the symplectic schemes for odes some existing schemes such as the preissman scheme and the leap frog scheme and new multi symplectic schemes are constructed we also show that the composition method which plays a crucial role in finding the high order symplectic integrators for the odes can also be applied to construct high order multi symplectic schemes for pdes extension of the concatenating method to more than one space dimension is also discussed numerical experiments are presented to show the order and the efficiency of the constructed multi symplectic schemes

conformal conservation laws and geometric integration for damped hamiltonian pdes conformal conservation laws are defined and derived for a class of multi symplectic equations with added dissipation in particular the conservation laws of energy and momentum are considered along with those that arise from linear symmetries numerical methods that preserve these conformal conservation laws are presented in detail providing a framework for proving a numerical method exactly preserves the dissipative properties considered the conformal methods are compared analytically and numerically to standard conservative methods which includes a thorough inspection of numerical solution behavior for linear equations damped klein gordon and sine gordon equations and a damped nonlinear schrodinger equation are used as examples to demonstrate the results

multi stage symplectic schemes of two kinds of hamiltonian systems for wave equations abstract multi stage schemes for wave equation are constructed their stability conditions are discussed

dispersion relation preserving stereo modeling method beyond nyquist frequency for acoustic wave equation abstractaccording to nyquist shannon sampling theory two sampling points of the displacements per minimal wavelength are required to reconstruct a wavefield however high frequency components above the nyquist frequency can be theoretically recovered by introducing spatial derivatives of the displacements we have developed a new finite difference scheme for solving the acoustic equation named the dispersion relation preserving stereo modeling method which is practical for seismic forward modeling beyond the nyquist frequency the key idea in this model is to approximate the high order spatial derivatives with wavenumber domain optimization in wavefields represented by the wave displacements and their gradients we investigated the theoretical properties of this method including the absolute error of spatial operators numerical error stability criterion and computational efficiency our results indicated that the method can effectively suppress the numerical dispersion on extremely coarse grids wi

unstructured grid method for stress wave propagation in elastic media a new numerical method named unstructured grid method is presented to calculate two dimensional stress wave propagation problems in elastic media this method is based on the dynamic equilibrium equations of the investigated lumps that are formed among the auxiliary unstructured grids the approach to the solution is obtained by calculating the node displacements and the central point stresses of the spatial grids alternately the stability criterion of the method is given and tested numerically analysis of dispersion for numerical phase velocity is studied the rule is provided to determine the spatial step size of discretization mesh so as to ensure the numerical accuracy of the unstructured grid method numerical results are compared with the available exact solutions and with the solutions of central difference method for demonstrating the good accuracy of the new method the unstructured grid method possesses higher calculating speed than the central difference method finally the dynamic behavior of a square plate with a hole under an impact loading is researched

modeling of the acoustic wave equation with transform methods numerical methods are described for the simulation of wave phenomena with application to the modeling of seismic data two separate topics are studied the first deals with the solution of the acoustic wave equation the second topic treats wave phenomena whose direction of propagation is restricted within 90 degrees from a given axis in the numerical methods developed here the wave field is advanced in time by using standard time differencing schemes on the other hand expressions including space derivative terms are computed by fourier transform methods this approach to computing derivatives minimizes truncation errors another benefit of transform methods becomes evident when attempting to restrict propagation to upward moving waves e g to avoid multiple reflections constraints imposed on the direction of the wave propagation are accomplished most precisely in the wavenumber domain the error analysis of the algorithms shows that truncation errors are due mainly to time discretization such er

the application of high order differencing to the scalar wave equation the second order central difference is often used to approximate the derivatives of the wave equation it is demonstrated that gains in computational efficiency can be made by using high order approximations for these derivatives a one dimensional model is used to illustrate the relative accuracy of o t2 x2 o t2 x4 o t4 x4 ando t4 x10 central difference schemes for comparison o t2 ando t4 pseudospectral schemes are used as an additional measure of performance the results indicate that o t4 x10 differencing can achieve similar accuracy as the o t4 spectral scheme for practical illustration a two dimensional form of the o t4 x10 algorithm is used to compute the exploding reflector response of a salt dome model and compared with a fine grid o t2 x4 result transmissive sponge like boundary conditions are also examined and shown to be effective

3d weak dispersion reverse time migration using a stereo modeling operator reliable 3d imaging is a required tool for developing models of complex geologic structures reverse time migration rtm as the most powerful depth imaging method has become the preferred imaging tool because of its ability to handle complex velocity models including steeply dipping interfaces and large velocity contrasts finite difference methods are among the most popular numerical approaches used for rtm however these methods often encounter a serious issue of numerical dispersion which is typically suppressed by reducing the grid interval of the propagation model resulting in large computation and memory requirements in addition even with small grid spacing numerical anisotropy may degrade images or worse provide images that appear to be focused but position events incorrectly recently stereo operators have been developed to approximate the partial differential operator in space these operators have been used to develop several weak dispersion and efficient stereo modeling methods that have been found to be superior to conventional algorithms in suppressing numerical dispersion and numerical anisotropy we generalized one stereo modeling method fourth order nearly analytic central difference nacd from 2d to 3d and applied it to 3d rtm the rtm results for the 3d seg eage phase a classic data set 1 and the seg advanced modeling project model demonstrated that even when using a large grid size the nacd method can handle very complex velocity models and produced better images than can be obtained using the fourth order and eighth order lax wendroff correction lwc schemes we also applied 3d nacd and fourth order lwc to a field data set and illustrated significant improvements in terms of structure imaging horizon layer continuity and positioning we also investigated numerical dispersion and found that not only does the nacd method have superior dispersion characteristics but also that the angular variation of dispersion is significantly less than for lwc

anisotropic wave propagation through finite difference grids an algorithm is presented to solve the elastic wave equation by replacing the partial differentials with finite differences it enables wave propagation to be simulated in three dimensions through generally anisotropic and heterogeneous models the space derivatives are calculated using discrete convolution sums while the time derivatives are replaced by a truncated taylor expansion a centered finite difference scheme in cartesian coordinates is used for the space derivatives leading to staggered grids the use of finite difference approximations to the partial derivatives results in a frequency dependent error in the group and phase velocities of waves for anisotropic media the use of staggered grids implies that some of the elements of the stress and strain tensors must be interpolated to calculate the hook sum this interpolation induces an additional error in the wave properties the overall error depends on the precision of the derivative and interpolation operators the anisotropic symmetry system its orientation and the degree of anisotropy the dispersion relation for the homogeneous case was derived for the proposed scheme since we use a general description of convolution sums to describe the finite difference operators the numerical wave properties can be calculated for any space operator and an arbitrary homogeneous elastic model in particular phase and group velocities of the three wave types can be determined in any direction we demonstrate that waves can be modeled accurately even through models with strong anisotropy when the operators are properly designed

symplectic integration of hamiltonian wave equations the numerical integration of a wide class of hamiltonian partial differential equations by standard symplectic schemes is discussed with a consistent hamiltonian approach we discretize the hamiltonian and the poisson structure separately then form the the resulting ode s the stability accuracy and dispersion of different explicit splitting methods are analyzed and we give the circumstances under which the best results can be obtained in particular when the hamiltonian can be split into linear and nonlinear terms many different treatments and examples are compared

a symplectic method for structure preserving modelling of damped acoustic waves in this paper a symplectic method for structure preserving modelling of the damped acoustic wave equation is introduced the equation is traditionally solved using non symplectic schemes however these schemes corrupt some intrinsic properties of the equation such as the conservation of both precision and the damping property in long term calculations in the method presented an explicit second order symplectic scheme is used for the time discretization whereas physical space is discretized by the discrete singular convolution differentiator the performance of the proposed scheme has been tested and verified using numerical simulations of the attenuating scalar seismic wave equation scalar seismic wave field modelling experiments on a heterogeneous medium with both damping and high parameter contrasts demonstrate the superior performance of the approach presented for suppression of numerical dispersion long term computational experiments display the remarkable capability of the approach presented for long time simulations of damped acoustic wave equations promising numerical results suggest that the approach is suitable for high precision and long time numerical simulations of wave equations with damping terms as it has a structure preserving property for the damping term

explicit symplectic schemes to solve vortex systems abstract here we propose a family of explicit symplectic schemes for vortex systems which are corresponding to the symmetry of these systems

third order symplectic integration method with inverse time dispersion transform for long term simulation the symplectic integration method is popular in high accuracy numerical simulations when discretizing temporal derivatives however it still suffers from time dispersion error when the temporal interval is coarse especially for long term simulations and large scale models we employ the inverse time dispersion transform itdt to the third order symplectic integration method to reduce the time dispersion error first we adopt the pseudospectral algorithm for the spatial discretization and the third order symplectic integration method for the temporal discretization then we apply the itdt to eliminate time dispersion error from the synthetic data as a post processing method the itdt can be easily cascaded in traditional numerical simulations we implement the itdt in one typical exiting third order symplectic scheme and compare its performances with the performances of the conventional second order scheme and the rapid expansion method theoretical analyses and numerical experiments show that the itdt can significantly reduce the time dispersion error especially for long travel times the implementation of the itdt requires some additional computations on correcting the time dispersion error but it allows us to use the maximum temporal interval under stability conditions thus its final computational efficiency would be higher than that of the traditional symplectic integration method for long term simulations with the aid of the itdt we can obtain much more accurate simulation results but with a lower computational cost we use the inverse time dispersion transform to the 3rd order symplectic integration it can greatly reduce the time dispersion error especially for long travel times it is superior to the conventional 2nd and high order finite difference methods it allows the maximum temporal interval under stability conditions thus is efficient we can obtain more accurate simulation results but with a lower computational cost

applications of higher order self adjoint schemes to partial differential equations abstract in this paper we apply the higher order self adjoint schemes constructed in 1 to wave equation and heat equation to show these methods can also be used to solve partial differential equations to get higher order accuracy in the time direction

on normal and subnormal q ary codes the authors extend to the q ary case the notions of a normal code a subnormal code and the amalgamated direct sum construction in order to investigate problems related to the covering radius of codes for example the authors prove that every nonbinary nontrivial perfect code is absubnormal they also include some linear programming lower bounds on ternary codes with covering radius 2 or 3

lower bounds for q ary covering codes the authors prove combinatorial lower bounds for k sub q n r the minimal cardinality of any q ary code of length n and covering radius r tables of lower bounds for k sub q n r are presented for q 3 4 5

cone beam reconstruction with sources on a curve an inversion procedure is developed for reconstructing a function of compact support in mathbb r 3 from its divergent beam x ray transform with sources on a curve the results apply to many curves not satisfying the conditions of tuy siam j appl math 43 1983 pp 546 552 for example planar circles of sufficiently large radius in some cases estimates in sobolev norms are established for the inversion operator

construction of symplectic schemes for wave equations via hyperbolic functions sinh x cosh x and tanh x abstract hamiltonian systems are canonical systems on phase space endowed with symplectic structures the dynamical evolutions i e the phase flow of the hamiltonian systems are symplectic transformations which are area preserving the importance of the hamiltonian systems and their special property require the numerical algorithms for them should preserve as much as possible the relevant symplectic properties of the original systems feng kang 1 3 proposed in 1984 a new approach to computing hamiltonian systems from the view point of symplectic geometry he systematically described the general method for constructing symplectic schemes with any order accuracy via generating functions a generalization of the above theory and methods for canonical hamiltonian equations in infinite dimension can be found in 4 using self adjoint schemes we can construct schemes of arbitrary even order 5 these schemes can be applied to wave equation 6 7 and the stability of them can be seen in 7 8 in this paper we will use the hyperbolic functions sinh x cosh x and tanh x to construct symplectic schemes of arbitrary order for wave equations and stabilities of these constructed schemes are also discussed