Affiliation:
1. Texas Instruments Incorporated, Dallas, Texas
Abstract
A simple and yet powerful method of solving two of the more common numerical problems is heuristically derived and briefly discussed. The method makes possible the efficient solution of the zeros of a complex function, either transcendental or algebraic, of a complex variable. In addition, it is applicable to the computation of eigen values of a general matrix in which the parameter may appear in any elements of the matrix in a basically unrestricted way. The method is related to the classical secant and regula falsi methods for the finding of real zeros of a real function. Numerical examples of the method applied to several pathological matrices are presented.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference13 articles.
1. Determiratio of eigenvahles of matrices having polynomial elemet;TRNOVE I;J. Soc. Ind. Appl. Math.,1958
2. On approximation of equations by algebraic equations. J. Soc. Ind. Appl. Math. Numer. Anal;OSTROWSKI A;Set. B,1964
3. TIAUB J. F. Iterative Methods for the Solution of Equations. Prentice-Hall Eiglcwxl Cliffs N. J. 1964. TIAUB J. F. Iterative Methods for the Solution of Equations. Prentice-Hall Eiglcwxl Cliffs N. J. 1964.
4. Note on approximating complex zeros of a polynomial;FRIEDMAN B;Comm. on P and Appl. Math.,1949
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献