Positive Reachability for Diffusion Equations | Zendy

Thomas I. Seidman | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Positive Reachability for Diffusion Equations

Author(s) -

Thomas I. Seidman

Publication year - 2004

Publication title -

applied mathematics and optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.913

H-Index - 51

eISSN - 1432-0606

pISSN - 0095-4616

DOI - 10.1007/s00245-004-0796-8

Subject(s) - counterexample , mathematics , reachability , conjecture , boundary (topology) , state (computer science) , terminal (telecommunication) , diffusion , mathematical analysis , pure mathematics , discrete mathematics , combinatorics , algorithm , computer science , telecommunications , physics , thermodynamics

Counterexamples are constructed for some plausible conjectures. Typical of these: as the Maximum Principle ensures that positive boundary data give a positive state at time T from 0 initial data, one might (plausibly, but falsely) conjecture that all positive terminal states should be approximately reachable in this way, i.e., subject to the requirement that the boundary data stays nonnegative.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research