On computational algorithm for inners

A modification is suggested to the computational algorithm for inners in [1], [2] in order to lessen the roundoff errors arising in computer calculations taking into consideration fixed structure of sparseness of left triangle of zeros without destroying the inners of original matrix.

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 1974-04, Vol.19 (2), p.154-155
Main Author: Kamat, P.
Format: Article
Language:English
Subjects:
Clustering algorithms
Frequency response
Polynomials
Sparse matrices
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c323t-352684ad99fe3fdfa3bb0150a05401bfe253205de36bf04519e15b70964e600d3
cites cdi_FETCH-LOGICAL-c323t-352684ad99fe3fdfa3bb0150a05401bfe253205de36bf04519e15b70964e600d3
container_end_page 155
container_issue 2
container_start_page 154
container_title IEEE transactions on automatic control
container_volume 19
creator Kamat, P.
description A modification is suggested to the computational algorithm for inners in [1], [2] in order to lessen the roundoff errors arising in computer calculations taking into consideration fixed structure of sparseness of left triangle of zeros without destroying the inners of original matrix.
doi_str_mv 10.1109/TAC.1974.1100509
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_1100509</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1100509</ieee_id><sourcerecordid>28954723</sourcerecordid><originalsourceid>FETCH-LOGICAL-c323t-352684ad99fe3fdfa3bb0150a05401bfe253205de36bf04519e15b70964e600d3</originalsourceid><addsrcrecordid>eNqNkE1Lw0AQhhdRMFbvgpdc9JY6-9nssQS_oNBLPS-bZFZXkmzdTQ_-exNa8OppeJnnHZiHkFsKS0pBP-7W1ZLqlZgTSNBnJKNSlgWTjJ-TDICWhWaluiRXKX1NUQlBM3K_HfIm9PvDaEcfBtvltvsI0Y-ffe5CzP0wYEzX5MLZLuHNaS7I-_PTrnotNtuXt2q9KRrO-FhwyVQpbKu1Q-5aZ3ldA5VgQQqgtUMmOQPZIle1AyGpRirrFWglUAG0fEEejnf3MXwfMI2m96nBrrMDhkMyrNRSrBj_Byimx0s1gXAEmxhSiujMPvrexh9DwczizCTOzOLMSdxUuTtWPCL-4aftL-lsZ3Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28425286</pqid></control><display><type>article</type><title>On computational algorithm for inners</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Kamat, P.</creator><creatorcontrib>Kamat, P.</creatorcontrib><description>A modification is suggested to the computational algorithm for inners in [1], [2] in order to lessen the roundoff errors arising in computer calculations taking into consideration fixed structure of sparseness of left triangle of zeros without destroying the inners of original matrix.</description><identifier>ISSN: 0018-9286</identifier><identifier>EISSN: 1558-2523</identifier><identifier>DOI: 10.1109/TAC.1974.1100509</identifier><identifier>CODEN: IETAA9</identifier><language>eng</language><publisher>IEEE</publisher><subject>Clustering algorithms ; Frequency response ; Polynomials ; Sparse matrices</subject><ispartof>IEEE transactions on automatic control, 1974-04, Vol.19 (2), p.154-155</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c323t-352684ad99fe3fdfa3bb0150a05401bfe253205de36bf04519e15b70964e600d3</citedby><cites>FETCH-LOGICAL-c323t-352684ad99fe3fdfa3bb0150a05401bfe253205de36bf04519e15b70964e600d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1100509$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27903,27904,54774</link.rule.ids></links><search><creatorcontrib>Kamat, P.</creatorcontrib><title>On computational algorithm for inners</title><title>IEEE transactions on automatic control</title><addtitle>TAC</addtitle><description>A modification is suggested to the computational algorithm for inners in [1], [2] in order to lessen the roundoff errors arising in computer calculations taking into consideration fixed structure of sparseness of left triangle of zeros without destroying the inners of original matrix.</description><subject>Clustering algorithms</subject><subject>Frequency response</subject><subject>Polynomials</subject><subject>Sparse matrices</subject><issn>0018-9286</issn><issn>1558-2523</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1974</creationdate><recordtype>article</recordtype><recordid>eNqNkE1Lw0AQhhdRMFbvgpdc9JY6-9nssQS_oNBLPS-bZFZXkmzdTQ_-exNa8OppeJnnHZiHkFsKS0pBP-7W1ZLqlZgTSNBnJKNSlgWTjJ-TDICWhWaluiRXKX1NUQlBM3K_HfIm9PvDaEcfBtvltvsI0Y-ffe5CzP0wYEzX5MLZLuHNaS7I-_PTrnotNtuXt2q9KRrO-FhwyVQpbKu1Q-5aZ3ldA5VgQQqgtUMmOQPZIle1AyGpRirrFWglUAG0fEEejnf3MXwfMI2m96nBrrMDhkMyrNRSrBj_Byimx0s1gXAEmxhSiujMPvrexh9DwczizCTOzOLMSdxUuTtWPCL-4aftL-lsZ3Q</recordid><startdate>19740401</startdate><enddate>19740401</enddate><creator>Kamat, P.</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>H8D</scope></search><sort><creationdate>19740401</creationdate><title>On computational algorithm for inners</title><author>Kamat, P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c323t-352684ad99fe3fdfa3bb0150a05401bfe253205de36bf04519e15b70964e600d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1974</creationdate><topic>Clustering algorithms</topic><topic>Frequency response</topic><topic>Polynomials</topic><topic>Sparse matrices</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kamat, P.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Aerospace Database</collection><jtitle>IEEE transactions on automatic control</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kamat, P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On computational algorithm for inners</atitle><jtitle>IEEE transactions on automatic control</jtitle><stitle>TAC</stitle><date>1974-04-01</date><risdate>1974</risdate><volume>19</volume><issue>2</issue><spage>154</spage><epage>155</epage><pages>154-155</pages><issn>0018-9286</issn><eissn>1558-2523</eissn><coden>IETAA9</coden><abstract>A modification is suggested to the computational algorithm for inners in [1], [2] in order to lessen the roundoff errors arising in computer calculations taking into consideration fixed structure of sparseness of left triangle of zeros without destroying the inners of original matrix.</abstract><pub>IEEE</pub><doi>10.1109/TAC.1974.1100509</doi><tpages>2</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0018-9286
ispartof IEEE transactions on automatic control, 1974-04, Vol.19 (2), p.154-155
issn 0018-9286
1558-2523
language eng
recordid cdi_ieee_primary_1100509
source IEEE Electronic Library (IEL) Journals
subjects Clustering algorithms
Frequency response
Polynomials
Sparse matrices
title On computational algorithm for inners
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T22%3A20%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20computational%20algorithm%20for%20inners&rft.jtitle=IEEE%20transactions%20on%20automatic%20control&rft.au=Kamat,%20P.&rft.date=1974-04-01&rft.volume=19&rft.issue=2&rft.spage=154&rft.epage=155&rft.pages=154-155&rft.issn=0018-9286&rft.eissn=1558-2523&rft.coden=IETAA9&rft_id=info:doi/10.1109/TAC.1974.1100509&rft_dat=%3Cproquest_ieee_%3E28954723%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c323t-352684ad99fe3fdfa3bb0150a05401bfe253205de36bf04519e15b70964e600d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=28425286&rft_id=info:pmid/&rft_ieee_id=1100509&rfr_iscdi=true