Fill-ins number reducing direct solver designed for FIT-type matrix

Authors:
Michał Dobrzyński;Jagoda Plata
Affiliations:
Numerical Methods Laboratory (LMN), Politehnica University of Bucharest, Splaiul Independentei 313, 060042 Bucharest, Romania;Numerical Methods Laboratory (LMN), Politehnica University of Bucharest, Splaiul Independentei 313, 060042 Bucharest, Romania
Venue:
Mathematics and Computers in Simulation
Year:
2010

Citing 4
Cited 0

Modification of the minimum-degree algorithm by multiple elimination

ACM Transactions on Mathematical Software (TOMS)
An Approximate Minimum Degree Ordering Algorithm

SIAM Journal on Matrix Analysis and Applications
Solving unsymmetric sparse systems of linear equations with PARDISO

Future Generation Computer Systems - Special issue: Selected numerical algorithms
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)

Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the particular problem of matrices appearing during the modeling of Integrated Circuits with Finite Integration Technique (FIT) method. We present the key points of FIT approach followed by an illustration of the structure and the properties of the FIT-type matrix. A novel algorithm SMark is proposed, which focuses on fill-ins number reduction. The main idea of SMark is the concept of a dual architecture-symbolic and numeric factorization. In order to validate SMark a comparison with other methods was performed. The excellent results confirm that the proposed approach is an adequate solving method for FIT-type matrices, whereas the identified weak points of the algorithm indicate possible directions in the future work.