Linear complexity algorithms for semiseparable matrices
Copyright policy )Linear complexity algorithms for semiseparable matrices
For the solution of linear systems with coefficient matrix \(R=D+S\), where S is a semiseparable matrix and D a diagonal matrix, recursive algorithms are introduced that use the LDU factorization of R into factors \((L+S_ L)D(I+S_ U)\), where the semiseparability property is retained. The complexity for these algorithms is analyzed and an efficient updating method for the increase of system dimensions is proposed.
- Stanford University United States
- Tel Aviv University Israel
LDU factorization, Analysis of algorithms and problem complexity, linear systems, Direct numerical methods for linear systems and matrix inversion, Factorization of matrices, semiseparable matrix, recursive algorithms, complexity, Computational methods in systems theory, efficient updating method
LDU factorization, Analysis of algorithms and problem complexity, linear systems, Direct numerical methods for linear systems and matrix inversion, Factorization of matrices, semiseparable matrix, recursive algorithms, complexity, Computational methods in systems theory, efficient updating method
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).54 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!