Exploiting Matrix Sparsity for Symbolic Analysis

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F04%3APU45775" target="_blank" >RIV/00216305:26220/04:PU45775 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Exploiting Matrix Sparsity for Symbolic Analysis

Original language description

This paper deals with a method for symbolic approximation that exploits the sparsity of circuit matrix to achieve an acceptable speed for large circuits. The method is based on a simplification of the equations of circuit models of linear or linearized circuits in the frequency domain. The simplified model is then analyzed symbolically. The algorithm proposed has been developed with the aim of obtaining maximum computational efficiency.

Czech name

Využití řídkých matic pro symbolickou analýzu

Czech description

Příspěvek pojednává o využití řídkých matic pro symbolickou analýzu.

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JA - Electronics and optoelectronics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2004

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

WSEAS Transactions on Circuits

ISSN

1109-2734

e-ISSN

—

Volume of the periodical

3

Issue of the periodical within the volume

10

Country of publishing house

GR - GREECE

Number of pages

4

Pages from-to

2278-2281

UT code for WoS article

—

EID of the result in the Scopus database

—