<s>
In	O
mathematics	O
numerical	B-General_Concept
analysis	I-General_Concept
,	O
the	O
Nyström	B-Algorithm
method	I-Algorithm
or	O
quadrature	O
method	O
seeks	O
the	O
numerical	B-General_Concept
solution	I-General_Concept
of	O
an	O
integral	B-Algorithm
equation	I-Algorithm
by	O
replacing	O
the	O
integral	O
with	O
a	O
representative	O
weighted	O
sum	O
.	O
</s>
<s>
The	O
continuous	O
problem	O
is	O
broken	O
into	O
discrete	O
intervals	O
;	O
quadrature	O
or	O
numerical	B-Algorithm
integration	I-Algorithm
determines	O
the	O
weights	O
and	O
locations	O
of	O
representative	O
points	O
for	O
the	O
integral	O
.	O
</s>
<s>
Since	O
the	O
linear	O
equations	O
require	O
operations	O
to	O
solve	O
,	O
high-order	O
quadrature	B-Algorithm
rules	I-Algorithm
perform	O
better	O
because	O
low-order	O
quadrature	B-Algorithm
rules	I-Algorithm
require	O
large	O
for	O
a	O
given	O
accuracy	O
.	O
</s>
<s>
Gaussian	B-Algorithm
quadrature	I-Algorithm
is	O
normally	O
a	O
good	O
choice	O
for	O
smooth	O
,	O
non-singular	O
problems	O
.	O
</s>
