A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget (Q2072434)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7464481
Language Label Description Also known as
default for all languages
No label defined
    English
    A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget
    scientific article; zbMATH DE number 7464481

      Statements

      A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget (English)
      0 references
      0 references
      0 references
      0 references
      26 January 2022
      0 references
      multi-fidelity modeling
      0 references
      Kaczmarz updating scheme
      0 references
      polynomial chaos expansion
      0 references
      uncertainty quantification on limited budget
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references