certain families of series associated with the hurwitz lerch zeta function abstract the history of problems of evaluation of series associated with the riemann zeta function can be traced back to christian goldbach 1690 1764 and leonhard euler 1707 1783 many different techniques to evaluate various series involving the zeta and related functions have since then been developed the authors show how elegantly certain families of series involving the hurwitz lerch zeta function can be evaluated by starting with a single known identity for the hurwitz lerch zeta function some of the special cases of these series identities are also shown to lead to certain known families of summation formulas involving the hurwitz zeta function

combining the radial basis function eulerian and lagrangian schemes with geostatistics for modeling of radionuclide migration through the geosphere to assess the long term safety of a radioactive waste disposal system mathematical models are used to describe groundwater flow chemistry and potential radionuclide migration through geological formations a number of processes need to be considered when predicting the movement of radionuclides through the geosphere the most important input data are obtained from field measurements which are not available for all regions of interest for example the hydraulic conductivity as an input parameter varies from place to place in such cases geostatistical science offers a variety of spatial estimation procedures methods for solving the solute transport equation can also be classified as eulerian lagrangian and mixed the numerical solution of partial differential equations pde has usually been obtained by finite difference methods fdm finite element methods fem or finite volume methods fvm kansa introduced the concept of solving partial differential equations using radial basis functions rbf for hyperbolic parabolic and elliptic pdes the aim of this study was to present a relatively new approach to the modeling of radionuclide migration through the geosphere using radial basis function methods in eulerian and lagrangian coordinates in this study we determine the average and standard deviation of radionuclide concentration with regard to variable hydraulic conductivity which was modelled by a geostatistical approach radionuclide concentrations will also be calculated in heterogeneous and partly heterogeneous 2d porous media

ramanujan formula for the generalized stirling approximation abstract the aim of this paper is to improve ramanujan s formula for approximation of the factorial function starting from burnside s formula in contradistinction with the classical formula that starts from stirling s formula

two numerical meshless techniques based on radial basis functions rbfs and the method of generalized moving least squares gmls for simulation of coupled klein gordon schrodinger kgs equations in the present study three numerical meshless methods are being considered to solve coupled klein gordon schrodinger equations in one two and three dimensions first the time derivative of the mentioned equation will be approximated using an implicit method based on crank nicolson scheme then kansa s approach rbfs pseudo spectral ps method and generalized moving least squares gmls method will be used to approximate the spatial derivatives the proposed methods do not require any background mesh or cell structures so they are based on a meshless approach applying three techniques reduces the solution of the one two and three dimensional partial differential equations to the solution of linear system of algebraic equations as is well known the use of kansa s approach makes the coefficients matrix in the above linear system of algebraic equations to be ill conditioned and we applied lu decomposition technique but when we employ ps method fasshauer 2007 the matrix of coefficients in the obtained linear system of algebraic equations is well conditioned also the gmls technique yields a well conditioned linear system because a shifted and scaled polynomial basis will be used at the end of this paper we provide some examples on one two and three dimensions for obtaining numerical simulations also the obtained numerical results show the applicability of the proposed three methods to find the numerical solution of the kgs equations

improved multiquadric method for elliptic partial differential equations via pde collocation on the boundary the multiquadric radial basis function mq method is a recent meshless collocation method with global basis functions it was introduced for discretizing partial differential equations pdes by kansa in the early 1990s the mq method was originally used for interpolation of scattered data and it was shown to have exponential convergence for interpolation problems in 1 we have extended the kansa mq method to numerical solution and detection of bifurcations in 1d and 2d parameterized nonlinear elliptic pdes we have found there that the modest size nonlinear systems resulting from the mq discretization can be efficiently continued by a standard continuation software such as auto we have observed high accuracy with a small number of unknowns as compared with most known results from the literature in this paper we formulate an improved kansa mq method with pde collocation on the boundary mq pdecb we add an additional set of nodes which can lie inside or outside of the domain adjacent to the boundary and correspondingly add an additional set of collocation equations obtained via collocation of the pde on the boundary numerical results are given that show a considerable improvement in accuracy of the mq pdecb method over the kansa mq method with both methods having exponential convergence with essentially the same rates

unsymmetric and symmetric meshless schemes for the unsteady convection diffusion equation in this paper we investigate the application of unsymmetric and symmetric meshless collocation techniques with radial basis functions for solving the unsteady convection diffusion equation we employ the method of lines approach to discretize the governing operator equation the stability of both explicit and implicit time stepping schemes are analyzed numerical results are presented for 1d and 2d problems to compare the performance of the unsymmetric and symmetric collocation techniques we compare the performance of various globally supported radial basis functions such as multiquadric inverse multiquadric gaussian thin plate splines and quintics numerical studies suggest that symmetric collocation is only marginally better than the unsymmetric approach further it appears that both collocation techniques require a very dense set of collocation points in order to achieve accurate results for high pe clet numbers

multiscale rbf collocation for solving pdes on spheres in this paper we discuss multiscale radial basis function collocation methods for solving certain elliptic partial differential equations on the unit sphere the approximate solution is constructed in a multi level fashion each level using compactly supported radial basis functions of smaller scale on an increasingly fine mesh two variants of the collocation method are considered sometimes called symmetric and unsymmetric although here both are symmetric a convergence theory is given which builds on recent theoretical advances for multiscale approximation using compactly supported radial basis functions

a note on computational algorithm for the inverse of a square matrix this short note gives some comments on computational algorithm for inverse of a square matrix considered in paper h saberi najafi m shams solary computational algorithms for computing the inverse of a square matrix quasi inverse of a non square matrix and block matrices appl math comput in press doi 10 1016 j amc 2006 05 108 and supplements the discussion on this topic

an alternative local collocation strategy for high convergence meshless pde solutions using radial basis functions this work proposes an alternative decomposition for local scalable meshless rbf collocation the proposed method operates on a dataset of scattered nodes that are placed within the solution domain and on the solution boundary forming a small rbf collocation system around each internal node unlike other meshless local rbf formulations that are based on a generalised finite difference rbf fd principle in the proposed finite collocation method the solution of the pde is driven entirely by collocation of pde governing and boundary operators within the local systems a sparse global collocation system is obtained not by enforcing the pde governing operator but by assembling the value of the field variable in terms of the field value at neighbouring nodes in analogy to full domain rbf collocation systems communication between stencils occurs only over the stencil periphery allowing the pde governing operator to be collocated in an uninterrupted manner within the stencil interior the local collocation of the pde governing operator allows the method to operate on centred stencils in the presence of strong convective fields the reconstruction weights assigned to nodes in the stencils being automatically adjusted to represent the flow of information as dictated by the problem physics this implicit upwinding effect mitigates the need for ad hoc upwinding stencils in convective dominant problems boundary conditions are also enforced within the local collocation systems allowing arbitrary boundary operators to be imposed naturally within the solution construction the performance of the method is assessed using a large number of numerical examples with two steady pdes the convection diffusion equation and the lame navier equations for linear elasticity the method exhibits high order convergence in each case tested greater than sixth order and the use of centred stencils is demonstrated for convective dominant problems in the case of linear elasticity the stress fields are reproduced to the same degree of accuracy as the displacement field and exhibit the same order of convergence the method is also highly stable towards variations in basis function flatness demonstrating significantly improved stability in comparison to finite difference type rbf collocation methods

a family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non square matrix based on a quadratical convergence method a family of iterative methods to compute the approximate inverse of square matrix are presented the theoretical proofs and numerical experiments show that these iterative methods are very effective and more importantly these methods can be used to compute the inner inverse and their convergence proofs are given by fundamental matrix tools

sums associated with the zeta function abstract we evaluate the sums of certain classes of series involving the riemann zeta function by using the theory of the double gamma function which has recently been revived in the study of determinants of laplacians relevant connections with various known results are also pointed out

a stabilized least squares radial point collocation method ls rpcm for adaptive analysis abstract in this paper a stabilized radial point collocation method rpcm that uses locally supported nodes is proposed using least squares stabilization technique the focus of this work is to stabilize the solution of the rpcm in order to perform adaptive analysis good stiffness matrix properties such as symmetric and positive definite spd are gained via a least squares procedure and yet the formulation procedure of the stabilized ls rpcm is still kept simple and straightforward adaptive analysis study has then been successfully carried out using the stabilized ls rpcm error indicator based on interpolation error is adopted in the adaptive scheme for nodal refinement thanks for the meshfree features of the rpcm refinement process can be easily done by inserting additional nodes based on the voronoi diagram without worrying about nodal connectivity in the formulation of system equations good numerical performance has been shown in the numerical examples presented in this paper

a scalable and implicit meshless rbf method for the 3d unsteady nonlinear richards equation with single and multi zone domains the local hermitian interpolation lhi method is a strong form meshless numerical technique which uses radial basis function rbf interpolants to satisfy linear and nonlinear governing equations and boundary operators recent developments have shown that for linear transport problems applying the pde governing equation directly to the basis functions can greatly improve the accuracy and stability of the resulting solutions in this work the lhi formulation with local pde interpolation is extended to the nonlinear gravity driven richards equation in order to solve unsteady problems involving flow in unsaturated porous media the application of the linearised pde operator to the basis functions incorporates information such as the effective velocity field directly into the solution construction this results in a form of analytical upwinding which helps to stabilise the solution in addition the local interpolation itself satisfies the linearised governing equation allowing for more accurate reconstruction of partial derivatives and hence a more accurate solution the procedure is tested using a 3d infiltration problem with a known analytical solution the performance of the lhi method both with and without local pde interpolation is compared to the finite element method via the femwater software the lhi formulation with pde data centres shows consistent improvement over the femwater solutions reducing errors by several orders of magnitude in addition a procedure is introduced to model strongly heterogeneous and layered soils the physically correct matching conditions are applied over layer interfaces i e continuity of pressure and mass flux the double collocation property of the hermitian rbf method is exploited to enforce both matching conditions at the same set of locations on the layer interface this procedure allows the accurate capture of solutions across such interfaces replicating the required discontinuities in the first derivatives of the pressure profile the multi layer formulation is validated using a transient two layer infiltration problem with the analytical solution replicated to a high precision in a variety of configurations copyright 2010 john wiley sons ltd

some mathematical constants the theory of multiple gamma functions was studied in about 1900 and has been revived in the study of determinants of laplacians in the middle or so of 1980s there are some classes of mathematical constants involved naturally in the gamma and multiple gamma functions here we introduce those known mathematical constants associated with the gamma and multiple gamma functions and will show how they are involved if possible

some observations on unsymmetric radial basis function collocation methods for convection diffusion problems in this paper we re investigate the unsymmetric radial basis function rbf collocation method for solving convection diffusion problems with high peclet number as in power and barraco computers and mathematics with applications 2002 43 551 by testing different rbfs and different numbers of nodes we found that the unsymmetric method can still solve high peclet number problems reasonably well by using more nodes and domain decomposition techniques compared to solving one large problem the domain decomposition method is shown to be very efficient and can improve the accuracy especially when the peclet number is not that high from our tests it seems that the rbfs r4 ln r and r8 ln r are not very stable while r6 ln r r5 and r7 perform very well copyright 2003 john wiley sons ltd

computational algorithms for computing the inverse of a square matrix quasi inverse of a non square matrix and block matrices in this paper we have written out some methods to find the inverse of a non singular matrix and also the quasi inverse of a singular matrix the corresponding algorithms have been used to solve the linear system of equations ax b as x a 1b a comparison table of the numerical results has been designed in each case to compare the implementation of the algorithms with each other the important part of the paper is presenting a block matrix method for finding the inverse matrix the block method finds the inverse matrix with a simple and easy algorithm

a double boundary collocation hermitian approach for the solution of steady state convection diffusion problems in this article a double boundary collocation approach based on the meshless radial basis function hermitian method symmetric method is proposed and compared with the conventional single collocation in the double boundary collocation approach at the boundary collocation points the boundary condition and the governing partial differential equation are required to be satisfied simultaneously instead of only the boundary condition as required in the single collocation we are able to carry out this type of algorithm due to the robustness of the proposed hermite interpolation scheme in which the resulting matrix will be non singular as long as the partial differential operators applied to each point are linearly independent even if in a single node we impose two different differential conditions the results obtained with this new method are characterized by a higher precision especially for the prediction of the fluxes at the boundaries this is due to the higher order of continuity of the approximation at the boundary points imposed by the double collocation

an efficient numerical scheme for burgers equation this paper applies the multiquadric mq as a spatial approximation scheme for solving the nonlinear burgers equation for comparison purposes a low order explicit finite difference approximation of the time derivative is employed by decreasing the time step of the computation it is shown that the major numerical error is from the time integration instead of the mq spatial approximation the numerical results indicate that this mq offers an excellent approximation for all possible values of reynolds number an adaptive algorithm is also developed to adjust the mq interpolation points to the peak of the shock wave which is shown to provide an improved numerical result numerical comparisons are made with most of the existing numerical schemes for solving the burgers equation

certain classes of series involving the zeta function the authors apply the theory of the double gamma function which was recently revived in the study of determinants of laplacians to evaluate some families of series involving the riemann zeta function introducing a presumably new mathematical constant in the theory of the double gamma function they also systematically evaluate a definite integral of the double gamma function and various classes of series associated with zeta functions some of these definite integrals are expressed in terms of quotients of double gamma functions

the uniform convergence of thin plate spline interpolation in two dimensions let f be a function from cal r 2 to cal r that has square integrable second derivatives and let s be the thin plate spline interpolant to f at the points underline v i i 1 2 ldots n in cal r 2 we seek bounds on the error f underline x s underline x when underline x is in the convex hull of the interpolation points or when underline x is close to at least one of the interpolation points but need not be in the convex hull we find for example that if underline x is inside a triangle whose vertices are any three of the interpolation points then f underline x s underline x is bounded above by a multiple of h where h is the length of the longest side of the triangle and where the multiplier is independent of the interpolation points further if cal d is any bounded set in cal r 2 that is not a subset of a single straight line then we prove that a sequence of thin plate spline interpolants converges to f uniformly on cal d specifically we require h rightarrow 0 where h is now the least upper bound on the numbers d underline x cal v underline x in cal d and where d underline x cal v underline x in cal r 2 is the least euclidean distance from underline x to an interpolation point our method of analysis applies integration by parts and the cauchy schwarz inequality to the scalar product between second derivatives that occurs in the variational calculation of thin plate spline interpolation

solving time dependent differential equations by multiquadric trigonometric quasi interpolation multiquadric mq quasi interpolation is a popular method for the numerical solution of differential equations however mq quasi interpolation is not well suited for the equations with periodic solutions this is mainly due to the fact that its kernel the mq function is not a periodic function a reasonable way of overcoming the difficulty is to use a quasi interpolant whose kernel itself is also periodic in these cases the paper constructs such a quasi interpolant error estimates of the quasi interpolant are also provided the quasi interpolant possesses many fair properties of the mq quasi interpolant i e simplicity efficiency stability etc moreover it is more suitable than the mq quasi interpolant for periodic problems since the quasi interpolant as well as its derivatives are periodic examples of solving both linear and nonlinear partial differential equations whose solutions are periodic by the quasi interpolant and the mq quasi interpolant are compared at the end of the paper numerical results show that the quasi interpolant outperforms the mq quasi interpolant for periodic problems

beta type polynomials and their generating functions we construct generating functions for beta type rational functions and the beta polynomials by using these generating functions we derive a collection of functional equations and pdes by using these functional equations and pdes we give derivative formulas a recurrence relation and a variety of identities related to these polynomials we also give a relation between the beta type rational functions and the bernstein basis functions integrating these identities and relations we derive various combinatorial sums involving binomial coefficients some old and some new for the beta type rational functions and the bernstein basis functions finally by applying the laplace transform to these generating functions we obtain two series representations for the beta type rational functions

some q extensions of the apostol bernoulli and the apostol euler polynomials of order n and the multiple hurwitz zeta function abstract in this paper we first investigate several further interesting properties of the multiple hurwitz lerch zeta function n z s a which was introduced recently by choi et al j choi d s jang h m srivastava a generalization of the hurwitz lerch zeta function integral transform spec funct 19 2008 we then introduce and investigate some q extensions of the multiple hurwitz lerch zeta function n z s a the apostol bernoulli polynomials b k n x of order n and the apostol euler polynomials e k n x of order n relevant connections of the results presented here with those obtained in earlier works are also indicated precisely

a comparison analysis between unsymmetric and symmetric radial basis function collocation methods for the numerical solution of partial differential equations abstract in this article we present a thorough numerical comparison between unsymmetric and symmetric radial basis function collocation methods for the numerical solution of boundary value problems for partial differential equations a series of test examples was solved with these two schemes different problems with different type of governing equations and boundary conditions particular emphasis was paid to the ability of these schemes to solve the steady state convection diffusion equation at high values of the peclet number from the examples tested in this work it was observed that the system of algebraic equations obtained with the symmetric method was in general simpler to solve than the one obtained with the unsymmetric method and that the resulting algorithm performs better however the unsymmetric method has the advantage of being simpler to implement two main features about the results obtained in this work are worthy of special attention first with the symmetric method it was possible to solve convection diffusion problems at a very high peclet number without the need of any artificial damping term and second with these two approaches symmetric and unsymmetric it is possible to impose free boundary conditions for problems in unbounded domains

sums of certain series of the riemann zeta function abstract the object of the present paper is to investigate systematically several interesting families of summation formulas involving infinite series of the riemann zeta function many of the various results which are unified and generalized here in a remarkably simple manner have received considerable attention in recent years we also present a brief account of a number of analogous results associated with the hurwitz s generalized zeta function

application of radial basis functions to linear and nonlinear structural analysis problems the basic characteristic of the techniques generally known as meshless methods is the attempt to reduce or even to eliminate the need for a discretization at least not in the way normally associated with traditional finite element techniques in the context of numerical solutions for boundary and or initial value problems the interest in meshless methods is relatively new and this is why despite the existence of various applications of meshless techniques to several problems of mechanics as well as to other fields these techniques are still relatively unknown to engineers furthermore and compared to traditional finite elements it may be difficult to understand the physical meaning of the variables involved in the formulations as an attempt to clarify some aspects of the meshless techniques and simultaneously to highlight the ease of use and the ease of implementation of the algorithms applications are made in this work to structural analysis problems the technique used here consists of the definition of a global approximation for a given variable of interest in this case components of the displacement field by means of a superposition of a set of conveniently placed in the domain and on the boundary radial basis functions rbfs in this work various types of one dimensional problems are analyzed ranging from the static linear elastic case free vibration and linear stability analysis for a beam on elastic foundation to physically nonlinear damage models problems to further complement the range of problems analysed the static analysis of a plate on elastic foundation was also addressed several error measures are used to numerically establish the performance of both symmetric and nonsymmetric approaches for several global rbfs the results obtained show that rbf collocation leads to good approximations and very high convergence rates

an iterative method for computing the approximate inverse of a square matrix and the moore penrose inverse of a non square matrix in this paper an iterative scheme is proposed to find the roots of a nonlinear equation it is shown that this iterative method has fourth order convergence in the neighborhood of the root based on this iterative scheme we propose the main contribution of this paper as a new high order computational algorithm for finding an approximate inverse of a square matrix the analytical discussions show that this algorithm has fourth order convergence as well next the iterative method will be extended by theoretical analysis to find the pseudo inverse also known as the moore penrose inverse of a singular or rectangular matrix numerical examples are also made on some practical problems to reveal the efficiency of the new algorithm for computing a robust approximate inverse of a real or complex matrix

two sided inequalities for the extended hurwitz lerch zeta function abstract recently srivastava et al 2011 2 unified and extended several interesting generalizations of the familiar hurwitz lerch zeta function z s a by introducing a fox wright type generalized hypergeometric function in the kernel for this newly introduced special function two integral representations of different kinds are investigated here by means of a known result involving a fox wright generalized hypergeometric function kernel which was given earlier by srivastava et al 2011 2 and by applying some mathieu a series techniques finally by appealing to each of these two integral representations two sets of two sided bounding inequalities are proved thereby extending and generalizing the recent work by jankov et al 2011 15

certain classes of series associated with the zeta function and multiple gamma functions abstract the authors apply the theory of multiple gamma functions which was recently revived in the study of the determinants of the laplacians in order to evaluate some families of series involving the riemann zeta function by introducing a certain mathematical constant they also systematically evaluate this constant and some definite integrals of the triple gamma function various classes of series associated with the zeta function are expressed in closed forms many of these results are also used here to compute the determinant of the laplacian on the four dimensional unit sphere s 4 explicitly

radial point interpolation collocation method rpicm for partial differential equations this paper presents a truly meshfree method referred to as radial point interpolation collocation method rpicm for solving partial differential equations this method is different from the existing point interpolation method pim that is based on the galerkin weak form because it is based on the collocation scheme no background cells are required for numerical integration radial basis functions are used in the work to create shape functions a series of test examples were numerically analysed using the present method including 1 d and 2 d partial differential equations in order to test the accuracy and efficiency of the proposed schemes several aspects have been numerically investigated including the choice of shape parameter c with can greatly affect the accuracy of the approximation the enforcement of additional polynomial terms and the application of the hermite type interpolation which makes use of the normal gradient on neumann boundary for the solution of pdes with neumann boundary conditions particular emphasis was on an efficient scheme namely hermite type interpolation for dealing with neumann boundary conditions the numerical results demonstrate that good improvement on accuracy can be obtained after using hermite type interpolation the h convergence rates are also studied for rpicm with different forms of basis functions and different additional terms

a new bernoulli matrix method for solving second order linear partial differential equations with the convergence analysis in this paper a new matrix approach for solving second order linear partial differential equations pdes under given initial conditions has been proposed the basic idea includes integrating from the considered pdes and transforming them to the associated integro differential equations with partial derivatives therefore bernoulli operational matrices of differentiation and integration together with the completeness of bernoulli polynomials can be used for transforming integro differential equations to the corresponding algebraic equations a rigorous error analysis in the infinity norm is given provided that the known functions and the exact solution are sufficiently smooth and bounded a numerical example is included to demonstrate the validity and the applicability of the technique the results confirm the theoretical prediction

a family of iterative methods for computing moore penrose inverse of a matrix abstract this paper improves on generalized properties of a family of iterative methods to compute the approximate inverses of square matrices originally proposed in 1 and while the methods of 1 can be used to compute the inner inverses of any matrix it has not been proved that these sequences converge in norm to a fixed inner inverse of the matrix in this paper it is proved that the sequences indeed are convergent to a fixed inner inverse of the matrix which is the moore penrose inverse of the matrix the convergence proof of these sequences is given by fundamental matrix calculus and numerical experiments show that the third order iterations are as good as the second order iterations

series involving the zeta function and multiple gamma functions the theory of multiple gamma functions which was recently revived in the study of the determinants of the laplacians was applied in several earlier works in order to evaluate some families of series involving the riemann zeta function as well as to compute the determinants of the laplacians here in the present paper the authors address the converse problem and apply various known or new formulas for series associated with the zeta and related functions with a view to developing the corresponding theory of multiple gamma functions and then using these series to compute the determinants of the laplacians on the n dimensional unit sphere s n n 5 6 7 explicitly

a novel iterative method for computing generalized inverse in this letter we propose a novel iterative method for computing generalized inverse based on a novel kkt formulation the proposed iterative algorithm requires making four matrix and vector multiplications at each iteration and thus has low computational complexity the proposed method is proved to be globally convergent without any condition furthermore for fast computing generalized inverse we present an acceleration scheme based on the proposed iterative method the global convergence of the proposed acceleration algorithm is also proved finally the effectiveness of the proposed iterative algorithm is evaluated numerically

spectral functions special functions and the selberg zeta function the functional determinant of an eigenvalue sequence as defined by zeta regularization can be simply evaluated by quadratures we apply this procedure to the selberg trace formula for a compact riemann surface to find a factorization of the selberg zeta function into two functional determinants respectively related to the laplacian on the compact surface itself and on the sphere we also apply our formalism to various explicit eigenvalue sequences reproducing in a simpler way classical results about the gamma function and the barnesg function concerning the latter our method explains its connection to the selberg zeta function and evaluates the related glaisher kinkelin constanta

multicloud multigrid convergence with a meshless operator the primary objective of this work is to develop and test a new convergence acceleration technique we call multicloud multicloud is well founded in the mathematical basis of multigrid but relies on a meshless operator on coarse levels the meshless operator enables extremely simple and automatic coarsening procedures for arbitrary meshes using arbitrary fine level discretization schemes the performance of multicloud is compared with established multigrid techniques for structured and unstructured meshes for the euler equations on two dimensional test cases results indicate comparable convergence rates per unit work for multicloud and multigrid however because of its mesh and scheme transparency multicloud may be applied to a wide array of problems with no modification of fine level schemes as is often required with agglomeration techniques the implication is that multicloud can be implemented in a completely modular fashion allowing researchers to develop fine level algorithms independent of the convergence accelerator for complex three dimensional problems

neural network for computing pseudoinverses and outer inverses of complex valued matrices we propose two continuous time neural networks for computing generalized inverses of complex valued matrices with rank deficient cases the first of them is applicable in the pseudoinverse computation and the second one is applicable in construction of outer inverses the proposed continuous time neural networks have a low complexity of implementation and they are proved to be globally convergent without any condition compared with the existing algorithms for computing the pseudoinverse and outer inverses of matrices the global convergence of the proposed continuous time neural networks is analyzed in the complex domain effectiveness of the proposed continuous time neural networks is evaluated numerically via examples

chebyshev type methods and preconditioning techniques recently a newton s iterative method is attracting more and more attention from various fields of science and engineering this method is generally quadratically convergent in this paper some chebyshev type methods with the third order convergence are analyzed in detail and used to compute approximate inverse preconditioners for solving the linear system ax b theoretic analysis and numerical experiments show that chebyshev s method is more effective than newton s one in the case of constructing approximate inverse preconditioners

meshfree explicit local radial basis function collocation method for diffusion problems this paper formulates a simple explicit local version of the classical meshless radial basis function collocation kansa method the formulation copes with the diffusion equation applicable in the solution of a broad spectrum of scientific and engineering problems the method is structured on multiquadrics radial basis functions instead of global the collocation is made locally over a set of overlapping domains of influence and the time stepping is performed in an explicit way only small systems of linear equations with the dimension of the number of nodes included in the domain of influence have to be solved for each node the computational effort thus grows roughly linearly with the number of the nodes the developed approach thus overcomes the principal large scale problem bottleneck of the original kansa method two test cases are elaborated the first is the boundary value problem nafems test associated with the steady temperature field with simultaneous involvement of the dirichlet neumann and robin boundary conditions on a rectangle the second is the initial value problem associated with the dirichlet jump problem on a square the accuracy of the method is assessed in terms of the average and maximum errors with respect to the density of nodes number of nodes in the domain of influence multiquadrics free parameter and timestep length on uniform and nonuniform node arrangements the developed meshless method outperforms the classical finite difference method in terms of accuracy in all situations except immediately after the dirichlet jump where the approximation properties appear similar

application of the multiquadric method for numerical solution of elliptic partial differential equations abstract we have used the multiquadric mq approximation scheme for the solution of elliptic partial differential equations with dirichlet and or neumann boundary conditions the scheme has the advantage of using the data points in arbitrary locations with an arbitrary ordering two dimensional laplace poisson and biharmonic equations describing the various physical processes have been taken as the test examples the agreement is found to be very good between the computed and exact solutions the method also provides an excellent approximation with a curved boundary

higher order convergent iterative method for computing the generalized inverse and its application to toeplitz matrices abstract the main aim of this paper is to provide a higher order convergent iterative method in order to calculate the generalized inverse of a given matrix we extend the iterative method proposed in li et al w g li z li a family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non square matrix applied mathematics and computation 215 2010 3433 3442 to compute the 2 inverse generalized inverse a t s 2 2 3 inverse and 2 4 inverse moreover we modify the iterative method to compute the generalized inverse a t s 2 of toeplitz matrices by using the displacement theory

the parameter r2 in multiquadric interpolation the multiquadric mq method is an effective bivariate interpolant to three dimensional data xi yi zi where the xi yi are arbitrarily located in the plane the accuracy of the mq method is dependent on a user defined parameter r2 and most practitioners select r2 based upon the number of data points and the locations of the xi yi in the plane we observe that the optimal value of r2 is a strong function of the zi and that it is essentially independent of both the number and the locationsof the xi yi points contrary to some opinions we observe that the mq method can effectively interpolate to track data that is data sampled densely along tracks in the plane together with several other observations we present an algorithm that generally yields an effective value for r2

iterative method for computing the moore penrose inverse based on penrose equations an iterative algorithm for estimating the moore penrose generalized inverse is developed the main motive for the construction of the algorithm is simultaneous usage of penrose equations 2 and 4 convergence properties of the introduced method as well as their first order and second order error terms are considered numerical experiment is also presented

estimating the digamma and trigamma functions by completely monotonicity arguments abstract we establish new sharp bounds for the digamma and trigamma functions using the complete monotonicity of some class of functions

a numerical study of compact approximations based on flat integrated radial basis functions for second order differential equations abstract in this paper we propose a simple but effective preconditioning technique to improve the numerical stability of integrated radial basis function irbf methods the proposed preconditioner is simply the inverse of a well conditioned matrix that is constructed using non flat irbfs much larger values of the free shape parameter of irbfs can thus be employed and better accuracy for smooth solution problems can be achieved furthermore to improve the accuracy of local irbf methods we propose a new stencil namely combined compact irbf ccirbf in which i the starting point is the fourth order derivative and ii nodal values of first and second order derivatives at side nodes of the stencil are included in the computation of first and second order derivatives at the middle node in a natural way the proposed stencil can be employed in uniform nonuniform cartesian grids the preconditioning technique in combination with the ccirbf scheme employed with large values of the shape parameter are tested with elliptic equations and then applied to simulate several fluid flow problems governed by poisson burgers convection diffusion and navier stokes equations highly accurate and stable solutions are obtained in some cases the preconditioned schemes are shown to be several orders of magnitude more accurate than those without preconditioning

a new algorithm for computing the inertia of eigenproblems ax λx and ax λbx abstract the inertia of a n n complex matrix a is defined to be an integer triple in a a a a where a is the number of eigenvalues of a with positive real parts a is the number of eigenvalues with negative real parts and a is the number of eigenvalues with zero real parts in this paper we show that the inertia can be computed by gereshgorin theorem and block shift and invert algorithm for equation ax bx or ax x and this algorithm is compared by function eig m and sptarn m in matlab

a meshless method on non fickian flows with mixing length growth in porous media based on radial basis functions a comparative study the present study aims to introduce a solution for parabolic integro differential equations arising in heat conduction in materials with memory which naturally occur in many applications two radial basis functions rbfs collocation schemes are employed for solving this equation the first method tested is an unsymmetric method and the second one which appears to be more efficient is a symmetric one the convergence of these two schemes is accelerated as we use the cartesian nodes as the center nodes

evaluation of series with hurwitz and lerch zeta function coefficients by using hankel contour integrals we introduce a new technique for evaluation of series with zeta coefficients and also for evaluation of certain integrals involving the loggamma function this technique is based on hankel integral representations of the hurwitz zeta the lerch transcendent the digamma and loggamma functions