Computability structure of the Sobolev spaces and its applications

DOI10.1016/S0304-3975(98)00302-8zbMATH Open0916.68044OpenAlexW2026953223MaRDI QIDQ1292420FDOQ1292420

Authors: Ning Zhong 

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00302-8

Recommendations

• Computable sequences in the Sobolev spaces
• scientific article; zbMATH DE number 800363
• Computability theory of generalized functions
• A tutorial on computable analysis

zbMATH Keywords

Sobolev spacescomputable continuous functionsecond-order hyperbolic and parabolic partial differential equations

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computability and Noncomputability in Classical Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the definitions of computable real continuous functions
• Computational complexity of real functions
• Title not available (Why is that?)
• Computable functionals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational complexity of fixed points and intersection points
• A polynomial-time computable curve whose interior has a nonrecursive measure
• On the computability of fractal dimensions and Hausdorff measure
• A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
• The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
• On the Definition of Computable Function of a Real Variable
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
• L p -Computability in Recursive Analysis
• Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma
• Derivatives of Computable Functions
• Title not available (Why is that?)

Cited In (9)

• Computational complexity theory for advanced function spaces in analysis
• A note on the computability of Hilbert-Schmidt operator
• Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
• Towards computability of elliptic boundary value problems in variational formulation
• Computable sequences in the Sobolev spaces
• Computability of Differential Equations
• Computing uniform bounds
• Computability theory of generalized functions
• Validated bounds on embedding constants for Sobolev space Banach algebras

This page was built for publication: Computability structure of the Sobolev spaces and its applications

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