Least squares solution with the minimum-norm to general matrix equations via iteration

2010 ◽  
Vol 215 (10) ◽  
pp. 3547-3562 ◽  
Author(s):  
Zhao-Yan Li ◽  
Yong Wang ◽  
Bin Zhou ◽  
Guang-Ren Duan
Keyword(s):  
Least Squares ◽  
Minimum Norm ◽  
Matrix Equations ◽  
General Matrix ◽  
Least Squares Solution

The Minimum Norm Least-Squares Solution in Reduction by Krylov Subspace Methods

2016 ◽  
Vol 26 (01) ◽  
pp. 1750006 ◽  
Author(s):  
Xinsheng Wang ◽  
Chenxu Wang ◽  
Mingyan Yu
Keyword(s):  
Least Squares ◽  
Computer Aided Design ◽  
Large Scale ◽  
Krylov Subspace ◽  
Krylov Subspace Methods ◽  
Small Scale ◽  
Minimum Norm ◽  
Subspace Projection ◽  
Subspace Methods ◽  
Least Squares Solution

In recent years, model order reduction (MOR) of interconnect system has become an important technique to reduce the computation complexity and improve the verification efficiency in the nanometer VLSI design. The Krylov subspaces techniques in existing MOR methods are efficient, and have become the methods of choice for generating small-scale macro-models of the large-scale multi-port RCL networks that arise in VLSI interconnect analysis. Although the Krylov subspace projection-based MOR methods have been widely studied over the past decade in the electrical computer-aided design community, all of them do not provide a best optimal solution in a given order. In this paper, a minimum norm least-squares solution for MOR by Krylov subspace methods is proposed. The method is based on generalized inverse (or pseudo-inverse) theory. This enables a new criterion for MOR-based Krylov subspace projection methods. Two numerical examples are used to test the PRIMA method based on the method proposed in this paper as a standard model.

Sign in / Sign up

Export Citation Format

Share Document