A graph-theoretic approach to sparse matrix inversion for implicit differential algebraic equations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A graph theoretic approach to matrix inversion by partitioning

Let M be a square matrix whose entries are in some field. Our object is to find a permutat ion matrix P such that P M P -x is completely reduced, i.e., is partitioned in block triangular form, so that all submatrices below its diagonal are 0 and all diagonal submatrices are square and irreducible. Let .4 be the binary (0, t) matrix obtained from M by preserving the O's of M and replacing the no...

متن کامل

A new approach for solving the first-order linear matrix differential equations

Abstract. The main contribution of the current paper is to propose a new effective numerical method for solving the first-order linear matrix differential equations. Properties of the Legendre basis operational matrix of integration together with a collocation method are applied to reduce the problem to a coupled linear matrix equations. Afterwards, an iterative algorithm is examined for solvin...

متن کامل

Designing Sparse Reliable Pose-Graph SLAM: A Graph-Theoretic Approach

In this paper, we aim to design sparse D-optimal (determinantoptimal) pose-graph SLAM problems through the synthesis of sparse graphs with the maximum weighted number of spanning trees. Characterizing graphs with the maximum number of spanning trees is an open problem in general. To tackle this problem, several new theoretical results are established in this paper, including the monotone log-su...

متن کامل

Implicit Runge–kutta Methods for Transferable Differential-algebraic Equations

The numerical solution of transferable differential-algebraic equations (DAE’s) by implicit Runge–Kutta methods (IRK) is studied. If the matrix of coefficients of an IRK is nonsingular then the arising systems of nonlinear equations are uniquely solvable. These methods are proved to be stable if an additional contractivity condition is satisfied. For transferable DAE’s with smooth solution we g...

متن کامل

Semi-implicit Krylov deferred correction methods for differential algebraic equations

In the recently developed Krylov deferred correction (KDC) methods for differential algebraic equation initial value problems [33], a Picardtype collocation formulation is preconditioned using low-order time integration schemes based on spectral deferred correction (SDC), and the resulting system is solved efficiently using Newton-Krylov methods. KDC methods have the advantage that methods with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mechanical Sciences

سال: 2013

ISSN: 2191-916X

DOI: 10.5194/ms-4-243-2013