File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: O(N**2) ALGORITHM FOR PARTIAL FRACTION EXPANSION.

TitleO(N**2) ALGORITHM FOR PARTIAL FRACTION EXPANSION.
Authors
Issue Date1977
Citation
Ieee Trans Circuits Syst, 1977, v. CAS-24 n. 1, p. 42-45 How to Cite?
AbstractA new O(N**2) algorithm for partial fraction expansion with multiple poles is presented, which is simpler and somewhat faster than the known methods. A short and general WATFIV program is included.
Persistent Identifierhttp://hdl.handle.net/10722/152200
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChin, Francis Yen_US
dc.contributor.authorSteiglitz, Kennethen_US
dc.date.accessioned2012-06-26T06:36:30Z-
dc.date.available2012-06-26T06:36:30Z-
dc.date.issued1977en_US
dc.identifier.citationIeee Trans Circuits Syst, 1977, v. CAS-24 n. 1, p. 42-45en_US
dc.identifier.urihttp://hdl.handle.net/10722/152200-
dc.description.abstractA new O(N**2) algorithm for partial fraction expansion with multiple poles is presented, which is simpler and somewhat faster than the known methods. A short and general WATFIV program is included.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Trans Circuits Systen_US
dc.titleO(N**2) ALGORITHM FOR PARTIAL FRACTION EXPANSION.en_US
dc.typeArticleen_US
dc.identifier.emailChin, Francis Y:chin@cs.hku.hken_US
dc.identifier.authorityChin, Francis Y=rp00105en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0017430666en_US
dc.identifier.volumeCAS-24en_US
dc.identifier.issue1en_US
dc.identifier.spage42en_US
dc.identifier.epage45en_US
dc.identifier.isiWOS:A1977CT31600007-
dc.identifier.scopusauthoridChin, Francis Y=7005101915en_US
dc.identifier.scopusauthoridSteiglitz, Kenneth=7006770729en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats