# Remarks on algorithm 352 [S22], algorithm 385 [S13], algorithm 392 [D3]

@article{Frisch1972RemarksOA, title={Remarks on algorithm 352 [S22], algorithm 385 [S13], algorithm 392 [D3]}, author={M. Frisch}, journal={Commun. ACM}, year={1972}, volume={15}, pages={1074} }

Submittal of an algorithm for eonsideralion for publication in Communications of the ACM implies that unrestricted use of the algorithm within a computer is permissible. Description This subroutine uses the product type trapezoidal rule compounded n times to approximate the value of the integral b f f(x)g(x) dx. (2 l~(g(a-.]-(j-1)h) x) (f(a + (j-1)h),f(a +jh)) i=i 1 2] \ g(a +jh) /' wlhereh = (b-a)/n. Note that Jig(x) ~ 1 (or fix)-~ 1),the rule reduces to the regular trapezoidal rule. The… Expand

#### Tables and Topics from this paper

#### References

SHOWING 1-4 OF 4 REFERENCES

The algebraic eigenvalue problem

- Mathematics
- 1965

Theoretical background Perturbation theory Error analysis Solution of linear algebraic equations Hermitian matrices Reduction of a general matrix to condensed form Eigenvalues of matrices of… Expand

F2] Roots of Matrix Pencils: The Generalized Eigenvalue Problem

- on Algorithm
- 1971

APL functions for data analysis and statistics Reducing the rank of (A --XB)

- Res. Rep. CP-5, Dep. of Statistics Proc. Amer. Math. Soc
- 1965