This paper deals with a fast numerical algorithm for large-change sensitivity computation for approximate symbolic analysis. It is based on Sherman-Morison formula and sparse matrix techniques. Effectiveness of the method was tested on a number of benchmarking circuits.
This paper deals with a fast numerical algorithm for large-change sensitivity computation for approximate symbolic analysis. It is based on Sherman-Morison formula and sparse matrix techniques. Effectiveness of the method was tested on a number of benchmarking circuits. (en)
Článek pojednává o výpočtu chyb pro přibližnou symbolickou analýzu. (cs)