The worst case complexity of the fredholm equation with periodic free term and noisy information<sup>∗</sup> (Q4935386): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: David J. Evans / rank
Normal rank
 
Property / author
 
Property / author: David J. Evans / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207169908804876 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002370532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of local solution of multivariate integral equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information complexity of multivariate Fredholm integral equations in Sobolev classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic complexity analysis for linear problems in bounded domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average case complexity of the Fredholm equation of second kind with free term in \(H^ r(\Gamma)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear integral equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimal radius of Galerkin information for the Fredholm problem of the first kind / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case complexity of problems with random information noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to benefit from noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3801999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-based complexity: New questions for mathematicians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of differential and integral equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of definite elliptic problems with noisy data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of indefinite elliptic problems with noisy data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing topological degree using noisy information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the topological degree with noisy information / rank
 
Normal rank

Latest revision as of 12:35, 29 May 2024

scientific article; zbMATH DE number 1395866
Language Label Description Also known as
English
The worst case complexity of the fredholm equation with periodic free term and noisy information<sup>∗</sup>
scientific article; zbMATH DE number 1395866

    Statements

    The worst case complexity of the fredholm equation with periodic free term and noisy information<sup>∗</sup> (English)
    0 references
    0 references
    0 references
    10 October 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Fredholm equation
    0 references
    Galerkin method
    0 references
    information theory
    0 references
    noisy information
    0 references
    computational complexity
    0 references
    information-based complexity
    0 references
    0 references