information theoretic lengths of jacobi polynomials the information theoretic lengths of the jacobi polynomials p n x which are information theoretic measures renyi shannon and fisher of their associated rakhmanov probability density are investigated they quantify the spreading of the polynomials along the orthogonality interval 1 1 in a complementary but different way as the root mean square or standard deviation because contrary to this measure they do not refer to any specific point of the interval the explicit expressions of the fisher length are given the renyi lengths are found by the use of the combinatorial multivariable bell polynomials in terms of the polynomial degree n and the parameters the shannon length which cannot be exactly calculated because of its logarithmic functional form is bounded from below by using sharp upper bounds to general densities on 1 1 given in terms of various expectation values moreover its asymptotics is also pointed out finally several computational issues relative to these three quantities are carefully analyzed

integral transforms and chebyshev like polynomials we use the integral representation method to derive the properties of chebyshev polynomials and of their generalized forms

a moving finite element method with error estimation and refinement for one dimensional time dependent partial differential equations we discuss a moving finite element method for solving vector systems of time dependent partial differential equations in one space dimension the mesh is moved so as to equidistribute the spatial component of the discretization error in h 1 we present a method of estimating this error by using p hierarchic finite elements the error estimate is also used in an adaptive mesh refinement procedure to give an algorithm that combines mesh movement and refinement we discretize the partial differential equations in space using a galerkin procedure with piecewise linear elements to approximate the solution and quadratic elements to estimate the error a system of ordinary differential equations for mesh velocities are used to control element motions we use existing software for stiff ordinary differential equations for the temporal integration of the solution the error estimate and the mesh motion computational results using a code based on our method are presented for several examples

moving mesh methods in multiple dimensions based on harmonic maps in practice there are three types of adaptive methods using the finite element approach namely the h method p method and r method in the h method the overall method contains two parts a solution algorithm and a mesh selection algorithm these two parts are independent of each other in the sense that the change of the pdes will affect the first part only however in some of the existing versions of the r method also known as the moving mesh method these two parts are strongly associated with each other and as a result any change of the pdes will result in the rewriting of the whole code in this work we will propose a moving mesh method which also contains two parts a solution algorithm and a mesh redistribution algorithm our efforts are to keep the advantages of the r method e g keep the number of nodes unchanged and of the h method e g the two parts in the code are independent a framework for adaptive meshes based on the hamilton schoen yau theory was proposed by dvinsky in this work we will extend dvinsky s method to provide an efficient solver for the mesh redistribution algorithm the key idea is to construct the harmonic map between the physical space and a parameter space by an iteration procedure each iteration step is to move the mesh closer to the harmonic map this procedure is simple and easy to program and also enables us to keep the map harmonic even after long times of numerical integration the numerical schemes are applied to a number of test problems in two dimensions it is observed that the mesh redistribution strategy based on the harmonic maps adapts the mesh extremely well to the solution without producing skew elements for multi dimensional computations

fuzzy homogeneity and scale space approach to color image segmentation image segmentation is the procedure in which the original image is partitioned into homogeneous regions and has many applications in this paper a fuzzy homogeneity and scale space approach to color image segmentation is proposed a color image is transformed into fuzzy domain with maximum fuzzy entropy principle the fuzzy homogeneity histogram is employed and both global and local informations are considered when we process fuzzy homogeneity histogram the scale space filter is utilized for analyzing the fuzzy homogeneity histogram to find the appropriate segments of the homogeneity histogram bounded by the local extrema of the derivatives a fuzzy region merging process is then implemented based on color difference and cluster sizes to avoid over segmentation the proposed method is compared with the space domain approach and experimental results demonstrate the effectiveness of the proposed approach

a local refinement finite element method for one dimensional parabolic systems vector systems of parabolic partial differential equations in one space dimension are solved by an adaptive local mesh refinement galerkin finite element procedure piecewise linear polynomials are used for the spatial representation of the solution and the backward euler method is used for temporal integration a local error indicator based on an estimate of the local discretization error is used to control an adaptive feedback mesh refinement strategy where finer space time meshes are recursively added to coarser ones in regions where greater solution resolution is needed a posteriori estimates of the local discretization error are obtained by a p refinement procedure that uses piecewise quadratic hierarchic finite element approximations in space and trapezoidal rule integration in time superconvergence properties of the finite element method are used to neglect errors at nodes and thereby increase the computational efficiency of the error estimation procedure further improvements in computational e

the quantum relativistic harmonic oscillator spectrum of zeros of its wave functions the distribution of zeros of the wave functions of the quantum relativistic harmonic oscillator is studied an analytic approximate expression for this distribution is derived within the framework of the wkb approximation using potential theory techniques it is proved that this wkb approach gives the right asymptotic distribution which is explicitly calculated

galerkin runge kutta discretizations for parabolic equations with time dependent coefficients a new class of fully discrete galerkin runge kutta methods is constructed and analyzed for linear parabolic initial boundary value problems with time dependent coefficients unlike any classical counterpart this class offers arbitrarily high order convergence while significantly avoiding what has been called order reduction in support of this claim error estimates are proved and computational results are presented additionally since the time stepping equations involve coefficient matrices changing at each time step a preconditioned iterative technique is used to solve the linear systems only approximately nevertheless the resulting algorithm is shown to preserve the original convergence rate while using only the order of work required by the base scheme applied to a linear parabolic problem with time independent coefficients furthermore it is noted that special runge kutta methods allow computations to be performed in parallel so that the final execution time can be reduced to that of a low order method

temporal error control for convection dominated equations in two space dimensions a new time integration strategy for the solution of convection dominated partial differential equations in two space dimensions by the method of lines is presented the strategy aims to ensure that the time integration error is less than the spatial discretisation error this is achieved by making use of the individual contributions of the local spatial discretisation error and the local time integration error to the global error in the numerical solution numerical results are used to illustrate the performance of this strategy

blockwise adaptivity for time dependent problems based on coarse scale adjoint solutions we describe and test an adaptive algorithm for evolution problems that employs a sequence of blocks consisting of fixed though nonuniform space meshes this approach offers the advantages of adaptive mesh refinement but with reduced overhead costs associated with load balancing remeshing matrix reassembly and the solution of adjoint problems used to estimate discretization error and the effects of mesh changes a major issue with a block adaptive approach is determining block discretizations from coarse scale solution information that achieve the desired accuracy we describe several strategies for achieving this goal using adjoint based a posteriori error estimates and we demonstrate the behavior of the proposed algorithms as well as several technical issues in a set of examples

multi level hp adaptivity for cohesive fracture modeling summary discretization induced oscillations in the load displacement curve are a well known problem for simulations of cohesive crack growth with finite elements the problem results from an insufficient resolution of the complex stress state within the cohesive zone ahead of the crack tip this work demonstrates that the hp version of the finite element method is ideally suited to resolve this complex and localized solution characteristic with high accuracy and low computational effort to this end we formulate a local and hierarchic mesh refinement scheme that follows dynamically the propagating crack tip in this way the usually applied static a priori mesh refinement along the complete potential crack path is avoided which significantly reduces the size of the numerical problem studying systematically the influence of h refinement p refinement and hp refinement we demonstrate why the suggested hp formulation allows to capture accurately the complex stress state at the crack front preventing artificial snap through and snap back effects this allows to decrease significantly the number of degrees of freedom and the simulation runtime furthermore we show that by combining this idea with the finite cell method the crack propagation within complex domains can be simulated efficiently without resolving the geometry by the mesh copyright 2016 john wiley sons ltd

a moving mesh finite element algorithm for singular problems in two and three space dimensions a framework for adaptive meshes based on the hamilton schoen yau theory was proposed by dvinsky in a recent work 2001 j comput phys 170 562 588 we extended dvinsky s method to provide an efficient moving mesh algorithm which compared favorably with the previously proposed schemes in terms of simplicity and reliability in this work we will further extend the moving mesh methods based on harmonic maps to deal with mesh adaptation in three space dimensions in obtaining the variational mesh we will solve an optimization problem with some appropriate constraints which is in contrast to the traditional method of solving the euler lagrange equation directly the key idea of this approach is to update the interior and boundary grids simultaneously rather than considering them separately application of the proposed moving mesh scheme is illustrated with some two and three dimensional problems with large solution gradients the numerical experiments show that our methods can accurately resolve detail features of singular problems in 3d

automatically determine the membership function based on the maximum entropy principle abstract fuzzy set theory has been successfully applied to many image processing and pattern recognition tasks in order to use the fuzzy logic approach membership functions for fuzzy sets must be determined first because many properties of images such as brightness of graylevels are strongly context dependent it is not easy to determine the membership function correctly in this paper the fuzzy set brightness of graylevels of an image is used as an example to illustrate how the membership function can be determined automatically we start with the concept of fuzzy event and use the maximum entropy principle as the criterion to find a membership function which will best represent the membership of brightness for each graylevel in an image that is the membership function is determined by finding a membership function such that the corresponding fuzzy event has maximum entropy the membership of brightness can be represented by an s function whose shape can be determined by the parameters a b and c the problem becomes to find a best parameter combination aopt bopt copt which is a combinatorial optimization problem the simulated annealing algorithm is used to solve this problem in this paper we have done the experiments on several images the results have shown that the proposed method can automatically and effectively find the brightness membership function for images the robustness of the proposed algorithm is also proved by the experiments though we used image processing as the application domain of the proposed approach the basic idea can be extended to other applications easily

moving finite element methods for evolutionary problems i theory abstract in this paper the first of two on the subject we present a unified approach to moving and fixed finite element methods for evolutionary problems in terms of projections the central theoretical results are concerned with moving finite elements for one dimensional scalar problems particularly hyperbolic equations with shocks but the viewpoint extends to general systems in any number of dimensions

energy stable numerical methods for hyperbolic partial differential equations using overlapping domain decomposition overlapping domain decomposition methods otherwise known as overset grid or chimera methods are useful for simplifying the discretization of partial differential equations in or around complex geometries though in wide use such methods are prone to numerical instability unless numerical diffusion or some other form of regularization is used especially for higher order methods to address this shortcoming high order provably energy stable overlapping domain decomposition methods are derived for hyperbolic initial boundary value problems the overlap is treated by splitting the domain into pieces and using generalized summation by parts derivative operators and polynomial interpolation new implicit and explicit operators are derived that do not require regularization for stability in the linear limit applications to linear and nonlinear problems in one and two dimensions are presented where it is found the explicit operators are preferred to the implicit ones

relativistic orthogonal polynomials are jacobi polynomials we identify the recently studied relativistic orthogonal polynomials in terms of jacobi polynomials so all their properties follow from the corresponding properties of jacobi polynomials through a change of variable

moving mesh strategy based on a gradient flow equation for two dimensional problems in this paper we introduce a moving mesh method for solving pdes in two dimensions it can be viewed as a higher dimensional generalization of the moving mesh pde mmpde strategy developed in our previous work for one dimensional problems w huang y ren and r d russell siam j numer anal 31 1994 pp 709 730 the mmpde is derived from a gradient flow equation which arises using a mesh adaptation functional in turn motivated from the theory of harmonic maps geometrical interpretations are given for the gradient equation and functional and basic properties of this mmpde are discussed numerical examples are presented where the method is used both for mesh generation and for solving time dependent pdes the results demonstrate the potential of the mesh movement strategy to concentrate the mesh points so as to adapt to special problem features and to also preserve a suitable level of mesh orthogonality

old and new results about relativistic hermite polynomials we provide new proofs of already known results as well as new results about the family of relativistic hermite polynomials we use essentially probabilistic tools such as moment representations pioneered by ismail et al but also subordination that allows to explicit links between gegenbauer usual hermite and relativistic hermite polynomials

a spectrally accurate method for overlapping grid solution of incompressible navier stokes equations an overlapping mesh methodology that is spectrally accurate in space and up to third order accurate in time is developed for solution of unsteady incompressible flow equations in three dimensional domains the ability to decompose a global domain into separate but overlapping subdomains eases mesh generation procedures and increases flexibility of modeling flows with complex geometries the methodology employs implicit spectral element discretization of equations in each subdomain and explicit treatment of subdomain interfaces with spectrally accurate spatial interpolation and high order accurate temporal extrapolation and requires few if any iterations yet maintains the global accuracy and stability of the underlying flow solver the overlapping mesh methodology is thoroughly validated using two dimensional and three dimensional benchmark problems in laminar and turbulent flows the spatial and temporal convergence is documented and is in agreement with the nominal order of accuracy of the solver the influence of long integration times as well as inflow outflow global boundary conditions on the performance of the overlapping grid solver is assessed in a turbulent benchmark of fully developed turbulent pipe flow the turbulent statistics with the overlapping grids is validated against published available experimental and other computation data scaling tests are presented that show near linear strong scaling even for moderately large processor counts a novel overlapping grid method for incompressible flow equations is developed the overlapping grid method is based on spectral element discretization the method maintains global spectral accuracy with polynomial refinement an explicit interface extrapolation scheme for temporal coupling is proposed the scheme allows for high order temporal accuracy with only a few iterations

the arbitrary local mesh replacement method an alternative to remeshing for crack propagation analysis a finite element based method is proposed to accommodate the arbitrary motion of a crack in the context of general two dimensional configurations of loading and body geometry the primary goal is to render consistently accurate simulations of crack propagation while maintaining a high degree of computational efficiency and without an undue burden on the analyst the essence of the method here called the arbitrary local mesh replacement method is the replacement of the finite element interpolant in the vicinity of the crack tip with one that is derived from a moving mesh patch the boundary of the patch is not required to be coincident with background mesh element edges accordingly a weak statement of compatibility is enforced on the interface between the two meshes thereby introducing a small set of additional force type unknowns also partial elements are manifest near the patch boundary a special numerical integration rule is devised for their treatment

adaptive local overlapping grid methods for parabolic systems in two space dimensions abstract adaptive mesh refinement techniques are described for two dimensional systems of parabolic partial differential equations solutions are calculated using galerkin s method with a piecewise bilinear basis in space and backward euler integration in time a posteriori estimates of the local discretization error of piecewise bilinear finite element solutions are obtained by a p refinement technique these error estimates are used to control a local h refinement strategy where finer grids are recursively introduced in regions where a prescribed tolerance is exceeded fine grids at a given level of refinement may overlap each other and independent solutions are generated on each of them a version of the schwarz alternating principle is used to coordinate solutions between overlapping fine grids computational results demonstrating the performance of the adaptive procedure on linear and nonlinear problems and apparent convergence of the error estimate for linear heat conduction problem and uniform global refinement is presented

determinants with orthogonal polynomial entries we use moment representations of orthogonal polynomials to evaluate the corresponding hankel determinants formed by the orthogonal polynomials we also study the hankel determinants which start with p n on the top left hand corner as examples we evaluate the hankel determinants whose entries are q ultraspherical or al salam chihara polynomials

iterative refinement of possibility distributions by learning for pixel based classification this paper proposes an approach referred as iterative refinement of possibility distributions by learning irpdl for pixel based image classification the irpdl approach is based on the use of possibilistic reasoning concepts exploiting expert knowledge sources as well as ground possibilistic seeds learning the set of seeds is constructed by incrementally updating and refining the possibility distributions synthetic images as well as real images from the rider breast mri database are being used to evaluate the irpdl performance its performance is compared with three relevant reference methods region growing semi supervised fuzzy pattern matching and markov random fields the irdpl performance in terms of recognition rate 87 3 is close to the markovian method 88 8 that is considered to be the reference in pixel based image classification irpdl outperforms the other two methods respectively at the recognition rates of 83 9 and 84 7 in addition the proposed irpdl requires fewer parameters for the mathematical representation and presents a reduced computational complexity

the relativistic hermite polynomial is a gegenbauer polynomial it is shown that the polynomials introduced recently by aldaya bisquert and navarro salas phys lett a 156 381 1991 in connection with a relativistic generalization of the quantum harmonic oscillator can be expressed in terms of gegenbauer polynomials this fact is useful in the investigation of the properties of the corresponding wave function some examples are given in particular related to the asymptotic behavior and to the distribution of zeros of the polynomials for large quantum numbers

moving finite element methods for evolutionary problems ii applications abstract in this the second of two papers on the subject we present applications of the moving finite element method to a number of test problems key features are linear elements a direct approach to parallelism and node overtaking avoiding penalty functions rapid inversion of the mass matrix by preconditioned conjugate gradients and explicit euler time stepping the resulting codes are fast and efficient and are able to follow fronts and similar features with great accuracy the paper includes a substantial section on changes of dependent variable and front tracking techniques for non linear diffusion problems test problems include non linear hyperbolic conservation laws and non linear parabolic equations in one and two dimensions

the finite element method for parabolic equations ii a posteriori error estimation and adaptive approach abstract we extend in this paper the analysis of a posteriori estimates of the space discretization error presented in a previous paper 3 for time independent space meshes in the context of the model problem studied there results are given relating the effectivity of the error estimator to properties of the solution space meshes and manner in which the meshes change a procedure based upon this theory is presented for the adaptive construction of time dependent meshes the results of some computational experiments show that this procedure is practically very effective and suggest that it can be used to control the space discretization error in more general problems author

an iterative grid redistribution method for singular problems in multiple dimensions we introduce an iterative grid redistribution method based on the variational approach the iterative procedure enables us to gain more precise control of the grid distribution near the regions of large solution variations the method is particularly effective for solving partial differential equations with singular solutions e g blowup solutions our method requires little prior information of the singular solutions and can handle multiple singularities the method is successfully applied to the nonlinear schrodinger equation and the keller segal equations where solutions with multiple blowup points can be solved up to times very close to the blowup time

a contact finite element formulation for biological soft hydrated tissues as part of the highly complex numerical simulation of human joints a finite element formulation for contact between layers of articular cartilage has been developed a biphasic description of the cartilage is used where the material is considered to be a porous permeable solid matrix with fluid flowing through it governing equations and contact boundary conditions are summarized for this material before developing the finite element formulation from a galerkin weighted residual statement lagrange multipliers are introduced to enforce the two kinetic continuity equations across the contact surface and an iterative scheme is employed to determine the current contact area numerical examples are presented which demonstrate both that the appropriate continuity across the contact surface is enforced and that the contact surface definition is accurate

parametric indices of fuzziness for automated image enhancement this paper presents an automated fuzziness driven algorithm for image enhancement a class of parametric indices of fuzziness is introduced which serves as the optimization criterion of the contrast enhancement procedure we show that the parametric class of indices constitutes a one parameter generalization of the linear index of fuzziness of a set the modification of the membership values of image pixels in the fuzzy plane is performed by finding the optimal s function which maximizes the parametric index of fuzziness pif the first order fuzzy moment of the image is used for tuning the pif experimental results demonstrate the efficiency of the proposed framework in enhancing even highly low contrasted images and also its ability to improve existing contrast enhancing algorithms

some identities for the moments of random variables having a linear rescaling the student s t distribution abstract taking advantage of nadarajah s representation of modified chebyshev polynomials by means of the random variable that has the student s t distribution s nadarajah on modified chebyshev polynomials j math anal appl 334 2007 1492 1494 the scope of this paper is the generation of the identities for the moments of linear rescaling random variables that have the student s t distribution

microcalcification detection using fuzzy logic and scale space approaches abstract breast cancer is one of the leading causes of women mortality in the world since the causes are unknown breast cancer cannot be prevented it is difficult for radiologists to provide both accurate and uniform evaluation over the enormous number of mammograms generated in widespread screening computer aided mammography diagnosis is an important and challenging task microcalcifications and masses are the early signs of breast carcinomas and their detection is one of the key issues for breast cancer control in this study a novel approach to microcalcification detection based on fuzzy logic and scale space techniques is presented first we employ fuzzy entropy principal and fuzzy set theory to fuzzify the images then we enhance the fuzzified image finally scale space and laplacian of gaussian filter techniques are used to detect the sizes and locations of microcalcifications a free response operating characteristic curve is used to evaluate the performance the major advantage of the proposed method is its ability to detect microcalcifications even in the mammograms of very dense breasts a data set of 40 mammograms nijmegen database containing 105 clusters of microcalcifications is studied experimental results demonstrate that the microcalcifications can be accurately and efficiently detected using the proposed approach it can produce lower false positives and false negatives than the existing methods

second order exponential differential operator and generalized hermite polynomials abstract both univariate and multivariate generalized hermite polynomials are defined by introducing second order exponential differential operator corresponding probabilistic expressions are given explicitly based on those expectation expressions their generating functions recursion relations and other properties are derived conveniently in connection to stein s identities in particular orthogonality are investigated and associated expressions are presented accordingly additionally some other classical identities related to hermite polynomials are proved by an alternative way and some examples and remarks are presented

the multi level hp method for three dimensional problems dynamically changing high order mesh refinement with arbitrary hanging nodes abstract one main challenge of the h p version of the finite element method is the high implementational complexity of the method resulting from the added need of handling hanging nodes appropriately the multi level h p formulation recently introduced for two dimensional applications aims at alleviating these difficulties without compromising the approximation quality this is achieved by changing from the conventional refine by replacement approach to a refine by superposition idea the current work shows that the multi level h p approach can be extended naturally to three dimensional refinement without increasing the complexity of the rule set ensuring linear independence and compatibility of the shape functions in this way a three dimensional h p refinement scheme is formulated in which hanging nodes are avoided by definition this ease of complexity allows for a highly flexible discretization kernel featuring arbitrary irregular meshes and a continuous refinement and coarsening throughout the simulation runtime different numerical examples demonstrate that even in the presence of singularities this novel refinement scheme yields exponential convergence with respect to both the number of unknowns and the computational time it is further shown that the refinement scheme is able to capture complex solution features that demand for three dimensional refinement patterns the dynamic discretization properties of the approach are demonstrated by continuously refining and coarsening the mesh during the simulation runtime to keep the refinement zone local to a moving singularity finally it is shown that the high approximation power of the multi level h p scheme also carries over to curved geometries common in engineering practice without a significant detrimental effect on the conditioning of the stiffness matrix

second order finite element approximations and a posteriori error estimation for two dimensional parabolic systems we discuss an adaptive local refinement finite element method of lines for solving vector systems of parabolic partial differential equations on two dimensional rectangular regions the partial differential system is discretized in space using a galerkin approach with piecewise eight node serendipity functions an a posteriori estimate of the spatial discretization error of the finite element solution is obtained using piecewise fifth degree polynomials that vanish on the edges of the rectangular elements of a grid ordinary differential equations for the finite element solution and error estimate are integrated in time using software for stiff differential systems the error estimate is used to control a local spatial mesh refinement procedure in an attempt to keep a global measure of the error within prescribed limits examples appraising the accuracy of the solution and error estimate and the computational efficiency of the procedure relative to one using bilinear finite elements are presented

fuzzy partitioning of continuous attributes through discretization methods to construct fuzzy decision tree classifiers abstract generating membership functions mfs from data is one of the fundamental challenges associated with the applications of fuzzy set theory this paper proposes a new two step algorithm which uses discretization methods for initial partitioning to generate mfs from data in the first step discretization algorithm divides domain of attributes to several partitions and then in the second step an mf is defined on each partition four different methods are proposed to define mfs in the second step the first method is based on partition width the second is based on standard deviation of examples the third is based on coverage rate of neighbor partitions npcr and the last one is based on coverage rate of partition pcr coverage rate of partition and coverage rate of neighbor partition are two new introduced parameters which can be used for mf generation in addition this paper proposes a new mf generation algorithm called fuzzy entropy based fuzzy partitioning febfp which is a specific version of the proposed two step algorithm with some modifications febfp uses fuzzy entropy of partition to generate mfs and involves the parameters of mfs in the process of mf generation to combine two steps of the algorithm non parametric statistical tests are used to compare fuzzy decision trees fdts induced using the mfs generated by the proposed methods employing different discretization algorithms as well as four mf generation methods experimental results show that eight methods outperform the others in terms of both accuracy and number of nodes among them trapezoidal mfs that are defined by pcr on partitions generated by zeta discretization algorithm outperform the others when the accuracy and complexity of fdt have the same degree of importance moreover the results show that the pcr and npcr mf definition methods perform better than the other ones

a local space time adaptive scheme in solving two dimensional parabolic problems based on domain decomposition methods we describe a local space time adaptive refinement and derefinement method for solving systems of parabolic partial differential equations solutions are calculated on local space time meshes using a domain decomposition finite element algorithm in space and an extrapolation algorithm in time an a posteriori spatial error estimate controls a local spatial refinement strategy and an a posteriori temporal error estimate monitors temporal refinement and order of the integration a multiplicative schwarz algorithm is used to coordinate solutions between overlapping grids we use nearly minimal fine meshes which follow the dynamics of the problems in an efficient manner

combined hermite spectral finite difference method for the fokker planck equation the convergence of a class of combined spectral finite difference methods using hermite basis applied to the fokker planck equation is studied it is shown that the hermite based spectral methods are convergent with spectral accuracy in weighted sobolev space numerical results indicating the spectral convergence rate are presented a velocity scaling factor is used in the hermite basis and is shown to improve the accuracy and effectiveness of the hermite spectral approximation with no increase in workload some basic analysis for the selection of the scaling factors is also presented

the moving finite element method applications to general partial differential equations with multiple large gradients abstract the moving finite element mfe method has been reduced to practice in the automatic solution program dyla for general systems of transient partial differential equations pdes in 1 d several test examples are presented which illustrate the unique node movement and systematic control features which are intrinsic in the mfe method computational dilemmas of numerical diffusion gibbs overshooting and undershooting zone tangling and grid remap or re connection aliasing which occur frequently in conventional pde methods are essentially eliminated in the mfe method arbitrarily large gradients or shocks can be solved with extremely high resolution and accuracy for non coincident or even counterdirected propagating wavefronts boundary layers of arbitrarily small dimensions are solved with high accuracy simultaneously with the large scale structures in reactive and non reactive fluid calculations the mfe method requires a small fraction of the grid nodes which are used in conventional pde solution methods because the nodes migrate continuously and systematically to those positions where they are most needed in order to yield accurate pde solutions on entire problem domains courant friedrichs lewy time step limits are exceeded by wide margins by factors of two to several thousand finally the extension of the mfe method to 2 d is briefly discussed

stability analysis of interface temporal discretization in grid overlapping methods we investigate the stability of a temporal discretization of interface terms in grid overlapping methods a matrix stability analysis is performed on a model problem of the one dimensional diffusion equation on overlapping grids the scheme stability is first analyzed theoretically and a proof of the unconditional stability of the first order interface extrapolation scheme with the first and second order time integration for any overlap size is presented for the higher order schemes we obtain explicit estimates of the spectral radius of the corresponding discrete matrix operator and document the values of the stability threshold depending on the number of grid points and the size of overlap the influence of iterations on stability properties is also investigated numerical experiments are then presented relating the obtained stability bounds to the observed numerical values semidiscrete analysis confirms the derived scaling for the stability bounds

a three dimensional adaptive method based on the iterative grid redistribution in this paper we develop a three dimensional adaptive method based on iterative grid redistribution technique introduced in j comput phys 159 2000 246 the key step for the successful implementation is a fast algorithm for grid generation which is composed of solving the linear grid equation systems and an efficient method for inverting a map by computing iso surface intersections to carry out the three dimensional calculations the whole procedure is also parallelized on a pc cluster the improved and extended three dimensional adaptive method is applied to solve pdes with singular solutions that have three dimensional structures numerical experiments have demonstrated the method s effectiveness

optimal numerical parameterization of discontinuous galerkin method applied to wave propagation problems this paper deals with the high order discontinuous galerkin dg method for solving wave propagation problems first we develop a one dimensional dg scheme and numerically compute dissipation and dispersion errors for various polynomial orders an optimal combination of time stepping scheme together with the high order dg spatial scheme is presented it is shown that using a time stepping scheme with the same formal accuracy as the dg scheme is too expensive for the range of wave numbers that is relevant for practical applications an efficient implementation of a high order dg method in three dimensions is presented using 1d convergence results we further show how to adequately choose elementary polynomial orders in order to equi distribute a priori the discretization error we also show a straightforward manner to allow variable polynomial orders in a dg scheme we finally propose some numerical examples in the field of aero acoustics

the finite element method for parabolic equations in this first of two papers computable a posteriori estimates of the space discretization error in the finite element method of lines solution of parabolic equations are analyzed for time independent space meshes the effectiveness of the error estimator is related to conditions on the solution regularity mesh family type and asymptotic range for the mesh size for clarity the results are limited to a model problem in which piecewise linear elements in one space dimension are used the results extend straight forwardly to systems of equations and higher order elements in one space dimension while the higher dimensional case requires additional considerations the theory presented here provides the basis for the analysis and adaptive construction of time dependent space meshes which is the subject of the second paper computational results show that the approach is practically very effective and suggest that it can be used for solving more general problems

a numerical approach to study the kramers equation for finite geometries boundary conditions and potential fields the kramers equation for the phase space function which models the dynamics of an underdamped brownian particle is the subject of our study numerical solutions of this equation for natural boundaries unconfined geometries have been well reported in the literature but not much has been done on the kramers equation for finite confining geometries which require a set of additional constraints imposed on the phase space function at physical boundaries in this paper we present numerical solutions for the kramers equation with a variety of potential fields namely constant linear harmonic and periodic in the presence of fully absorbing and fully reflecting boundary conditions bcs the choice of the numerical method and its implementation take into consideration the type of bcs in order to avoid the use of ghost points or artificial conditions we study and assess the conditions under which the numerical method converges various aspects of the solutions for the phase space function are presented with figures and discussed in detail