High degree quadrature rules with pseudorandom rational nodes

07/23/2019
by   Mário M. Graça, et al.
0

After introducing the definitions of positive, negative and companion rules, from a given pair of companion rules we construct a new rule with higher degree of precision The scheme is generalized giving rise to a transformation which we call the mean rule. We show that the mean rule is the best approximation, in the sense of least-squares, obtained from a linear combination of two rules of the same degree of precision. Finally, we show that a rule of degree 2k+1 can be constructed as linear combination of k+1 rules of degree one and rational pseudorandom nodes. Several worked examples are presented.

READ FULL TEXT
research
07/21/2022

A Node Elimination Algorithm for Cubature of High-Dimensional Polytopes

Node elimination is a numerical approach to obtain cubature rules for th...
research
11/28/2019

Efficient Recognition of Graph Languages

Graph transformation is the rule-based modification of graphs, and is a ...
research
06/14/2019

Four beautiful quadrature rules

A framework is presented to compute approximations of an integral I(f)=∫...
research
02/28/2022

On the quadrature exactness in hyperinterpolation

This paper investigates the role of quadrature exactness in the approxim...
research
11/05/2020

How to Amend a Constitution? Model, Axioms, and Supermajority Rules

A self-governed community or society must have rules by which group deci...
research
01/29/2019

Knowledge Refinement via Rule Selection

In several different applications, including data transformation and ent...
research
03/17/2015

Combining partially independent belief functions

The theory of belief functions manages uncertainty and also proposes a s...

Please sign up or login with your details

Forgot password? Click here to reset