An Algorithm for Computing Fundamental Solutions

Authors:
Klaus Weihrauch;Ning Zhong
Affiliations:
Department of Computer Science, Fernuniversität, 58084 Hagen, Germany;Department of Mathematical Sciences, University of Cincinnati, Ohio 45221-0025, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 3
Cited 1

Computability on computable metric spaces

Theoretical Computer Science
Computable analysis: an introduction

Computable analysis: an introduction
Computability theory of generalized functions

Journal of the ACM (JACM)

Beyond the first main theorem – when is the solution of a linear cauchy problem computable?

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a partial differential operator P=@?"|"@a"|"=