Engineering topics
Publications and source records attributed to Segethova, J..
As an aid in the numerical construction of Hill functions and their derivatives, an algorithm using local coordinates and an expansion in Legendre polynomials is proposed. The algorithm is shown to possess sufficient stability, and the orthogonality of the Legendre polynomials simplifies the computation when the Ritz-Galerkin technique is used.
Consideration of the problem of finding a permutation of rows and columns and an algorithm for solving ordered systems of linear algebraic equations with sparse matrices having a certain regular structure. Two approaches to the solution of this problem, in which the sparsity is used to some extent, are outlined. One of them is a very general approach where optimal (or nearly optimal) ordering is sought and the algorithm for solving the ordered system treats the matrix element by element to perform only necessary operations. The other approach involves the use of band matrices. After comparing these two approaches, a third approach is then suggested which involves the use of pipe matrices, and a means of ordering the rows and columns to obtain this type of matrix is presented. Examples of matrices reordered by the proposed procedure are cited.