Algorithms. 30. BRYAN. Bryan's method for calculation of characteristic polynomial of a matrix
نویسندگان
چکیده
منابع مشابه
The CHACM Method for Computing the Characteristic Polynomial of a Polynomial Matrix
This paper presents an efficient algorithm for computing the characteristic polynomial of a matrix, which utilizes Cayley-Hamilton’s theorem. The algorithm requires no condition on input matrix and can be performed only with basic matrix operations except only one computation of inverse of constant matrix. Though the algorithm can be applied to a constant matrix, it is the most effective when a...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملNew Deterministic Parallel Algorithms for the Characteristic Polynomial of a Matrix over Abstract Fields
We study deterministic parallel computation of the characteristic polynomial of an nn matrix A over an arbitrary eld F of a positive characteristic c n. Our new NC algorithms run in polylogarithmic time and simultaneously enable us to decrease the known upper bounds on processor complexity by order of magnitude except for matrices A forming an algebraic variety of codimension d c ? 1 in the spa...
متن کاملRapid calculation of RMSDs using a quaternion-based characteristic polynomial.
A common measure of conformational similarity in structural bioinformatics is the minimum root mean square deviation (RMSD) between the coordinates of two macromolecules. In many applications, the rotations relating the structures are not needed. Several common algorithms for calculating RMSDs require the computationally costly procedures of determining either the eigen decomposition or matrix ...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1973
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1973.103461