An Algorithm for Computing Fundamental Solutions

DOI10.1137/S0097539704446360MaRDI QIDQ5470734zbMATH OpenOpenAlexFDO

Authors Klaus Weihrauch, Ning Zhong

Publication date 1 June 2006

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539704446360

zbMATH Keywords

computable analysisfundamental solutionpartial differential equationsTuring machine

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60)

Recommendations

• An algorithm for computing fundamental solutions of difference operators
• Fundamental solutions of homogeneous elliptic differential operators.
• A General Formula for Fundamental Solutions of Linear Partial Differential Equations with Constant Coefficients
• Construction of a fundamental solution of a partial differential equation with piecewise constant coefficients
• Computability theory of generalized functions

Cited in

(10)

• Algorithmic solution of Abel's equation
• An algorithm for computing fundamental solutions of difference operators
• scientific article; zbMATH DE number 5694287 (Why is no real title available?)
• On the computational complexity of the Dirichlet problem for Poisson's equation
• Complete algorithms for calculating the higher-order fundamental solutions of wave equations
• Complexity of blowup problems (extended abstract)
• Computable analysis of the abstract Cauchy problem in a Banach space and its applications. I
• Computability of Differential Equations
• Computational unsolvability of domains of attraction of nonlinear systems
• Letter to the Editor—-A Closed Form Solution of Certain Programming Problems

This page was built for publication: An Algorithm for Computing Fundamental Solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470734)