Recursive evaluation of space-time lattice Green's functions
Enumeration in graph theory (05C30) Generalized hypergeometric series, ({}_pF_q) (33C20) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Asymptotic behavior of solutions to PDEs (35B40) Time series analysis of dynamical systems (37M10) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Fundamental solutions, Green's function methods, etc. for initial value and initial-boundary value problems involving PDEs (65M80) Numerical aspects of recurrence relations (65Q30) Symbolic computation and algebraic computation (68W30)
- No-neighbours recurrence schemes for space-time Green's functions on a 3D simple cubic lattice
- Lattice Green's functions in all dimensions
- A general method for calculating lattice green functions on the branch cut
- DIFFERENTIAL EQUATION APPROACH FOR ONE- AND TWO-DIMENSIONAL LATTICE GREEN'S FUNCTION
- On computing the square lattice Green's function without any integrations
- On computing the square lattice Green's function without any integrations
- A general method for calculating lattice green functions on the branch cut
- No-neighbours recurrence schemes for space-time Green's functions on a 3D simple cubic lattice
- Efficient computation of lattice Green functions for models with longer range hopping
- Rapid evaluation of the periodic Green function inddimensions
- Lattice Green’s Functions for High-Order Finite Difference Stencils
This page was built for publication: Recursive evaluation of space-time lattice Green's functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920346)
