Detail publikace

Fast Error Prediction for Approximate Symbolic Analysis

Originální název

Fast Error Prediction for Approximate Symbolic Analysis

Anglický název

Fast Error Prediction for Approximate Symbolic Analysis

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

BibTex


@inproceedings{BUT18962,
  author="Martin {Horák} and Zdeněk {Kolka}",
  title="Fast Error Prediction for Approximate Symbolic Analysis",
  annote="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.
",
  address="Slovak University of Technology",
  booktitle="Proc. of Radioelektronika 2006",
  chapter="18962",
  institution="Slovak University of Technology",
  year="2006",
  month="april",
  pages="9",
  publisher="Slovak University of Technology",
  type="conference paper"
}