An Algorithm for Computing Fundamental Solutions

DOI10.1137/S0097539704446360zbMath1103.03061OpenAlexW2067423908MaRDI QIDQ5470734

Weihrauch, Klaus, 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

fundamental solutionpartial differential equationsTuring machinecomputable analysis

Mathematics Subject Classification ID

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

Related Items (5)

Computational unsolvability of domains of attraction of nonlinear systems ⋮ On the computational complexity of the Dirichlet Problem for Poisson's Equation ⋮ Complexity of Blowup Problems ⋮ Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I) ⋮ Computability of Differential Equations

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