Abstract
PurposeThis paper aims to propose a novel direct method for indefinite algebraic linear systems. It is well adapted for sparse linear systems, such as those of two-dimensional (2-D) finite elements problems, especially for coupled systems.Design/methodology/approachThe proposed method is developed on an example of an indefinite symmetric matrix. The algorithm of the method is given next, and a comparison between the numbers of operations required by the method and the Cholesky method is also given. Finally, an application on a magnetostatic problem for classical methods (Gauss and Cholesky) shows the relative efficiency of the proposed method.FindingsThe proposed method can be used advantageously for 2-D finite elements in stepping methods without using a block decomposition of matrices.Research limitations/implicationsThis method is advantageous for direct linear solving for 2-D problems, but it is not recommended at this time for three-dimensional problems.Originality/valueThe proposed method is the first direct solver for algebraic linear systems proposed since more than a half century. It is not limited for symmetric positive systems such as many of direct and iterative methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: COMPEL - The international journal for computation and mathematics in electrical and electronic engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
