Scholars Central

ArticlePublished 31 May 2024

A Fast Algorithm for Computing High-dimensional Gauss Quadrature Rules

Authors: Rustam Grillo

Journal of Applied & Computational Mathematics

Volume 13 · Issue 3 · Pages 1–2

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

Gauss quadrature rules are essential for numerical integration, especially in high-dimensional spaces. Traditional methods for computing these rules become computationally expensive and inefficient as the dimensionality increases. This article presents a novel fast algorithm for computing high-dimensional Gauss quadrature rules, significantly reducing computational complexity and improving efficiency. The proposed method leverages sparse grids, tensor decompositions, and adaptive strategies to handle the curse of dimensionality effectively.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Applied & Computational Mathematics.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Applied & Computational Mathematics
  • SubjectMathematics & Statistics
  • BylineArticles whose byline prints “Rustam Grillo”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels