An efficient multifidelity <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml46" display="inline" overflow="scroll" altimg="si1.gif"><mml:msub><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-minimization method for sparse polynomial chaos

Research article (Computer Methods in Applied Mechanics and Engineering, 2018) · cited 46× · AI/ML
Press Enter · cited answer in seconds

An efficient multifidelity 1-minimization method for sparse polynomial chaos

Summary

An efficient multifidelity 1-minimization method for sparse polynomial chaos is a scholarly article<sup id="cite-A2" class="cite-ref" title="An efficient multifidelity [1].

Key Facts

  • An efficient multifidelity 1-minimization method for sparse polynomial chaos's instance of is recorded as scholarly article<sup id="cite-C1" class="cite-ref" title="An efficient multifidelity [2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). An efficient multifidelity <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml46" display="inline" overflow="scroll" altimg="si1.gif"><mml:msub><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-minimization method for sparse polynomial chaos. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-efficient-multifidelity-mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-id-mml46-display-inline-overflow-scroll-a
MLA “An efficient multifidelity <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml46" display="inline" overflow="scroll" altimg="si1.gif"><mml:msub><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-minimization method for sparse polynomial chaos.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-efficient-multifidelity-mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-id-mml46-display-inline-overflow-scroll-a.
BibTeX @misc{4ortxyz_an-efficient-multifidelity-mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-id-mml46-display-inline-overflow-scroll-a_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An efficient multifidelity <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml46" display="inline" overflow="scroll" altimg="si1.gif"><mml:msub><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-minimization method for sparse polynomial chaos}}, year = {2026}, url = {https://4ort.xyz/entity/an-efficient-multifidelity-mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-id-mml46-display-inline-overflow-scroll-a}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An efficient multifidelity <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml46" display="inline" overflow="scroll" altimg="si1.gif"><mml:msub><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-minimization method for sparse polynomial chaos — https://4ort.xyz/entity/an-efficient-multifidelity-mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-id-mml46-display-inline-overflow-scroll-a (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/an-efficient-multifidelity-mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-id-mml46-display-inline-overflow-scroll-a · Last refreshed: