• 作者： 張俊明
• 作者服務機構： 中原大學電機工程學系
• 中文摘要： 本文將Cederbaum所提一個應用於網路合成技術的矩陣分解法重新檢視接，提出一個新的「符號相合」的分解法，使分解所得的矩陣能雊完全符合Cederbaum本人所提的「符號法則」定律。所提新的矩陣分解法由於僅需簡單的算學運算，較原法非但較簡單且更快速。
• 英文摘要： A matrix factorization used to annlv to network synthesis was considered by Cederbaum who de-composed a paramount matrix K in a congruence ADA' , A being a rectangular unimoaular matrix and Da diagonal matrix with constant, positive and real elements. In this paper, a new "sign match" method ispresented for improving Cederbaum's technique such that matrix A can be thoroughly consistent with the“sign rule”theorem, leading to a new algorithm which is simpler and faster than Cederbaum's technique.
• 中文關鍵字： network synthesis; matrix factorization
• 英文關鍵字： --