A method for constructing the exact quadratures for Müntz and Müntz-logarithmic polynomials is presented. The algorithm does permit to anticipate the precision (machine precision) of the numerical integration of Müntz-logarithmic polynomials in terms of the number of Gauss–Legendre (GL) quadrature samples and monomial transformation order. To investigate in depth the properties of classical GL quadrature, we present new optimal asymptotic estimates for the remainder. In boundary element integrals this quadrature rule can be applied to evaluate singular functions with end-point singularity, singular kernel as well as smooth functions. The method is numerically stable, efficient, easy to be implemented. The rule has been fully tested and several numerical examples are included. The proposed quadrature method is more efficient in run-time evaluation than the existing methods for Müntz polynomials.
Design of quadrature rules for Müntz and Müntz-logarithmic polynomials using monomial transformation / Lombardi, Guido. - In: INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING. - ISSN 0029-5981. - STAMPA. - 80:13(2009), pp. 1687-1717. [10.1002/nme.2684]
Design of quadrature rules for Müntz and Müntz-logarithmic polynomials using monomial transformation
LOMBARDI, Guido
2009
Abstract
A method for constructing the exact quadratures for Müntz and Müntz-logarithmic polynomials is presented. The algorithm does permit to anticipate the precision (machine precision) of the numerical integration of Müntz-logarithmic polynomials in terms of the number of Gauss–Legendre (GL) quadrature samples and monomial transformation order. To investigate in depth the properties of classical GL quadrature, we present new optimal asymptotic estimates for the remainder. In boundary element integrals this quadrature rule can be applied to evaluate singular functions with end-point singularity, singular kernel as well as smooth functions. The method is numerically stable, efficient, easy to be implemented. The rule has been fully tested and several numerical examples are included. The proposed quadrature method is more efficient in run-time evaluation than the existing methods for Müntz polynomials.File | Dimensione | Formato | |
---|---|---|---|
ijnmepaper4.pdf
accesso aperto
Tipologia:
1. Preprint / submitted version [pre- review]
Licenza:
Pubblico - Tutti i diritti riservati
Dimensione
1.69 MB
Formato
Adobe PDF
|
1.69 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2297767
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo